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