3.19/3.20	NO
3.19/3.20	
3.19/3.20	Solver Timeout: 4
3.19/3.20	Global Timeout: 300
3.19/3.20	No parsing errors!
3.19/3.20	Init Location: 0
3.19/3.20	Transitions:
3.19/3.20	<l0, l9, true>
3.19/3.20	<l1, l2, true>
3.19/3.20	<l3, l4, true>
3.19/3.20	<l5, l6, true>
3.19/3.20	<l6, l5, true>
3.19/3.20	<l7, l1, ((0 + __rho_1_^0) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(1) + curr_serv^0)}>
3.19/3.20	<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)}>
3.19/3.20	<l2, l7, (1 <= (0 + curr_serv^0)) /\ (undef38 = undef38), par{__rho_1_^0 -> undef38}>
3.19/3.20	<l2, l5, ((0 + curr_serv^0) <= 0)>
3.19/3.20	<l8, l1, (undef51 = undef51) /\ (1 <= (0 + undef51)) /\ (undef54 = (0 + __const_8^0)), par{c^0 -> undef51, curr_serv^0 -> (0 + undef54), resp^0 -> 0, servers^0 -> undef54}>
3.19/3.20	<l9, l8, true>
3.19/3.20	
3.19/3.20	Fresh variables:
3.19/3.20	undef38, undef51, undef54, 
3.19/3.20	
3.19/3.20	Undef variables:
3.19/3.20	undef38, undef51, undef54, 
3.19/3.20	
3.19/3.20	Abstraction variables:
3.19/3.20	
3.19/3.20	Exit nodes:
3.19/3.20	
3.19/3.20	Accepting locations:
3.19/3.20	
3.19/3.20	Asserts:
3.19/3.20	
3.19/3.20	Preprocessed LLVMGraph
3.19/3.20	Init Location: 0
3.19/3.20	Transitions:
3.19/3.20	<l0, l1, (c^0 = undef51) /\ (curr_serv^0 = (0 + undef54)) /\ (resp^0 = 0) /\ (undef51 = undef51) /\ (1 <= (0 + undef51)) /\ (undef54 = (0 + __const_8^0))>
3.19/3.20	<l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef38 = undef38) /\ ((0 + undef38) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(1) + curr_serv^0)}>
3.19/3.20	<l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef38 = undef38) /\ (1 <= (0 + undef38)), par{c^0 -> (~(1) + c^0), curr_serv^0 -> (~(1) + curr_serv^0), resp^0 -> (1 + resp^0)}>
3.19/3.20	<l1, l5, ((0 + curr_serv^0) <= 0)>
3.19/3.20	<l5, l5, true>
3.19/3.20	
3.19/3.20	Fresh variables:
3.19/3.20	undef38, undef51, undef54, 
3.19/3.20	
3.19/3.20	Undef variables:
3.19/3.20	undef38, undef51, undef54, 
3.19/3.20	
3.19/3.20	Abstraction variables:
3.19/3.20	
3.19/3.20	Exit nodes:
3.19/3.20	
3.19/3.20	Accepting locations:
3.19/3.20	
3.19/3.20	Asserts:
3.19/3.20	
3.19/3.20	*************************************************************
3.19/3.20	*******************************************************************************************
3.19/3.20	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
3.19/3.20	*******************************************************************************************
3.19/3.20	
3.19/3.20	Init Location: 0
3.19/3.20	Graph 0:
3.19/3.20	Transitions:
3.19/3.20	Variables:
3.19/3.20	
3.19/3.20	Graph 1:
3.19/3.20	Transitions:
3.19/3.20	<l1, l1, undef38 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -1 + curr_serv^0, rest remain the same}>
3.19/3.20	<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef38, {c^0 -> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
3.19/3.20	Variables:
3.19/3.20	c^0, curr_serv^0, resp^0
3.19/3.20	
3.19/3.20	Graph 2:
3.19/3.20	Transitions:
3.19/3.20	<l5, l5, true, {all remain the same}>
3.19/3.20	Variables:
3.19/3.20	
3.19/3.20	Precedence: 
3.19/3.20	Graph 0
3.19/3.20	
3.19/3.20	Graph 1
3.19/3.20	<l0, l1, 1 <= undef51 /\ __const_8^0 = undef54 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0, {all remain the same}>
3.19/3.20	
3.19/3.20	Graph 2
3.19/3.20	<l1, l5, curr_serv^0 <= 0, {all remain the same}>
3.19/3.20	
3.19/3.20	Map Locations to Subgraph:
3.19/3.20	( 0 , 0 )
3.19/3.20	( 1 , 1 )
3.19/3.20	( 5 , 2 )
3.19/3.20	
3.19/3.20	*******************************************************************************************
3.19/3.20	********************************    CHECKING ASSERTIONS    ********************************
3.19/3.20	*******************************************************************************************
3.19/3.20	
3.19/3.20	Proving termination of subgraph 0
3.19/3.20	Proving termination of subgraph 1
3.19/3.20	Checking unfeasibility...
3.19/3.20	Time used: 0.005343
3.19/3.20	
3.19/3.20	Checking conditional termination of SCC {l1}...
3.19/3.20	
3.19/3.20	LOG: CALL solveLinear
3.19/3.20	
3.19/3.20	LOG: RETURN solveLinear - Elapsed time: 0.001342s
3.19/3.20	Ranking function: -1 - c^0 + curr_serv^0
3.19/3.20	New Graphs: 
3.19/3.20	Transitions:
3.19/3.20	<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef38, {c^0 -> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
3.19/3.20	Variables:
3.19/3.20	c^0, curr_serv^0, resp^0
3.19/3.20	Checking conditional termination of SCC {l1}...
3.19/3.20	
3.19/3.20	LOG: CALL solveLinear
3.19/3.20	
3.19/3.20	LOG: RETURN solveLinear - Elapsed time: 0.000711s
3.19/3.20	Ranking function: -1 + curr_serv^0
3.19/3.20	New Graphs: 
3.19/3.20	Proving termination of subgraph 2
3.19/3.20	Checking unfeasibility...
3.19/3.20	Time used: 0.000847
3.19/3.20	
3.19/3.20	> No variable changes in termination graph.
3.19/3.20	Checking conditional unfeasibility...
3.19/3.20	Termination failed. Trying to show unreachability...
3.19/3.20	Proving unreachability of entry: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
3.19/3.20	
3.19/3.20	LOG: CALL check - Post:1 <= 0 - Process 1
3.19/3.20	* Exit transition: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
3.19/3.20	* Postcondition  : 1 <= 0
3.19/3.20	Postcodition moved up: 1 <= 0
3.19/3.20	
3.19/3.20	LOG: Try proving POST
3.19/3.20	Postcondition: 1 <= 0
3.19/3.20	
3.19/3.20	LOG: CALL check - Post:1 <= 0 - Process 2
3.19/3.20	* Exit transition: <l0, l1, 1 <= undef51 /\ __const_8^0 = undef54 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0, {all remain the same}>
3.19/3.20	* Postcondition  : 1 <= 0
3.19/3.20	
3.19/3.20	LOG: CALL solveLinear
3.19/3.20	
3.19/3.20	LOG: RETURN solveLinear - Elapsed time: 0.000585s
3.19/3.20	> Postcondition is not implied!
3.19/3.20	
3.19/3.20	LOG: RETURN check - Elapsed time: 0.000690s
3.19/3.20	
3.19/3.20	LOG: NarrowEntry size 1
3.19/3.20	Narrowing transition: 
3.19/3.20	<l1, l1, undef38 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -1 + curr_serv^0, rest remain the same}>
3.19/3.20	
3.19/3.20	LOG: Narrow transition size 1
3.19/3.20	Narrowing transition: 
3.19/3.20	<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef38, {c^0 -> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
3.19/3.20	
3.19/3.20	LOG: Narrow transition size 1
3.19/3.20	ENTRIES:
3.19/3.20	<l0, l1, 0 <= 0 /\ 1 <= undef51 /\ __const_8^0 = undef54 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0, {all remain the same}>
3.19/3.20	END ENTRIES:
3.19/3.20	GRAPH:
3.19/3.20	<l1, l1, 0 <= 0 /\ undef38 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -1 + curr_serv^0, rest remain the same}>
3.19/3.20	<l1, l1, 0 <= 0 /\ 1 <= curr_serv^0 /\ 1 <= undef38, {c^0 -> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
3.19/3.20	END GRAPH:
3.19/3.20	EXIT: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
3.19/3.20	POST: 1 <= 0
3.19/3.20	
3.19/3.20	
3.19/3.20	LOG: Try proving POST
3.19/3.20	Solving with 1 template(s).
3.19/3.20	
3.19/3.20	LOG: CALL solveNonLinearGetFirstSolution
3.19/3.20	
3.19/3.20	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012639s
3.19/3.20	Time used: 0.012447
3.19/3.20	Improving Solution with cost 51 ...
3.19/3.20	
3.19/3.20	LOG: CALL solveNonLinearGetNextSolution
3.19/3.20	
3.19/3.20	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000608s
3.19/3.20	Time used: 1.00029
3.19/3.20	
3.19/3.20	LOG: SAT solveNonLinear - Elapsed time: 1.013248s
3.19/3.20	Cost: 51; Total time: 1.01274
3.19/3.20	Failed at location 1: 1 + curr_serv^0 <= 0
3.19/3.20	Before Improving: 
3.19/3.20	Quasi-invariant at l1: 1 + curr_serv^0 <= 0
3.19/3.20	Optimizing invariants...
3.19/3.20	
3.19/3.20	LOG: CALL solveLinear
3.19/3.20	
3.19/3.20	LOG: RETURN solveLinear - Elapsed time: 0.004397s
3.19/3.20	Remaining time after improvement: 0.998658
3.19/3.20	Some transition disabled by a set of quasi-invariant(s):
3.19/3.20	Quasi-invariant at l1: 1 + curr_serv^0 <= 0
3.19/3.20	
3.19/3.20	LOG: NEXT CALL check - disable
3.19/3.20	
3.19/3.20	LOG: CALL check - Post:1 + curr_serv^0 <= 0 - Process 3
3.19/3.20	* Exit transition: <l0, l1, 0 <= 0 /\ 1 <= undef51 /\ __const_8^0 = undef54 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0, {all remain the same}>
3.19/3.20	* Postcondition  : 1 + curr_serv^0 <= 0
3.19/3.20	
3.19/3.20	LOG: CALL solveLinear
3.19/3.20	
3.19/3.20	LOG: RETURN solveLinear - Elapsed time: 0.000798s
3.19/3.20	> Postcondition is not implied!
3.19/3.20	
3.19/3.20	LOG: RETURN check - Elapsed time: 0.000915s
3.19/3.20	Solving with 2 template(s).
3.19/3.20	
3.19/3.20	LOG: CALL solveNonLinearGetFirstSolution
3.19/3.20	
3.19/3.20	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.076133s
3.19/3.20	Time used: 0.07583
3.19/3.20	Improving Solution with cost 51 ...
3.19/3.20	
3.19/3.20	LOG: CALL solveNonLinearGetNextSolution
3.19/3.20	
3.19/3.20	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000623s
3.19/3.20	Time used: 1.00044
3.19/3.20	
3.19/3.20	LOG: SAT solveNonLinear - Elapsed time: 1.076756s
3.19/3.20	Cost: 51; Total time: 1.07627
3.19/3.20	Failed at location 1: curr_serv^0 <= 0
3.19/3.20	Before Improving: 
3.19/3.20	Quasi-invariant at l1: curr_serv^0 <= 0
3.19/3.20	Quasi-invariant at l1: 1 <= c^0 + resp^0
3.19/3.20	Optimizing invariants...
3.19/3.20	
3.19/3.20	LOG: CALL solveLinear
3.19/3.20	
3.19/3.20	LOG: RETURN solveLinear - Elapsed time: 0.014967s
3.19/3.20	Remaining time after improvement: 0.997987
3.19/3.20	Some transition disabled by a set of quasi-invariant(s):
3.19/3.20	Quasi-invariant at l1: curr_serv^0 <= 0
3.19/3.20	Quasi-invariant at l1: 1 <= c^0 + resp^0
3.19/3.20	
3.19/3.20	LOG: NEXT CALL check - disable
3.19/3.20	
3.19/3.20	LOG: CALL check - Post:curr_serv^0 <= 0 - Process 4
3.19/3.20	* Exit transition: <l0, l1, 0 <= 0 /\ 1 <= undef51 /\ __const_8^0 = undef54 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0, {all remain the same}>
3.19/3.20	* Postcondition  : curr_serv^0 <= 0
3.19/3.20	
3.19/3.20	LOG: CALL solveLinear
3.19/3.20	
3.19/3.20	LOG: RETURN solveLinear - Elapsed time: 0.001050s
3.19/3.20	> Postcondition is not implied!
3.19/3.20	
3.19/3.20	LOG: RETURN check - Elapsed time: 0.001168s
3.19/3.20	Solving with 3 template(s).
3.19/3.20	
3.19/3.20	LOG: CALL solveNonLinearGetFirstSolution
3.19/3.20	
3.19/3.20	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.860562s
3.19/3.20	Time used: 0.860145
3.19/3.20	Improving Solution with cost 51 ...
3.19/3.20	
3.19/3.20	LOG: CALL solveNonLinearGetNextSolution
3.19/3.20	
3.19/3.20	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.140384s
3.19/3.20	Time used: 0.14037
3.19/3.20	
3.19/3.20	LOG: SAT solveNonLinear - Elapsed time: 1.000946s
3.19/3.20	Cost: 51; Total time: 1.00052
3.19/3.20	Failed at location 1: curr_serv^0 <= 0
3.19/3.20	Before Improving: 
3.19/3.20	Quasi-invariant at l1: 0 <= 1 + resp^0
3.19/3.20	Quasi-invariant at l1: curr_serv^0 <= 0
3.19/3.20	Quasi-invariant at l1: 1 <= c^0
3.19/3.20	Optimizing invariants...
3.19/3.20	
3.19/3.20	LOG: CALL solveLinear
3.19/3.20	
3.19/3.20	LOG: RETURN solveLinear - Elapsed time: 0.019572s
3.19/3.20	Remaining time after improvement: 0.997536
3.19/3.20	Some transition disabled by a set of quasi-invariant(s):
3.19/3.20	Quasi-invariant at l1: 0 <= 1 + resp^0
3.19/3.20	Quasi-invariant at l1: curr_serv^0 <= 0
3.19/3.20	Quasi-invariant at l1: 1 <= c^0
3.19/3.20	
3.19/3.20	LOG: NEXT CALL check - disable
3.19/3.20	
3.19/3.20	LOG: CALL check - Post:curr_serv^0 <= 0 - Process 5
3.19/3.20	* Exit transition: <l0, l1, 0 <= 0 /\ 1 <= undef51 /\ __const_8^0 = undef54 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0, {all remain the same}>
3.19/3.20	* Postcondition  : curr_serv^0 <= 0
3.19/3.20	
3.19/3.20	LOG: CALL solveLinear
3.19/3.20	
3.19/3.20	LOG: RETURN solveLinear - Elapsed time: 0.001156s
3.19/3.20	> Postcondition is not implied!
3.19/3.20	
3.19/3.20	LOG: RETURN check - Elapsed time: 0.001272s
3.19/3.20	
3.19/3.20	LOG: Postcondition is not implied - no solution
3.19/3.20	> Postcondition is not implied!
3.19/3.20	
3.19/3.20	LOG: RETURN check - Elapsed time: 3.146457s
3.19/3.20	Cannot prove unreachability
3.19/3.20	
3.19/3.20	Proving non-termination of subgraph 2
3.19/3.20	Transitions:
3.19/3.20	<l5, l5, true, {all remain the same}>
3.19/3.20	Variables:
3.19/3.20	
3.19/3.20	Checking conditional non-termination of SCC {l5}...
3.19/3.20	> No exit transition to close.
3.19/3.20	Calling reachability with...
3.19/3.20	Transition: <l5, end, true, {all remain the same}>
3.19/3.20	Conditions: 
3.19/3.20	OPEN EXITS: 
3.19/3.20	<l5, end, true, {all remain the same}>
3.19/3.20	
3.19/3.20	--- Reachability graph ---
3.19/3.20	> Graph without transitions.
3.19/3.20	
3.19/3.20	Calling reachability with...
3.19/3.20	Transition: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
3.19/3.20	Conditions: 
3.19/3.20	OPEN EXITS: 
3.19/3.20	<l1, l5, curr_serv^0 <= 0, {all remain the same}>
3.19/3.20	
3.19/3.20	--- Reachability graph ---
3.19/3.20	> Graph without transitions.
3.19/3.20	
3.19/3.20	Calling reachability with...
3.19/3.20	Transition: <l0, l1, 1 <= undef51 /\ __const_8^0 = undef54 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0, {all remain the same}>
3.19/3.20	Conditions: curr_serv^0 <= 0, 
3.19/3.20	OPEN EXITS: 
3.19/3.20	<l0, l1, curr_serv^0 <= 0 /\ 1 <= undef51 /\ __const_8^0 = undef54 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0, {all remain the same}>
3.19/3.20	
3.19/3.20	> Conditions are reachable!
3.19/3.20	
3.19/3.20	Program does NOT terminate
3.19/3.20	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
3.19/3.20	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
3.19/3.20	EOF