0.00/0.06	YES
0.00/0.06	
0.00/0.06	Solver Timeout: 4
0.00/0.06	Global Timeout: 300
0.00/0.06	No parsing errors!
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l8, true>
0.00/0.06	<l1, l2, (arg1 > 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> undef3, arg4 -> undef4}>
0.00/0.06	<l1, l3, (undef5 <= arg1) /\ (arg2 > 0) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> 0, arg3 -> undef7, arg4 -> undef8}>
0.00/0.06	<l1, l3, (undef10 > ~(1)) /\ (arg2 > 0) /\ (undef9 <= arg1) /\ (arg1 > 0) /\ (undef9 > 0), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}>
0.00/0.06	<l3, l2, (arg1 > 0), par{arg1 -> arg2, arg2 -> 0, arg3 -> undef15, arg4 -> undef16}>
0.00/0.06	<l3, l4, (undef17 <= arg1) /\ (undef21 > 1) /\ (arg1 > 0) /\ (undef17 > 0), par{arg1 -> undef17, arg3 -> 0, arg4 -> undef20}>
0.00/0.06	<l3, l4, (undef26 > 1) /\ (undef24 > ~(1)) /\ (undef22 <= arg1) /\ (arg1 > 0) /\ (undef22 > 0), par{arg1 -> undef22, arg3 -> undef24, arg4 -> undef25}>
0.00/0.06	<l4, l2, (arg1 > 0) /\ (undef31 > 1), par{arg1 -> arg2, arg2 -> arg3, arg3 -> undef29, arg4 -> undef30}>
0.00/0.06	<l2, l5, (arg1 < 2) /\ (arg2 > 1), par{arg3 -> undef34, arg4 -> undef35}>
0.00/0.06	<l5, l6, (arg2 > 1) /\ (arg1 < 2) /\ ((arg2 - (2 * undef40)) < 2) /\ ((arg2 - (2 * undef40)) >= 0), par{arg3 -> (arg2 - (2 * undef40)), arg4 -> undef39}>
0.00/0.06	<l2, l5, (arg1 > 2) /\ (arg2 > 1), par{arg3 -> undef43, arg4 -> undef44}>
0.00/0.06	<l5, l6, (arg2 > 1) /\ (arg1 > 2) /\ ((arg2 - (2 * undef49)) < 2) /\ ((arg2 - (2 * undef49)) >= 0), par{arg3 -> (arg2 - (2 * undef49)), arg4 -> undef48}>
0.00/0.06	<l6, l7, (arg2 > 1) /\ (undef54 > 0) /\ (arg2 > undef54) /\ (0 = arg3), par{arg3 -> 0}>
0.00/0.06	<l7, l2, (arg2 > 1) /\ (arg2 > undef56) /\ (undef56 > 0) /\ ((arg2 - (2 * undef56)) < 2) /\ ((arg2 - (2 * undef56)) >= 0) /\ (0 = arg3), par{arg2 -> undef56, arg3 -> undef57, arg4 -> undef58}>
0.00/0.06	<l6, l2, (arg2 > 1) /\ ((arg2 - 1) < arg2) /\ (1 = arg3), par{arg2 -> (arg2 - 1), arg3 -> undef61, arg4 -> undef62}>
0.00/0.06	<l8, l1, true, par{arg1 -> undef63, arg2 -> undef64, arg3 -> undef65, arg4 -> undef66}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef11, undef12, undef15, undef16, undef17, undef20, undef21, undef22, undef24, undef25, undef26, undef29, undef30, undef31, undef34, undef35, undef39, undef40, undef43, undef44, undef48, undef49, undef54, undef56, undef57, undef58, undef61, undef62, undef63, undef64, undef65, undef66, 
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef11, undef12, undef15, undef16, undef17, undef20, undef21, undef22, undef24, undef25, undef26, undef29, undef30, undef31, undef34, undef35, undef39, undef40, undef43, undef44, undef48, undef49, undef54, undef56, undef57, undef58, undef61, undef62, undef63, undef64, undef65, undef66, 
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	Preprocessed LLVMGraph
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l2, (undef63 > 0) /\ (0 = undef64), par{arg1 -> 0, arg2 -> 0}>
0.00/0.06	<l0, l2, (undef5 <= undef63) /\ (undef64 > 0) /\ (undef63 > 0) /\ (undef5 > 0) /\ (undef5 > 0), par{arg1 -> 0, arg2 -> 0}>
0.00/0.06	<l0, l2, (undef5 <= undef63) /\ (undef64 > 0) /\ (undef63 > 0) /\ (undef5 > 0) /\ (undef17 <= undef5) /\ (undef21 > 1) /\ (undef5 > 0) /\ (undef17 > 0) /\ (undef17 > 0) /\ (undef31 > 1), par{arg1 -> 0, arg2 -> 0}>
0.00/0.06	<l0, l2, (undef5 <= undef63) /\ (undef64 > 0) /\ (undef63 > 0) /\ (undef5 > 0) /\ (undef26 > 1) /\ (undef24 > ~(1)) /\ (undef22 <= undef5) /\ (undef5 > 0) /\ (undef22 > 0) /\ (undef22 > 0) /\ (undef31 > 1), par{arg1 -> 0, arg2 -> undef24}>
0.00/0.06	<l0, l2, (undef10 > ~(1)) /\ (undef64 > 0) /\ (undef9 <= undef63) /\ (undef63 > 0) /\ (undef9 > 0) /\ (undef9 > 0), par{arg1 -> undef10, arg2 -> 0}>
0.00/0.06	<l0, l2, (undef10 > ~(1)) /\ (undef64 > 0) /\ (undef9 <= undef63) /\ (undef63 > 0) /\ (undef9 > 0) /\ (undef17 <= undef9) /\ (undef21 > 1) /\ (undef9 > 0) /\ (undef17 > 0) /\ (undef17 > 0) /\ (undef31 > 1), par{arg1 -> undef10, arg2 -> 0}>
0.00/0.06	<l0, l2, (undef10 > ~(1)) /\ (undef64 > 0) /\ (undef9 <= undef63) /\ (undef63 > 0) /\ (undef9 > 0) /\ (undef26 > 1) /\ (undef24 > ~(1)) /\ (undef22 <= undef9) /\ (undef9 > 0) /\ (undef22 > 0) /\ (undef22 > 0) /\ (undef31 > 1), par{arg1 -> undef10, arg2 -> undef24}>
0.00/0.06	<l2, l2, (arg1 < 2) /\ (arg2 > 1) /\ (arg2 > 1) /\ (arg1 < 2) /\ ((arg2 - (2 * undef40)) < 2) /\ ((arg2 - (2 * undef40)) >= 0) /\ (arg2 > 1) /\ (undef54 > 0) /\ (arg2 > undef54) /\ (0 = (arg2 - (2 * undef40))) /\ (arg2 > 1) /\ (arg2 > undef56) /\ (undef56 > 0) /\ ((arg2 - (2 * undef56)) < 2) /\ ((arg2 - (2 * undef56)) >= 0) /\ (0 = 0), par{arg2 -> undef56}>
0.00/0.06	<l2, l2, (arg1 < 2) /\ (arg2 > 1) /\ (arg2 > 1) /\ (arg1 < 2) /\ ((arg2 - (2 * undef40)) < 2) /\ ((arg2 - (2 * undef40)) >= 0) /\ (arg2 > 1) /\ ((arg2 - 1) < arg2) /\ (1 = (arg2 - (2 * undef40))), par{arg2 -> (arg2 - 1)}>
0.00/0.06	<l2, l2, (arg1 > 2) /\ (arg2 > 1) /\ (arg2 > 1) /\ (arg1 > 2) /\ ((arg2 - (2 * undef49)) < 2) /\ ((arg2 - (2 * undef49)) >= 0) /\ (arg2 > 1) /\ (undef54 > 0) /\ (arg2 > undef54) /\ (0 = (arg2 - (2 * undef49))) /\ (arg2 > 1) /\ (arg2 > undef56) /\ (undef56 > 0) /\ ((arg2 - (2 * undef56)) < 2) /\ ((arg2 - (2 * undef56)) >= 0) /\ (0 = 0), par{arg2 -> undef56}>
0.00/0.06	<l2, l2, (arg1 > 2) /\ (arg2 > 1) /\ (arg2 > 1) /\ (arg1 > 2) /\ ((arg2 - (2 * undef49)) < 2) /\ ((arg2 - (2 * undef49)) >= 0) /\ (arg2 > 1) /\ ((arg2 - 1) < arg2) /\ (1 = (arg2 - (2 * undef49))), par{arg2 -> (arg2 - 1)}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef11, undef12, undef15, undef16, undef17, undef20, undef21, undef22, undef24, undef25, undef26, undef29, undef30, undef31, undef34, undef35, undef39, undef40, undef43, undef44, undef48, undef49, undef54, undef56, undef57, undef58, undef61, undef62, undef63, undef64, undef65, undef66, 
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef11, undef12, undef15, undef16, undef17, undef20, undef21, undef22, undef24, undef25, undef26, undef29, undef30, undef31, undef34, undef35, undef39, undef40, undef43, undef44, undef48, undef49, undef54, undef56, undef57, undef58, undef61, undef62, undef63, undef64, undef65, undef66, 
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	*************************************************************
0.00/0.06	*******************************************************************************************
0.00/0.06	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Init Location: 0
0.00/0.06	Graph 0:
0.00/0.06	Transitions:
0.00/0.06	Variables:
0.00/0.06	
0.00/0.06	Graph 1:
0.00/0.06	Transitions:
0.00/0.06	<l2, l2, 2*undef56 <= arg2 /\ 1 + undef54 <= arg2 /\ 1 + undef56 <= arg2 /\ 1 <= undef54 /\ 1 <= undef56 /\ arg1 <= 1 /\ arg2 <= 1 + 2*undef56 /\ 2 <= arg2 /\ arg2 = 2*undef40, {arg2 -> undef56, rest remain the same}>
0.00/0.06	<l2, l2, arg1 <= 1 /\ 2 <= arg2 /\ arg2 = 1 + 2*undef40, {arg2 -> -1 + arg2, rest remain the same}>
0.00/0.06	<l2, l2, 2*undef56 <= arg2 /\ 1 + undef54 <= arg2 /\ 1 + undef56 <= arg2 /\ 1 <= undef54 /\ 1 <= undef56 /\ arg2 <= 1 + 2*undef56 /\ 2 <= arg2 /\ 3 <= arg1 /\ arg2 = 2*undef49, {arg2 -> undef56, rest remain the same}>
0.00/0.06	<l2, l2, 2 <= arg2 /\ 3 <= arg1 /\ arg2 = 1 + 2*undef49, {arg2 -> -1 + arg2, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	arg1, arg2
0.00/0.06	
0.00/0.06	Precedence: 
0.00/0.06	Graph 0
0.00/0.06	
0.00/0.06	Graph 1
0.00/0.06	<l0, l2, 1 <= undef63 /\ undef64 = 0, {arg1 -> 0, arg2 -> 0, rest remain the same}>
0.00/0.06	<l0, l2, undef5 <= undef63 /\ 1 <= undef5 /\ 1 <= undef63 /\ 1 <= undef64, {arg1 -> 0, arg2 -> 0, rest remain the same}>
0.00/0.06	<l0, l2, undef5 <= undef63 /\ undef17 <= undef5 /\ 1 <= undef5 /\ 1 <= undef17 /\ 1 <= undef63 /\ 1 <= undef64 /\ 2 <= undef21 /\ 2 <= undef31, {arg1 -> 0, arg2 -> 0, rest remain the same}>
0.00/0.06	<l0, l2, undef5 <= undef63 /\ undef22 <= undef5 /\ 0 <= undef24 /\ 1 <= undef5 /\ 1 <= undef22 /\ 1 <= undef63 /\ 1 <= undef64 /\ 2 <= undef26 /\ 2 <= undef31, {arg1 -> 0, arg2 -> undef24, rest remain the same}>
0.00/0.06	<l0, l2, undef9 <= undef63 /\ 0 <= undef10 /\ 1 <= undef9 /\ 1 <= undef63 /\ 1 <= undef64, {arg1 -> undef10, arg2 -> 0, rest remain the same}>
0.00/0.06	<l0, l2, undef9 <= undef63 /\ undef17 <= undef9 /\ 0 <= undef10 /\ 1 <= undef9 /\ 1 <= undef17 /\ 1 <= undef63 /\ 1 <= undef64 /\ 2 <= undef21 /\ 2 <= undef31, {arg1 -> undef10, arg2 -> 0, rest remain the same}>
0.00/0.06	<l0, l2, undef9 <= undef63 /\ undef22 <= undef9 /\ 0 <= undef10 /\ 0 <= undef24 /\ 1 <= undef9 /\ 1 <= undef22 /\ 1 <= undef63 /\ 1 <= undef64 /\ 2 <= undef26 /\ 2 <= undef31, {arg1 -> undef10, arg2 -> undef24, rest remain the same}>
0.00/0.06	
0.00/0.06	Map Locations to Subgraph:
0.00/0.06	( 0 , 0 )
0.00/0.06	( 2 , 1 )
0.00/0.06	
0.00/0.06	*******************************************************************************************
0.00/0.06	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Proving termination of subgraph 0
0.00/0.06	Proving termination of subgraph 1
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.013776
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l2}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.003884s
0.00/0.06	Ranking function: (7 / 2) + (~(11) / 2)*arg1 + arg2
0.00/0.06	New Graphs: 
0.00/0.06	Transitions:
0.00/0.06	<l2, l2, 2*undef56 <= arg2 /\ 1 + undef54 <= arg2 /\ 1 + undef56 <= arg2 /\ 1 <= undef54 /\ 1 <= undef56 /\ arg2 <= 1 + 2*undef56 /\ 2 <= arg2 /\ 3 <= arg1 /\ arg2 = 2*undef49, {arg2 -> undef56, rest remain the same}>
0.00/0.06	<l2, l2, 2 <= arg2 /\ 3 <= arg1 /\ arg2 = 1 + 2*undef49, {arg2 -> -1 + arg2, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	arg1, arg2
0.00/0.06	Checking conditional termination of SCC {l2}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.001996s
0.00/0.06	Ranking function: -2 + arg2
0.00/0.06	New Graphs: 
0.00/0.06	Program Terminates
0.00/0.06	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.06	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.06/0.06	EOF