267.96/268.30	NO
267.96/268.30	
267.96/268.30	Solver Timeout: 4
267.96/268.30	Global Timeout: 300
267.96/268.30	No parsing errors!
267.96/268.30	Init Location: 0
267.96/268.30	Transitions:
267.96/268.30	<l0, l27, true>
267.96/268.30	<l1, l2, true>
267.96/268.30	<l3, l1, (0 <= (0 + isign^0))>
267.96/268.30	<l3, l1, ((1 + isign^0) <= ~(1))>
267.96/268.30	<l3, l1, ((0 + isign^0) <= ~(1)) /\ (~(1) <= (0 + isign^0))>
267.96/268.30	<l4, l5, true>
267.96/268.30	<l6, l7, (undef124 = undef124) /\ (undef114 = undef114) /\ (undef113 = undef113) /\ (undef115 = undef115) /\ (undef116 = undef116), par{h1i^0 -> undef113, h1r^0 -> undef114, h2i^0 -> undef115, h2r^0 -> undef116, j3^0 -> undef124}>
267.96/268.30	<l8, l6, true, par{j2^0 -> ((2 + (~(1) * i2^0)) + nn2^0)}>
267.96/268.30	<l9, l6, ((0 + i2^0) <= 1) /\ (1 <= (0 + i2^0)), par{j2^0 -> 1}>
267.96/268.30	<l9, l8, (2 <= (0 + i2^0))>
267.96/268.30	<l9, l8, ((1 + i2^0) <= 1)>
267.96/268.30	<l7, l10, true, par{i2^0 -> (1 + i2^0)}>
267.96/268.30	<l11, l12, true>
267.96/268.30	<l13, l7, (undef268 = undef268) /\ (undef267 = undef267) /\ (undef269 = undef269) /\ (undef270 = undef270), par{h1i^0 -> undef267, h1r^0 -> undef268, h2i^0 -> undef269, h2r^0 -> undef270}>
267.96/268.30	<l14, l13, (undef299 = undef299), par{j2^0 -> undef299}>
267.96/268.30	<l15, l13, ((0 + i2^0) <= 1) /\ (1 <= (0 + i2^0)), par{j2^0 -> 1}>
267.96/268.30	<l15, l14, (2 <= (0 + i2^0))>
267.96/268.30	<l15, l14, ((1 + i2^0) <= 1)>
267.96/268.30	<l16, l17, true>
267.96/268.30	<l18, l9, (2 <= (0 + i3^0))>
267.96/268.30	<l18, l9, ((1 + i3^0) <= 1)>
267.96/268.30	<l18, l15, ((0 + i3^0) <= 1) /\ (1 <= (0 + i3^0))>
267.96/268.30	<l19, l20, ((1 + nn2^0) <= (0 + i2^0)) /\ (undef483 = undef483) /\ (undef480 = undef480), par{i3^0 -> (1 + i3^0), ii3^0 -> (2 + ii3^0), wi^0 -> undef480, wr^0 -> undef483, wtemp^0 -> (0 + wr^0)}>
267.96/268.30	<l19, l18, ((0 + i2^0) <= (0 + nn2^0))>
267.96/268.30	<l21, l16, true, par{i1^0 -> (1 + i1^0)}>
267.96/268.30	<l21, l10, true>
267.96/268.30	<l22, l20, true, par{wi^0 -> 0, wr^0 -> 1}>
267.96/268.30	<l23, l22, true, par{j1___0^0 -> ((2 + (~(1) * i1^0)) + nn1^0)}>
267.96/268.30	<l20, l21, true>
267.96/268.30	<l24, l22, ((0 + i1^0) <= 1) /\ (1 <= (0 + i1^0)), par{j1___0^0 -> 1}>
267.96/268.30	<l24, l23, (2 <= (0 + i1^0))>
267.96/268.30	<l24, l23, ((1 + i1^0) <= 1)>
267.96/268.30	<l17, l3, ((1 + nn1^0) <= (0 + i1^0))>
267.96/268.30	<l17, l24, ((0 + i1^0) <= (0 + nn1^0))>
267.96/268.30	<l10, l19, true>
267.96/268.30	<l12, l4, ((1 + nn2^0) <= (0 + i2^0)), par{i1^0 -> (1 + i1^0)}>
267.96/268.30	<l12, l11, ((0 + i2^0) <= (0 + nn2^0)) /\ (undef793 = (1 + j2^0)), par{i2^0 -> (1 + i2^0), j2^0 -> (1 + undef793)}>
267.96/268.30	<l5, l16, ((1 + nn1^0) <= (0 + i1^0))>
267.96/268.30	<l5, l11, ((0 + i1^0) <= (0 + nn1^0))>
267.96/268.30	<l25, l16, (2 <= (0 + isign^0))>
267.96/268.30	<l25, l16, ((1 + isign^0) <= 1)>
267.96/268.30	<l25, l4, ((0 + isign^0) <= 1) /\ (1 <= (0 + isign^0))>
267.96/268.30	<l26, l25, (undef904 = undef904) /\ (undef905 = undef905) /\ (undef920 = undef920) /\ (undef925 = undef925) /\ (undef923 = undef923) /\ (undef922 = undef922), par{c1^0 -> undef904, c2^0 -> undef905, theta^0 -> undef920, wpi^0 -> undef922, wpr^0 -> undef923, wtemp^0 -> undef925}>
267.96/268.30	<l27, l26, true>
267.96/268.30	
267.96/268.30	Fresh variables:
267.96/268.30	undef113, undef114, undef115, undef116, undef124, undef267, undef268, undef269, undef270, undef299, undef480, undef483, undef793, undef904, undef905, undef920, undef922, undef923, undef925, 
267.96/268.30	
267.96/268.30	Undef variables:
267.96/268.30	undef113, undef114, undef115, undef116, undef124, undef267, undef268, undef269, undef270, undef299, undef480, undef483, undef793, undef904, undef905, undef920, undef922, undef923, undef925, 
267.96/268.30	
267.96/268.30	Abstraction variables:
267.96/268.30	
267.96/268.30	Exit nodes:
267.96/268.30	
267.96/268.30	Accepting locations:
267.96/268.30	
267.96/268.30	Asserts:
267.96/268.30	
267.96/268.30	Preprocessed LLVMGraph
267.96/268.30	Init Location: 0
267.96/268.30	Transitions:
267.96/268.30	<l0, l2, (undef904 = undef904) /\ (undef905 = undef905) /\ (undef920 = undef920) /\ (undef925 = undef925) /\ (undef923 = undef923) /\ (undef922 = undef922) /\ (2 <= (0 + isign^0)) /\ ((1 + nn1^0) <= (0 + i1^0)) /\ (0 <= (0 + isign^0))>
267.96/268.30	<l0, l20, (undef904 = undef904) /\ (undef905 = undef905) /\ (undef920 = undef920) /\ (undef925 = undef925) /\ (undef923 = undef923) /\ (undef922 = undef922) /\ (2 <= (0 + isign^0)) /\ ((0 + i1^0) <= (0 + nn1^0)) /\ ((0 + i1^0) <= 1) /\ (1 <= (0 + i1^0)), par{wr^0 -> 1}>
267.96/268.30	<l0, l20, (undef904 = undef904) /\ (undef905 = undef905) /\ (undef920 = undef920) /\ (undef925 = undef925) /\ (undef923 = undef923) /\ (undef922 = undef922) /\ (2 <= (0 + isign^0)) /\ ((0 + i1^0) <= (0 + nn1^0)) /\ (2 <= (0 + i1^0)), par{wr^0 -> 1}>
267.96/268.30	<l0, l20, (undef904 = undef904) /\ (undef905 = undef905) /\ (undef920 = undef920) /\ (undef925 = undef925) /\ (undef923 = undef923) /\ (undef922 = undef922) /\ (2 <= (0 + isign^0)) /\ ((0 + i1^0) <= (0 + nn1^0)) /\ ((1 + i1^0) <= 1), par{wr^0 -> 1}>
267.96/268.30	<l0, l2, (undef904 = undef904) /\ (undef905 = undef905) /\ (undef920 = undef920) /\ (undef925 = undef925) /\ (undef923 = undef923) /\ (undef922 = undef922) /\ ((1 + isign^0) <= 1) /\ ((1 + nn1^0) <= (0 + i1^0)) /\ (0 <= (0 + isign^0))>
267.96/268.30	<l0, l2, (undef904 = undef904) /\ (undef905 = undef905) /\ (undef920 = undef920) /\ (undef925 = undef925) /\ (undef923 = undef923) /\ (undef922 = undef922) /\ ((1 + isign^0) <= 1) /\ ((1 + nn1^0) <= (0 + i1^0)) /\ ((1 + isign^0) <= ~(1))>
267.96/268.30	<l0, l2, (undef904 = undef904) /\ (undef905 = undef905) /\ (undef920 = undef920) /\ (undef925 = undef925) /\ (undef923 = undef923) /\ (undef922 = undef922) /\ ((1 + isign^0) <= 1) /\ ((1 + nn1^0) <= (0 + i1^0)) /\ ((0 + isign^0) <= ~(1)) /\ (~(1) <= (0 + isign^0))>
267.96/268.30	<l0, l20, (undef904 = undef904) /\ (undef905 = undef905) /\ (undef920 = undef920) /\ (undef925 = undef925) /\ (undef923 = undef923) /\ (undef922 = undef922) /\ ((1 + isign^0) <= 1) /\ ((0 + i1^0) <= (0 + nn1^0)) /\ ((0 + i1^0) <= 1) /\ (1 <= (0 + i1^0)), par{wr^0 -> 1}>
267.96/268.30	<l0, l20, (undef904 = undef904) /\ (undef905 = undef905) /\ (undef920 = undef920) /\ (undef925 = undef925) /\ (undef923 = undef923) /\ (undef922 = undef922) /\ ((1 + isign^0) <= 1) /\ ((0 + i1^0) <= (0 + nn1^0)) /\ (2 <= (0 + i1^0)), par{wr^0 -> 1}>
267.96/268.30	<l0, l20, (undef904 = undef904) /\ (undef905 = undef905) /\ (undef920 = undef920) /\ (undef925 = undef925) /\ (undef923 = undef923) /\ (undef922 = undef922) /\ ((1 + isign^0) <= 1) /\ ((0 + i1^0) <= (0 + nn1^0)) /\ ((1 + i1^0) <= 1), par{wr^0 -> 1}>
267.96/268.30	<l0, l2, (undef904 = undef904) /\ (undef905 = undef905) /\ (undef920 = undef920) /\ (undef925 = undef925) /\ (undef923 = undef923) /\ (undef922 = undef922) /\ ((0 + isign^0) <= 1) /\ (1 <= (0 + isign^0)) /\ ((1 + nn1^0) <= (0 + i1^0)) /\ ((1 + nn1^0) <= (0 + i1^0)) /\ (0 <= (0 + isign^0))>
267.96/268.30	<l0, l11, (undef904 = undef904) /\ (undef905 = undef905) /\ (undef920 = undef920) /\ (undef925 = undef925) /\ (undef923 = undef923) /\ (undef922 = undef922) /\ ((0 + isign^0) <= 1) /\ (1 <= (0 + isign^0)) /\ ((0 + i1^0) <= (0 + nn1^0))>
267.96/268.30	<l10, l20, ((1 + nn2^0) <= (0 + i2^0)) /\ (undef483 = undef483) /\ (undef480 = undef480), par{i3^0 -> (1 + i3^0), ii3^0 -> (2 + ii3^0), wr^0 -> undef483}>
267.96/268.30	<l10, l10, ((0 + i2^0) <= (0 + nn2^0)) /\ (2 <= (0 + i3^0)) /\ ((0 + i2^0) <= 1) /\ (1 <= (0 + i2^0)) /\ (undef124 = undef124) /\ (undef114 = undef114) /\ (undef113 = undef113) /\ (undef115 = undef115) /\ (undef116 = undef116), par{i2^0 -> (1 + i2^0), j2^0 -> 1}>
267.96/268.30	<l10, l10, ((0 + i2^0) <= (0 + nn2^0)) /\ (2 <= (0 + i3^0)) /\ (2 <= (0 + i2^0)) /\ (undef124 = undef124) /\ (undef114 = undef114) /\ (undef113 = undef113) /\ (undef115 = undef115) /\ (undef116 = undef116), par{i2^0 -> (1 + i2^0), j2^0 -> ((2 + (~(1) * i2^0)) + nn2^0)}>
267.96/268.30	<l10, l10, ((0 + i2^0) <= (0 + nn2^0)) /\ (2 <= (0 + i3^0)) /\ ((1 + i2^0) <= 1) /\ (undef124 = undef124) /\ (undef114 = undef114) /\ (undef113 = undef113) /\ (undef115 = undef115) /\ (undef116 = undef116), par{i2^0 -> (1 + i2^0), j2^0 -> ((2 + (~(1) * i2^0)) + nn2^0)}>
267.96/268.30	<l10, l10, ((0 + i2^0) <= (0 + nn2^0)) /\ ((1 + i3^0) <= 1) /\ ((0 + i2^0) <= 1) /\ (1 <= (0 + i2^0)) /\ (undef124 = undef124) /\ (undef114 = undef114) /\ (undef113 = undef113) /\ (undef115 = undef115) /\ (undef116 = undef116), par{i2^0 -> (1 + i2^0), j2^0 -> 1}>
267.96/268.30	<l10, l10, ((0 + i2^0) <= (0 + nn2^0)) /\ ((1 + i3^0) <= 1) /\ (2 <= (0 + i2^0)) /\ (undef124 = undef124) /\ (undef114 = undef114) /\ (undef113 = undef113) /\ (undef115 = undef115) /\ (undef116 = undef116), par{i2^0 -> (1 + i2^0), j2^0 -> ((2 + (~(1) * i2^0)) + nn2^0)}>
267.96/268.30	<l10, l10, ((0 + i2^0) <= (0 + nn2^0)) /\ ((1 + i3^0) <= 1) /\ ((1 + i2^0) <= 1) /\ (undef124 = undef124) /\ (undef114 = undef114) /\ (undef113 = undef113) /\ (undef115 = undef115) /\ (undef116 = undef116), par{i2^0 -> (1 + i2^0), j2^0 -> ((2 + (~(1) * i2^0)) + nn2^0)}>
267.96/268.30	<l10, l10, ((0 + i2^0) <= (0 + nn2^0)) /\ ((0 + i3^0) <= 1) /\ (1 <= (0 + i3^0)) /\ ((0 + i2^0) <= 1) /\ (1 <= (0 + i2^0)) /\ (undef268 = undef268) /\ (undef267 = undef267) /\ (undef269 = undef269) /\ (undef270 = undef270), par{i2^0 -> (1 + i2^0), j2^0 -> 1}>
267.96/268.30	<l10, l10, ((0 + i2^0) <= (0 + nn2^0)) /\ ((0 + i3^0) <= 1) /\ (1 <= (0 + i3^0)) /\ (2 <= (0 + i2^0)) /\ (undef299 = undef299) /\ (undef268 = undef268) /\ (undef267 = undef267) /\ (undef269 = undef269) /\ (undef270 = undef270), par{i2^0 -> (1 + i2^0), j2^0 -> undef299}>
267.96/268.30	<l10, l10, ((0 + i2^0) <= (0 + nn2^0)) /\ ((0 + i3^0) <= 1) /\ (1 <= (0 + i3^0)) /\ ((1 + i2^0) <= 1) /\ (undef299 = undef299) /\ (undef268 = undef268) /\ (undef267 = undef267) /\ (undef269 = undef269) /\ (undef270 = undef270), par{i2^0 -> (1 + i2^0), j2^0 -> undef299}>
267.96/268.30	<l11, l2, ((1 + nn2^0) <= (0 + i2^0)) /\ ((1 + nn1^0) <= (0 + (1 + i1^0))) /\ ((1 + nn1^0) <= (0 + (1 + i1^0))) /\ (0 <= (0 + isign^0)), par{i1^0 -> (1 + i1^0)}>
267.96/268.30	<l11, l2, ((1 + nn2^0) <= (0 + i2^0)) /\ ((1 + nn1^0) <= (0 + (1 + i1^0))) /\ ((1 + nn1^0) <= (0 + (1 + i1^0))) /\ ((1 + isign^0) <= ~(1)), par{i1^0 -> (1 + i1^0)}>
267.96/268.30	<l11, l2, ((1 + nn2^0) <= (0 + i2^0)) /\ ((1 + nn1^0) <= (0 + (1 + i1^0))) /\ ((1 + nn1^0) <= (0 + (1 + i1^0))) /\ ((0 + isign^0) <= ~(1)) /\ (~(1) <= (0 + isign^0)), par{i1^0 -> (1 + i1^0)}>
267.96/268.30	<l11, l11, ((1 + nn2^0) <= (0 + i2^0)) /\ ((0 + (1 + i1^0)) <= (0 + nn1^0)), par{i1^0 -> (1 + i1^0)}>
267.96/268.30	<l11, l11, ((0 + i2^0) <= (0 + nn2^0)) /\ (undef793 = (1 + j2^0)), par{i2^0 -> (1 + i2^0), j2^0 -> (1 + undef793)}>
267.96/268.30	<l20, l2, ((1 + nn1^0) <= (0 + (1 + i1^0))) /\ (0 <= (0 + isign^0)), par{i1^0 -> (1 + i1^0)}>
267.96/268.30	<l20, l2, ((1 + nn1^0) <= (0 + (1 + i1^0))) /\ ((1 + isign^0) <= ~(1)), par{i1^0 -> (1 + i1^0)}>
267.96/268.30	<l20, l2, ((1 + nn1^0) <= (0 + (1 + i1^0))) /\ ((0 + isign^0) <= ~(1)) /\ (~(1) <= (0 + isign^0)), par{i1^0 -> (1 + i1^0)}>
267.96/268.30	<l20, l20, ((0 + (1 + i1^0)) <= (0 + nn1^0)) /\ ((0 + (1 + i1^0)) <= 1) /\ (1 <= (0 + (1 + i1^0))), par{i1^0 -> (1 + i1^0), wr^0 -> 1}>
267.96/268.30	<l20, l20, ((0 + (1 + i1^0)) <= (0 + nn1^0)) /\ (2 <= (0 + (1 + i1^0))), par{i1^0 -> (1 + i1^0), wr^0 -> 1}>
267.96/268.30	<l20, l20, ((0 + (1 + i1^0)) <= (0 + nn1^0)) /\ ((1 + (1 + i1^0)) <= 1), par{i1^0 -> (1 + i1^0), wr^0 -> 1}>
267.96/268.30	<l20, l10, true>
267.96/268.30	
267.96/268.30	Fresh variables:
267.96/268.30	undef113, undef114, undef115, undef116, undef124, undef267, undef268, undef269, undef270, undef299, undef480, undef483, undef793, undef904, undef905, undef920, undef922, undef923, undef925, 
267.96/268.30	
267.96/268.30	Undef variables:
267.96/268.30	undef113, undef114, undef115, undef116, undef124, undef267, undef268, undef269, undef270, undef299, undef480, undef483, undef793, undef904, undef905, undef920, undef922, undef923, undef925, 
267.96/268.30	
267.96/268.30	Abstraction variables:
267.96/268.30	
267.96/268.30	Exit nodes:
267.96/268.30	
267.96/268.30	Accepting locations:
267.96/268.30	
267.96/268.30	Asserts:
267.96/268.30	
267.96/268.30	*************************************************************
267.96/268.30	*******************************************************************************************
267.96/268.30	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
267.96/268.30	*******************************************************************************************
267.96/268.30	
267.96/268.30	Init Location: 0
267.96/268.30	Graph 0:
267.96/268.30	Transitions:
267.96/268.30	Variables:
267.96/268.30	
267.96/268.30	Graph 1:
267.96/268.30	Transitions:
267.96/268.30	<l11, l11, 1 + i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0, {i1^0 -> 1 + i1^0, rest remain the same}>
267.96/268.30	<l11, l11, i2^0 <= nn2^0 /\ 1 + j2^0 = undef793, {i2^0 -> 1 + i2^0, j2^0 -> 1 + undef793, rest remain the same}>
267.96/268.30	Variables:
267.96/268.30	i1^0, i2^0, nn1^0, nn2^0, j2^0
267.96/268.30	
267.96/268.30	Graph 2:
267.96/268.30	Transitions:
267.96/268.30	<l10, l20, 1 + nn2^0 <= i2^0, {i3^0 -> 1 + i3^0, ii3^0 -> 2 + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= nn2^0 /\ 2 <= i3^0 /\ i2^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= nn2^0 /\ 2 <= i2^0 /\ 2 <= i3^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= 0 /\ i2^0 <= nn2^0 /\ 2 <= i3^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= nn2^0 /\ i3^0 <= 0 /\ i2^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= nn2^0 /\ i3^0 <= 0 /\ 2 <= i2^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= 0 /\ i2^0 <= nn2^0 /\ i3^0 <= 0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= nn2^0 /\ i2^0 = 1 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= nn2^0 /\ 2 <= i2^0 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> undef299, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= 0 /\ i2^0 <= nn2^0 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> undef299, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= nn1^0 /\ i1^0 = 0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= nn1^0 /\ 1 <= i1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= 0 /\ 1 + i1^0 <= nn1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l10, true, {all remain the same}>
267.96/268.30	Variables:
267.96/268.30	i2^0, i3^0, ii3^0, nn2^0, wr^0, j2^0, i1^0, nn1^0
267.96/268.30	
267.96/268.30	Graph 3:
267.96/268.30	Transitions:
267.96/268.30	Variables:
267.96/268.30	
267.96/268.30	Precedence: 
267.96/268.30	Graph 0
267.96/268.30	
267.96/268.30	Graph 1
267.96/268.30	<l0, l11, i1^0 <= nn1^0 /\ isign^0 = 1, {all remain the same}>
267.96/268.30	
267.96/268.30	Graph 2
267.96/268.30	<l0, l20, i1^0 <= nn1^0 /\ 2 <= isign^0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.30	<l0, l20, i1^0 <= nn1^0 /\ 2 <= i1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.30	<l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.30	<l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.30	<l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ 2 <= i1^0, {wr^0 -> 1, rest remain the same}>
267.96/268.30	<l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ isign^0 <= 0, {wr^0 -> 1, rest remain the same}>
267.96/268.30	
267.96/268.30	Graph 3
267.96/268.30	<l0, l2, 1 + nn1^0 <= i1^0 /\ 2 <= isign^0, {all remain the same}>
267.96/268.30	<l0, l2, 1 + nn1^0 <= i1^0 /\ isign^0 = 0, {all remain the same}>
267.96/268.30	<l0, l2, 1 + nn1^0 <= i1^0 /\ 2 + isign^0 <= 0, {all remain the same}>
267.96/268.30	<l0, l2, 1 + nn1^0 <= i1^0 /\ 1 + isign^0 = 0, {all remain the same}>
267.96/268.30	<l0, l2, 1 + nn1^0 <= i1^0 /\ isign^0 = 1, {all remain the same}>
267.96/268.30	<l11, l2, nn1^0 <= i1^0 /\ 0 <= isign^0 /\ 1 + nn2^0 <= i2^0, {i1^0 -> 1 + i1^0, rest remain the same}>
267.96/268.30	<l11, l2, nn1^0 <= i1^0 /\ 1 + nn2^0 <= i2^0 /\ 2 + isign^0 <= 0, {i1^0 -> 1 + i1^0, rest remain the same}>
267.96/268.30	<l11, l2, nn1^0 <= i1^0 /\ 1 + nn2^0 <= i2^0 /\ 1 + isign^0 = 0, {i1^0 -> 1 + i1^0, rest remain the same}>
267.96/268.30	<l20, l2, nn1^0 <= i1^0 /\ 0 <= isign^0, {i1^0 -> 1 + i1^0, rest remain the same}>
267.96/268.30	<l20, l2, nn1^0 <= i1^0 /\ 2 + isign^0 <= 0, {i1^0 -> 1 + i1^0, rest remain the same}>
267.96/268.30	<l20, l2, nn1^0 <= i1^0 /\ 1 + isign^0 = 0, {i1^0 -> 1 + i1^0, rest remain the same}>
267.96/268.30	
267.96/268.30	Map Locations to Subgraph:
267.96/268.30	( 0 , 0 )
267.96/268.30	( 2 , 3 )
267.96/268.30	( 10 , 2 )
267.96/268.30	( 11 , 1 )
267.96/268.30	( 20 , 2 )
267.96/268.30	
267.96/268.30	*******************************************************************************************
267.96/268.30	********************************    CHECKING ASSERTIONS    ********************************
267.96/268.30	*******************************************************************************************
267.96/268.30	
267.96/268.30	Proving termination of subgraph 0
267.96/268.30	Proving termination of subgraph 1
267.96/268.30	Checking unfeasibility...
267.96/268.30	Time used: 0.007091
267.96/268.30	
267.96/268.30	Checking conditional termination of SCC {l11}...
267.96/268.30	
267.96/268.30	LOG: CALL solveLinear
267.96/268.30	
267.96/268.30	LOG: RETURN solveLinear - Elapsed time: 0.002090s
267.96/268.30	Ranking function: -i2^0 + nn2^0
267.96/268.30	New Graphs: 
267.96/268.30	Transitions:
267.96/268.30	<l11, l11, 1 + i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0, {i1^0 -> 1 + i1^0, rest remain the same}>
267.96/268.30	Variables:
267.96/268.30	i1^0, i2^0, nn1^0, nn2^0
267.96/268.30	Checking conditional termination of SCC {l11}...
267.96/268.30	
267.96/268.30	LOG: CALL solveLinear
267.96/268.30	
267.96/268.30	LOG: RETURN solveLinear - Elapsed time: 0.001052s
267.96/268.30	Ranking function: -1 - i1^0 + nn1^0
267.96/268.30	New Graphs: 
267.96/268.30	Proving termination of subgraph 2
267.96/268.30	Checking unfeasibility...
267.96/268.30	Time used: 0.352767
267.96/268.30	
267.96/268.30	Checking conditional termination of SCC {l10, l20}...
267.96/268.30	
267.96/268.30	LOG: CALL solveLinear
267.96/268.30	
267.96/268.30	LOG: RETURN solveLinear - Elapsed time: 0.033700s
267.96/268.30	Ranking function: -4 - i2^0 - 10*i3^0 + 5*nn2^0
267.96/268.30	New Graphs: 
267.96/268.30	Transitions:
267.96/268.30	<l10, l20, 1 + nn2^0 <= i2^0, {i3^0 -> 1 + i3^0, ii3^0 -> 2 + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= nn2^0 /\ 2 <= i3^0 /\ i2^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= nn2^0 /\ 2 <= i2^0 /\ 2 <= i3^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= 0 /\ i2^0 <= nn2^0 /\ 2 <= i3^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= 0 /\ i2^0 <= nn2^0 /\ i3^0 <= 0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= nn2^0 /\ i2^0 = 1 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= nn2^0 /\ 2 <= i2^0 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> undef299, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= 0 /\ i2^0 <= nn2^0 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> undef299, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= nn1^0 /\ i1^0 = 0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= nn1^0 /\ 1 <= i1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= 0 /\ 1 + i1^0 <= nn1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l10, true, {all remain the same}>
267.96/268.30	Variables:
267.96/268.30	i1^0, i2^0, i3^0, ii3^0, j2^0, nn1^0, nn2^0, wr^0
267.96/268.30	Checking conditional termination of SCC {l10, l20}...
267.96/268.30	
267.96/268.30	LOG: CALL solveLinear
267.96/268.30	
267.96/268.30	LOG: RETURN solveLinear - Elapsed time: 0.006968s
267.96/268.30	Ranking function: -4 - i2^0 + 5*nn2^0
267.96/268.30	New Graphs: 
267.96/268.30	Transitions:
267.96/268.30	<l10, l20, 1 + nn2^0 <= i2^0, {i3^0 -> 1 + i3^0, ii3^0 -> 2 + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= 0 /\ i2^0 <= nn2^0 /\ 2 <= i3^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= 0 /\ i2^0 <= nn2^0 /\ i3^0 <= 0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= 0 /\ i2^0 <= nn2^0 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> undef299, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= nn1^0 /\ i1^0 = 0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= nn1^0 /\ 1 <= i1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= 0 /\ 1 + i1^0 <= nn1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l10, true, {all remain the same}>
267.96/268.30	Variables:
267.96/268.30	i1^0, i2^0, i3^0, ii3^0, j2^0, nn1^0, nn2^0, wr^0
267.96/268.30	Checking conditional termination of SCC {l10, l20}...
267.96/268.30	
267.96/268.30	LOG: CALL solveLinear
267.96/268.30	
267.96/268.30	LOG: RETURN solveLinear - Elapsed time: 0.004273s
267.96/268.30	Ranking function: 1 - i2^0 - 3*i3^0 + nn2^0
267.96/268.30	New Graphs: 
267.96/268.30	Transitions:
267.96/268.30	<l10, l20, 1 + nn2^0 <= i2^0, {i3^0 -> 1 + i3^0, ii3^0 -> 2 + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= 0 /\ i2^0 <= nn2^0 /\ 2 <= i3^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= 0 /\ i2^0 <= nn2^0 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> undef299, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= nn1^0 /\ i1^0 = 0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= nn1^0 /\ 1 <= i1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= 0 /\ 1 + i1^0 <= nn1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l10, true, {all remain the same}>
267.96/268.30	Variables:
267.96/268.30	i1^0, i2^0, i3^0, ii3^0, j2^0, nn1^0, nn2^0, wr^0
267.96/268.30	Checking conditional termination of SCC {l10, l20}...
267.96/268.30	
267.96/268.30	LOG: CALL solveLinear
267.96/268.30	
267.96/268.30	LOG: RETURN solveLinear - Elapsed time: 0.003812s
267.96/268.30	Ranking function: 2 - i2^0 - i3^0 + nn2^0
267.96/268.30	New Graphs: 
267.96/268.30	Transitions:
267.96/268.30	<l10, l20, 1 + nn2^0 <= i2^0, {i3^0 -> 1 + i3^0, ii3^0 -> 2 + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.30	<l10, l10, i2^0 <= 0 /\ i2^0 <= nn2^0 /\ 2 <= i3^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= nn1^0 /\ i1^0 = 0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= nn1^0 /\ 1 <= i1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= 0 /\ 1 + i1^0 <= nn1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l10, true, {all remain the same}>
267.96/268.30	Variables:
267.96/268.30	i1^0, i2^0, i3^0, ii3^0, j2^0, nn1^0, nn2^0, wr^0
267.96/268.30	Checking conditional termination of SCC {l10, l20}...
267.96/268.30	
267.96/268.30	LOG: CALL solveLinear
267.96/268.30	
267.96/268.30	LOG: RETURN solveLinear - Elapsed time: 0.003283s
267.96/268.30	Ranking function: 1 - i2^0 + nn2^0
267.96/268.30	New Graphs: 
267.96/268.30	Transitions:
267.96/268.30	<l10, l20, 1 + nn2^0 <= i2^0, {i3^0 -> 1 + i3^0, ii3^0 -> 2 + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= nn1^0 /\ i1^0 = 0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= nn1^0 /\ 1 <= i1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= 0 /\ 1 + i1^0 <= nn1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l10, true, {all remain the same}>
267.96/268.30	Variables:
267.96/268.30	i1^0, i2^0, i3^0, ii3^0, nn1^0, nn2^0, wr^0
267.96/268.30	Checking conditional termination of SCC {l10, l20}...
267.96/268.30	
267.96/268.30	LOG: CALL solveLinear
267.96/268.30	
267.96/268.30	LOG: RETURN solveLinear - Elapsed time: 0.002741s
267.96/268.30	Ranking function: -4*i1^0
267.96/268.30	New Graphs: 
267.96/268.30	Transitions:
267.96/268.30	<l10, l20, 1 + nn2^0 <= i2^0, {i3^0 -> 1 + i3^0, ii3^0 -> 2 + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.30	<l20, l20, 1 + i1^0 <= nn1^0 /\ 1 <= i1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.30	<l20, l10, true, {all remain the same}>
267.96/268.30	Variables:
267.96/268.30	i1^0, i2^0, i3^0, ii3^0, nn1^0, nn2^0, wr^0
267.96/268.30	Checking conditional termination of SCC {l10, l20}...
267.96/268.30	
267.96/268.30	LOG: CALL solveLinear
267.96/268.30	
267.96/268.30	LOG: RETURN solveLinear - Elapsed time: 0.002057s
267.96/268.30	Ranking function: -i1^0 + nn1^0
267.96/268.30	New Graphs: 
267.96/268.30	Transitions:
267.96/268.30	<l10, l10, 1 + nn2^0 <= i2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.30	Variables:
267.96/268.30	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.30	Checking conditional termination of SCC {l10}...
267.96/268.30	
267.96/268.30	LOG: CALL solveLinear
267.96/268.30	
267.96/268.30	LOG: RETURN solveLinear - Elapsed time: 0.000630s
267.96/268.30	
267.96/268.30	LOG: CALL solveLinear
267.96/268.30	
267.96/268.30	LOG: RETURN solveLinear - Elapsed time: 0.002141s
267.96/268.30	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.30	Solving with 1 template(s).
267.96/268.30	
267.96/268.30	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.30	
267.96/268.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015336s
267.96/268.30	Time used: 0.015198
267.96/268.30	Solving with 1 template(s).
267.96/268.30	
267.96/268.30	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.30	
267.96/268.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003267s
267.96/268.30	Time used: 4.00206
267.96/268.30	Solving with 2 template(s).
267.96/268.30	
267.96/268.30	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.30	
267.96/268.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004586s
267.96/268.30	Time used: 4.0002
267.96/268.30	Solving with 3 template(s).
267.96/268.30	
267.96/268.30	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.30	
267.96/268.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007805s
267.96/268.30	Time used: 1.00004
267.96/268.30	Solving with 1 template(s).
267.96/268.30	
267.96/268.30	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.30	
267.96/268.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.206687s
267.96/268.30	Time used: 0.175605
267.96/268.30	Improving Solution with cost 1 ...
267.96/268.30	
267.96/268.30	LOG: CALL solveNonLinearGetNextSolution
267.96/268.30	
267.96/268.30	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.136898s
267.96/268.30	Time used: 0.136891
267.96/268.30	
267.96/268.30	LOG: SAT solveNonLinear - Elapsed time: 0.343585s
267.96/268.30	Cost: 1; Total time: 0.312496
267.96/268.30	Quasi-ranking function: 50000 - i3^0
267.96/268.30	New Graphs: 
267.96/268.30	Transitions:
267.96/268.30	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.30	Variables:
267.96/268.30	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.30	Checking conditional termination of SCC {l10}...
267.96/268.30	
267.96/268.30	LOG: CALL solveLinear
267.96/268.30	
267.96/268.30	LOG: RETURN solveLinear - Elapsed time: 0.000853s
267.96/268.30	
267.96/268.30	LOG: CALL solveLinear
267.96/268.30	
267.96/268.30	LOG: RETURN solveLinear - Elapsed time: 0.003022s
267.96/268.30	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.30	Solving with 1 template(s).
267.96/268.30	
267.96/268.30	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.30	
267.96/268.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021853s
267.96/268.30	Time used: 0.021681
267.96/268.30	Solving with 1 template(s).
267.96/268.30	
267.96/268.30	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.30	
267.96/268.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011659s
267.96/268.30	Time used: 4.0103
267.96/268.30	Solving with 2 template(s).
267.96/268.30	
267.96/268.30	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.30	
267.96/268.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004986s
267.96/268.30	Time used: 4.00003
267.96/268.30	Solving with 3 template(s).
267.96/268.30	
267.96/268.30	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.30	
267.96/268.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008852s
267.96/268.30	Time used: 1.00024
267.96/268.30	Solving with 1 template(s).
267.96/268.30	
267.96/268.30	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.30	
267.96/268.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.236076s
267.96/268.30	Time used: 0.206653
267.96/268.30	Improving Solution with cost 1 ...
267.96/268.30	
267.96/268.30	LOG: CALL solveNonLinearGetNextSolution
267.96/268.30	
267.96/268.30	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.219315s
267.96/268.30	Time used: 0.219168
267.96/268.30	
267.96/268.30	LOG: SAT solveNonLinear - Elapsed time: 0.455391s
267.96/268.30	Cost: 1; Total time: 0.425821
267.96/268.30	Quasi-ranking function: 50000 + 2*i2^0 - i3^0 - 2*nn2^0
267.96/268.30	New Graphs: 
267.96/268.30	Transitions:
267.96/268.30	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.30	Variables:
267.96/268.30	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.30	Checking conditional termination of SCC {l10}...
267.96/268.30	
267.96/268.30	LOG: CALL solveLinear
267.96/268.30	
267.96/268.30	LOG: RETURN solveLinear - Elapsed time: 0.000984s
267.96/268.30	
267.96/268.30	LOG: CALL solveLinear
267.96/268.30	
267.96/268.30	LOG: RETURN solveLinear - Elapsed time: 0.004034s
267.96/268.30	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.30	Solving with 1 template(s).
267.96/268.30	
267.96/268.30	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.30	
267.96/268.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031055s
267.96/268.30	Time used: 0.030874
267.96/268.30	Solving with 1 template(s).
267.96/268.30	
267.96/268.30	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.30	
267.96/268.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005508s
267.96/268.30	Time used: 4.00401
267.96/268.30	Solving with 2 template(s).
267.96/268.30	
267.96/268.30	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006388s
267.96/268.31	Time used: 4.00106
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008024s
267.96/268.31	Time used: 1.00002
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.225273s
267.96/268.31	Time used: 0.193016
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.157358s
267.96/268.31	Time used: 0.157351
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.382631s
267.96/268.31	Cost: 1; Total time: 0.350367
267.96/268.31	Quasi-ranking function: 50000 - i2^0 - i3^0 + nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.001154s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.005475s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028202s
267.96/268.31	Time used: 0.028006
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005823s
267.96/268.31	Time used: 4.00442
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005961s
267.96/268.31	Time used: 4.00069
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009602s
267.96/268.31	Time used: 1.00143
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.223965s
267.96/268.31	Time used: 0.196665
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.177824s
267.96/268.31	Time used: 0.17781
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.401789s
267.96/268.31	Cost: 1; Total time: 0.374475
267.96/268.31	Quasi-ranking function: 50000 + i2^0 - i3^0 + nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.001217s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.004877s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033415s
267.96/268.31	Time used: 0.033218
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005736s
267.96/268.31	Time used: 4.0044
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005413s
267.96/268.31	Time used: 4.00001
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009050s
267.96/268.31	Time used: 1.00064
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.238284s
267.96/268.31	Time used: 0.205608
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.149162s
267.96/268.31	Time used: 0.149154
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.387446s
267.96/268.31	Cost: 1; Total time: 0.354762
267.96/268.31	Quasi-ranking function: 50000 - i2^0 - i3^0 - nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.001443s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.006273s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035246s
267.96/268.31	Time used: 0.035034
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006663s
267.96/268.31	Time used: 4.00533
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005762s
267.96/268.31	Time used: 4.00024
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009299s
267.96/268.31	Time used: 1.00007
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.250798s
267.96/268.31	Time used: 0.219202
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.166373s
267.96/268.31	Time used: 0.166364
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.417170s
267.96/268.31	Cost: 1; Total time: 0.385566
267.96/268.31	Quasi-ranking function: 50000 - i3^0 - nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.001528s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.006597s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037923s
267.96/268.31	Time used: 0.0377
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008238s
267.96/268.31	Time used: 4.00695
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005617s
267.96/268.31	Time used: 4.00016
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009843s
267.96/268.31	Time used: 1.00116
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.224045s
267.96/268.31	Time used: 0.19112
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.231413s
267.96/268.31	Time used: 0.231404
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.455458s
267.96/268.31	Cost: 1; Total time: 0.422524
267.96/268.31	Quasi-ranking function: 50000 - i3^0 + 100004*nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.001531s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.007121s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040250s
267.96/268.31	Time used: 0.040021
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009408s
267.96/268.31	Time used: 4.00799
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005448s
267.96/268.31	Time used: 4.00003
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.014180s
267.96/268.31	Time used: 1.00008
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.265133s
267.96/268.31	Time used: 0.2323
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.154896s
267.96/268.31	Time used: 0.154887
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.420030s
267.96/268.31	Cost: 1; Total time: 0.387187
267.96/268.31	Quasi-ranking function: 50000 + i2^0 - 3*i3^0 + ii3^0 - nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.001727s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.013172s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.103421s
267.96/268.31	Time used: 0.10316
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008627s
267.96/268.31	Time used: 4.0068
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005693s
267.96/268.31	Time used: 4.00014
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010414s
267.96/268.31	Time used: 1.00057
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.244536s
267.96/268.31	Time used: 0.221924
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.205554s
267.96/268.31	Time used: 0.205545
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.450090s
267.96/268.31	Cost: 1; Total time: 0.427469
267.96/268.31	Quasi-ranking function: 50000 + i2^0 + 2*i3^0 - 2*ii3^0 + nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.001871s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.031070s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.191976s
267.96/268.31	Time used: 0.191687
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008993s
267.96/268.31	Time used: 4.00714
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006351s
267.96/268.31	Time used: 4.00082
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009267s
267.96/268.31	Time used: 1.00033
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.447776s
267.96/268.31	Time used: 0.412606
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.130261s
267.96/268.31	Time used: 0.130233
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.578036s
267.96/268.31	Cost: 1; Total time: 0.542839
267.96/268.31	Quasi-ranking function: 50000 - i2^0 + i3^0 - ii3^0 + nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.002040s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.022962s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.171513s
267.96/268.31	Time used: 0.17124
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010456s
267.96/268.31	Time used: 4.00852
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005531s
267.96/268.31	Time used: 4.00013
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008759s
267.96/268.31	Time used: 1.00009
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.291987s
267.96/268.31	Time used: 0.25547
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.225539s
267.96/268.31	Time used: 0.22553
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.517526s
267.96/268.31	Cost: 1; Total time: 0.481
267.96/268.31	Quasi-ranking function: 50000 + i2^0 + i3^0 - ii3^0 - nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.002265s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.017704s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.196428s
267.96/268.31	Time used: 0.195959
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010093s
267.96/268.31	Time used: 4.00814
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005501s
267.96/268.31	Time used: 4.00008
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009756s
267.96/268.31	Time used: 1.00103
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.235618s
267.96/268.31	Time used: 0.201504
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.164305s
267.96/268.31	Time used: 0.156437
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.399923s
267.96/268.31	Cost: 1; Total time: 0.357941
267.96/268.31	Quasi-ranking function: 50000 - i2^0 + 9*i3^0 - 5*ii3^0 - nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.002333s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.022738s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.202138s
267.96/268.31	Time used: 0.20164
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.033123s
267.96/268.31	Time used: 4.03108
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005107s
267.96/268.31	Time used: 4.00004
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.013149s
267.96/268.31	Time used: 1.00478
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.272610s
267.96/268.31	Time used: 0.240938
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.185161s
267.96/268.31	Time used: 0.185151
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.457771s
267.96/268.31	Cost: 1; Total time: 0.426089
267.96/268.31	Quasi-ranking function: 50000 - i2^0 - 3*i3^0 + ii3^0 - nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.002363s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.032775s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.200687s
267.96/268.31	Time used: 0.194463
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010662s
267.96/268.31	Time used: 4.00845
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005421s
267.96/268.31	Time used: 4.00013
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008620s
267.96/268.31	Time used: 1.00004
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.339842s
267.96/268.31	Time used: 0.305275
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.243670s
267.96/268.31	Time used: 0.243662
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.583512s
267.96/268.31	Cost: 1; Total time: 0.548937
267.96/268.31	Quasi-ranking function: 50000 + i2^0 - 3*i3^0 + ii3^0 + nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.002548s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.053256s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.262292s
267.96/268.31	Time used: 0.254424
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010749s
267.96/268.31	Time used: 4.00847
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006525s
267.96/268.31	Time used: 4.00109
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009318s
267.96/268.31	Time used: 1.0007
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.344181s
267.96/268.31	Time used: 0.310724
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.180772s
267.96/268.31	Time used: 0.180763
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.524953s
267.96/268.31	Cost: 1; Total time: 0.491487
267.96/268.31	Quasi-ranking function: 50000 - i2^0 - 3*i3^0 + ii3^0 + nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.002615s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.079713s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.231495s
267.96/268.31	Time used: 0.221738
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.669696s
267.96/268.31	Time used: 3.66755
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.977568s
267.96/268.31	Time used: 0.972625
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.977340s
267.96/268.31	Time used: 0.969378
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.281823s
267.96/268.31	Time used: 0.252188
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.168732s
267.96/268.31	Time used: 0.168723
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.450555s
267.96/268.31	Cost: 1; Total time: 0.420911
267.96/268.31	Quasi-ranking function: 50000 - i3^0 - ii3^0 + nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.002710s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.140311s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.231213s
267.96/268.31	Time used: 0.230707
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.107430s
267.96/268.31	Time used: 0.105418
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.984486s
267.96/268.31	Time used: 0.981374
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.979494s
267.96/268.31	Time used: 0.971944
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.258003s
267.96/268.31	Time used: 0.227186
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.217647s
267.96/268.31	Time used: 0.217628
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.475650s
267.96/268.31	Cost: 1; Total time: 0.444814
267.96/268.31	Quasi-ranking function: 50000 + i2^0 - i3^0 - ii3^0 + nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.002859s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.097972s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.251749s
267.96/268.31	Time used: 0.251212
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.110521s
267.96/268.31	Time used: 0.108737
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.976970s
267.96/268.31	Time used: 0.965069
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.962956s
267.96/268.31	Time used: 0.953089
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.237157s
267.96/268.31	Time used: 0.209066
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.176255s
267.96/268.31	Time used: 0.176245
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.413412s
267.96/268.31	Cost: 1; Total time: 0.385311
267.96/268.31	Quasi-ranking function: 50000 + 2*i2^0 - 5*i3^0 + 2*ii3^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.002960s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.065379s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.274739s
267.96/268.31	Time used: 0.27421
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.168513s
267.96/268.31	Time used: 0.166719
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.990882s
267.96/268.31	Time used: 0.987481
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.979539s
267.96/268.31	Time used: 0.971771
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.293011s
267.96/268.31	Time used: 0.260899
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.158947s
267.96/268.31	Time used: 0.158938
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.451958s
267.96/268.31	Cost: 1; Total time: 0.419837
267.96/268.31	Quasi-ranking function: 50000 + i2^0 - ii3^0 - nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.003095s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.039991s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.284206s
267.96/268.31	Time used: 0.283646
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.137548s
267.96/268.31	Time used: 0.135767
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.990491s
267.96/268.31	Time used: 0.986813
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.979429s
267.96/268.31	Time used: 0.971509
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.276344s
267.96/268.31	Time used: 0.244221
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.161258s
267.96/268.31	Time used: 0.161249
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.437603s
267.96/268.31	Cost: 1; Total time: 0.40547
267.96/268.31	Quasi-ranking function: 50000 - i3^0 - ii3^0 - nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.003221s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.179280s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.276708s
267.96/268.31	Time used: 0.276099
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.120377s
267.96/268.31	Time used: 0.118562
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.897751s
267.96/268.31	Time used: 0.894433
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.988148s
267.96/268.31	Time used: 0.970787
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.407606s
267.96/268.31	Time used: 0.377002
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.194115s
267.96/268.31	Time used: 0.194094
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.601722s
267.96/268.31	Cost: 1; Total time: 0.571096
267.96/268.31	Quasi-ranking function: 50000 + 75004*i2^0 - i3^0 - ii3^0 - nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.003443s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.225073s
267.96/268.31	Trying to remove transition: <l10, l10, 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.080482s
267.96/268.31	Time used: 0.079685
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002870s
267.96/268.31	Time used: 1.00134
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.979409s
267.96/268.31	Time used: 0.975264
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.978321s
267.96/268.31	Time used: 0.969869
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.317114s
267.96/268.31	Time used: 0.284471
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.164638s
267.96/268.31	Time used: 0.164621
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.481752s
267.96/268.31	Cost: 1; Total time: 0.449092
267.96/268.31	Termination implied by a set of invariant(s):
267.96/268.31	Invariant at l10: i1^0 <= nn1^0
267.96/268.31	Invariant at l20: i1^0 <= nn1^0
267.96/268.31	[ Invariant Graph ]
267.96/268.31	Strengthening and disabling transitions...
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l10, l20, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0, {i3^0 -> 1 + i3^0, ii3^0 -> 2 + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ 2 <= i3^0 /\ i2^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ 2 <= i2^0 /\ 2 <= i3^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= 0 /\ i2^0 <= nn2^0 /\ 2 <= i3^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ i3^0 <= 0 /\ i2^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ i3^0 <= 0 /\ 2 <= i2^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= 0 /\ i2^0 <= nn2^0 /\ i3^0 <= 0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ i2^0 = 1 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ 2 <= i2^0 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> undef299, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= 0 /\ i2^0 <= nn2^0 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> undef299, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l20, l20, 1 + i1^0 <= nn1^0 /\ i1^0 = 0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l20, l20, 1 + i1^0 <= nn1^0 /\ 1 <= i1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l20, l20, 1 + i1^0 <= 0 /\ 1 + i1^0 <= nn1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l20, l10, i1^0 <= nn1^0, {all remain the same}>
267.96/268.31	[ Termination Graph ]
267.96/268.31	Strengthening and disabling transitions...
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Quasi-ranking function: 50000 - i2^0 - i3^0 - ii3^0 + nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.003551s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.358977s
267.96/268.31	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.076959s
267.96/268.31	Time used: 0.076244
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.923659s
267.96/268.31	Time used: 0.921854
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.978688s
267.96/268.31	Time used: 0.974746
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.976669s
267.96/268.31	Time used: 0.968909
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.335651s
267.96/268.31	Time used: 0.30765
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.150316s
267.96/268.31	Time used: 0.150297
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.485967s
267.96/268.31	Cost: 1; Total time: 0.457947
267.96/268.31	Quasi-ranking function: 50000 - i2^0 - i3^0 - ii3^0 - nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.003966s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.422132s
267.96/268.31	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.080662s
267.96/268.31	Time used: 0.079765
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.938028s
267.96/268.31	Time used: 0.931586
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.974994s
267.96/268.31	Time used: 0.971219
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.977175s
267.96/268.31	Time used: 0.969229
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.271759s
267.96/268.31	Time used: 0.239894
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.208359s
267.96/268.31	Time used: 0.208341
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.480118s
267.96/268.31	Cost: 1; Total time: 0.448235
267.96/268.31	Quasi-ranking function: 50000 + i3^0 - ii3^0 + nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.003961s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.717580s
267.96/268.31	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.379581s
267.96/268.31	Time used: 0.378346
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.328677s
267.96/268.31	Time used: 0.326614
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.988470s
267.96/268.31	Time used: 0.984634
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.976217s
267.96/268.31	Time used: 0.968135
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.331078s
267.96/268.31	Time used: 0.30111
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.154394s
267.96/268.31	Time used: 0.154378
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.485472s
267.96/268.31	Cost: 1; Total time: 0.455488
267.96/268.31	Termination implied by a set of invariant(s):
267.96/268.31	Invariant at l20: i1^0 <= nn1^0
267.96/268.31	[ Invariant Graph ]
267.96/268.31	Strengthening and disabling transitions...
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l20, l20, 1 + i1^0 <= nn1^0 /\ i1^0 = 0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l20, l20, 1 + i1^0 <= nn1^0 /\ 1 <= i1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l20, l20, 1 + i1^0 <= 0 /\ 1 + i1^0 <= nn1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l20, l10, i1^0 <= nn1^0, {all remain the same}>
267.96/268.31	[ Termination Graph ]
267.96/268.31	Strengthening and disabling transitions...
267.96/268.31	Quasi-ranking function: 50000 + i3^0 - ii3^0 - nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.004017s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.449259s
267.96/268.31	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.448026s
267.96/268.31	Time used: 0.447157
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.500214s
267.96/268.31	Time used: 0.497742
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.987715s
267.96/268.31	Time used: 0.983937
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.985781s
267.96/268.31	Time used: 0.968235
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.351108s
267.96/268.31	Time used: 0.328802
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.175751s
267.96/268.31	Time used: 0.175732
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.526860s
267.96/268.31	Cost: 1; Total time: 0.504534
267.96/268.31	Quasi-ranking function: 50000 - 3*i3^0 + ii3^0 + nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.004119s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.089170s
267.96/268.31	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.306687s
267.96/268.31	Time used: 0.305928
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.957129s
267.96/268.31	Time used: 0.95461
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.976134s
267.96/268.31	Time used: 0.971831
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.976909s
267.96/268.31	Time used: 0.968735
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.352690s
267.96/268.31	Time used: 0.318814
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.182574s
267.96/268.31	Time used: 0.182557
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.535264s
267.96/268.31	Cost: 1; Total time: 0.501371
267.96/268.31	Termination implied by a set of invariant(s):
267.96/268.31	Invariant at l20: i1^0 <= nn1^0
267.96/268.31	[ Invariant Graph ]
267.96/268.31	Strengthening and disabling transitions...
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l20, l20, 1 + i1^0 <= nn1^0 /\ i1^0 = 0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l20, l20, 1 + i1^0 <= nn1^0 /\ 1 <= i1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l20, l20, 1 + i1^0 <= 0 /\ 1 + i1^0 <= nn1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.31	
267.96/268.31	LOG: CALL solverLinear in Graph for feasibility
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.31	Strengthening transition (result): 
267.96/268.31	<l20, l10, i1^0 <= nn1^0, {all remain the same}>
267.96/268.31	[ Termination Graph ]
267.96/268.31	Strengthening and disabling transitions...
267.96/268.31	Quasi-ranking function: 50000 - 3*i3^0 + ii3^0 - nn2^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.004242s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.323460s
267.96/268.31	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.093949s
267.96/268.31	Time used: 0.093106
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.937340s
267.96/268.31	Time used: 0.935384
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.977602s
267.96/268.31	Time used: 0.97336
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.978909s
267.96/268.31	Time used: 0.970659
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.303659s
267.96/268.31	Time used: 0.270768
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.277247s
267.96/268.31	Time used: 0.277232
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.580906s
267.96/268.31	Cost: 1; Total time: 0.548
267.96/268.31	Quasi-ranking function: 50000 - i2^0 - i3^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.004399s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.071784s
267.96/268.31	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.268009s
267.96/268.31	Time used: 0.267171
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.991614s
267.96/268.31	Time used: 0.986846
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.974528s
267.96/268.31	Time used: 0.97038
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.976019s
267.96/268.31	Time used: 0.967847
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.321738s
267.96/268.31	Time used: 0.288281
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.127074s
267.96/268.31	Time used: 0.127064
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.448812s
267.96/268.31	Cost: 1; Total time: 0.415345
267.96/268.31	Quasi-ranking function: 50000 + i2^0 - i3^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.004589s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.343193s
267.96/268.31	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.120110s
267.96/268.31	Time used: 0.119168
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003745s
267.96/268.31	Time used: 1.00157
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.975380s
267.96/268.31	Time used: 0.971251
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.976292s
267.96/268.31	Time used: 0.968242
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.375228s
267.96/268.31	Time used: 0.341384
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.160073s
267.96/268.31	Time used: 0.160052
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.535301s
267.96/268.31	Cost: 1; Total time: 0.501436
267.96/268.31	Quasi-ranking function: 50000 - i2^0 - 3*i3^0 + ii3^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.005029s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.149002s
267.96/268.31	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.239538s
267.96/268.31	Time used: 0.238656
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.985602s
267.96/268.31	Time used: 0.982859
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.985115s
267.96/268.31	Time used: 0.98088
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.974865s
267.96/268.31	Time used: 0.957366
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.374358s
267.96/268.31	Time used: 0.339102
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.147517s
267.96/268.31	Time used: 0.147495
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.521875s
267.96/268.31	Cost: 1; Total time: 0.486597
267.96/268.31	Quasi-ranking function: 50000 - i2^0 - i3^0 - ii3^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.005171s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.405887s
267.96/268.31	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.490922s
267.96/268.31	Time used: 0.489653
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.472076s
267.96/268.31	Time used: 0.469358
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.987031s
267.96/268.31	Time used: 0.983311
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.980143s
267.96/268.31	Time used: 0.971705
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.387799s
267.96/268.31	Time used: 0.354561
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.170165s
267.96/268.31	Time used: 0.170145
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.557964s
267.96/268.31	Cost: 1; Total time: 0.524706
267.96/268.31	Quasi-ranking function: 50000 + i2^0 - i3^0 - ii3^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.005337s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.377340s
267.96/268.31	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.546764s
267.96/268.31	Time used: 0.545416
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.404033s
267.96/268.31	Time used: 0.401575
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.986680s
267.96/268.31	Time used: 0.982742
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.975520s
267.96/268.31	Time used: 0.967376
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.372357s
267.96/268.31	Time used: 0.337697
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.161969s
267.96/268.31	Time used: 0.161958
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.534326s
267.96/268.31	Cost: 1; Total time: 0.499655
267.96/268.31	Quasi-ranking function: 50000 - i3^0 - ii3^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.005465s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.349907s
267.96/268.31	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.114659s
267.96/268.31	Time used: 0.113449
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.900601s
267.96/268.31	Time used: 0.898594
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.974133s
267.96/268.31	Time used: 0.969715
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.975397s
267.96/268.31	Time used: 0.966792
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.350219s
267.96/268.31	Time used: 0.315458
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.195912s
267.96/268.31	Time used: 0.195892
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.546130s
267.96/268.31	Cost: 1; Total time: 0.51135
267.96/268.31	Quasi-ranking function: 50000 - 3*i3^0 + ii3^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.005819s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.375649s
267.96/268.31	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.466512s
267.96/268.31	Time used: 0.465321
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.496211s
267.96/268.31	Time used: 0.493841
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.987348s
267.96/268.31	Time used: 0.983335
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.977352s
267.96/268.31	Time used: 0.969025
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.482898s
267.96/268.31	Time used: 0.45055
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.316001s
267.96/268.31	Time used: 0.315992
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.798898s
267.96/268.31	Cost: 1; Total time: 0.766542
267.96/268.31	Quasi-ranking function: 50000 + i3^0 - ii3^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.005911s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.119554s
267.96/268.31	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.569829s
267.96/268.31	Time used: 0.568614
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.404523s
267.96/268.31	Time used: 0.402419
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.986787s
267.96/268.31	Time used: 0.98309
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.984126s
267.96/268.31	Time used: 0.967645
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.351227s
267.96/268.31	Time used: 0.318282
267.96/268.31	Improving Solution with cost 1 ...
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetNextSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.185804s
267.96/268.31	Time used: 0.185787
267.96/268.31	
267.96/268.31	LOG: SAT solveNonLinear - Elapsed time: 0.537032s
267.96/268.31	Cost: 1; Total time: 0.504069
267.96/268.31	Quasi-ranking function: 50000 - i2^0 + i3^0 - ii3^0
267.96/268.31	New Graphs: 
267.96/268.31	Transitions:
267.96/268.31	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Variables:
267.96/268.31	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.31	Checking conditional termination of SCC {l10}...
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.006100s
267.96/268.31	
267.96/268.31	LOG: CALL solveLinear
267.96/268.31	
267.96/268.31	LOG: RETURN solveLinear - Elapsed time: 0.227462s
267.96/268.31	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.130945s
267.96/268.31	Time used: 0.129664
267.96/268.31	Solving with 1 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.001794s
267.96/268.31	Time used: 0.999773
267.96/268.31	Solving with 2 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.31	
267.96/268.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.974838s
267.96/268.31	Time used: 0.970259
267.96/268.31	Solving with 3 template(s).
267.96/268.31	
267.96/268.31	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.974531s
267.96/268.32	Time used: 0.966167
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.404163s
267.96/268.32	Time used: 0.371784
267.96/268.32	Improving Solution with cost 1 ...
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetNextSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.178523s
267.96/268.32	Time used: 0.178505
267.96/268.32	
267.96/268.32	LOG: SAT solveNonLinear - Elapsed time: 0.582686s
267.96/268.32	Cost: 1; Total time: 0.550289
267.96/268.32	Termination implied by a set of invariant(s):
267.96/268.32	Invariant at l10: i1^0 <= 1 + nn1^0
267.96/268.32	[ Invariant Graph ]
267.96/268.32	Strengthening and disabling transitions...
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l20, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0, {i3^0 -> 1 + i3^0, ii3^0 -> 2 + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ 2 <= i3^0 /\ i2^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ 2 <= i2^0 /\ 2 <= i3^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= 0 /\ i2^0 <= nn2^0 /\ 2 <= i3^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ i3^0 <= 0 /\ i2^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ i3^0 <= 0 /\ 2 <= i2^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= 0 /\ i2^0 <= nn2^0 /\ i3^0 <= 0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ i2^0 = 1 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ 2 <= i2^0 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> undef299, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= 0 /\ i2^0 <= nn2^0 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> undef299, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	[ Termination Graph ]
267.96/268.32	Strengthening and disabling transitions...
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Quasi-ranking function: 50000 + i2^0 + i3^0 - ii3^0
267.96/268.32	New Graphs: 
267.96/268.32	Transitions:
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Variables:
267.96/268.32	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.32	Checking conditional termination of SCC {l10}...
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.005683s
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.223423s
267.96/268.32	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.522284s
267.96/268.32	Time used: 0.520979
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.447150s
267.96/268.32	Time used: 0.445003
267.96/268.32	Solving with 2 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.986292s
267.96/268.32	Time used: 0.982373
267.96/268.32	Solving with 3 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.975310s
267.96/268.32	Time used: 0.967177
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.373532s
267.96/268.32	Time used: 0.339197
267.96/268.32	Improving Solution with cost 1 ...
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetNextSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.163236s
267.96/268.32	Time used: 0.163217
267.96/268.32	
267.96/268.32	LOG: SAT solveNonLinear - Elapsed time: 0.536769s
267.96/268.32	Cost: 1; Total time: 0.502414
267.96/268.32	Quasi-ranking function: 50000 - i2^0 - ii3^0
267.96/268.32	New Graphs: 
267.96/268.32	Transitions:
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Variables:
267.96/268.32	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.32	Checking conditional termination of SCC {l10}...
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.005808s
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.030067s
267.96/268.32	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.345085s
267.96/268.32	Time used: 0.344041
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.986224s
267.96/268.32	Time used: 0.983392
267.96/268.32	Solving with 2 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.972715s
267.96/268.32	Time used: 0.968418
267.96/268.32	Solving with 3 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.974047s
267.96/268.32	Time used: 0.965751
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.405778s
267.96/268.32	Time used: 0.370856
267.96/268.32	Improving Solution with cost 1 ...
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetNextSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.232448s
267.96/268.32	Time used: 0.232425
267.96/268.32	
267.96/268.32	LOG: SAT solveNonLinear - Elapsed time: 0.638225s
267.96/268.32	Cost: 1; Total time: 0.603281
267.96/268.32	Quasi-ranking function: 50000 + i2^0 - ii3^0
267.96/268.32	New Graphs: 
267.96/268.32	Transitions:
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Variables:
267.96/268.32	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.32	Checking conditional termination of SCC {l10}...
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.005861s
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.273669s
267.96/268.32	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.539098s
267.96/268.32	Time used: 0.5376
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.435017s
267.96/268.32	Time used: 0.432656
267.96/268.32	Solving with 2 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.986960s
267.96/268.32	Time used: 0.983019
267.96/268.32	Solving with 3 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.975517s
267.96/268.32	Time used: 0.96734
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.338574s
267.96/268.32	Time used: 0.304983
267.96/268.32	Improving Solution with cost 1 ...
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetNextSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.229428s
267.96/268.32	Time used: 0.229409
267.96/268.32	
267.96/268.32	LOG: SAT solveNonLinear - Elapsed time: 0.568002s
267.96/268.32	Cost: 1; Total time: 0.534392
267.96/268.32	Termination implied by a set of invariant(s):
267.96/268.32	Invariant at l20: i1^0 <= nn1^0
267.96/268.32	[ Invariant Graph ]
267.96/268.32	Strengthening and disabling transitions...
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l20, l20, 1 + i1^0 <= nn1^0 /\ i1^0 = 0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l20, l20, 1 + i1^0 <= nn1^0 /\ 1 <= i1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l20, l20, 1 + i1^0 <= 0 /\ 1 + i1^0 <= nn1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l20, l10, i1^0 <= nn1^0, {all remain the same}>
267.96/268.32	[ Termination Graph ]
267.96/268.32	Strengthening and disabling transitions...
267.96/268.32	Quasi-ranking function: 50000 - ii3^0
267.96/268.32	New Graphs: 
267.96/268.32	Transitions:
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 <= ii3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Variables:
267.96/268.32	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.32	Checking conditional termination of SCC {l10}...
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.005958s
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.378425s
267.96/268.32	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 <= ii3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.573246s
267.96/268.32	Time used: 0.571255
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.321828s
267.96/268.32	Time used: 0.319428
267.96/268.32	Solving with 2 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.986313s
267.96/268.32	Time used: 0.982724
267.96/268.32	Solving with 3 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.982464s
267.96/268.32	Time used: 0.966524
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.387658s
267.96/268.32	Time used: 0.352109
267.96/268.32	Improving Solution with cost 1 ...
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetNextSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.175497s
267.96/268.32	Time used: 0.175479
267.96/268.32	
267.96/268.32	LOG: SAT solveNonLinear - Elapsed time: 0.563155s
267.96/268.32	Cost: 1; Total time: 0.527588
267.96/268.32	Termination implied by a set of invariant(s):
267.96/268.32	Invariant at l10: i1^0 <= 1 + nn1^0
267.96/268.32	Invariant at l20: i1^0 <= nn1^0
267.96/268.32	[ Invariant Graph ]
267.96/268.32	Strengthening and disabling transitions...
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l20, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0, {i3^0 -> 1 + i3^0, ii3^0 -> 2 + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ 2 <= i3^0 /\ i2^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ 2 <= i2^0 /\ 2 <= i3^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= 0 /\ i2^0 <= nn2^0 /\ 2 <= i3^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ i3^0 <= 0 /\ i2^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ i3^0 <= 0 /\ 2 <= i2^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= 0 /\ i2^0 <= nn2^0 /\ i3^0 <= 0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ i2^0 = 1 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ 2 <= i2^0 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> undef299, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= 0 /\ i2^0 <= nn2^0 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> undef299, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l20, l20, 1 + i1^0 <= nn1^0 /\ i1^0 = 0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l20, l20, 1 + i1^0 <= nn1^0 /\ 1 <= i1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l20, l20, 1 + i1^0 <= 0 /\ 1 + i1^0 <= nn1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l20, l10, i1^0 <= nn1^0, {all remain the same}>
267.96/268.32	[ Termination Graph ]
267.96/268.32	Strengthening and disabling transitions...
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 <= ii3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Quasi-ranking function: 50000 - i2^0 - ii3^0 - nn2^0
267.96/268.32	New Graphs: 
267.96/268.32	Transitions:
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 <= ii3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Variables:
267.96/268.32	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.32	Checking conditional termination of SCC {l10}...
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.006056s
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.251285s
267.96/268.32	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 <= ii3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.548503s
267.96/268.32	Time used: 0.546909
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.342297s
267.96/268.32	Time used: 0.340042
267.96/268.32	Solving with 2 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.985994s
267.96/268.32	Time used: 0.982065
267.96/268.32	Solving with 3 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.973837s
267.96/268.32	Time used: 0.965649
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.396206s
267.96/268.32	Time used: 0.360394
267.96/268.32	Improving Solution with cost 1 ...
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetNextSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.148622s
267.96/268.32	Time used: 0.148602
267.96/268.32	
267.96/268.32	LOG: SAT solveNonLinear - Elapsed time: 0.544828s
267.96/268.32	Cost: 1; Total time: 0.508996
267.96/268.32	Quasi-ranking function: 50000 - i2^0 - ii3^0 + nn2^0
267.96/268.32	New Graphs: 
267.96/268.32	Transitions:
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 <= ii3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Variables:
267.96/268.32	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.32	Checking conditional termination of SCC {l10}...
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.005861s
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.356406s
267.96/268.32	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 <= ii3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.432692s
267.96/268.32	Time used: 0.431176
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.543448s
267.96/268.32	Time used: 0.540605
267.96/268.32	Solving with 2 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004563s
267.96/268.32	Time used: 1.00067
267.96/268.32	Solving with 3 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.955276s
267.96/268.32	Time used: 0.945809
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.399902s
267.96/268.32	Time used: 0.363538
267.96/268.32	Improving Solution with cost 1 ...
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetNextSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.172571s
267.96/268.32	Time used: 0.172555
267.96/268.32	
267.96/268.32	LOG: SAT solveNonLinear - Elapsed time: 0.572473s
267.96/268.32	Cost: 1; Total time: 0.536093
267.96/268.32	Termination implied by a set of invariant(s):
267.96/268.32	Invariant at l10: i1^0 <= 1 + nn1^0
267.96/268.32	Invariant at l20: i1^0 <= 1 + nn1^0
267.96/268.32	[ Invariant Graph ]
267.96/268.32	Strengthening and disabling transitions...
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l20, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0, {i3^0 -> 1 + i3^0, ii3^0 -> 2 + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ 2 <= i3^0 /\ i2^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ 2 <= i2^0 /\ 2 <= i3^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= 0 /\ i2^0 <= nn2^0 /\ 2 <= i3^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ i3^0 <= 0 /\ i2^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ i3^0 <= 0 /\ 2 <= i2^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= 0 /\ i2^0 <= nn2^0 /\ i3^0 <= 0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ i2^0 = 1 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= nn2^0 /\ 2 <= i2^0 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> undef299, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ i2^0 <= 0 /\ i2^0 <= nn2^0 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> undef299, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l20, l20, 1 + i1^0 <= nn1^0 /\ i1^0 = 0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l20, l20, 1 + i1^0 <= nn1^0 /\ 1 <= i1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l20, l20, 1 + i1^0 <= 0 /\ 1 + i1^0 <= nn1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l20, l10, i1^0 <= nn1^0, {all remain the same}>
267.96/268.32	[ Termination Graph ]
267.96/268.32	Strengthening and disabling transitions...
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 <= ii3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Quasi-ranking function: 50000 + i2^0 - ii3^0 + nn2^0
267.96/268.32	New Graphs: 
267.96/268.32	Transitions:
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 /\ 50001 + i2^0 + nn2^0 <= ii3^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 <= ii3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Variables:
267.96/268.32	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.32	Checking conditional termination of SCC {l10}...
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.006028s
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.176904s
267.96/268.32	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 /\ 50001 + i2^0 + nn2^0 <= ii3^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 <= ii3^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.645114s
267.96/268.32	Time used: 0.634741
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.331143s
267.96/268.32	Time used: 0.328459
267.96/268.32	Solving with 2 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.985386s
267.96/268.32	Time used: 0.981176
267.96/268.32	Solving with 3 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.972967s
267.96/268.32	Time used: 0.964605
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.425270s
267.96/268.32	Time used: 0.389798
267.96/268.32	Improving Solution with cost 1 ...
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetNextSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.204734s
267.96/268.32	Time used: 0.204717
267.96/268.32	
267.96/268.32	LOG: SAT solveNonLinear - Elapsed time: 0.630004s
267.96/268.32	Cost: 1; Total time: 0.594515
267.96/268.32	Quasi-ranking function: 50000 - ii3^0 - nn2^0
267.96/268.32	New Graphs: 
267.96/268.32	Transitions:
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 /\ 50001 + i2^0 + nn2^0 <= ii3^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 <= ii3^0 /\ 50001 <= ii3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Variables:
267.96/268.32	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.32	Checking conditional termination of SCC {l10}...
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.006081s
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.468327s
267.96/268.32	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 /\ 50001 + i2^0 + nn2^0 <= ii3^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 <= ii3^0 /\ 50001 <= ii3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.496438s
267.96/268.32	Time used: 0.494591
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.283752s
267.96/268.32	Time used: 0.280859
267.96/268.32	Solving with 2 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.985597s
267.96/268.32	Time used: 0.981877
267.96/268.32	Solving with 3 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.974587s
267.96/268.32	Time used: 0.966556
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.418761s
267.96/268.32	Time used: 0.384783
267.96/268.32	Improving Solution with cost 1 ...
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetNextSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.277707s
267.96/268.32	Time used: 0.277687
267.96/268.32	
267.96/268.32	LOG: SAT solveNonLinear - Elapsed time: 0.696468s
267.96/268.32	Cost: 1; Total time: 0.66247
267.96/268.32	Termination implied by a set of invariant(s):
267.96/268.32	Invariant at l20: i1^0 <= nn1^0
267.96/268.32	[ Invariant Graph ]
267.96/268.32	Strengthening and disabling transitions...
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l20, l20, 1 + i1^0 <= nn1^0 /\ i1^0 = 0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l20, l20, 1 + i1^0 <= nn1^0 /\ 1 <= i1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l20, l20, 1 + i1^0 <= 0 /\ 1 + i1^0 <= nn1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL solverLinear in Graph for feasibility
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear in Graph for feasibility
267.96/268.32	Strengthening transition (result): 
267.96/268.32	<l20, l10, i1^0 <= nn1^0, {all remain the same}>
267.96/268.32	[ Termination Graph ]
267.96/268.32	Strengthening and disabling transitions...
267.96/268.32	Quasi-ranking function: 50000 - ii3^0 + nn2^0
267.96/268.32	New Graphs: 
267.96/268.32	Transitions:
267.96/268.32	<l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 /\ 50001 + i2^0 + nn2^0 <= ii3^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 <= ii3^0 /\ 50001 + nn2^0 <= ii3^0 /\ 50001 <= ii3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Variables:
267.96/268.32	i2^0, i3^0, ii3^0, nn2^0, wr^0
267.96/268.32	Checking conditional termination of SCC {l10}...
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.006157s
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.060621s
267.96/268.32	Trying to remove transition: <l10, l10, i1^0 <= nn1^0 /\ 1 + nn2^0 <= i2^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 /\ 50001 + i2^0 + i3^0 <= ii3^0 + nn2^0 /\ 50001 + i2^0 <= i3^0 /\ 50001 + i2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 + ii3^0 /\ 50001 + i2^0 + nn2^0 <= i3^0 /\ 50001 + i2^0 + 2*i3^0 + nn2^0 <= 2*ii3^0 /\ 50001 + i2^0 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + i2^0 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 + i2^0 <= ii3^0 /\ 50001 + i2^0 + nn2^0 <= ii3^0 /\ 50001 + i2^0 <= ii3^0 + nn2^0 /\ 50001 + i3^0 <= i2^0 + ii3^0 /\ 50001 + i3^0 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 + ii3^0 /\ 50001 <= i2^0 + i3^0 + ii3^0 + nn2^0 /\ 50001 + nn2^0 <= i2^0 + i3^0 /\ 50001 <= i2^0 + i3^0 + nn2^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= i2^0 + 3*i3^0 /\ 50001 + ii3^0 <= i2^0 + 3*i3^0 + nn2^0 /\ 50001 + 9*i3^0 <= i2^0 + 5*ii3^0 + nn2^0 /\ 50001 <= i2^0 + ii3^0 /\ 50001 + nn2^0 <= i2^0 + ii3^0 /\ 50001 <= i2^0 + ii3^0 + nn2^0 /\ 50001 + 2*i2^0 <= i3^0 + 2*nn2^0 /\ 50001 + 2*i2^0 + 2*ii3^0 <= 5*i3^0 /\ 50001 + 75004*i2^0 <= i3^0 + ii3^0 + nn2^0 /\ 50001 + i3^0 <= ii3^0 /\ 50001 + i3^0 + nn2^0 <= ii3^0 /\ 50001 + i3^0 <= ii3^0 + nn2^0 /\ 50001 <= i3^0 /\ 50001 <= i3^0 + ii3^0 /\ 50001 + nn2^0 <= i3^0 + ii3^0 /\ 50001 <= i3^0 + ii3^0 + nn2^0 /\ 50001 <= i3^0 + nn2^0 /\ 50001 + 100004*nn2^0 <= i3^0 /\ 50001 + ii3^0 <= 3*i3^0 /\ 50001 + ii3^0 + nn2^0 <= 3*i3^0 /\ 50001 + ii3^0 <= 3*i3^0 + nn2^0 /\ 50001 <= ii3^0 /\ 50001 + nn2^0 <= ii3^0 /\ 50001 <= ii3^0 + nn2^0, {i3^0 -> ((0 + 1) + 0) + i3^0, ii3^0 -> ((0 + 2) + 0) + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.152430s
267.96/268.32	Time used: 0.151209
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.944387s
267.96/268.32	Time used: 0.942046
267.96/268.32	Solving with 2 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.971758s
267.96/268.32	Time used: 0.967641
267.96/268.32	Solving with 3 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.982854s
267.96/268.32	Time used: 0.965739
267.96/268.32	Solving with 1 template(s).
267.96/268.32	
267.96/268.32	LOG: CALL solveNonLinearGetFirstSolution
267.96/268.32	
267.96/268.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.536216s
267.96/268.32	Time used: 0.503775
267.96/268.32	Termination failed. Trying to show unreachability...
267.96/268.32	Proving unreachability of entry: <l0, l20, i1^0 <= nn1^0 /\ 2 <= isign^0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	LOG: CALL check - Post:1 <= 0 - Process 1
267.96/268.32	* Exit transition: <l0, l20, i1^0 <= nn1^0 /\ 2 <= isign^0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	* Postcondition  : 1 <= 0
267.96/268.32	
267.96/268.32	LOG: CALL solveLinear
267.96/268.32	
267.96/268.32	LOG: RETURN solveLinear - Elapsed time: 0.014943s
267.96/268.32	> Postcondition is not implied!
267.96/268.32	
267.96/268.32	LOG: RETURN check - Elapsed time: 0.015075s
267.96/268.32	Cannot prove unreachability
267.96/268.32	
267.96/268.32	Proving non-termination of subgraph 2
267.96/268.32	Transitions:
267.96/268.32	<l10, l20, 1 + nn2^0 <= i2^0, {i3^0 -> 1 + i3^0, ii3^0 -> 2 + ii3^0, wr^0 -> undef483, rest remain the same}>
267.96/268.32	<l10, l10, i2^0 <= nn2^0 /\ 2 <= i3^0 /\ i2^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.32	<l10, l10, i2^0 <= nn2^0 /\ 2 <= i2^0 /\ 2 <= i3^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.32	<l10, l10, i2^0 <= 0 /\ i2^0 <= nn2^0 /\ 2 <= i3^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.32	<l10, l10, i2^0 <= nn2^0 /\ i3^0 <= 0 /\ i2^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.32	<l10, l10, i2^0 <= nn2^0 /\ i3^0 <= 0 /\ 2 <= i2^0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.32	<l10, l10, i2^0 <= 0 /\ i2^0 <= nn2^0 /\ i3^0 <= 0, {i2^0 -> 1 + i2^0, j2^0 -> 2 - i2^0 + nn2^0, rest remain the same}>
267.96/268.32	<l10, l10, i2^0 <= nn2^0 /\ i2^0 = 1 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> 1, rest remain the same}>
267.96/268.32	<l10, l10, i2^0 <= nn2^0 /\ 2 <= i2^0 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> undef299, rest remain the same}>
267.96/268.32	<l10, l10, i2^0 <= 0 /\ i2^0 <= nn2^0 /\ i3^0 = 1, {i2^0 -> 1 + i2^0, j2^0 -> undef299, rest remain the same}>
267.96/268.32	<l20, l20, 1 + i1^0 <= nn1^0 /\ i1^0 = 0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.32	<l20, l20, 1 + i1^0 <= nn1^0 /\ 1 <= i1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.32	<l20, l20, 1 + i1^0 <= 0 /\ 1 + i1^0 <= nn1^0, {i1^0 -> 1 + i1^0, wr^0 -> 1, rest remain the same}>
267.96/268.32	<l20, l10, true, {all remain the same}>
267.96/268.32	Variables:
267.96/268.32	i2^0, i3^0, ii3^0, nn2^0, wr^0, j2^0, i1^0, nn1^0
267.96/268.32	
267.96/268.32	Checking conditional non-termination of SCC {l10, l20}...
267.96/268.32	> No exit transition to close.
267.96/268.32	Calling reachability with...
267.96/268.32	Transition: <l20, end, true, {all remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l20, end, true, {all remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l20, end, true, {all remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l20, end, true, {all remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l20, end, true, {all remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l20, end, true, {all remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	OPEN EXITS: 
267.96/268.32	<l20, end, true, {all remain the same}>
267.96/268.32	<l20, end, true, {all remain the same}>
267.96/268.32	<l20, end, true, {all remain the same}>
267.96/268.32	<l20, end, true, {all remain the same}>
267.96/268.32	<l20, end, true, {all remain the same}>
267.96/268.32	<l20, end, true, {all remain the same}>
267.96/268.32	
267.96/268.32	--- Reachability graph ---
267.96/268.32	> Graph without transitions.
267.96/268.32	
267.96/268.32	Calling reachability with...
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ 2 <= isign^0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ 2 <= i1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ 2 <= i1^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ isign^0 <= 0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ 2 <= isign^0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ 2 <= i1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ 2 <= i1^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ isign^0 <= 0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ 2 <= isign^0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ 2 <= i1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ 2 <= i1^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ isign^0 <= 0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ 2 <= isign^0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ 2 <= i1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ 2 <= i1^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ isign^0 <= 0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ 2 <= isign^0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ 2 <= i1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ 2 <= i1^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ isign^0 <= 0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ 2 <= isign^0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ 2 <= i1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ 2 <= i1^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	Transition: <l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ isign^0 <= 0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	Conditions: 
267.96/268.32	OPEN EXITS: 
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ 2 <= isign^0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ 2 <= i1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ 2 <= i1^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ isign^0 <= 0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ 2 <= isign^0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ 2 <= i1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ 2 <= i1^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ isign^0 <= 0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ 2 <= isign^0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ 2 <= i1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ 2 <= i1^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ isign^0 <= 0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ 2 <= isign^0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ 2 <= i1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ 2 <= i1^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ isign^0 <= 0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ 2 <= isign^0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ 2 <= i1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ 2 <= i1^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ isign^0 <= 0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ 2 <= isign^0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ 2 <= i1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ 2 <= isign^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ i1^0 = 1, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= nn1^0 /\ isign^0 <= 0 /\ 2 <= i1^0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	<l0, l20, i1^0 <= 0 /\ i1^0 <= nn1^0 /\ isign^0 <= 0, {wr^0 -> 1, rest remain the same}>
267.96/268.32	
267.96/268.32	> Conditions are reachable!
267.96/268.32	
267.96/268.32	Program does NOT terminate
267.96/268.32	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
267.96/268.32	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
267.96/268.32	EOF