0.00/0.07	YES
0.00/0.07	
0.00/0.08	Solver Timeout: 4
0.00/0.08	Global Timeout: 300
0.00/0.08	No parsing errors!
0.00/0.08	Init Location: 0
0.00/0.08	Transitions:
0.00/0.08	<l0, l8, true>
0.00/0.08	<l1, l2, ((0 + ox^0) <= (0 + x^0)) /\ ((0 + oy^0) <= (0 + y^0))>
0.00/0.08	<l1, l3, true, par{x^0 -> (0 + x^0)}>
0.00/0.08	<l4, l3, ((0 + c^0) <= 0)>
0.00/0.08	<l4, l3, true, par{c^0 -> 1, ox^0 -> (0 + x^0), oy^0 -> (0 + y^0)}>
0.00/0.08	<l5, l4, ((0 + c^0) <= 0)>
0.00/0.08	<l5, l1, (1 <= (0 + c^0))>
0.00/0.08	<l6, l5, true, par{y^0 -> (~(1) + y^0)}>
0.00/0.08	<l6, l5, true, par{x^0 -> (~(1) + x^0)}>
0.00/0.08	<l3, l6, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0))>
0.00/0.08	<l7, l3, ((0 + c^0) <= 0)>
0.00/0.08	<l8, l7, true>
0.00/0.08	
0.00/0.08	Fresh variables:
0.00/0.08	
0.00/0.08	Undef variables:
0.00/0.08	
0.00/0.08	Abstraction variables:
0.00/0.08	
0.00/0.08	Exit nodes:
0.00/0.08	
0.00/0.08	Accepting locations:
0.00/0.08	
0.00/0.08	Asserts:
0.00/0.08	
0.00/0.08	Preprocessed LLVMGraph
0.00/0.08	Init Location: 0
0.00/0.08	Transitions:
0.00/0.08	<l0, l3, ((0 + c^0) <= 0)>
0.00/0.08	<l3, l3, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ ((0 + c^0) <= 0) /\ ((0 + c^0) <= 0), par{y^0 -> (~(1) + y^0)}>
0.00/0.08	<l3, l3, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ ((0 + c^0) <= 0), par{c^0 -> 1, ox^0 -> (0 + x^0), oy^0 -> (0 + (~(1) + y^0)), y^0 -> (~(1) + y^0)}>
0.00/0.08	<l3, l2, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ (1 <= (0 + c^0)) /\ ((0 + ox^0) <= (0 + x^0)) /\ ((0 + oy^0) <= (0 + (~(1) + y^0))), par{y^0 -> (~(1) + y^0)}>
0.00/0.08	<l3, l3, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ (1 <= (0 + c^0)), par{x^0 -> (0 + x^0), y^0 -> (~(1) + y^0)}>
0.00/0.08	<l3, l3, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ ((0 + c^0) <= 0) /\ ((0 + c^0) <= 0), par{x^0 -> (~(1) + x^0)}>
0.00/0.08	<l3, l3, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ ((0 + c^0) <= 0), par{c^0 -> 1, ox^0 -> (0 + (~(1) + x^0)), oy^0 -> (0 + y^0), x^0 -> (~(1) + x^0)}>
0.00/0.08	<l3, l2, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ (1 <= (0 + c^0)) /\ ((0 + ox^0) <= (0 + (~(1) + x^0))) /\ ((0 + oy^0) <= (0 + y^0)), par{x^0 -> (~(1) + x^0)}>
0.00/0.08	<l3, l3, (1 <= (0 + x^0)) /\ (1 <= (0 + y^0)) /\ (1 <= (0 + c^0)), par{x^0 -> (0 + (~(1) + x^0))}>
0.00/0.08	
0.00/0.08	Fresh variables:
0.00/0.08	
0.00/0.08	Undef variables:
0.00/0.08	
0.00/0.08	Abstraction variables:
0.00/0.08	
0.00/0.08	Exit nodes:
0.00/0.08	
0.00/0.08	Accepting locations:
0.00/0.08	
0.00/0.08	Asserts:
0.00/0.08	
0.00/0.08	*************************************************************
0.00/0.08	*******************************************************************************************
0.00/0.08	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.08	*******************************************************************************************
0.00/0.08	
0.00/0.08	Init Location: 0
0.00/0.08	Graph 0:
0.00/0.08	Transitions:
0.00/0.08	Variables:
0.00/0.08	
0.00/0.08	Graph 1:
0.00/0.08	Transitions:
0.00/0.08	<l3, l3, c^0 <= 0 /\ 1 <= x^0 /\ 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}>
0.00/0.08	<l3, l3, c^0 <= 0 /\ 1 <= x^0 /\ 1 <= y^0, {c^0 -> 1, ox^0 -> x^0, oy^0 -> -1 + y^0, y^0 -> -1 + y^0, rest remain the same}>
0.00/0.08	<l3, l3, 1 <= c^0 /\ 1 <= x^0 /\ 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}>
0.00/0.08	<l3, l3, c^0 <= 0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> -1 + x^0, rest remain the same}>
0.00/0.08	<l3, l3, c^0 <= 0 /\ 1 <= x^0 /\ 1 <= y^0, {c^0 -> 1, ox^0 -> -1 + x^0, oy^0 -> y^0, x^0 -> -1 + x^0, rest remain the same}>
0.00/0.08	<l3, l3, 1 <= c^0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> -1 + x^0, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	c^0, x^0, y^0, ox^0, oy^0
0.00/0.08	
0.00/0.08	Graph 2:
0.00/0.08	Transitions:
0.00/0.08	Variables:
0.00/0.08	
0.00/0.08	Precedence: 
0.00/0.08	Graph 0
0.00/0.08	
0.00/0.08	Graph 1
0.00/0.08	<l0, l3, c^0 <= 0, {all remain the same}>
0.00/0.08	
0.00/0.08	Graph 2
0.00/0.08	<l3, l2, ox^0 <= x^0 /\ 1 <= c^0 /\ 1 + oy^0 <= y^0 /\ 1 <= x^0 /\ 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}>
0.00/0.08	<l3, l2, oy^0 <= y^0 /\ 1 <= c^0 /\ 1 + ox^0 <= x^0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> -1 + x^0, rest remain the same}>
0.00/0.08	
0.00/0.08	Map Locations to Subgraph:
0.00/0.08	( 0 , 0 )
0.00/0.08	( 2 , 2 )
0.00/0.08	( 3 , 1 )
0.00/0.08	
0.00/0.08	*******************************************************************************************
0.00/0.08	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.08	*******************************************************************************************
0.00/0.08	
0.00/0.08	Proving termination of subgraph 0
0.00/0.08	Proving termination of subgraph 1
0.00/0.08	Checking unfeasibility...
0.00/0.08	Time used: 0.026902
0.00/0.08	
0.00/0.08	Checking conditional termination of SCC {l3}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.005337s
0.00/0.08	Ranking function: -1 - 4*c^0 + y^0
0.00/0.08	New Graphs: 
0.00/0.08	Transitions:
0.00/0.08	<l3, l3, 1 <= c^0 /\ 1 <= x^0 /\ 1 <= y^0, {y^0 -> -1 + y^0, rest remain the same}>
0.00/0.08	<l3, l3, c^0 <= 0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> -1 + x^0, rest remain the same}>
0.00/0.08	<l3, l3, 1 <= c^0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> -1 + x^0, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	c^0, x^0, y^0
0.00/0.08	Checking conditional termination of SCC {l3}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.001776s
0.00/0.08	Ranking function: -4 + 3*c^0 + y^0
0.00/0.08	New Graphs: 
0.00/0.08	Transitions:
0.00/0.08	<l3, l3, c^0 <= 0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> -1 + x^0, rest remain the same}>
0.00/0.08	<l3, l3, 1 <= c^0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> -1 + x^0, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	c^0, x^0, y^0
0.00/0.08	Checking conditional termination of SCC {l3}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.001306s
0.00/0.08	Ranking function: -4 + 3*c^0 + x^0
0.00/0.08	New Graphs: 
0.00/0.08	Transitions:
0.00/0.08	<l3, l3, c^0 <= 0 /\ 1 <= x^0 /\ 1 <= y^0, {x^0 -> -1 + x^0, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	c^0, x^0, y^0
0.00/0.08	Checking conditional termination of SCC {l3}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.000812s
0.00/0.08	Ranking function: -1 + x^0
0.00/0.08	New Graphs: 
0.00/0.08	Proving termination of subgraph 2
0.00/0.08	Analyzing SCC {l2}...
0.00/0.08	No cycles found.
0.00/0.08	
0.00/0.08	Program Terminates
0.00/0.08	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.08	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.08	EOF