37.30/37.37	NO
37.30/37.37	
37.30/37.37	Solver Timeout: 4
37.30/37.37	Global Timeout: 300
37.30/37.37	No parsing errors!
37.30/37.37	Init Location: 0
37.30/37.37	Transitions:
37.30/37.37	<l0, l9, true>
37.30/37.37	<l1, l2, (undef1 > 3) /\ (undef2 > 3) /\ (undef4 > 3) /\ (undef3 > 3), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4}>
37.30/37.37	<l2, l2, ((undef5 + 1) <= arg2) /\ (undef6 <= arg1) /\ (undef6 <= arg3) /\ (undef6 <= arg4) /\ (arg2 >= (undef7 + 1)) /\ (arg2 >= (undef8 + 1)) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (arg4 > 0) /\ (undef5 > ~(1)) /\ (undef6 > 0) /\ (undef7 > ~(1)) /\ (undef8 > ~(1)), par{arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8}>
37.30/37.37	<l1, l3, (undef9 > 3) /\ (undef11 > ~(1)) /\ (undef10 > 4), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}>
37.30/37.37	<l3, l3, (undef14 <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef13 > 0) /\ (undef14 > 0) /\ (undef15 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16}>
37.30/37.37	<l1, l4, (undef18 > 1) /\ (undef17 > 3), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}>
37.30/37.37	<l4, l4, ((undef21 + 2) <= arg1) /\ (undef21 <= arg2) /\ ((undef22 + 3) <= arg1) /\ ((undef22 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef21 > 0) /\ (undef22 > ~(1)), par{arg1 -> undef21, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24}>
37.30/37.37	<l1, l5, (undef26 > 1) /\ (undef25 > 3), par{arg1 -> undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28}>
37.30/37.37	<l5, l5, ((undef29 + 2) <= arg1) /\ (undef29 <= arg2) /\ ((undef30 + 3) <= arg1) /\ ((undef30 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef29 > 0) /\ (undef30 > ~(1)), par{arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> undef32}>
37.30/37.37	<l1, l6, (undef34 > 1) /\ (undef33 > 3), par{arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36}>
37.30/37.37	<l6, l6, ((undef37 + 2) <= arg1) /\ (undef37 <= arg2) /\ ((undef38 + 3) <= arg1) /\ ((undef38 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef37 > 0) /\ (undef38 > ~(1)), par{arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40}>
37.30/37.37	<l6, l3, ((undef41 + 1) <= arg1) /\ ((undef41 - 1) <= arg2) /\ ((undef42 + 1) <= arg1) /\ ((undef42 - 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef41 > 1) /\ (undef42 > 1) /\ (undef43 > ~(1)), par{arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44}>
37.30/37.37	<l6, l7, (arg1 > 2) /\ (arg2 > 0) /\ (undef45 > 4), par{arg1 -> undef45, arg2 -> undef46, arg3 -> undef47, arg4 -> undef48}>
37.30/37.37	<l6, l7, (arg1 > 2) /\ (arg2 > 0) /\ (undef49 > 2), par{arg1 -> undef49, arg2 -> undef50, arg3 -> undef51, arg4 -> undef52}>
37.30/37.37	<l8, l7, (undef53 <= arg1) /\ (arg1 > 2) /\ (undef53 > 2) /\ ((arg2 + 4) <= arg1), par{arg1 -> undef53, arg2 -> undef54, arg3 -> undef55, arg4 -> undef56}>
37.30/37.37	<l7, l3, (undef57 <= arg1) /\ ((undef58 + 1) <= arg1) /\ (arg1 > 2) /\ (undef57 > 2) /\ (undef58 > 1) /\ (undef59 > ~(1)), par{arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60}>
37.30/37.37	<l9, l1, true, par{arg1 -> undef61, arg2 -> undef62, arg3 -> undef63, arg4 -> undef64}>
37.30/37.37	
37.30/37.37	Fresh variables:
37.30/37.37	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, 
37.30/37.37	
37.30/37.37	Undef variables:
37.30/37.37	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, 
37.30/37.37	
37.30/37.37	Abstraction variables:
37.30/37.37	
37.30/37.37	Exit nodes:
37.30/37.37	
37.30/37.37	Accepting locations:
37.30/37.37	
37.30/37.37	Asserts:
37.30/37.37	
37.30/37.37	Preprocessed LLVMGraph
37.30/37.37	Init Location: 0
37.30/37.37	Transitions:
37.30/37.37	<l0, l2, (undef1 > 3) /\ (undef2 > 3) /\ (undef4 > 3) /\ (undef3 > 3), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4}>
37.30/37.37	<l0, l3, (undef9 > 3) /\ (undef11 > ~(1)) /\ (undef10 > 4), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}>
37.30/37.37	<l0, l4, (undef18 > 1) /\ (undef17 > 3), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}>
37.30/37.37	<l0, l5, (undef26 > 1) /\ (undef25 > 3), par{arg1 -> undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28}>
37.30/37.37	<l0, l6, (undef34 > 1) /\ (undef33 > 3), par{arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36}>
37.30/37.37	<l2, l2, ((undef5 + 1) <= arg2) /\ (undef6 <= arg1) /\ (undef6 <= arg3) /\ (undef6 <= arg4) /\ (arg2 >= (undef7 + 1)) /\ (arg2 >= (undef8 + 1)) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (arg4 > 0) /\ (undef5 > ~(1)) /\ (undef6 > 0) /\ (undef7 > ~(1)) /\ (undef8 > ~(1)), par{arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8}>
37.30/37.37	<l3, l3, (undef14 <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef13 > 0) /\ (undef14 > 0) /\ (undef15 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16}>
37.30/37.37	<l4, l4, ((undef21 + 2) <= arg1) /\ (undef21 <= arg2) /\ ((undef22 + 3) <= arg1) /\ ((undef22 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef21 > 0) /\ (undef22 > ~(1)), par{arg1 -> undef21, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24}>
37.30/37.37	<l5, l5, ((undef29 + 2) <= arg1) /\ (undef29 <= arg2) /\ ((undef30 + 3) <= arg1) /\ ((undef30 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef29 > 0) /\ (undef30 > ~(1)), par{arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> undef32}>
37.30/37.37	<l6, l6, ((undef37 + 2) <= arg1) /\ (undef37 <= arg2) /\ ((undef38 + 3) <= arg1) /\ ((undef38 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef37 > 0) /\ (undef38 > ~(1)), par{arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40}>
37.30/37.37	<l6, l3, ((undef41 + 1) <= arg1) /\ ((undef41 - 1) <= arg2) /\ ((undef42 + 1) <= arg1) /\ ((undef42 - 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef41 > 1) /\ (undef42 > 1) /\ (undef43 > ~(1)), par{arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44}>
37.30/37.37	<l6, l3, (arg1 > 2) /\ (arg2 > 0) /\ (undef45 > 4) /\ (undef57 <= undef45) /\ ((undef58 + 1) <= undef45) /\ (undef45 > 2) /\ (undef57 > 2) /\ (undef58 > 1) /\ (undef59 > ~(1)), par{arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60}>
37.30/37.37	<l6, l3, (arg1 > 2) /\ (arg2 > 0) /\ (undef49 > 2) /\ (undef57 <= undef49) /\ ((undef58 + 1) <= undef49) /\ (undef49 > 2) /\ (undef57 > 2) /\ (undef58 > 1) /\ (undef59 > ~(1)), par{arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60}>
37.30/37.37	
37.30/37.37	Fresh variables:
37.30/37.37	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, 
37.30/37.37	
37.30/37.37	Undef variables:
37.30/37.37	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, 
37.30/37.37	
37.30/37.37	Abstraction variables:
37.30/37.37	
37.30/37.37	Exit nodes:
37.30/37.37	
37.30/37.37	Accepting locations:
37.30/37.37	
37.30/37.37	Asserts:
37.30/37.37	
37.30/37.37	*************************************************************
37.30/37.37	*******************************************************************************************
37.30/37.37	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
37.30/37.37	*******************************************************************************************
37.30/37.37	
37.30/37.37	Init Location: 0
37.30/37.37	Graph 0:
37.30/37.37	Transitions:
37.30/37.37	Variables:
37.30/37.37	
37.30/37.37	Graph 1:
37.30/37.37	Transitions:
37.30/37.37	<l6, l6, 3 <= arg1 /\ 3 + undef38 <= arg1 /\ 1 <= arg2 /\ 1 + undef38 <= arg2 /\ 1 <= undef37 /\ undef37 <= arg2 /\ 0 <= undef38 /\ 2 + undef37 <= arg1, {arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}>
37.30/37.37	Variables:
37.30/37.37	arg1, arg2, arg3, arg4
37.30/37.37	
37.30/37.37	Graph 2:
37.30/37.37	Transitions:
37.30/37.37	<l5, l5, 3 <= arg1 /\ 3 + undef30 <= arg1 /\ 1 <= arg2 /\ 1 + undef30 <= arg2 /\ 1 <= undef29 /\ undef29 <= arg2 /\ 0 <= undef30 /\ 2 + undef29 <= arg1, {arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> undef32, rest remain the same}>
37.30/37.37	Variables:
37.30/37.37	arg1, arg2, arg3, arg4
37.30/37.37	
37.30/37.37	Graph 3:
37.30/37.37	Transitions:
37.30/37.37	<l4, l4, 3 <= arg1 /\ 3 + undef22 <= arg1 /\ 1 <= arg2 /\ 1 + undef22 <= arg2 /\ 1 <= undef21 /\ undef21 <= arg2 /\ 0 <= undef22 /\ 2 + undef21 <= arg1, {arg1 -> undef21, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24, rest remain the same}>
37.30/37.37	Variables:
37.30/37.37	arg1, arg2, arg3, arg4
37.30/37.37	
37.30/37.37	Graph 4:
37.30/37.37	Transitions:
37.30/37.37	<l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef13 /\ 1 <= undef14 /\ undef14 <= arg2 /\ 0 <= undef15, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	Variables:
37.30/37.37	arg1, arg2, arg3, arg4
37.30/37.37	
37.30/37.37	Graph 5:
37.30/37.37	Transitions:
37.30/37.37	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef5 <= arg2 /\ 1 + undef7 <= arg2 /\ 1 + undef8 <= arg2 /\ 1 <= arg3 /\ 1 <= arg4 /\ 1 <= undef6 /\ undef6 <= arg1 /\ undef6 <= arg3 /\ undef6 <= arg4 /\ 0 <= undef5 /\ 0 <= undef7 /\ 0 <= undef8, {arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}>
37.30/37.37	Variables:
37.30/37.37	arg1, arg2, arg3, arg4
37.30/37.37	
37.30/37.37	Precedence: 
37.30/37.37	Graph 0
37.30/37.37	
37.30/37.37	Graph 1
37.30/37.37	<l0, l6, 4 <= undef33 /\ 2 <= undef34, {arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}>
37.30/37.37	
37.30/37.37	Graph 2
37.30/37.37	<l0, l5, 4 <= undef25 /\ 2 <= undef26, {arg1 -> undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28, rest remain the same}>
37.30/37.37	
37.30/37.37	Graph 3
37.30/37.37	<l0, l4, 4 <= undef17 /\ 2 <= undef18, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
37.30/37.37	
37.30/37.37	Graph 4
37.30/37.37	<l0, l3, 0 <= undef11 /\ 4 <= undef9 /\ 5 <= undef10, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
37.30/37.37	<l6, l3, 3 <= arg1 /\ 1 + undef41 <= arg1 /\ 1 + undef42 <= arg1 /\ 1 <= arg2 /\ 0 <= undef43 /\ undef41 <= 1 + arg2 /\ undef42 <= 1 + arg2 /\ 2 <= undef41 /\ 2 <= undef42, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
37.30/37.37	<l6, l3, 3 <= arg1 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef58 <= undef45 /\ undef57 <= undef45 /\ 0 <= undef59 /\ 2 <= undef58 /\ 5 <= undef45, {arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}>
37.30/37.37	<l6, l3, 3 <= arg1 /\ 3 <= undef49 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef58 <= undef49 /\ undef57 <= undef49 /\ 0 <= undef59 /\ 2 <= undef58, {arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}>
37.30/37.37	
37.30/37.37	Graph 5
37.30/37.37	<l0, l2, 4 <= undef1 /\ 4 <= undef2 /\ 4 <= undef3 /\ 4 <= undef4, {arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4, rest remain the same}>
37.30/37.37	
37.30/37.37	Map Locations to Subgraph:
37.30/37.37	( 0 , 0 )
37.30/37.37	( 2 , 5 )
37.30/37.37	( 3 , 4 )
37.30/37.37	( 4 , 3 )
37.30/37.37	( 5 , 2 )
37.30/37.37	( 6 , 1 )
37.30/37.37	
37.30/37.37	*******************************************************************************************
37.30/37.37	********************************    CHECKING ASSERTIONS    ********************************
37.30/37.37	*******************************************************************************************
37.30/37.37	
37.30/37.37	Proving termination of subgraph 0
37.30/37.37	Proving termination of subgraph 1
37.30/37.37	Checking unfeasibility...
37.30/37.37	Time used: 0.003719
37.30/37.37	
37.30/37.37	Checking conditional termination of SCC {l6}...
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.001497s
37.30/37.37	Ranking function: (~(4) / 3) + (1 / 3)*arg1 + (1 / 3)*arg2
37.30/37.37	New Graphs: 
37.30/37.37	Proving termination of subgraph 2
37.30/37.37	Checking unfeasibility...
37.30/37.37	Time used: 0.003302
37.30/37.37	
37.30/37.37	Checking conditional termination of SCC {l5}...
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.001562s
37.30/37.37	Ranking function: (~(4) / 3) + (1 / 3)*arg1 + (1 / 3)*arg2
37.30/37.37	New Graphs: 
37.30/37.37	Proving termination of subgraph 3
37.30/37.37	Checking unfeasibility...
37.30/37.37	Time used: 0.003246
37.30/37.37	
37.30/37.37	Checking conditional termination of SCC {l4}...
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.001553s
37.30/37.37	Ranking function: (~(4) / 3) + (1 / 3)*arg1 + (1 / 3)*arg2
37.30/37.37	New Graphs: 
37.30/37.37	Proving termination of subgraph 4
37.30/37.37	Checking unfeasibility...
37.30/37.37	Time used: 0.005203
37.30/37.37	
37.30/37.37	Checking conditional termination of SCC {l3}...
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.001178s
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.005185s
37.30/37.37	Trying to remove transition: <l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef13 /\ 1 <= undef14 /\ undef14 <= arg2 /\ 0 <= undef15, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	Solving with 1 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014166s
37.30/37.37	Time used: 0.01388
37.30/37.37	Solving with 1 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028534s
37.30/37.37	Time used: 0.027801
37.30/37.37	Improving Solution with cost 4 ...
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetNextSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.036110s
37.30/37.37	Time used: 0.036102
37.30/37.37	
37.30/37.37	LOG: SAT solveNonLinear - Elapsed time: 0.064644s
37.30/37.37	Cost: 4; Total time: 0.063903
37.30/37.37	Failed at location 3: arg3 <= 0
37.30/37.37	Failed at location 3: arg3 <= 0
37.30/37.37	Failed at location 3: arg3 <= 0
37.30/37.37	Failed at location 3: arg3 <= 0
37.30/37.37	Before Improving: 
37.30/37.37	Quasi-invariant at l3: arg3 <= 0
37.30/37.37	Optimizing invariants...
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.004915s
37.30/37.37	Remaining time after improvement: 0.997657
37.30/37.37	Termination implied by a set of quasi-invariant(s):
37.30/37.37	Quasi-invariant at l3: arg3 <= 0
37.30/37.37	[ Invariant Graph ]
37.30/37.37	Strengthening and disabling transitions...
37.30/37.37	
37.30/37.37	LOG: CALL solverLinear in Graph for feasibility
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear in Graph for feasibility
37.30/37.37	It's unfeasible. Removing transition: 
37.30/37.37	<l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef13 /\ 1 <= undef14 /\ undef14 <= arg2 /\ 0 <= undef15, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	[ Termination Graph ]
37.30/37.37	Strengthening and disabling transitions...
37.30/37.37	> It's unfeasible. Removing transition: 
37.30/37.37	<l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef13 /\ 1 <= undef14 /\ undef14 <= arg2 /\ 0 <= undef15, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	New Graphs: 
37.30/37.37	Calling Safety with literal arg3 <= 0 and entry <l0, l3, 0 <= undef11 /\ 4 <= undef9 /\ 5 <= undef10, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
37.30/37.37	
37.30/37.37	LOG: CALL check - Post:arg3 <= 0 - Process 1
37.30/37.37	* Exit transition: <l0, l3, 0 <= undef11 /\ 4 <= undef9 /\ 5 <= undef10, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
37.30/37.37	* Postcondition  : arg3 <= 0
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.000684s
37.30/37.37	> Postcondition is not implied!
37.30/37.37	
37.30/37.37	LOG: RETURN check - Elapsed time: 0.000789s
37.30/37.37	Calling Safety with literal arg3 <= 0 and entry <l6, l3, 3 <= arg1 /\ 1 + undef41 <= arg1 /\ 1 + undef42 <= arg1 /\ 1 <= arg2 /\ 0 <= undef43 /\ undef41 <= 1 + arg2 /\ undef42 <= 1 + arg2 /\ 2 <= undef41 /\ 2 <= undef42, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
37.30/37.37	
37.30/37.37	LOG: CALL check - Post:arg3 <= 0 - Process 2
37.30/37.37	* Exit transition: <l6, l3, 3 <= arg1 /\ 1 + undef41 <= arg1 /\ 1 + undef42 <= arg1 /\ 1 <= arg2 /\ 0 <= undef43 /\ undef41 <= 1 + arg2 /\ undef42 <= 1 + arg2 /\ 2 <= undef41 /\ 2 <= undef42, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
37.30/37.37	* Postcondition  : arg3 <= 0
37.30/37.37	Postcodition moved up: undef43 <= 0
37.30/37.37	
37.30/37.37	LOG: Try proving POST
37.30/37.37	Postcondition: undef43 <= 0
37.30/37.37	
37.30/37.37	LOG: CALL check - Post:undef43 <= 0 - Process 3
37.30/37.37	* Exit transition: <l0, l6, 0 <= undef43 /\ 4 <= undef33 /\ 2 <= undef34 /\ 2 <= undef41 /\ 2 <= undef42, {arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}>
37.30/37.37	* Postcondition  : undef43 <= 0
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.000634s
37.30/37.37	> Postcondition is not implied!
37.30/37.37	
37.30/37.37	LOG: RETURN check - Elapsed time: 0.000760s
37.30/37.37	
37.30/37.37	LOG: NarrowEntry size 1
37.30/37.37	Narrowing transition: 
37.30/37.37	<l6, l6, 3 <= arg1 /\ 3 + undef38 <= arg1 /\ 1 <= arg2 /\ 1 + undef38 <= arg2 /\ 1 <= undef37 /\ undef37 <= arg2 /\ 0 <= undef38 /\ 2 + undef37 <= arg1, {arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}>
37.30/37.37	
37.30/37.37	LOG: Narrow transition size 1
37.30/37.37	ENTRIES:
37.30/37.37	<l0, l6, 1 <= undef43 /\ 4 <= undef33 /\ 2 <= undef34 /\ 2 <= undef41 /\ 2 <= undef42, {arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}>
37.30/37.37	END ENTRIES:
37.30/37.37	GRAPH:
37.30/37.37	<l6, l6, 3 <= arg1 /\ 3 + undef38 <= arg1 /\ 1 <= arg2 /\ 1 + undef38 <= arg2 /\ 1 <= undef37 /\ 1 <= undef43 /\ undef37 <= arg2 /\ 0 <= undef38 /\ 2 + undef37 <= arg1 /\ 2 <= undef41 /\ 2 <= undef42, {arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}>
37.30/37.37	END GRAPH:
37.30/37.37	EXIT: <l6, l3, 3 <= arg1 /\ 1 + undef41 <= arg1 /\ 1 + undef42 <= arg1 /\ 1 <= arg2 /\ 0 <= undef43 /\ undef41 <= 1 + arg2 /\ undef42 <= 1 + arg2 /\ 2 <= undef41 /\ 2 <= undef42, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
37.30/37.37	POST: arg3 <= 0
37.30/37.37	
37.30/37.37	
37.30/37.37	LOG: Try proving POST
37.30/37.37	Solving with 1 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027327s
37.30/37.37	Time used: 0.02722
37.30/37.37	Solving with 2 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001537s
37.30/37.37	Time used: 4.00044
37.30/37.37	Solving with 3 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002504s
37.30/37.37	Time used: 1.00026
37.30/37.37	
37.30/37.37	LOG: Postcondition is not implied - no solution
37.30/37.37	> Postcondition is not implied!
37.30/37.37	
37.30/37.37	LOG: RETURN check - Elapsed time: 5.043816s
37.30/37.37	Calling Safety with literal arg3 <= 0 and entry <l6, l3, 3 <= arg1 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef58 <= undef45 /\ undef57 <= undef45 /\ 0 <= undef59 /\ 2 <= undef58 /\ 5 <= undef45, {arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}>
37.30/37.37	
37.30/37.37	LOG: CALL check - Post:arg3 <= 0 - Process 4
37.30/37.37	* Exit transition: <l6, l3, 3 <= arg1 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef58 <= undef45 /\ undef57 <= undef45 /\ 0 <= undef59 /\ 2 <= undef58 /\ 5 <= undef45, {arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}>
37.30/37.37	* Postcondition  : arg3 <= 0
37.30/37.37	Postcodition moved up: undef59 <= 0
37.30/37.37	
37.30/37.37	LOG: Try proving POST
37.30/37.37	Postcondition: undef59 <= 0
37.30/37.37	
37.30/37.37	LOG: CALL check - Post:undef59 <= 0 - Process 5
37.30/37.37	* Exit transition: <l0, l6, 3 <= undef57 /\ 1 + undef58 <= undef45 /\ undef57 <= undef45 /\ 0 <= undef59 /\ 4 <= undef33 /\ 2 <= undef34 /\ 2 <= undef58 /\ 5 <= undef45, {arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}>
37.30/37.37	* Postcondition  : undef59 <= 0
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.000866s
37.30/37.37	> Postcondition is not implied!
37.30/37.37	
37.30/37.37	LOG: RETURN check - Elapsed time: 0.001027s
37.30/37.37	
37.30/37.37	LOG: NarrowEntry size 1
37.30/37.37	Narrowing transition: 
37.30/37.37	<l6, l6, 3 <= arg1 /\ 3 + undef38 <= arg1 /\ 1 <= arg2 /\ 1 + undef38 <= arg2 /\ 1 <= undef37 /\ undef37 <= arg2 /\ 0 <= undef38 /\ 2 + undef37 <= arg1, {arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}>
37.30/37.37	
37.30/37.37	LOG: Narrow transition size 1
37.30/37.37	ENTRIES:
37.30/37.37	<l0, l6, 3 <= undef57 /\ 1 + undef58 <= undef45 /\ 1 <= undef59 /\ undef57 <= undef45 /\ 4 <= undef33 /\ 2 <= undef34 /\ 2 <= undef58 /\ 5 <= undef45, {arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}>
37.30/37.37	END ENTRIES:
37.30/37.37	GRAPH:
37.30/37.37	<l6, l6, 3 <= arg1 /\ 3 + undef38 <= arg1 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef38 <= arg2 /\ 1 <= undef37 /\ 1 + undef58 <= undef45 /\ 1 <= undef59 /\ undef37 <= arg2 /\ 0 <= undef38 /\ undef57 <= undef45 /\ 2 + undef37 <= arg1 /\ 2 <= undef58 /\ 5 <= undef45, {arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}>
37.30/37.37	END GRAPH:
37.30/37.37	EXIT: <l6, l3, 3 <= arg1 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef58 <= undef45 /\ undef57 <= undef45 /\ 0 <= undef59 /\ 2 <= undef58 /\ 5 <= undef45, {arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}>
37.30/37.37	POST: arg3 <= 0
37.30/37.37	
37.30/37.37	
37.30/37.37	LOG: Try proving POST
37.30/37.37	Solving with 1 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.032238s
37.30/37.37	Time used: 0.032127
37.30/37.37	Solving with 2 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001663s
37.30/37.37	Time used: 4.00047
37.30/37.37	Solving with 3 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002648s
37.30/37.37	Time used: 1.00011
37.30/37.37	
37.30/37.37	LOG: Postcondition is not implied - no solution
37.30/37.37	> Postcondition is not implied!
37.30/37.37	
37.30/37.37	LOG: RETURN check - Elapsed time: 5.058522s
37.30/37.37	Calling Safety with literal arg3 <= 0 and entry <l6, l3, 3 <= arg1 /\ 3 <= undef49 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef58 <= undef49 /\ undef57 <= undef49 /\ 0 <= undef59 /\ 2 <= undef58, {arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}>
37.30/37.37	
37.30/37.37	LOG: CALL check - Post:arg3 <= 0 - Process 6
37.30/37.37	* Exit transition: <l6, l3, 3 <= arg1 /\ 3 <= undef49 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef58 <= undef49 /\ undef57 <= undef49 /\ 0 <= undef59 /\ 2 <= undef58, {arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}>
37.30/37.37	* Postcondition  : arg3 <= 0
37.30/37.37	Postcodition moved up: undef59 <= 0
37.30/37.37	
37.30/37.37	LOG: Try proving POST
37.30/37.37	Postcondition: undef59 <= 0
37.30/37.37	
37.30/37.37	LOG: CALL check - Post:undef59 <= 0 - Process 7
37.30/37.37	* Exit transition: <l0, l6, 3 <= undef49 /\ 3 <= undef57 /\ 1 + undef58 <= undef49 /\ undef57 <= undef49 /\ 0 <= undef59 /\ 4 <= undef33 /\ 2 <= undef34 /\ 2 <= undef58, {arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}>
37.30/37.37	* Postcondition  : undef59 <= 0
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.000933s
37.30/37.37	> Postcondition is not implied!
37.30/37.37	
37.30/37.37	LOG: RETURN check - Elapsed time: 0.001085s
37.30/37.37	
37.30/37.37	LOG: NarrowEntry size 1
37.30/37.37	Narrowing transition: 
37.30/37.37	<l6, l6, 3 <= arg1 /\ 3 + undef38 <= arg1 /\ 1 <= arg2 /\ 1 + undef38 <= arg2 /\ 1 <= undef37 /\ undef37 <= arg2 /\ 0 <= undef38 /\ 2 + undef37 <= arg1, {arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}>
37.30/37.37	
37.30/37.37	LOG: Narrow transition size 1
37.30/37.37	ENTRIES:
37.30/37.37	<l0, l6, 3 <= undef49 /\ 3 <= undef57 /\ 1 + undef58 <= undef49 /\ 1 <= undef59 /\ undef57 <= undef49 /\ 4 <= undef33 /\ 2 <= undef34 /\ 2 <= undef58, {arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}>
37.30/37.37	END ENTRIES:
37.30/37.37	GRAPH:
37.30/37.37	<l6, l6, 3 <= arg1 /\ 3 + undef38 <= arg1 /\ 3 <= undef49 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef38 <= arg2 /\ 1 <= undef37 /\ 1 + undef58 <= undef49 /\ 1 <= undef59 /\ undef37 <= arg2 /\ 0 <= undef38 /\ undef57 <= undef49 /\ 2 + undef37 <= arg1 /\ 2 <= undef58, {arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}>
37.30/37.37	END GRAPH:
37.30/37.37	EXIT: <l6, l3, 3 <= arg1 /\ 3 <= undef49 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef58 <= undef49 /\ undef57 <= undef49 /\ 0 <= undef59 /\ 2 <= undef58, {arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}>
37.30/37.37	POST: arg3 <= 0
37.30/37.37	
37.30/37.37	
37.30/37.37	LOG: Try proving POST
37.30/37.37	Solving with 1 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.029840s
37.30/37.37	Time used: 0.02973
37.30/37.37	Solving with 2 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001817s
37.30/37.37	Time used: 4.00053
37.30/37.37	Solving with 3 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002700s
37.30/37.37	Time used: 1.00002
37.30/37.37	
37.30/37.37	LOG: Postcondition is not implied - no solution
37.30/37.37	> Postcondition is not implied!
37.30/37.37	
37.30/37.37	LOG: RETURN check - Elapsed time: 5.067270s
37.30/37.37	INVARIANTS: 
37.30/37.37	3: 
37.30/37.37	Quasi-INVARIANTS to narrow Graph: 
37.30/37.37	3: arg3 <= 0 , 
37.30/37.37	Narrowing transition: 
37.30/37.37	<l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef13 /\ 1 <= undef14 /\ undef14 <= arg2 /\ 0 <= undef15, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	
37.30/37.37	LOG: Narrow transition size 1
37.30/37.37	invGraph after Narrowing: 
37.30/37.37	Transitions:
37.30/37.37	<l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef13 /\ 1 <= undef14 /\ undef14 <= arg2 /\ 0 <= undef15, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	Variables:
37.30/37.37	arg1, arg2, arg3, arg4
37.30/37.37	Checking conditional termination of SCC {l3}...
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.001149s
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.005328s
37.30/37.37	Trying to remove transition: <l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef13 /\ 1 <= undef14 /\ undef14 <= arg2 /\ 0 <= undef15, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	Solving with 1 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013422s
37.30/37.37	Time used: 0.013183
37.30/37.37	Solving with 1 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.067043s
37.30/37.37	Time used: 0.066095
37.30/37.37	Improving Solution with cost 4 ...
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetNextSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.047598s
37.30/37.37	Time used: 0.047589
37.30/37.37	
37.30/37.37	LOG: SAT solveNonLinear - Elapsed time: 0.114640s
37.30/37.37	Cost: 4; Total time: 0.113684
37.30/37.37	Failed at location 3: arg1 <= 2
37.30/37.37	Failed at location 3: arg1 <= 2
37.30/37.37	Failed at location 3: arg1 <= 2
37.30/37.37	Failed at location 3: arg1 <= 2
37.30/37.37	Before Improving: 
37.30/37.37	Quasi-invariant at l3: arg1 <= 2
37.30/37.37	Optimizing invariants...
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.005844s
37.30/37.37	Remaining time after improvement: 0.997474
37.30/37.37	Termination implied by a set of quasi-invariant(s):
37.30/37.37	Quasi-invariant at l3: arg1 <= 2
37.30/37.37	[ Invariant Graph ]
37.30/37.37	Strengthening and disabling transitions...
37.30/37.37	
37.30/37.37	LOG: CALL solverLinear in Graph for feasibility
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear in Graph for feasibility
37.30/37.37	It's unfeasible. Removing transition: 
37.30/37.37	<l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef13 /\ 1 <= undef14 /\ undef14 <= arg2 /\ 0 <= undef15, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	[ Termination Graph ]
37.30/37.37	Strengthening and disabling transitions...
37.30/37.37	
37.30/37.37	LOG: CALL solverLinear in Graph for feasibility
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear in Graph for feasibility
37.30/37.37	It's unfeasible. Removing transition: 
37.30/37.37	<l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef13 /\ 1 <= undef14 /\ undef14 <= arg2 /\ 0 <= undef15, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	New Graphs: 
37.30/37.37	Calling Safety with literal arg1 <= 2 and entry <l0, l3, 1 <= undef11 /\ 4 <= undef9 /\ 5 <= undef10, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
37.30/37.37	
37.30/37.37	LOG: CALL check - Post:arg1 <= 2 - Process 8
37.30/37.37	* Exit transition: <l0, l3, 1 <= undef11 /\ 4 <= undef9 /\ 5 <= undef10, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
37.30/37.37	* Postcondition  : arg1 <= 2
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.001086s
37.30/37.37	> Postcondition is not implied!
37.30/37.37	
37.30/37.37	LOG: RETURN check - Elapsed time: 0.001187s
37.30/37.37	Calling Safety with literal arg1 <= 2 and entry <l6, l3, 3 <= arg1 /\ 1 + undef41 <= arg1 /\ 1 + undef42 <= arg1 /\ 1 <= arg2 /\ 1 <= undef43 /\ undef41 <= 1 + arg2 /\ undef42 <= 1 + arg2 /\ 2 <= undef41 /\ 2 <= undef42, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
37.30/37.37	
37.30/37.37	LOG: CALL check - Post:arg1 <= 2 - Process 9
37.30/37.37	* Exit transition: <l6, l3, 3 <= arg1 /\ 1 + undef41 <= arg1 /\ 1 + undef42 <= arg1 /\ 1 <= arg2 /\ 1 <= undef43 /\ undef41 <= 1 + arg2 /\ undef42 <= 1 + arg2 /\ 2 <= undef41 /\ 2 <= undef42, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
37.30/37.37	* Postcondition  : arg1 <= 2
37.30/37.37	Postcodition moved up: undef41 <= 2
37.30/37.37	
37.30/37.37	LOG: Try proving POST
37.30/37.37	Postcondition: undef41 <= 2
37.30/37.37	
37.30/37.37	LOG: CALL check - Post:undef41 <= 2 - Process 10
37.30/37.37	* Exit transition: <l0, l6, 1 <= undef43 /\ 4 <= undef33 /\ 2 <= undef34 /\ 2 <= undef41 /\ 2 <= undef42, {arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}>
37.30/37.37	* Postcondition  : undef41 <= 2
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.000830s
37.30/37.37	> Postcondition is not implied!
37.30/37.37	
37.30/37.37	LOG: RETURN check - Elapsed time: 0.000949s
37.30/37.37	
37.30/37.37	LOG: NarrowEntry size 1
37.30/37.37	Narrowing transition: 
37.30/37.37	<l6, l6, 3 <= arg1 /\ 3 + undef38 <= arg1 /\ 1 <= arg2 /\ 1 + undef38 <= arg2 /\ 1 <= undef37 /\ undef37 <= arg2 /\ 0 <= undef38 /\ 2 + undef37 <= arg1, {arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}>
37.30/37.37	
37.30/37.37	LOG: Narrow transition size 1
37.30/37.37	ENTRIES:
37.30/37.37	<l0, l6, 3 <= undef41 /\ 1 <= undef43 /\ 4 <= undef33 /\ 2 <= undef34 /\ 2 <= undef42, {arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}>
37.30/37.37	END ENTRIES:
37.30/37.37	GRAPH:
37.30/37.37	<l6, l6, 3 <= arg1 /\ 3 + undef38 <= arg1 /\ 3 <= undef41 /\ 1 <= arg2 /\ 1 + undef38 <= arg2 /\ 1 <= undef37 /\ 1 <= undef43 /\ undef37 <= arg2 /\ 0 <= undef38 /\ 2 + undef37 <= arg1 /\ 2 <= undef42, {arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}>
37.30/37.37	END GRAPH:
37.30/37.37	EXIT: <l6, l3, 3 <= arg1 /\ 1 + undef41 <= arg1 /\ 1 + undef42 <= arg1 /\ 1 <= arg2 /\ 1 <= undef43 /\ undef41 <= 1 + arg2 /\ undef42 <= 1 + arg2 /\ 2 <= undef41 /\ 2 <= undef42, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
37.30/37.37	POST: arg1 <= 2
37.30/37.37	
37.30/37.37	
37.30/37.37	LOG: Try proving POST
37.30/37.37	Solving with 1 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037825s
37.30/37.37	Time used: 0.037715
37.30/37.37	Solving with 2 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001639s
37.30/37.37	Time used: 4.00068
37.30/37.37	Solving with 3 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002818s
37.30/37.37	Time used: 1.00007
37.30/37.37	
37.30/37.37	LOG: Postcondition is not implied - no solution
37.30/37.37	> Postcondition is not implied!
37.30/37.37	
37.30/37.37	LOG: RETURN check - Elapsed time: 5.071636s
37.30/37.37	Calling Safety with literal arg1 <= 2 and entry <l6, l3, 3 <= arg1 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef58 <= undef45 /\ 1 <= undef59 /\ undef57 <= undef45 /\ 2 <= undef58 /\ 5 <= undef45, {arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}>
37.30/37.37	
37.30/37.37	LOG: CALL check - Post:arg1 <= 2 - Process 11
37.30/37.37	* Exit transition: <l6, l3, 3 <= arg1 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef58 <= undef45 /\ 1 <= undef59 /\ undef57 <= undef45 /\ 2 <= undef58 /\ 5 <= undef45, {arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}>
37.30/37.37	* Postcondition  : arg1 <= 2
37.30/37.37	Postcodition moved up: undef57 <= 2
37.30/37.37	
37.30/37.37	LOG: Try proving POST
37.30/37.37	Postcondition: undef57 <= 2
37.30/37.37	
37.30/37.37	LOG: CALL check - Post:undef57 <= 2 - Process 12
37.30/37.37	* Exit transition: <l0, l6, 3 <= undef57 /\ 1 + undef58 <= undef45 /\ 1 <= undef59 /\ undef57 <= undef45 /\ 4 <= undef33 /\ 2 <= undef34 /\ 2 <= undef58 /\ 5 <= undef45, {arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}>
37.30/37.37	* Postcondition  : undef57 <= 2
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.000999s
37.30/37.37	> Postcondition is not implied!
37.30/37.37	
37.30/37.37	LOG: RETURN check - Elapsed time: 0.001159s
37.30/37.37	
37.30/37.37	LOG: NarrowEntry size 1
37.30/37.37	Narrowing transition: 
37.30/37.37	<l6, l6, 3 <= arg1 /\ 3 + undef38 <= arg1 /\ 1 <= arg2 /\ 1 + undef38 <= arg2 /\ 1 <= undef37 /\ undef37 <= arg2 /\ 0 <= undef38 /\ 2 + undef37 <= arg1, {arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}>
37.30/37.37	
37.30/37.37	LOG: Narrow transition size 1
37.30/37.37	ENTRIES:
37.30/37.37	<l0, l6, 3 <= undef57 /\ 1 + undef58 <= undef45 /\ 1 <= undef59 /\ undef57 <= undef45 /\ 4 <= undef33 /\ 2 <= undef34 /\ 2 <= undef58 /\ 5 <= undef45, {arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}>
37.30/37.37	END ENTRIES:
37.30/37.37	GRAPH:
37.30/37.37	<l6, l6, 3 <= arg1 /\ 3 + undef38 <= arg1 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef38 <= arg2 /\ 1 <= undef37 /\ 1 + undef58 <= undef45 /\ 1 <= undef59 /\ undef37 <= arg2 /\ 0 <= undef38 /\ undef57 <= undef45 /\ 2 + undef37 <= arg1 /\ 2 <= undef58 /\ 5 <= undef45, {arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}>
37.30/37.37	END GRAPH:
37.30/37.37	EXIT: <l6, l3, 3 <= arg1 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef58 <= undef45 /\ 1 <= undef59 /\ undef57 <= undef45 /\ 2 <= undef58 /\ 5 <= undef45, {arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}>
37.30/37.37	POST: arg1 <= 2
37.30/37.37	
37.30/37.37	
37.30/37.37	LOG: Try proving POST
37.30/37.37	Solving with 1 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031148s
37.30/37.37	Time used: 0.031037
37.30/37.37	Solving with 2 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002783s
37.30/37.37	Time used: 4.00065
37.30/37.37	Solving with 3 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003188s
37.30/37.37	Time used: 1.00021
37.30/37.37	
37.30/37.37	LOG: Postcondition is not implied - no solution
37.30/37.37	> Postcondition is not implied!
37.30/37.37	
37.30/37.37	LOG: RETURN check - Elapsed time: 5.072859s
37.30/37.37	Calling Safety with literal arg1 <= 2 and entry <l6, l3, 3 <= arg1 /\ 3 <= undef49 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef58 <= undef49 /\ 1 <= undef59 /\ undef57 <= undef49 /\ 2 <= undef58, {arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}>
37.30/37.37	
37.30/37.37	LOG: CALL check - Post:arg1 <= 2 - Process 13
37.30/37.37	* Exit transition: <l6, l3, 3 <= arg1 /\ 3 <= undef49 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef58 <= undef49 /\ 1 <= undef59 /\ undef57 <= undef49 /\ 2 <= undef58, {arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}>
37.30/37.37	* Postcondition  : arg1 <= 2
37.30/37.37	Postcodition moved up: undef57 <= 2
37.30/37.37	
37.30/37.37	LOG: Try proving POST
37.30/37.37	Postcondition: undef57 <= 2
37.30/37.37	
37.30/37.37	LOG: CALL check - Post:undef57 <= 2 - Process 14
37.30/37.37	* Exit transition: <l0, l6, 3 <= undef49 /\ 3 <= undef57 /\ 1 + undef58 <= undef49 /\ 1 <= undef59 /\ undef57 <= undef49 /\ 4 <= undef33 /\ 2 <= undef34 /\ 2 <= undef58, {arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}>
37.30/37.37	* Postcondition  : undef57 <= 2
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.001006s
37.30/37.37	> Postcondition is not implied!
37.30/37.37	
37.30/37.37	LOG: RETURN check - Elapsed time: 0.001158s
37.30/37.37	
37.30/37.37	LOG: NarrowEntry size 1
37.30/37.37	Narrowing transition: 
37.30/37.37	<l6, l6, 3 <= arg1 /\ 3 + undef38 <= arg1 /\ 1 <= arg2 /\ 1 + undef38 <= arg2 /\ 1 <= undef37 /\ undef37 <= arg2 /\ 0 <= undef38 /\ 2 + undef37 <= arg1, {arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}>
37.30/37.37	
37.30/37.37	LOG: Narrow transition size 1
37.30/37.37	ENTRIES:
37.30/37.37	<l0, l6, 3 <= undef49 /\ 3 <= undef57 /\ 1 + undef58 <= undef49 /\ 1 <= undef59 /\ undef57 <= undef49 /\ 4 <= undef33 /\ 2 <= undef34 /\ 2 <= undef58, {arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}>
37.30/37.37	END ENTRIES:
37.30/37.37	GRAPH:
37.30/37.37	<l6, l6, 3 <= arg1 /\ 3 + undef38 <= arg1 /\ 3 <= undef49 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef38 <= arg2 /\ 1 <= undef37 /\ 1 + undef58 <= undef49 /\ 1 <= undef59 /\ undef37 <= arg2 /\ 0 <= undef38 /\ undef57 <= undef49 /\ 2 + undef37 <= arg1 /\ 2 <= undef58, {arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}>
37.30/37.37	END GRAPH:
37.30/37.37	EXIT: <l6, l3, 3 <= arg1 /\ 3 <= undef49 /\ 3 <= undef57 /\ 1 <= arg2 /\ 1 + undef58 <= undef49 /\ 1 <= undef59 /\ undef57 <= undef49 /\ 2 <= undef58, {arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}>
37.30/37.37	POST: arg1 <= 2
37.30/37.37	
37.30/37.37	
37.30/37.37	LOG: Try proving POST
37.30/37.37	Solving with 1 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.032675s
37.30/37.37	Time used: 0.032539
37.30/37.37	Solving with 2 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001765s
37.30/37.37	Time used: 4.00078
37.30/37.37	Solving with 3 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003158s
37.30/37.37	Time used: 1.00008
37.30/37.37	
37.30/37.37	LOG: Postcondition is not implied - no solution
37.30/37.37	> Postcondition is not implied!
37.30/37.37	
37.30/37.37	LOG: RETURN check - Elapsed time: 5.060224s
37.30/37.37	INVARIANTS: 
37.30/37.37	3: 
37.30/37.37	Quasi-INVARIANTS to narrow Graph: 
37.30/37.37	3: arg1 <= 2 , 
37.30/37.37	Narrowing transition: 
37.30/37.37	<l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef13 /\ 1 <= undef14 /\ undef14 <= arg2 /\ 0 <= undef15, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	
37.30/37.37	LOG: Narrow transition size 1
37.30/37.37	invGraph after Narrowing: 
37.30/37.37	Transitions:
37.30/37.37	<l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef13 /\ 1 <= undef14 /\ undef14 <= arg2 /\ 0 <= undef15, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	Variables:
37.30/37.37	arg1, arg2, arg3, arg4
37.30/37.37	Checking conditional termination of SCC {l3}...
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.001169s
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.005497s
37.30/37.37	Trying to remove transition: <l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef13 /\ 1 <= undef14 /\ undef14 <= arg2 /\ 0 <= undef15, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	Solving with 1 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013633s
37.30/37.37	Time used: 0.0134
37.30/37.37	Solving with 1 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.070653s
37.30/37.37	Time used: 0.06989
37.30/37.37	Solving with 2 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011613s
37.30/37.37	Time used: 4.00062
37.30/37.37	Solving with 3 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005037s
37.30/37.37	Time used: 1.0008
37.30/37.37	Solving with 1 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022102s
37.30/37.37	Time used: 0.01435
37.30/37.37	
37.30/37.37	Proving non-termination of subgraph 4
37.30/37.37	Transitions:
37.30/37.37	<l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef13 /\ 1 <= undef14 /\ undef14 <= arg2 /\ 0 <= undef15, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	Variables:
37.30/37.37	arg1, arg2, arg3, arg4
37.30/37.37	
37.30/37.37	Checking that every undef value has an assignment...
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.001763s
37.30/37.37	Checking conditional non-termination of SCC {l3}...
37.30/37.37	EXIT TRANSITIONS:
37.30/37.37	<l3, end, 3 <= arg1 /\ 1 <= arg2 /\ arg3 <= 0, {all remain the same}>
37.30/37.37	<l3, end, 3 <= arg1 /\ arg2 <= 0, {all remain the same}>
37.30/37.37	<l3, end, arg1 <= 2, {all remain the same}>
37.30/37.37	
37.30/37.37	Solving with 1 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.079182s
37.30/37.37	Time used: 0.078679
37.30/37.37	Improving Solution with cost 4 ...
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetNextSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.150920s
37.30/37.37	Time used: 0.150906
37.30/37.37	
37.30/37.37	LOG: SAT solveNonLinear - Elapsed time: 0.230102s
37.30/37.37	Cost: 4; Total time: 0.229585
37.30/37.37	Minimizing number of undef constraints...
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinear - Elapsed time: 0.027992s
37.30/37.37	Number of undef constraints reduced!
37.30/37.37	
37.30/37.37	Non-termination implied by a set of quasi-invariant(s):
37.30/37.37	Quasi-invariant at l3: 1 <= arg2
37.30/37.37	
37.30/37.37	Strengthening and disabling EXIT transitions...
37.30/37.37	Closed exits from l3: 1
37.30/37.37	Strengthening exit transition (result): 
37.30/37.37	<l3, end, 3 <= arg1 /\ 1 <= arg2 /\ arg3 <= 0, {all remain the same}>
37.30/37.37	Strengthening exit transition (result): 
37.30/37.37	<l3, end, 1 <= arg2 /\ arg1 <= 2, {all remain the same}>
37.30/37.37	
37.30/37.37	Strengthening and disabling transitions...
37.30/37.37	
37.30/37.37	LOG: CALL solverLinear in Graph for feasibility
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear in Graph for feasibility
37.30/37.37	Strengthening transition (result): 
37.30/37.37	<l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef13 /\ 1 <= undef14 /\ undef14 <= arg2 /\ 0 <= undef15, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	
37.30/37.37	Checking conditional non-termination of SCC {l3}...
37.30/37.37	EXIT TRANSITIONS:
37.30/37.37	<l3, end, 3 <= arg1 /\ 1 <= arg2 /\ arg3 <= 0, {all remain the same}>
37.30/37.37	<l3, end, 1 <= arg2 /\ arg1 <= 2, {all remain the same}>
37.30/37.37	
37.30/37.37	Solving with 1 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.119210s
37.30/37.37	Time used: 0.118781
37.30/37.37	Improving Solution with cost 7 ...
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetNextSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.787343s
37.30/37.37	Time used: 0.787291
37.30/37.37	Improving Solution with cost 2 ...
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetNextSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.084096s
37.30/37.37	Time used: 0.084085
37.30/37.37	
37.30/37.37	LOG: SAT solveNonLinear - Elapsed time: 0.990649s
37.30/37.37	Cost: 2; Total time: 0.990157
37.30/37.37	Failed at location 3: 3 <= arg1
37.30/37.37	Before Improving: 
37.30/37.37	Quasi-invariant at l3: 3 <= arg1
37.30/37.37	Optimizing invariants...
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.007095s
37.30/37.37	Remaining time after improvement: 0.996442
37.30/37.37	Minimizing number of undef constraints...
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinear - Elapsed time: 0.006947s
37.30/37.37	Non-termination implied by a set of quasi-invariant(s):
37.30/37.37	Quasi-invariant at l3: 3 <= arg1
37.30/37.37	Constraint over undef '7 <= undef13' in transition:
37.30/37.37	<l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef13 /\ 1 <= undef14 /\ undef14 <= arg2 /\ 0 <= undef15, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	
37.30/37.37	Strengthening and disabling EXIT transitions...
37.30/37.37	Closed exits from l3: 1
37.30/37.37	Strengthening exit transition (result): 
37.30/37.37	<l3, end, 3 <= arg1 /\ 1 <= arg2 /\ arg3 <= 0, {all remain the same}>
37.30/37.37	
37.30/37.37	Strengthening and disabling transitions...
37.30/37.37	
37.30/37.37	LOG: CALL solverLinear in Graph for feasibility
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear in Graph for feasibility
37.30/37.37	Strengthening transition (result): 
37.30/37.37	<l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef14 /\ undef14 <= arg2 /\ 0 <= undef15 /\ 7 <= undef13, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	
37.30/37.37	Checking conditional non-termination of SCC {l3}...
37.30/37.37	EXIT TRANSITIONS:
37.30/37.37	<l3, end, 3 <= arg1 /\ 1 <= arg2 /\ arg3 <= 0, {all remain the same}>
37.30/37.37	
37.30/37.37	Solving with 1 template(s).
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetFirstSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.096506s
37.30/37.37	Time used: 0.096097
37.30/37.37	Improving Solution with cost 4 ...
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinearGetNextSolution
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.071588s
37.30/37.37	Time used: 0.071578
37.30/37.37	
37.30/37.37	LOG: SAT solveNonLinear - Elapsed time: 0.168094s
37.30/37.37	Cost: 4; Total time: 0.167675
37.30/37.37	Failed at location 3: 1 <= arg3
37.30/37.37	Failed at location 3: 1 <= arg3
37.30/37.37	Failed at location 3: 1 <= arg3
37.30/37.37	Failed at location 3: 1 <= arg3
37.30/37.37	Before Improving: 
37.30/37.37	Quasi-invariant at l3: 1 <= arg3
37.30/37.37	Optimizing invariants...
37.30/37.37	
37.30/37.37	LOG: CALL solveLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear - Elapsed time: 0.021752s
37.30/37.37	Remaining time after improvement: 0.996905
37.30/37.37	Minimizing number of undef constraints...
37.30/37.37	
37.30/37.37	LOG: CALL solveNonLinear
37.30/37.37	
37.30/37.37	LOG: RETURN solveNonLinear - Elapsed time: 0.005644s
37.30/37.37	Non-termination implied by a set of quasi-invariant(s):
37.30/37.37	Quasi-invariant at l3: 1 <= arg3
37.30/37.37	Constraint over undef '1 <= undef15' in transition:
37.30/37.37	<l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef14 /\ undef14 <= arg2 /\ 0 <= undef15 /\ 7 <= undef13, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	
37.30/37.37	Strengthening and disabling EXIT transitions...
37.30/37.37	Closed exits from l3: 1
37.30/37.37	
37.30/37.37	Strengthening and disabling transitions...
37.30/37.37	
37.30/37.37	LOG: CALL solverLinear in Graph for feasibility
37.30/37.37	
37.30/37.37	LOG: RETURN solveLinear in Graph for feasibility
37.30/37.37	Strengthening transition (result): 
37.30/37.37	<l3, l3, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef14 /\ 1 <= undef15 /\ undef14 <= arg2 /\ 7 <= undef13, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
37.30/37.37	
37.30/37.37	Calling reachability with...
37.30/37.37	Transition: <l3, end, true, {all remain the same}>
37.30/37.37	Conditions: 1 <= arg2, 3 <= arg1, 1 <= arg3, 
37.30/37.37	Transition: <l3, end, true, {all remain the same}>
37.30/37.37	Conditions: 1 <= arg2, 3 <= arg1, 1 <= arg3, 
37.30/37.37	Transition: <l3, end, true, {all remain the same}>
37.30/37.37	Conditions: 1 <= arg2, 3 <= arg1, 1 <= arg3, 
37.30/37.37	Transition: <l3, end, true, {all remain the same}>
37.30/37.37	Conditions: 1 <= arg2, 3 <= arg1, 1 <= arg3, 
37.30/37.37	OPEN EXITS: 
37.30/37.37	<l3, end, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {all remain the same}>
37.30/37.37	<l3, end, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {all remain the same}>
37.30/37.37	<l3, end, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {all remain the same}>
37.30/37.37	<l3, end, 3 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {all remain the same}>
37.30/37.37	
37.30/37.37	--- Reachability graph ---
37.30/37.37	> Graph without transitions.
37.30/37.37	
37.30/37.37	Calling reachability with...
37.30/37.37	Transition: <l0, l3, 0 <= undef11 /\ 4 <= undef9 /\ 5 <= undef10, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
37.30/37.37	Conditions: 3 <= arg1, 1 <= arg2, 1 <= arg3, 
37.30/37.37	Transition: <l0, l3, 0 <= undef11 /\ 4 <= undef9 /\ 5 <= undef10, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
37.30/37.37	Conditions: 3 <= arg1, 1 <= arg2, 1 <= arg3, 
37.30/37.37	Transition: <l0, l3, 0 <= undef11 /\ 4 <= undef9 /\ 5 <= undef10, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
37.30/37.37	Conditions: 3 <= arg1, 1 <= arg2, 1 <= arg3, 
37.30/37.37	Transition: <l0, l3, 0 <= undef11 /\ 4 <= undef9 /\ 5 <= undef10, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
37.30/37.37	Conditions: 3 <= arg1, 1 <= arg2, 1 <= arg3, 
37.30/37.37	OPEN EXITS: 
37.30/37.37	<l0, l3, 1 <= undef11 /\ 4 <= undef9 /\ 5 <= undef10, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
37.30/37.37	<l0, l3, 1 <= undef11 /\ 4 <= undef9 /\ 5 <= undef10, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
37.30/37.37	<l0, l3, 1 <= undef11 /\ 4 <= undef9 /\ 5 <= undef10, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
37.30/37.37	<l0, l3, 1 <= undef11 /\ 4 <= undef9 /\ 5 <= undef10, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
37.30/37.37	
37.30/37.37	> Conditions are reachable!
37.30/37.37	
37.30/37.37	Program does NOT terminate
37.30/37.37	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
37.30/37.37	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
37.30/37.37	EOF