0.00/0.04	YES
0.00/0.04	
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, l4, true>
0.00/0.04	<l1, l2, ((1 + p^0) <= (0 + c^0)), par{p^0 -> (0 + s^0), s^0 -> (1 + s^0)}>
0.00/0.04	<l2, l1, true>
0.00/0.04	<l3, l1, true, par{p^0 -> 1, s^0 -> 1}>
0.00/0.04	<l4, l3, true>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	
0.00/0.04	Undef variables:
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, l1, (p^0 = 1) /\ (s^0 = 1)>
0.00/0.04	<l1, l1, ((1 + p^0) <= (0 + c^0)), par{p^0 -> (0 + s^0), s^0 -> (1 + s^0)}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	
0.00/0.04	Undef variables:
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	<l1, l1, 1 + p^0 <= c^0, {p^0 -> s^0, s^0 -> 1 + s^0, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	c^0, p^0, s^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, l1, p^0 = 1 /\ s^0 = 1, {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	( 1 , 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.0025
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l1}...
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.000661s
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.001805s
0.00/0.04	Trying to remove transition: <l1, l1, 1 + p^0 <= c^0, {p^0 -> s^0, s^0 -> 1 + s^0, rest remain the same}>
0.00/0.04	Solving with 1 template(s).
0.00/0.04	
0.00/0.04	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.04	
0.00/0.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007359s
0.00/0.04	Time used: 0.007193
0.00/0.04	Solving with 1 template(s).
0.00/0.04	
0.00/0.04	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.04	
0.00/0.04	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009066s
0.00/0.04	Time used: 0.008678
0.00/0.04	
0.00/0.04	LOG: SAT solveNonLinear - Elapsed time: 0.009066s
0.00/0.04	Cost: 0; Total time: 0.008678
0.00/0.04	Termination implied by a set of invariant(s):
0.00/0.04	Invariant at l1: s^0 <= 1 + p^0
0.00/0.04	[ Invariant Graph ]
0.00/0.04	Strengthening and disabling transitions...
0.00/0.04	
0.00/0.04	LOG: CALL solverLinear in Graph for feasibility
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.04	Strengthening transition (result): 
0.00/0.04	<l1, l1, 1 + p^0 <= c^0 /\ s^0 <= 1 + p^0, {p^0 -> s^0, s^0 -> 1 + s^0, rest remain the same}>
0.00/0.04	[ Termination Graph ]
0.00/0.04	Strengthening and disabling transitions...
0.00/0.04	
0.00/0.04	LOG: CALL solverLinear in Graph for feasibility
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.04	Strengthening transition (result): 
0.00/0.04	<l1, l1, 1 + p^0 <= c^0 /\ s^0 <= 1 + p^0, {p^0 -> s^0, s^0 -> 1 + s^0, rest remain the same}>
0.00/0.04	Ranking function: 1 + c^0 - s^0
0.00/0.04	New Graphs: 
0.00/0.04	INVARIANTS: 
0.00/0.04	1: s^0 <= 1 + p^0 , 
0.00/0.04	Quasi-INVARIANTS to narrow Graph: 
0.00/0.04	1: 
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