12.24/12.30	NO
12.24/12.30	
12.28/12.30	Solver Timeout: 4
12.28/12.30	Global Timeout: 300
12.28/12.30	No parsing errors!
12.28/12.30	Init Location: 0
12.28/12.30	Transitions:
12.28/12.30	<l0, l9, true>
12.28/12.30	<l1, l2, true>
12.28/12.30	<l3, l4, true>
12.28/12.30	<l5, l6, true>
12.28/12.30	<l6, l5, true>
12.28/12.30	<l7, l1, ((0 + ___rho_1_^0) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(1) + curr_serv^0)}>
12.28/12.30	<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)}>
12.28/12.30	<l2, l7, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37), par{___rho_1_^0 -> undef37}>
12.28/12.30	<l2, l5, ((0 + curr_serv^0) <= 0)>
12.28/12.30	<l8, l1, (undef50 = undef50) /\ (undef51 = (0 + undef50)) /\ (1 <= (0 + undef51)) /\ (undef54 = 4), par{___rho_2_^0 -> undef50, c^0 -> undef51, curr_serv^0 -> (0 + undef54), resp^0 -> 0, servers^0 -> undef54}>
12.28/12.30	<l9, l8, true>
12.28/12.30	
12.28/12.30	Fresh variables:
12.28/12.30	undef37, undef50, undef51, undef54, 
12.28/12.30	
12.28/12.30	Undef variables:
12.28/12.30	undef37, undef50, undef51, undef54, 
12.28/12.30	
12.28/12.30	Abstraction variables:
12.28/12.30	
12.28/12.30	Exit nodes:
12.28/12.30	
12.28/12.30	Accepting locations:
12.28/12.30	
12.28/12.30	Asserts:
12.28/12.30	
12.28/12.30	Preprocessed LLVMGraph
12.28/12.30	Init Location: 0
12.28/12.30	Transitions:
12.28/12.30	<l0, l1, (c^0 = undef51) /\ (curr_serv^0 = (0 + undef54)) /\ (resp^0 = 0) /\ (undef50 = undef50) /\ (undef51 = (0 + undef50)) /\ (1 <= (0 + undef51)) /\ (undef54 = 4)>
12.28/12.30	<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)}>
12.28/12.30	<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)}>
12.28/12.30	<l1, l5, ((0 + curr_serv^0) <= 0)>
12.28/12.30	<l5, l5, true>
12.28/12.30	
12.28/12.30	Fresh variables:
12.28/12.30	undef37, undef50, undef51, undef54, 
12.28/12.30	
12.28/12.30	Undef variables:
12.28/12.30	undef37, undef50, undef51, undef54, 
12.28/12.30	
12.28/12.30	Abstraction variables:
12.28/12.30	
12.28/12.30	Exit nodes:
12.28/12.30	
12.28/12.30	Accepting locations:
12.28/12.30	
12.28/12.30	Asserts:
12.28/12.30	
12.28/12.30	*************************************************************
12.28/12.30	*******************************************************************************************
12.28/12.30	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
12.28/12.30	*******************************************************************************************
12.28/12.30	
12.28/12.30	Init Location: 0
12.28/12.30	Graph 0:
12.28/12.30	Transitions:
12.28/12.30	Variables:
12.28/12.30	
12.28/12.30	Graph 1:
12.28/12.30	Transitions:
12.28/12.30	<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}>
12.28/12.30	<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}>
12.28/12.30	Variables:
12.28/12.30	c^0, curr_serv^0, resp^0
12.28/12.30	
12.28/12.30	Graph 2:
12.28/12.30	Transitions:
12.28/12.30	<l5, l5, true, {all remain the same}>
12.28/12.30	Variables:
12.28/12.30	
12.28/12.30	Precedence: 
12.28/12.30	Graph 0
12.28/12.30	
12.28/12.30	Graph 1
12.28/12.30	<l0, l1, 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.28/12.30	
12.28/12.30	Graph 2
12.28/12.30	<l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.28/12.30	
12.28/12.30	Map Locations to Subgraph:
12.28/12.30	( 0 , 0 )
12.28/12.30	( 1 , 1 )
12.28/12.30	( 5 , 2 )
12.28/12.30	
12.28/12.30	*******************************************************************************************
12.28/12.30	********************************    CHECKING ASSERTIONS    ********************************
12.28/12.30	*******************************************************************************************
12.28/12.30	
12.28/12.30	Proving termination of subgraph 0
12.28/12.31	Proving termination of subgraph 1
12.28/12.31	Checking unfeasibility...
12.28/12.31	Time used: 0.006258
12.28/12.31	
12.28/12.31	Checking conditional termination of SCC {l1}...
12.28/12.31	
12.28/12.31	LOG: CALL solveLinear
12.28/12.31	
12.28/12.31	LOG: RETURN solveLinear - Elapsed time: 0.001372s
12.28/12.31	Ranking function: -1 - c^0 + curr_serv^0
12.28/12.31	New Graphs: 
12.28/12.31	Transitions:
12.28/12.31	<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}>
12.28/12.31	Variables:
12.28/12.31	c^0, curr_serv^0, resp^0
12.28/12.31	Checking conditional termination of SCC {l1}...
12.28/12.31	
12.28/12.31	LOG: CALL solveLinear
12.28/12.31	
12.28/12.31	LOG: RETURN solveLinear - Elapsed time: 0.000706s
12.28/12.31	Ranking function: -1 + curr_serv^0
12.28/12.31	New Graphs: 
12.28/12.31	Proving termination of subgraph 2
12.28/12.31	Checking unfeasibility...
12.28/12.31	Time used: 0.000854
12.28/12.31	
12.28/12.31	> No variable changes in termination graph.
12.28/12.31	Checking conditional unfeasibility...
12.28/12.31	Termination failed. Trying to show unreachability...
12.28/12.31	Proving unreachability of entry: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.28/12.31	
12.28/12.31	LOG: CALL check - Post:1 <= 0 - Process 1
12.28/12.31	* Exit transition: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.28/12.31	* Postcondition  : 1 <= 0
12.28/12.31	Postcodition moved up: 1 <= 0
12.28/12.31	
12.28/12.31	LOG: Try proving POST
12.28/12.31	Postcondition: 1 <= 0
12.28/12.31	
12.28/12.31	LOG: CALL check - Post:1 <= 0 - Process 2
12.28/12.31	* Exit transition: <l0, l1, 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.28/12.31	* Postcondition  : 1 <= 0
12.28/12.31	
12.28/12.31	LOG: CALL solveLinear
12.28/12.31	
12.28/12.31	LOG: RETURN solveLinear - Elapsed time: 0.000638s
12.28/12.31	> Postcondition is not implied!
12.28/12.31	
12.28/12.31	LOG: RETURN check - Elapsed time: 0.000754s
12.28/12.31	
12.28/12.31	LOG: NarrowEntry size 1
12.28/12.31	Narrowing transition: 
12.28/12.31	<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}>
12.28/12.31	
12.28/12.31	LOG: Narrow transition size 1
12.28/12.31	Narrowing transition: 
12.28/12.31	<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}>
12.28/12.31	
12.28/12.31	LOG: Narrow transition size 1
12.28/12.31	ENTRIES:
12.28/12.31	<l0, l1, 0 <= 0 /\ 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.28/12.31	END ENTRIES:
12.28/12.31	GRAPH:
12.28/12.31	<l1, l1, 0 <= 0 /\ undef37 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -1 + curr_serv^0, rest remain the same}>
12.28/12.31	<l1, l1, 0 <= 0 /\ 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}>
12.28/12.31	END GRAPH:
12.28/12.31	EXIT: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.28/12.31	POST: 1 <= 0
12.28/12.31	
12.28/12.31	
12.28/12.31	LOG: Try proving POST
12.28/12.31	Solving with 1 template(s).
12.28/12.31	
12.28/12.31	LOG: CALL solveNonLinearGetFirstSolution
12.28/12.31	
12.28/12.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011355s
12.28/12.31	Time used: 0.011159
12.28/12.31	Improving Solution with cost 51 ...
12.28/12.31	
12.28/12.31	LOG: CALL solveNonLinearGetNextSolution
12.28/12.31	
12.28/12.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.027197s
12.28/12.31	Time used: 0.027189
12.28/12.31	
12.28/12.31	LOG: SAT solveNonLinear - Elapsed time: 0.038552s
12.28/12.31	Cost: 51; Total time: 0.038348
12.28/12.31	Failed at location 1: curr_serv^0 <= c^0
12.28/12.31	Before Improving: 
12.28/12.31	Quasi-invariant at l1: curr_serv^0 <= c^0
12.28/12.31	Optimizing invariants...
12.28/12.31	
12.28/12.31	LOG: CALL solveLinear
12.28/12.31	
12.28/12.31	LOG: RETURN solveLinear - Elapsed time: 0.002412s
12.28/12.31	Remaining time after improvement: 0.998879
12.28/12.31	Some transition disabled by a set of quasi-invariant(s):
12.28/12.31	Quasi-invariant at l1: curr_serv^0 <= c^0
12.28/12.31	
12.28/12.31	LOG: NEXT CALL check - disable
12.28/12.31	
12.28/12.31	LOG: CALL check - Post:curr_serv^0 <= c^0 - Process 3
12.28/12.31	* Exit transition: <l0, l1, 0 <= 0 /\ 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.28/12.31	* Postcondition  : curr_serv^0 <= c^0
12.28/12.31	
12.28/12.31	LOG: CALL solveLinear
12.28/12.31	
12.28/12.31	LOG: RETURN solveLinear - Elapsed time: 0.000845s
12.28/12.31	> Postcondition is not implied!
12.28/12.31	
12.28/12.31	LOG: RETURN check - Elapsed time: 0.000979s
12.28/12.31	Solving with 2 template(s).
12.28/12.31	
12.28/12.31	LOG: CALL solveNonLinearGetFirstSolution
12.28/12.31	
12.28/12.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.077577s
12.28/12.31	Time used: 0.077278
12.28/12.31	Improving Solution with cost 51 ...
12.28/12.31	
12.28/12.31	LOG: CALL solveNonLinearGetNextSolution
12.28/12.31	
12.28/12.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000647s
12.28/12.31	Time used: 1.00048
12.28/12.31	
12.28/12.31	LOG: SAT solveNonLinear - Elapsed time: 1.078224s
12.28/12.31	Cost: 51; Total time: 1.07776
12.28/12.31	Failed at location 1: 1 + curr_serv^0 <= c^0
12.28/12.31	Before Improving: 
12.28/12.31	Quasi-invariant at l1: 1 + curr_serv^0 <= c^0
12.28/12.31	Optimizing invariants...
12.28/12.31	
12.28/12.31	LOG: CALL solveLinear
12.28/12.31	
12.28/12.31	LOG: RETURN solveLinear - Elapsed time: 0.008231s
12.28/12.31	Remaining time after improvement: 0.998153
12.28/12.31	Some transition disabled by a set of quasi-invariant(s):
12.28/12.31	Quasi-invariant at l1: 1 + curr_serv^0 <= c^0
12.28/12.31	
12.28/12.31	LOG: NEXT CALL check - disable
12.28/12.31	
12.28/12.31	LOG: CALL check - Post:1 + curr_serv^0 <= c^0 - Process 4
12.28/12.31	* Exit transition: <l0, l1, 0 <= 0 /\ 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.28/12.31	* Postcondition  : 1 + curr_serv^0 <= c^0
12.28/12.31	
12.28/12.31	LOG: CALL solveLinear
12.28/12.31	
12.28/12.31	LOG: RETURN solveLinear - Elapsed time: 0.001032s
12.28/12.31	> Postcondition is not implied!
12.28/12.31	
12.28/12.31	LOG: RETURN check - Elapsed time: 0.001168s
12.28/12.31	Solving with 3 template(s).
12.28/12.31	
12.28/12.31	LOG: CALL solveNonLinearGetFirstSolution
12.28/12.31	
12.28/12.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.696597s
12.28/12.31	Time used: 0.696145
12.28/12.31	Improving Solution with cost 51 ...
12.28/12.31	
12.28/12.31	LOG: CALL solveNonLinearGetNextSolution
12.28/12.31	
12.28/12.31	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.304555s
12.28/12.31	Time used: 0.304539
12.28/12.31	
12.28/12.31	LOG: SAT solveNonLinear - Elapsed time: 1.001152s
12.28/12.31	Cost: 51; Total time: 1.00068
12.28/12.31	Failed at location 1: 1 + curr_serv^0 <= c^0
12.28/12.31	Before Improving: 
12.28/12.31	Quasi-invariant at l1: 0 <= 1 + c^0
12.28/12.31	Quasi-invariant at l1: 1 <= c^0
12.28/12.31	Quasi-invariant at l1: 1 + curr_serv^0 <= c^0
12.28/12.31	Optimizing invariants...
12.28/12.31	
12.28/12.31	LOG: CALL solveLinear
12.28/12.31	
12.28/12.31	LOG: RETURN solveLinear - Elapsed time: 0.040369s
12.28/12.31	Remaining time after improvement: 0.997327
12.28/12.31	Some transition disabled by a set of quasi-invariant(s):
12.28/12.31	Quasi-invariant at l1: 0 <= 1 + c^0
12.28/12.31	Quasi-invariant at l1: 1 <= c^0
12.28/12.31	Quasi-invariant at l1: 1 + curr_serv^0 <= c^0
12.28/12.31	
12.28/12.31	LOG: NEXT CALL check - disable
12.28/12.31	
12.28/12.31	LOG: CALL check - Post:1 + curr_serv^0 <= c^0 - Process 5
12.28/12.31	* Exit transition: <l0, l1, 0 <= 0 /\ 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.28/12.31	* Postcondition  : 1 + curr_serv^0 <= c^0
12.28/12.31	
12.28/12.31	LOG: CALL solveLinear
12.28/12.31	
12.28/12.31	LOG: RETURN solveLinear - Elapsed time: 0.001429s
12.28/12.31	> Postcondition is not implied!
12.28/12.31	
12.28/12.31	LOG: RETURN check - Elapsed time: 0.001564s
12.28/12.31	
12.28/12.31	LOG: Postcondition is not implied - no solution
12.28/12.31	> Postcondition is not implied!
12.28/12.31	
12.28/12.31	LOG: RETURN check - Elapsed time: 2.185566s
12.28/12.31	Cannot prove unreachability
12.28/12.31	
12.28/12.31	Proving non-termination of subgraph 2
12.28/12.31	Transitions:
12.28/12.31	<l5, l5, true, {all remain the same}>
12.28/12.31	Variables:
12.28/12.31	
12.28/12.31	Checking conditional non-termination of SCC {l5}...
12.28/12.31	> No exit transition to close.
12.28/12.31	Calling reachability with...
12.28/12.31	Transition: <l5, end, true, {all remain the same}>
12.28/12.31	Conditions: 
12.28/12.31	OPEN EXITS: 
12.28/12.31	<l5, end, true, {all remain the same}>
12.28/12.31	
12.28/12.31	--- Reachability graph ---
12.28/12.31	> Graph without transitions.
12.28/12.31	
12.28/12.31	Calling reachability with...
12.28/12.31	Transition: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.28/12.31	Conditions: 
12.28/12.31	OPEN EXITS: 
12.28/12.31	<l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.28/12.31	
12.28/12.31	--- Reachability graph ---
12.28/12.31	> Graph without transitions.
12.28/12.31	
12.28/12.31	Calling reachability with...
12.28/12.31	Transition: <l0, l1, 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.28/12.31	Conditions: curr_serv^0 <= 0, 
12.28/12.31	OPEN EXITS: 
12.28/12.31	
12.28/12.31	> Conditions are not feasible after transitions.
12.28/12.31	--- Reachability graph ---
12.28/12.31	Transitions:
12.28/12.31	<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}>
12.28/12.31	Variables:
12.28/12.31	c^0, curr_serv^0
12.28/12.31	Checking edge-closing of SCC {l1}...
12.28/12.31	EXIT TRANSITIONS (TO CLOSE):
12.28/12.31	<l1, end, curr_serv^0 <= c^0 /\ 1 <= curr_serv^0, {all remain the same}>
12.28/12.31	
12.28/12.31	Solving with 1 template(s).
12.28/12.31	
12.28/12.31	LOG: CALL solveNonLinearGetFirstSolution
12.28/12.31	
12.28/12.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023812s
12.28/12.31	Time used: 0.02371
12.28/12.31	Solving with 2 template(s).
12.28/12.31	
12.28/12.31	LOG: CALL solveNonLinearGetFirstSolution
12.28/12.31	
12.28/12.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.001640s
12.28/12.31	Time used: 5.00055
12.28/12.31	Solving with 3 template(s).
12.28/12.31	
12.28/12.31	LOG: CALL solveNonLinearGetFirstSolution
12.28/12.31	
12.28/12.31	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.004612s
12.28/12.31	Time used: 5.00078
12.28/12.31	> No quasi-invariants that block all exits have been found.
12.28/12.31	--- Reachability graph ---
12.28/12.31	Transitions:
12.28/12.31	<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}>
12.28/12.31	Variables:
12.28/12.31	c^0, curr_serv^0, resp^0
12.28/12.31	Checking edge-closing of SCC {l1}...
12.28/12.31	> No exit transition to close.
12.28/12.31	Checking conditional termination of SCC {l1}...
12.28/12.31	
12.28/12.31	LOG: CALL solveLinear
12.28/12.31	
12.28/12.31	LOG: RETURN solveLinear - Elapsed time: 0.001022s
12.28/12.31	Ranking function: -1 + curr_serv^0
12.28/12.31	New Graphs: 
12.28/12.31	Calling reachability with...
12.28/12.31	Transition: <l0, l1, 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.28/12.31	Conditions: 
12.28/12.31	OPEN EXITS: 
12.28/12.31	<l0, l1, 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.28/12.31	
12.28/12.31	> Conditions are reachable!
12.28/12.31	
12.28/12.31	Program does NOT terminate
12.28/12.31	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
12.28/12.31	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
12.28/12.31	EOF