0.00/0.03	YES
0.00/0.03	
0.00/0.03	Solver Timeout: 4
0.00/0.03	Global Timeout: 300
0.00/0.03	No parsing errors!
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l5, true>
0.00/0.03	<l1, l2, true>
0.00/0.03	<l2, l3, (1 <= (0 + x_13^0)) /\ ((0 + y_15^0) <= 0), par{result_11^0 -> (0 + temp0_14^0)}>
0.00/0.03	<l2, l3, ((0 + x_13^0) <= 0) /\ (undef19 = undef19) /\ ((0 + undef19) <= 0), par{result_11^0 -> (0 + temp0_14^0), x_13^0 -> undef19}>
0.00/0.03	<l2, l4, (undef28 = undef28) /\ (undef24 = undef24) /\ (1 <= (0 + x_13^0)) /\ (1 <= (0 + y_15^0)) /\ (undef29 = (0 + x_13^0)) /\ (undef30 = (~(2) + y_15^0)) /\ (undef31 = (1 + undef29)) /\ (undef23 = (0 + undef30)) /\ (undef26 = (~(2) + undef31)) /\ (undef27 = (1 + undef23)) /\ ((0 + undef26) <= (~(1) + undef24)) /\ ((~(1) + undef24) <= (0 + undef26)) /\ ((0 + undef27) <= (1 + undef23)) /\ ((1 + undef23) <= (0 + undef27)) /\ ((0 + undef23) <= (~(2) + undef28)) /\ ((~(2) + undef28) <= (0 + undef23)) /\ (1 <= (0 + undef28)) /\ (1 <= (0 + undef24)), par{t_16^0 -> undef23, t_22^0 -> undef24, x_13^0 -> undef26, y_15^0 -> undef27, y_21^0 -> undef28}>
0.00/0.03	<l4, l2, true>
0.00/0.03	<l5, l1, true>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef19, undef23, undef24, undef26, undef27, undef28, undef29, undef30, undef31, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef19, undef23, undef24, undef26, undef27, undef28, undef29, undef30, undef31, 
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	Preprocessed LLVMGraph
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l2, true>
0.00/0.03	<l2, l3, (1 <= (0 + x_13^0)) /\ ((0 + y_15^0) <= 0)>
0.00/0.03	<l2, l3, ((0 + x_13^0) <= 0) /\ (undef19 = undef19) /\ ((0 + undef19) <= 0), par{x_13^0 -> undef19}>
0.00/0.03	<l2, l2, (undef28 = undef28) /\ (undef24 = undef24) /\ (1 <= (0 + x_13^0)) /\ (1 <= (0 + y_15^0)) /\ (undef29 = (0 + x_13^0)) /\ (undef30 = (~(2) + y_15^0)) /\ (undef31 = (1 + undef29)) /\ (undef23 = (0 + undef30)) /\ (undef26 = (~(2) + undef31)) /\ (undef27 = (1 + undef23)) /\ ((0 + undef26) <= (~(1) + undef24)) /\ ((~(1) + undef24) <= (0 + undef26)) /\ ((0 + undef27) <= (1 + undef23)) /\ ((1 + undef23) <= (0 + undef27)) /\ ((0 + undef23) <= (~(2) + undef28)) /\ ((~(2) + undef28) <= (0 + undef23)) /\ (1 <= (0 + undef28)) /\ (1 <= (0 + undef24)), par{x_13^0 -> undef26, y_15^0 -> undef27}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef19, undef23, undef24, undef26, undef27, undef28, undef29, undef30, undef31, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef19, undef23, undef24, undef26, undef27, undef28, undef29, undef30, undef31, 
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	*************************************************************
0.00/0.03	*******************************************************************************************
0.00/0.03	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	Init Location: 0
0.00/0.03	Graph 0:
0.00/0.03	Transitions:
0.00/0.03	Variables:
0.00/0.03	
0.00/0.03	Graph 1:
0.00/0.03	Transitions:
0.00/0.03	<l2, l2, 1 <= x_13^0 /\ 1 <= y_15^0 /\ 1 <= undef24 /\ 1 <= undef28 /\ 1 + undef23 = undef27 /\ 1 + undef29 = undef31 /\ x_13^0 = undef29 /\ undef23 = undef30 /\ 2 + undef23 = undef28 /\ 2 + undef26 = undef31 /\ y_15^0 = 2 + undef30 /\ undef24 = 1 + undef26, {x_13^0 -> undef26, y_15^0 -> undef27, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	x_13^0, y_15^0
0.00/0.03	
0.00/0.03	Graph 2:
0.00/0.03	Transitions:
0.00/0.03	Variables:
0.00/0.03	
0.00/0.03	Precedence: 
0.00/0.03	Graph 0
0.00/0.03	
0.00/0.03	Graph 1
0.00/0.03	<l0, l2, true, {all remain the same}>
0.00/0.03	
0.00/0.03	Graph 2
0.00/0.03	<l2, l3, 1 <= x_13^0 /\ y_15^0 <= 0, {all remain the same}>
0.00/0.03	<l2, l3, x_13^0 <= 0 /\ undef19 <= 0, {x_13^0 -> undef19, rest remain the same}>
0.00/0.03	
0.00/0.03	Map Locations to Subgraph:
0.00/0.03	( 0 , 0 )
0.00/0.03	( 2 , 1 )
0.00/0.03	( 3 , 2 )
0.00/0.03	
0.00/0.03	*******************************************************************************************
0.00/0.03	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	Proving termination of subgraph 0
0.00/0.03	Proving termination of subgraph 1
0.00/0.03	Checking unfeasibility...
0.00/0.03	Time used: 0.002694
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l2}...
0.00/0.03	
0.00/0.03	LOG: CALL solveLinear
0.00/0.03	
0.00/0.03	LOG: RETURN solveLinear - Elapsed time: 0.001695s
0.00/0.03	Ranking function: -1 + x_13^0
0.00/0.03	New Graphs: 
0.00/0.03	Proving termination of subgraph 2
0.00/0.03	Analyzing SCC {l3}...
0.00/0.03	No cycles found.
0.00/0.03	
0.00/0.03	Program Terminates
0.00/0.03	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.03	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.03	EOF