0.00/0.09	YES
0.00/0.09	
0.00/0.09	Solver Timeout: 4
0.00/0.09	Global Timeout: 300
0.00/0.09	No parsing errors!
0.00/0.09	Init Location: 0
0.00/0.09	Transitions:
0.00/0.09	<l0, l5, true>
0.00/0.09	<l1, l2, (undef3 > ~(1)) /\ (arg2 > 0) /\ (undef1 <= arg1) /\ (arg1 > 0) /\ (undef1 > 0) /\ (undef2 > 2), par{arg1 -> undef1, arg2 -> undef2}>
0.00/0.09	<l1, l2, (undef6 > ~(1)) /\ (arg2 > 0) /\ (undef4 <= arg1) /\ ((undef5 - 1) <= arg1) /\ (arg1 > 0) /\ (undef4 > 0) /\ (undef5 > 1), par{arg1 -> undef4, arg2 -> undef5}>
0.00/0.09	<l2, l3, (undef8 <= arg2) /\ (undef9 > 0) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef8 > 0), par{arg1 -> 0, arg2 -> undef8}>
0.00/0.09	<l1, l4, (undef10 > ~(1)) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> undef10, arg2 -> undef11}>
0.00/0.09	<l4, l4, (arg1 > 1) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef13}>
0.00/0.09	<l3, l3, ((undef15 + 7) <= arg2) /\ (arg2 > 6) /\ (undef15 > ~(1)) /\ (0 = arg1), par{arg1 -> 1, arg2 -> undef15}>
0.00/0.09	<l3, l3, ((undef17 - 2) <= arg2) /\ (arg2 > 0) /\ (undef17 > 2) /\ (1 = arg1), par{arg1 -> 2, arg2 -> undef17}>
0.00/0.09	<l3, l3, ((undef19 - 4) <= arg2) /\ (arg2 > 0) /\ (undef19 > 4) /\ (2 = arg1), par{arg1 -> 0, arg2 -> undef19}>
0.00/0.09	<l5, l1, true, par{arg1 -> undef20, arg2 -> undef21}>
0.00/0.09	
0.00/0.09	Fresh variables:
0.00/0.09	undef1, undef2, undef3, undef4, undef5, undef6, undef8, undef9, undef10, undef11, undef13, undef15, undef17, undef19, undef20, undef21, 
0.00/0.09	
0.00/0.09	Undef variables:
0.00/0.09	undef1, undef2, undef3, undef4, undef5, undef6, undef8, undef9, undef10, undef11, undef13, undef15, undef17, undef19, undef20, undef21, 
0.00/0.09	
0.00/0.09	Abstraction variables:
0.00/0.09	
0.00/0.09	Exit nodes:
0.00/0.09	
0.00/0.09	Accepting locations:
0.00/0.09	
0.00/0.09	Asserts:
0.00/0.09	
0.00/0.09	Preprocessed LLVMGraph
0.00/0.09	Init Location: 0
0.00/0.09	Transitions:
0.00/0.09	<l0, l3, (undef3 > ~(1)) /\ (undef21 > 0) /\ (undef1 <= undef20) /\ (undef20 > 0) /\ (undef1 > 0) /\ (undef2 > 2) /\ (undef8 <= undef2) /\ (undef9 > 0) /\ (undef1 > 0) /\ (undef2 > 0) /\ (undef8 > 0), par{arg1 -> 0, arg2 -> undef8}>
0.00/0.09	<l0, l3, (undef6 > ~(1)) /\ (undef21 > 0) /\ (undef4 <= undef20) /\ ((undef5 - 1) <= undef20) /\ (undef20 > 0) /\ (undef4 > 0) /\ (undef5 > 1) /\ (undef8 <= undef5) /\ (undef9 > 0) /\ (undef4 > 0) /\ (undef5 > 0) /\ (undef8 > 0), par{arg1 -> 0, arg2 -> undef8}>
0.00/0.09	<l0, l4, (undef10 > ~(1)) /\ (undef21 > 0) /\ (undef20 > 0), par{arg1 -> undef10, arg2 -> undef11}>
0.00/0.09	<l3, l3, ((undef15 + 7) <= arg2) /\ (arg2 > 6) /\ (undef15 > ~(1)) /\ (0 = arg1), par{arg1 -> 1, arg2 -> undef15}>
0.00/0.09	<l3, l3, ((undef17 - 2) <= arg2) /\ (arg2 > 0) /\ (undef17 > 2) /\ (1 = arg1), par{arg1 -> 2, arg2 -> undef17}>
0.00/0.09	<l3, l3, ((undef19 - 4) <= arg2) /\ (arg2 > 0) /\ (undef19 > 4) /\ (2 = arg1), par{arg1 -> 0, arg2 -> undef19}>
0.00/0.09	<l4, l4, (arg1 > 1) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef13}>
0.00/0.09	
0.00/0.09	Fresh variables:
0.00/0.09	undef1, undef2, undef3, undef4, undef5, undef6, undef8, undef9, undef10, undef11, undef13, undef15, undef17, undef19, undef20, undef21, 
0.00/0.09	
0.00/0.09	Undef variables:
0.00/0.09	undef1, undef2, undef3, undef4, undef5, undef6, undef8, undef9, undef10, undef11, undef13, undef15, undef17, undef19, undef20, undef21, 
0.00/0.09	
0.00/0.09	Abstraction variables:
0.00/0.09	
0.00/0.09	Exit nodes:
0.00/0.09	
0.00/0.09	Accepting locations:
0.00/0.09	
0.00/0.09	Asserts:
0.00/0.09	
0.00/0.09	*************************************************************
0.00/0.09	*******************************************************************************************
0.00/0.09	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.09	*******************************************************************************************
0.00/0.09	
0.00/0.09	Init Location: 0
0.00/0.09	Graph 0:
0.00/0.09	Transitions:
0.00/0.09	Variables:
0.00/0.09	
0.00/0.09	Graph 1:
0.00/0.09	Transitions:
0.00/0.09	<l4, l4, 2 <= arg1, {arg1 -> -1 + arg1, arg2 -> undef13, rest remain the same}>
0.00/0.09	Variables:
0.00/0.09	arg1, arg2
0.00/0.09	
0.00/0.09	Graph 2:
0.00/0.09	Transitions:
0.00/0.09	<l3, l3, 0 <= undef15 /\ 7 <= arg2 /\ 7 + undef15 <= arg2 /\ arg1 = 0, {arg1 -> 1, arg2 -> undef15, rest remain the same}>
0.00/0.09	<l3, l3, 1 <= arg2 /\ undef17 <= 2 + arg2 /\ 3 <= undef17 /\ arg1 = 1, {arg1 -> 2, arg2 -> undef17, rest remain the same}>
0.00/0.09	<l3, l3, 1 <= arg2 /\ undef19 <= 4 + arg2 /\ 5 <= undef19 /\ arg1 = 2, {arg1 -> 0, arg2 -> undef19, rest remain the same}>
0.00/0.09	Variables:
0.00/0.09	arg1, arg2
0.00/0.09	
0.00/0.09	Precedence: 
0.00/0.09	Graph 0
0.00/0.09	
0.00/0.09	Graph 1
0.00/0.09	<l0, l4, 1 <= undef20 /\ 1 <= undef21 /\ 0 <= undef10, {arg1 -> undef10, arg2 -> undef11, rest remain the same}>
0.00/0.09	
0.00/0.09	Graph 2
0.00/0.09	<l0, l3, 1 <= undef1 /\ 1 <= undef8 /\ 1 <= undef9 /\ 1 <= undef20 /\ 1 <= undef21 /\ undef1 <= undef20 /\ undef8 <= undef2 /\ 0 <= undef3 /\ 3 <= undef2, {arg1 -> 0, arg2 -> undef8, rest remain the same}>
0.00/0.09	<l0, l3, 1 <= undef4 /\ 1 <= undef8 /\ 1 <= undef9 /\ 1 <= undef20 /\ 1 <= undef21 /\ undef5 <= 1 + undef20 /\ undef4 <= undef20 /\ undef8 <= undef5 /\ 0 <= undef6 /\ 2 <= undef5, {arg1 -> 0, arg2 -> undef8, rest remain the same}>
0.00/0.09	
0.00/0.09	Map Locations to Subgraph:
0.00/0.09	( 0 , 0 )
0.00/0.09	( 3 , 2 )
0.00/0.09	( 4 , 1 )
0.00/0.09	
0.00/0.09	*******************************************************************************************
0.00/0.09	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.09	*******************************************************************************************
0.00/0.09	
0.00/0.09	Proving termination of subgraph 0
0.00/0.09	Proving termination of subgraph 1
0.00/0.09	Checking unfeasibility...
0.00/0.09	Time used: 0.002076
0.00/0.09	
0.00/0.09	Checking conditional termination of SCC {l4}...
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.000616s
0.00/0.09	Ranking function: -2 + arg1
0.00/0.09	New Graphs: 
0.00/0.09	Proving termination of subgraph 2
0.00/0.09	Checking unfeasibility...
0.00/0.09	Time used: 0.025947
0.00/0.09	
0.00/0.09	Checking conditional termination of SCC {l3}...
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.002093s
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.016117s
0.00/0.09	Piecewise ranking function: min(-122 + 132*arg1 + 19*arg2,66 - 47*arg1 + 19*arg2)
0.00/0.09	New Graphs: 
0.00/0.09	Transitions:
0.00/0.09	<l3, l3, 1 <= arg2 /\ undef17 <= 2 + arg2 /\ 3 <= undef17 /\ arg1 = 1, {arg1 -> 2, arg2 -> undef17, rest remain the same}>
0.00/0.09	<l3, l3, 1 <= arg2 /\ undef19 <= 4 + arg2 /\ 5 <= undef19 /\ arg1 = 2, {arg1 -> 0, arg2 -> undef19, rest remain the same}>
0.00/0.09	Variables:
0.00/0.09	arg1, arg2
0.00/0.09	Checking conditional termination of SCC {l3}...
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.001235s
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.006983s
0.00/0.09	Piecewise ranking function: min(8 - 9*arg1 + arg2,-14 + 19*arg1 + arg2)
0.00/0.09	New Graphs: 
0.00/0.09	Transitions:
0.00/0.09	<l3, l3, 1 <= arg2 /\ undef19 <= 4 + arg2 /\ 5 <= undef19 /\ arg1 = 2, {arg1 -> 0, arg2 -> undef19, rest remain the same}>
0.00/0.09	Variables:
0.00/0.09	arg1, arg2
0.00/0.09	Checking conditional termination of SCC {l3}...
0.00/0.09	
0.00/0.09	LOG: CALL solveLinear
0.00/0.09	
0.00/0.09	LOG: RETURN solveLinear - Elapsed time: 0.001054s
0.00/0.09	Ranking function: -1 + (1 / 2)*arg1
0.00/0.09	New Graphs: 
0.00/0.09	Program Terminates
0.00/0.09	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.09	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.09	EOF