4.00/4.05	YES
4.00/4.05	
4.00/4.05	Solver Timeout: 4
4.00/4.05	Global Timeout: 300
4.00/4.05	No parsing errors!
4.00/4.05	Init Location: 0
4.00/4.05	Transitions:
4.00/4.05	<l0, l6, true>
4.00/4.05	<l1, l2, (undef1 = undef1) /\ (undef4 = undef4), par{x_13^0 -> undef1, y_16^0 -> undef4}>
4.00/4.05	<l2, l3, (1 <= (0 + x_13^0)) /\ (undef10 = 5000) /\ (1 <= (0 + undef10)) /\ (1 <= (0 + x_13^0)), par{y_16^0 -> undef10}>
4.00/4.05	<l4, l3, (undef14 = undef14) /\ (undef17 = undef17) /\ (1 <= (0 + y_16^0)) /\ (undef13 = (~(1) + x_13^0)) /\ (undef16 = (~(1) + y_16^0)) /\ ((0 + undef13) <= (~(1) + undef14)) /\ ((~(1) + undef14) <= (0 + undef13)) /\ ((0 + undef16) <= (~(1) + undef17)) /\ ((~(1) + undef17) <= (0 + undef16)) /\ (1 <= (0 + undef14)) /\ (1 <= (0 + undef17)), par{x_13^0 -> undef13, x_27^0 -> undef14, y_16^0 -> undef16, y_28^0 -> undef17}>
4.00/4.05	<l3, l2, ((0 + y_16^0) <= 0) /\ ((0 + y_16^0) <= 0)>
4.00/4.05	<l3, l5, (undef27 = undef27) /\ (undef30 = undef30) /\ (1 <= (0 + y_16^0)) /\ (undef25 = (~(1) + x_13^0)) /\ (undef28 = (~(1) + y_16^0)) /\ ((0 + undef25) <= (~(1) + undef27)) /\ ((~(1) + undef27) <= (0 + undef25)) /\ ((0 + undef28) <= (~(1) + undef30)) /\ ((~(1) + undef30) <= (0 + undef28)) /\ (1 <= (0 + undef30)), par{x_13^0 -> undef25, x_32^0 -> undef27, y_16^0 -> undef28, y_33^0 -> undef30}>
4.00/4.05	<l5, l3, true>
4.00/4.05	<l6, l1, true>
4.00/4.05	
4.00/4.05	Fresh variables:
4.00/4.05	undef1, undef4, undef10, undef13, undef14, undef16, undef17, undef25, undef27, undef28, undef30, 
4.00/4.05	
4.00/4.05	Undef variables:
4.00/4.05	undef1, undef4, undef10, undef13, undef14, undef16, undef17, undef25, undef27, undef28, undef30, 
4.00/4.05	
4.00/4.05	Abstraction variables:
4.00/4.05	
4.00/4.05	Exit nodes:
4.00/4.05	
4.00/4.05	Accepting locations:
4.00/4.05	
4.00/4.05	Asserts:
4.00/4.05	
4.00/4.05	Preprocessed LLVMGraph
4.00/4.05	Init Location: 0
4.00/4.05	Transitions:
4.00/4.05	<l0, l3, (x_13^0 = undef1) /\ (y_16^0 = undef10) /\ (undef1 = undef1) /\ (undef4 = undef4) /\ (1 <= (0 + undef1)) /\ (undef10 = 5000) /\ (1 <= (0 + undef10)) /\ (1 <= (0 + undef1))>
4.00/4.05	<l3, l3, ((0 + y_16^0) <= 0) /\ ((0 + y_16^0) <= 0) /\ (1 <= (0 + x_13^0)) /\ (undef10 = 5000) /\ (1 <= (0 + undef10)) /\ (1 <= (0 + x_13^0)), par{y_16^0 -> undef10}>
4.00/4.05	<l3, l3, (undef27 = undef27) /\ (undef30 = undef30) /\ (1 <= (0 + y_16^0)) /\ (undef25 = (~(1) + x_13^0)) /\ (undef28 = (~(1) + y_16^0)) /\ ((0 + undef25) <= (~(1) + undef27)) /\ ((~(1) + undef27) <= (0 + undef25)) /\ ((0 + undef28) <= (~(1) + undef30)) /\ ((~(1) + undef30) <= (0 + undef28)) /\ (1 <= (0 + undef30)), par{x_13^0 -> undef25, y_16^0 -> undef28}>
4.00/4.05	
4.00/4.05	Fresh variables:
4.00/4.05	undef1, undef4, undef10, undef13, undef14, undef16, undef17, undef25, undef27, undef28, undef30, 
4.00/4.05	
4.00/4.05	Undef variables:
4.00/4.05	undef1, undef4, undef10, undef13, undef14, undef16, undef17, undef25, undef27, undef28, undef30, 
4.00/4.05	
4.00/4.05	Abstraction variables:
4.00/4.05	
4.00/4.05	Exit nodes:
4.00/4.05	
4.00/4.05	Accepting locations:
4.00/4.05	
4.00/4.05	Asserts:
4.00/4.05	
4.00/4.05	*************************************************************
4.00/4.05	*******************************************************************************************
4.00/4.05	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
4.00/4.05	*******************************************************************************************
4.00/4.05	
4.00/4.05	Init Location: 0
4.00/4.05	Graph 0:
4.00/4.05	Transitions:
4.00/4.05	Variables:
4.00/4.05	
4.00/4.05	Graph 1:
4.00/4.05	Transitions:
4.00/4.05	<l3, l3, 1 <= x_13^0 /\ y_16^0 <= 0 /\ undef10 = 5000, {y_16^0 -> undef10, rest remain the same}>
4.00/4.05	<l3, l3, 1 <= y_16^0 /\ 1 <= undef30 /\ 1 + undef25 = undef27 /\ 1 + undef28 = undef30 /\ x_13^0 = 1 + undef25 /\ y_16^0 = 1 + undef28, {x_13^0 -> undef25, y_16^0 -> undef28, rest remain the same}>
4.00/4.05	Variables:
4.00/4.05	x_13^0, y_16^0
4.00/4.05	
4.00/4.05	Precedence: 
4.00/4.05	Graph 0
4.00/4.05	
4.00/4.05	Graph 1
4.00/4.05	<l0, l3, 1 <= undef1 /\ x_13^0 = undef1 /\ y_16^0 = undef10 /\ undef10 = 5000, {all remain the same}>
4.00/4.05	
4.00/4.05	Map Locations to Subgraph:
4.00/4.05	( 0 , 0 )
4.00/4.05	( 3 , 1 )
4.00/4.05	
4.00/4.05	*******************************************************************************************
4.00/4.05	********************************    CHECKING ASSERTIONS    ********************************
4.00/4.05	*******************************************************************************************
4.00/4.05	
4.00/4.05	Proving termination of subgraph 0
4.00/4.05	Proving termination of subgraph 1
4.00/4.05	Checking unfeasibility...
4.00/4.05	Time used: 4.00081
4.00/4.05	
4.00/4.05	Checking conditional termination of SCC {l3}...
4.00/4.05	
4.00/4.05	LOG: CALL solveLinear
4.00/4.05	
4.00/4.05	LOG: RETURN solveLinear - Elapsed time: 0.012530s
4.00/4.05	Ranking function: (1 / 5000) + (5001 / 5000)*x_13^0 + (~(1) / 5000)*y_16^0
4.00/4.05	New Graphs: 
4.00/4.05	Transitions:
4.00/4.05	<l3, l3, 1 <= y_16^0 /\ 1 <= undef30 /\ 1 + undef25 = undef27 /\ 1 + undef28 = undef30 /\ x_13^0 = 1 + undef25 /\ y_16^0 = 1 + undef28, {x_13^0 -> undef25, y_16^0 -> undef28, rest remain the same}>
4.00/4.05	Variables:
4.00/4.05	x_13^0, y_16^0
4.00/4.05	Checking conditional termination of SCC {l3}...
4.00/4.05	
4.00/4.05	LOG: CALL solveLinear
4.00/4.05	
4.00/4.05	LOG: RETURN solveLinear - Elapsed time: 0.001094s
4.00/4.05	Ranking function: -1 + y_16^0
4.00/4.05	New Graphs: 
4.00/4.05	Program Terminates
4.00/4.05	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
4.00/4.05	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
4.00/4.05	EOF