0.00/0.02	YES
0.00/0.02	
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	<l3, l2, ((0 + z^0) <= (0 + y^0)), par{x^0 -> (1 + x^0)}>
0.00/0.03	<l3, l4, ((1 + y^0) <= (0 + z^0)), par{y^0 -> (1 + y^0)}>
0.00/0.03	<l4, l3, true>
0.00/0.03	<l2, l3, ((1 + x^0) <= (0 + y^0))>
0.00/0.03	<l5, l1, true>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	
0.00/0.03	Undef variables:
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, l3, ((1 + x^0) <= (0 + y^0))>
0.00/0.03	<l3, l3, ((0 + z^0) <= (0 + y^0)) /\ ((1 + (1 + x^0)) <= (0 + y^0)), par{x^0 -> (1 + x^0)}>
0.00/0.03	<l3, l3, ((1 + y^0) <= (0 + z^0)), par{y^0 -> (1 + y^0)}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	
0.00/0.03	Undef variables:
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	<l3, l3, z^0 <= y^0 /\ 2 + x^0 <= y^0, {x^0 -> 1 + x^0, rest remain the same}>
0.00/0.03	<l3, l3, 1 + y^0 <= z^0, {y^0 -> 1 + y^0, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	x^0, y^0, z^0
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, l3, 1 + x^0 <= y^0, {all 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	( 3 , 1 )
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.00489
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l3}...
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.001188s
0.00/0.03	Ranking function: -5 - 5*y^0 + 5*z^0
0.00/0.03	New Graphs: 
0.00/0.03	Transitions:
0.00/0.03	<l3, l3, z^0 <= y^0 /\ 2 + x^0 <= y^0, {x^0 -> 1 + x^0, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	x^0, y^0, z^0
0.00/0.03	Checking conditional termination of SCC {l3}...
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.000664s
0.00/0.03	Ranking function: -2 - x^0 + y^0
0.00/0.03	New Graphs: 
0.00/0.03	Program Terminates
0.00/0.03	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.03	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.03	EOF