0.00/0.03	YES
0.00/0.03	
0.00/0.04	Solver Timeout: 4
0.00/0.04	Global Timeout: 300
0.00/0.04	No parsing errors!
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l5, true>
0.00/0.04	<l1, l2, (undef1 > ~(1)) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> undef1, arg3 -> 1}>
0.00/0.04	<l1, l3, (undef7 > ~(1)) /\ (arg2 > 0) /\ (undef4 <= arg1) /\ (arg1 > 0) /\ (undef4 > 0) /\ (undef5 > 2), par{arg1 -> undef4, arg2 -> undef5, arg3 -> undef6}>
0.00/0.04	<l1, l3, (undef11 > ~(1)) /\ (arg2 > 0) /\ (arg1 >= undef8) /\ (arg1 >= (undef9 - 1)) /\ (arg1 > 0) /\ (undef8 > 0) /\ (undef9 > 1), par{arg1 -> undef8, arg2 -> undef9, arg3 -> undef10}>
0.00/0.04	<l2, l2, (arg1 > ~(1)) /\ (arg2 > ~(1)) /\ (arg3 > 0) /\ ((arg1 - 1) < arg1) /\ (arg3 < arg2), par{arg1 -> (arg1 - 1), arg3 -> (arg3 + 1)}>
0.00/0.04	<l3, l4, (undef18 > 0) /\ (arg3 > 1) /\ (undef15 <= arg2) /\ ((undef16 + 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef15 > 0) /\ (undef16 > ~(1)), par{arg1 -> undef15, arg2 -> undef16}>
0.00/0.04	<l4, l4, ((undef19 + 2) <= arg1) /\ (arg3 > 1) /\ (undef19 <= arg2) /\ ((undef20 + 3) <= arg1) /\ ((undef20 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef19 > 0) /\ (undef20 > ~(1)), par{arg1 -> undef19, arg2 -> undef20}>
0.00/0.04	<l5, l1, true, par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef1, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef15, undef16, undef18, undef19, undef20, undef22, undef23, undef24, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef1, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef15, undef16, undef18, undef19, undef20, undef22, undef23, undef24, 
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	Preprocessed LLVMGraph
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l2, (undef1 > ~(1)) /\ (undef23 > 0) /\ (undef22 > 0), par{arg1 -> undef1, arg2 -> undef23, arg3 -> 1}>
0.00/0.04	<l0, l4, (undef7 > ~(1)) /\ (undef23 > 0) /\ (undef4 <= undef22) /\ (undef22 > 0) /\ (undef4 > 0) /\ (undef5 > 2) /\ (undef18 > 0) /\ (undef6 > 1) /\ (undef15 <= undef5) /\ ((undef16 + 1) <= undef5) /\ (undef4 > 0) /\ (undef5 > 0) /\ (undef15 > 0) /\ (undef16 > ~(1)), par{arg1 -> undef15, arg2 -> undef16, arg3 -> undef6}>
0.00/0.04	<l0, l4, (undef11 > ~(1)) /\ (undef23 > 0) /\ (undef22 >= undef8) /\ (undef22 >= (undef9 - 1)) /\ (undef22 > 0) /\ (undef8 > 0) /\ (undef9 > 1) /\ (undef18 > 0) /\ (undef10 > 1) /\ (undef15 <= undef9) /\ ((undef16 + 1) <= undef9) /\ (undef8 > 0) /\ (undef9 > 0) /\ (undef15 > 0) /\ (undef16 > ~(1)), par{arg1 -> undef15, arg2 -> undef16, arg3 -> undef10}>
0.00/0.04	<l2, l2, (arg1 > ~(1)) /\ (arg2 > ~(1)) /\ (arg3 > 0) /\ ((arg1 - 1) < arg1) /\ (arg3 < arg2), par{arg1 -> (arg1 - 1), arg3 -> (arg3 + 1)}>
0.00/0.04	<l4, l4, ((undef19 + 2) <= arg1) /\ (arg3 > 1) /\ (undef19 <= arg2) /\ ((undef20 + 3) <= arg1) /\ ((undef20 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef19 > 0) /\ (undef20 > ~(1)), par{arg1 -> undef19, arg2 -> undef20}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef1, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef15, undef16, undef18, undef19, undef20, undef22, undef23, undef24, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef1, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef15, undef16, undef18, undef19, undef20, undef22, undef23, undef24, 
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	*************************************************************
0.00/0.04	*******************************************************************************************
0.00/0.04	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	Init Location: 0
0.00/0.04	Graph 0:
0.00/0.04	Transitions:
0.00/0.04	Variables:
0.00/0.04	
0.00/0.04	Graph 1:
0.00/0.04	Transitions:
0.00/0.04	<l4, l4, 1 <= arg2 /\ 1 + undef20 <= arg2 /\ 1 <= undef19 /\ undef19 <= arg2 /\ 0 <= undef20 /\ 2 + undef19 <= arg1 /\ 2 <= arg3 /\ 3 <= arg1 /\ 3 + undef20 <= arg1, {arg1 -> undef19, arg2 -> undef20, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	arg1, arg2, arg3
0.00/0.04	
0.00/0.04	Graph 2:
0.00/0.04	Transitions:
0.00/0.04	<l2, l2, 1 + arg3 <= arg2 /\ 1 <= arg3 /\ 0 <= arg1 /\ 0 <= arg2, {arg1 -> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	arg1, arg2, arg3
0.00/0.04	
0.00/0.04	Precedence: 
0.00/0.04	Graph 0
0.00/0.04	
0.00/0.04	Graph 1
0.00/0.04	<l0, l4, 1 <= undef4 /\ 1 + undef16 <= undef5 /\ 1 <= undef15 /\ 1 <= undef18 /\ 1 <= undef22 /\ 1 <= undef23 /\ undef4 <= undef22 /\ undef15 <= undef5 /\ 0 <= undef7 /\ 0 <= undef16 /\ 2 <= undef6 /\ 3 <= undef5, {arg1 -> undef15, arg2 -> undef16, arg3 -> undef6, rest remain the same}>
0.00/0.04	<l0, l4, 1 <= undef8 /\ 1 + undef16 <= undef9 /\ 1 <= undef15 /\ 1 <= undef18 /\ 1 <= undef22 /\ 1 <= undef23 /\ undef9 <= 1 + undef22 /\ undef8 <= undef22 /\ undef15 <= undef9 /\ 0 <= undef11 /\ 0 <= undef16 /\ 2 <= undef9 /\ 2 <= undef10, {arg1 -> undef15, arg2 -> undef16, arg3 -> undef10, rest remain the same}>
0.00/0.04	
0.00/0.04	Graph 2
0.00/0.04	<l0, l2, 1 <= undef22 /\ 1 <= undef23 /\ 0 <= undef1, {arg1 -> undef1, arg2 -> undef23, arg3 -> 1, rest remain the same}>
0.00/0.04	
0.00/0.04	Map Locations to Subgraph:
0.00/0.04	( 0 , 0 )
0.00/0.04	( 2 , 2 )
0.00/0.04	( 4 , 1 )
0.00/0.04	
0.00/0.04	*******************************************************************************************
0.00/0.04	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	Proving termination of subgraph 0
0.00/0.04	Proving termination of subgraph 1
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.005066
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l4}...
0.00/0.04	
0.00/0.04	LOG: CALL solveLinear
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear - Elapsed time: 0.001511s
0.00/0.04	Ranking function: (~(4) / 3) + (1 / 3)*arg1 + (1 / 3)*arg2
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 2
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.002929
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l2}...
0.00/0.04	
0.00/0.04	LOG: CALL solveLinear
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear - Elapsed time: 0.000969s
0.00/0.04	Ranking function: arg1
0.00/0.04	New Graphs: 
0.00/0.04	Program Terminates
0.00/0.04	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.04	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.04	EOF