0.00/0.04	NO
0.00/0.04	
0.00/0.05	Solver Timeout: 4
0.00/0.05	Global Timeout: 300
0.00/0.05	No parsing errors!
0.00/0.05	Init Location: 0
0.00/0.05	Transitions:
0.00/0.05	<l0, l10, true>
0.00/0.05	<l1, l2, true>
0.00/0.05	<l3, l4, true>
0.00/0.05	<l5, l6, true>
0.00/0.05	<l6, l5, true>
0.00/0.05	<l7, l1, ((0 + ___rho_1_^0) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(1) + curr_serv^0)}>
0.00/0.05	<l7, l1, (1 <= (0 + ___rho_1_^0)), par{c^0 -> (~(1) + c^0), curr_serv^0 -> (~(1) + curr_serv^0), resp^0 -> (1 + resp^0)}>
0.00/0.05	<l2, l7, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37), par{___rho_1_^0 -> undef37}>
0.00/0.05	<l2, l5, ((0 + curr_serv^0) <= 0)>
0.00/0.05	<l8, l5, (6 <= (0 + c^0))>
0.00/0.05	<l8, l1, ((0 + c^0) <= 5)>
0.00/0.05	<l9, l8, (undef62 = undef62) /\ (undef63 = (0 + undef62)) /\ (1 <= (0 + undef63)) /\ (undef66 = 4), par{___rho_2_^0 -> undef62, c^0 -> undef63, curr_serv^0 -> (0 + undef66), resp^0 -> 0, servers^0 -> undef66}>
0.00/0.05	<l10, l9, true>
0.00/0.05	
0.00/0.05	Fresh variables:
0.00/0.05	undef37, undef62, undef63, undef66, 
0.00/0.05	
0.00/0.05	Undef variables:
0.00/0.05	undef37, undef62, undef63, undef66, 
0.00/0.05	
0.00/0.05	Abstraction variables:
0.00/0.05	
0.00/0.05	Exit nodes:
0.00/0.05	
0.00/0.05	Accepting locations:
0.00/0.05	
0.00/0.05	Asserts:
0.00/0.05	
0.00/0.05	Preprocessed LLVMGraph
0.00/0.05	Init Location: 0
0.00/0.05	Transitions:
0.00/0.05	<l0, l5, (c^0 = undef63) /\ (curr_serv^0 = (0 + undef66)) /\ (resp^0 = 0) /\ (undef62 = undef62) /\ (undef63 = (0 + undef62)) /\ (1 <= (0 + undef63)) /\ (undef66 = 4) /\ (6 <= (0 + undef63))>
0.00/0.05	<l0, l1, (c^0 = undef63) /\ (curr_serv^0 = (0 + undef66)) /\ (resp^0 = 0) /\ (undef62 = undef62) /\ (undef63 = (0 + undef62)) /\ (1 <= (0 + undef63)) /\ (undef66 = 4) /\ ((0 + undef63) <= 5)>
0.00/0.05	<l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37) /\ ((0 + undef37) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(1) + curr_serv^0)}>
0.00/0.05	<l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37) /\ (1 <= (0 + undef37)), par{c^0 -> (~(1) + c^0), curr_serv^0 -> (~(1) + curr_serv^0), resp^0 -> (1 + resp^0)}>
0.00/0.05	<l1, l5, ((0 + curr_serv^0) <= 0)>
0.00/0.05	<l5, l5, true>
0.00/0.05	
0.00/0.05	Fresh variables:
0.00/0.05	undef37, undef62, undef63, undef66, 
0.00/0.05	
0.00/0.05	Undef variables:
0.00/0.05	undef37, undef62, undef63, undef66, 
0.00/0.05	
0.00/0.05	Abstraction variables:
0.00/0.05	
0.00/0.05	Exit nodes:
0.00/0.05	
0.00/0.05	Accepting locations:
0.00/0.05	
0.00/0.05	Asserts:
0.00/0.05	
0.00/0.05	*************************************************************
0.00/0.05	*******************************************************************************************
0.00/0.05	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.05	*******************************************************************************************
0.00/0.05	
0.00/0.05	Init Location: 0
0.00/0.05	Graph 0:
0.00/0.05	Transitions:
0.00/0.05	Variables:
0.00/0.05	
0.00/0.05	Graph 1:
0.00/0.05	Transitions:
0.00/0.05	<l1, l1, undef37 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -1 + curr_serv^0, rest remain the same}>
0.00/0.05	<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef37, {c^0 -> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
0.00/0.05	Variables:
0.00/0.05	c^0, curr_serv^0, resp^0
0.00/0.05	
0.00/0.05	Graph 2:
0.00/0.05	Transitions:
0.00/0.05	<l5, l5, true, {all remain the same}>
0.00/0.05	Variables:
0.00/0.05	
0.00/0.05	Precedence: 
0.00/0.05	Graph 0
0.00/0.05	
0.00/0.05	Graph 1
0.00/0.05	<l0, l1, 1 <= undef63 /\ undef63 <= 5 /\ c^0 = undef63 /\ curr_serv^0 = undef66 /\ resp^0 = 0 /\ undef62 = undef63 /\ undef66 = 4, {all remain the same}>
0.00/0.05	
0.00/0.05	Graph 2
0.00/0.05	<l0, l5, 6 <= undef63 /\ c^0 = undef63 /\ curr_serv^0 = undef66 /\ resp^0 = 0 /\ undef62 = undef63 /\ undef66 = 4, {all remain the same}>
0.00/0.05	<l1, l5, curr_serv^0 <= 0, {all remain the same}>
0.00/0.05	
0.00/0.05	Map Locations to Subgraph:
0.00/0.05	( 0 , 0 )
0.00/0.05	( 1 , 1 )
0.00/0.05	( 5 , 2 )
0.00/0.05	
0.00/0.05	*******************************************************************************************
0.00/0.05	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.05	*******************************************************************************************
0.00/0.05	
0.00/0.05	Proving termination of subgraph 0
0.00/0.05	Proving termination of subgraph 1
0.00/0.05	Checking unfeasibility...
0.00/0.05	Time used: 0.006157
0.00/0.05	
0.00/0.05	Checking conditional termination of SCC {l1}...
0.00/0.05	
0.00/0.05	LOG: CALL solveLinear
0.00/0.05	
0.00/0.05	LOG: RETURN solveLinear - Elapsed time: 0.001346s
0.00/0.05	Ranking function: -1 - c^0 + curr_serv^0
0.00/0.05	New Graphs: 
0.00/0.05	Transitions:
0.00/0.05	<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef37, {c^0 -> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
0.00/0.05	Variables:
0.00/0.05	c^0, curr_serv^0, resp^0
0.00/0.05	Checking conditional termination of SCC {l1}...
0.00/0.05	
0.00/0.05	LOG: CALL solveLinear
0.00/0.05	
0.00/0.05	LOG: RETURN solveLinear - Elapsed time: 0.000713s
0.00/0.05	Ranking function: -1 + curr_serv^0
0.00/0.05	New Graphs: 
0.00/0.05	Proving termination of subgraph 2
0.00/0.05	Checking unfeasibility...
0.00/0.05	Time used: 0.000946
0.00/0.05	
0.00/0.05	> No variable changes in termination graph.
0.00/0.05	Checking conditional unfeasibility...
0.00/0.05	Termination failed. Trying to show unreachability...
0.00/0.05	Proving unreachability of entry: <l0, l5, 6 <= undef63 /\ c^0 = undef63 /\ curr_serv^0 = undef66 /\ resp^0 = 0 /\ undef62 = undef63 /\ undef66 = 4, {all remain the same}>
0.00/0.05	
0.00/0.05	LOG: CALL check - Post:1 <= 0 - Process 1
0.00/0.05	* Exit transition: <l0, l5, 6 <= undef63 /\ c^0 = undef63 /\ curr_serv^0 = undef66 /\ resp^0 = 0 /\ undef62 = undef63 /\ undef66 = 4, {all remain the same}>
0.00/0.05	* Postcondition  : 1 <= 0
0.00/0.05	
0.00/0.05	LOG: CALL solveLinear
0.00/0.05	
0.00/0.05	LOG: RETURN solveLinear - Elapsed time: 0.000676s
0.00/0.05	> Postcondition is not implied!
0.00/0.05	
0.00/0.05	LOG: RETURN check - Elapsed time: 0.000803s
0.00/0.05	Cannot prove unreachability
0.00/0.05	
0.00/0.05	Proving non-termination of subgraph 2
0.00/0.05	Transitions:
0.00/0.05	<l5, l5, true, {all remain the same}>
0.00/0.05	Variables:
0.00/0.05	
0.00/0.05	Checking conditional non-termination of SCC {l5}...
0.00/0.05	> No exit transition to close.
0.00/0.05	Calling reachability with...
0.00/0.05	Transition: <l5, end, true, {all remain the same}>
0.00/0.05	Conditions: 
0.00/0.05	Transition: <l5, end, true, {all remain the same}>
0.00/0.05	Conditions: 
0.00/0.05	OPEN EXITS: 
0.00/0.05	<l5, end, true, {all remain the same}>
0.00/0.05	<l5, end, true, {all remain the same}>
0.00/0.05	
0.00/0.05	--- Reachability graph ---
0.00/0.05	> Graph without transitions.
0.00/0.05	
0.00/0.05	Calling reachability with...
0.00/0.05	Transition: <l0, l5, 6 <= undef63 /\ c^0 = undef63 /\ curr_serv^0 = undef66 /\ resp^0 = 0 /\ undef62 = undef63 /\ undef66 = 4, {all remain the same}>
0.00/0.05	Conditions: 
0.00/0.05	Transition: <l0, l5, 6 <= undef63 /\ c^0 = undef63 /\ curr_serv^0 = undef66 /\ resp^0 = 0 /\ undef62 = undef63 /\ undef66 = 4, {all remain the same}>
0.00/0.05	Conditions: 
0.00/0.05	OPEN EXITS: 
0.00/0.05	<l0, l5, 6 <= undef63 /\ c^0 = undef63 /\ curr_serv^0 = undef66 /\ resp^0 = 0 /\ undef62 = undef63 /\ undef66 = 4, {all remain the same}>
0.00/0.05	<l0, l5, 6 <= undef63 /\ c^0 = undef63 /\ curr_serv^0 = undef66 /\ resp^0 = 0 /\ undef62 = undef63 /\ undef66 = 4, {all remain the same}>
0.00/0.05	
0.00/0.05	> Conditions are reachable!
0.00/0.05	
0.00/0.05	Program does NOT terminate
0.00/0.05	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.05	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.05	EOF