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, l6, true>
0.00/0.04	<l1, l2, (undef2 = undef2) /\ (undef5 = undef5), par{x_13^0 -> undef2, y_16^0 -> undef5}>
0.00/0.04	<l2, l3, (1 <= (0 + x_13^0)) /\ (undef12 = (0 + __const_5000^0)) /\ (1 <= (0 + undef12)) /\ (1 <= (0 + x_13^0)), par{y_16^0 -> undef12}>
0.00/0.04	<l4, l3, (undef17 = undef17) /\ (undef20 = undef20) /\ (1 <= (0 + y_16^0)) /\ (undef16 = (~(1) + x_13^0)) /\ (undef19 = (~(1) + y_16^0)) /\ ((0 + undef16) <= (~(1) + undef17)) /\ ((~(1) + undef17) <= (0 + undef16)) /\ ((0 + undef19) <= (~(1) + undef20)) /\ ((~(1) + undef20) <= (0 + undef19)) /\ (1 <= (0 + undef17)) /\ (1 <= (0 + undef20)), par{x_13^0 -> undef16, x_27^0 -> undef17, y_16^0 -> undef19, y_28^0 -> undef20}>
0.00/0.04	<l3, l2, ((0 + y_16^0) <= 0) /\ ((0 + y_16^0) <= 0)>
0.00/0.04	<l3, l5, (undef32 = undef32) /\ (undef35 = undef35) /\ (1 <= (0 + y_16^0)) /\ (undef30 = (~(1) + x_13^0)) /\ (undef33 = (~(1) + y_16^0)) /\ ((0 + undef30) <= (~(1) + undef32)) /\ ((~(1) + undef32) <= (0 + undef30)) /\ ((0 + undef33) <= (~(1) + undef35)) /\ ((~(1) + undef35) <= (0 + undef33)) /\ (1 <= (0 + undef35)), par{x_13^0 -> undef30, x_32^0 -> undef32, y_16^0 -> undef33, y_33^0 -> undef35}>
0.00/0.04	<l5, l3, true>
0.00/0.04	<l6, l1, true>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef2, undef5, undef12, undef16, undef17, undef19, undef20, undef30, undef32, undef33, undef35, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef2, undef5, undef12, undef16, undef17, undef19, undef20, undef30, undef32, undef33, undef35, 
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, l3, (x_13^0 = undef2) /\ (y_16^0 = undef12) /\ (undef2 = undef2) /\ (undef5 = undef5) /\ (1 <= (0 + undef2)) /\ (undef12 = (0 + __const_5000^0)) /\ (1 <= (0 + undef12)) /\ (1 <= (0 + undef2))>
0.00/0.04	<l3, l3, ((0 + y_16^0) <= 0) /\ ((0 + y_16^0) <= 0) /\ (1 <= (0 + x_13^0)) /\ (undef12 = (0 + __const_5000^0)) /\ (1 <= (0 + undef12)) /\ (1 <= (0 + x_13^0)), par{y_16^0 -> undef12}>
0.00/0.04	<l3, l3, (undef32 = undef32) /\ (undef35 = undef35) /\ (1 <= (0 + y_16^0)) /\ (undef30 = (~(1) + x_13^0)) /\ (undef33 = (~(1) + y_16^0)) /\ ((0 + undef30) <= (~(1) + undef32)) /\ ((~(1) + undef32) <= (0 + undef30)) /\ ((0 + undef33) <= (~(1) + undef35)) /\ ((~(1) + undef35) <= (0 + undef33)) /\ (1 <= (0 + undef35)), par{x_13^0 -> undef30, y_16^0 -> undef33}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef2, undef5, undef12, undef16, undef17, undef19, undef20, undef30, undef32, undef33, undef35, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef2, undef5, undef12, undef16, undef17, undef19, undef20, undef30, undef32, undef33, undef35, 
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	<l3, l3, 1 <= x_13^0 /\ 1 <= undef12 /\ y_16^0 <= 0 /\ __const_5000^0 = undef12, {y_16^0 -> undef12, rest remain the same}>
0.00/0.04	<l3, l3, 1 <= y_16^0 /\ 1 <= undef35 /\ 1 + undef30 = undef32 /\ 1 + undef33 = undef35 /\ x_13^0 = 1 + undef30 /\ y_16^0 = 1 + undef33, {x_13^0 -> undef30, y_16^0 -> undef33, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	__const_5000^0, x_13^0, y_16^0
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, l3, 1 <= undef2 /\ 1 <= undef12 /\ __const_5000^0 = undef12 /\ x_13^0 = undef2 /\ y_16^0 = undef12, {all 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	( 3 , 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.007308
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l3}...
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.001921s
0.00/0.04	Ranking function: 1 + 2*x_13^0 - y_16^0
0.00/0.04	New Graphs: 
0.00/0.04	Transitions:
0.00/0.04	<l3, l3, 1 <= y_16^0 /\ 1 <= undef35 /\ 1 + undef30 = undef32 /\ 1 + undef33 = undef35 /\ x_13^0 = 1 + undef30 /\ y_16^0 = 1 + undef33, {x_13^0 -> undef30, y_16^0 -> undef33, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	x_13^0, y_16^0
0.00/0.04	Checking conditional termination of SCC {l3}...
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.001090s
0.00/0.04	Ranking function: -1 + y_16^0
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