15.36/15.40	NO
15.36/15.40	
15.36/15.40	Solver Timeout: 4
15.36/15.40	Global Timeout: 300
15.36/15.40	No parsing errors!
15.36/15.40	Init Location: 0
15.36/15.40	Transitions:
15.36/15.40	<l0, l14, true>
15.36/15.40	<l1, l2, true>
15.36/15.40	<l2, l3, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0)>
15.36/15.40	<l3, l4, (undef16 = __disjvr_0^0) /\ (__disjvr_0^0 = undef16), par{__disjvr_0^0 -> undef16}>
15.36/15.40	<l4, l5, (undef22 = undef22), par{Result_4^0 -> undef22}>
15.36/15.40	<l2, l6, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef33 = undef33) /\ ((0 + undef33) <= 0) /\ (0 <= (0 + undef33)), par{tmp_7^0 -> undef33}>
15.36/15.40	<l6, l2, true>
15.36/15.40	<l2, l7, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef47 = undef47), par{tmp_7^0 -> undef47}>
15.36/15.40	<l7, l8, (undef52 = __disjvr_1^0) /\ (__disjvr_1^0 = undef52), par{__disjvr_1^0 -> undef52}>
15.36/15.40	<l8, l9, true, par{x_5^0 -> (1 + x_5^0)}>
15.36/15.40	<l9, l2, true>
15.36/15.40	<l2, l10, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef75 = undef75) /\ ((0 + undef75) <= 0) /\ (0 <= (0 + undef75)), par{tmp_7^0 -> undef75}>
15.36/15.40	<l10, l2, true>
15.36/15.40	<l2, l11, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef89 = undef89), par{tmp_7^0 -> undef89}>
15.36/15.40	<l11, l12, (undef95 = __disjvr_2^0) /\ (__disjvr_2^0 = undef95), par{__disjvr_2^0 -> undef95}>
15.36/15.40	<l12, l13, true, par{x_5^0 -> (1 + x_5^0)}>
15.36/15.40	<l13, l2, true>
15.36/15.40	<l14, l1, true>
15.36/15.40	
15.36/15.40	Fresh variables:
15.36/15.40	undef16, undef22, undef33, undef47, undef52, undef75, undef89, undef95, 
15.36/15.40	
15.36/15.40	Undef variables:
15.36/15.40	undef16, undef22, undef33, undef47, undef52, undef75, undef89, undef95, 
15.36/15.40	
15.36/15.40	Abstraction variables:
15.36/15.40	
15.36/15.40	Exit nodes:
15.36/15.40	
15.36/15.40	Accepting locations:
15.36/15.40	
15.36/15.40	Asserts:
15.36/15.40	
15.36/15.40	Preprocessed LLVMGraph
15.36/15.40	Init Location: 0
15.36/15.40	Transitions:
15.36/15.40	<l0, l2, true>
15.36/15.40	<l2, l5, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef16 = __disjvr_0^0) /\ (__disjvr_0^0 = undef16) /\ (undef22 = undef22), par{__disjvr_0^0 -> undef16}>
15.36/15.40	<l2, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef33 = undef33) /\ ((0 + undef33) <= 0) /\ (0 <= (0 + undef33))>
15.36/15.40	<l2, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef47 = undef47) /\ (undef52 = __disjvr_1^0) /\ (__disjvr_1^0 = undef52), par{__disjvr_1^0 -> undef52, x_5^0 -> (1 + x_5^0)}>
15.36/15.40	<l2, l2, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef75 = undef75) /\ ((0 + undef75) <= 0) /\ (0 <= (0 + undef75))>
15.36/15.40	<l2, l2, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef89 = undef89) /\ (undef95 = __disjvr_2^0) /\ (__disjvr_2^0 = undef95), par{__disjvr_2^0 -> undef95, x_5^0 -> (1 + x_5^0)}>
15.36/15.40	
15.36/15.40	Fresh variables:
15.36/15.40	undef16, undef22, undef33, undef47, undef52, undef75, undef89, undef95, 
15.36/15.40	
15.36/15.40	Undef variables:
15.36/15.40	undef16, undef22, undef33, undef47, undef52, undef75, undef89, undef95, 
15.36/15.40	
15.36/15.40	Abstraction variables:
15.36/15.40	
15.36/15.40	Exit nodes:
15.36/15.40	
15.36/15.40	Accepting locations:
15.36/15.40	
15.36/15.40	Asserts:
15.36/15.40	
15.36/15.40	*************************************************************
15.36/15.40	*******************************************************************************************
15.36/15.40	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
15.36/15.40	*******************************************************************************************
15.36/15.40	
15.36/15.40	Init Location: 0
15.36/15.40	Graph 0:
15.36/15.40	Transitions:
15.36/15.40	Variables:
15.36/15.40	
15.36/15.40	Graph 1:
15.36/15.40	Transitions:
15.36/15.40	<l2, l2, x_5^0 = y_6^0 /\ undef33 = 0, {all remain the same}>
15.36/15.40	<l2, l2, __disjvr_1^0 = undef52 /\ x_5^0 = y_6^0, {__disjvr_1^0 -> undef52, x_5^0 -> 1 + x_5^0, rest remain the same}>
15.36/15.40	<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef75 = 0, {all remain the same}>
15.36/15.40	<l2, l2, 1 + x_5^0 <= y_6^0 /\ __disjvr_2^0 = undef95, {__disjvr_2^0 -> undef95, x_5^0 -> 1 + x_5^0, rest remain the same}>
15.36/15.40	Variables:
15.36/15.40	x_5^0, y_6^0, __disjvr_1^0, __disjvr_2^0
15.36/15.40	
15.36/15.40	Graph 2:
15.36/15.40	Transitions:
15.36/15.40	Variables:
15.36/15.40	
15.36/15.40	Precedence: 
15.36/15.40	Graph 0
15.36/15.40	
15.36/15.40	Graph 1
15.36/15.40	<l0, l2, true, {all remain the same}>
15.36/15.40	
15.36/15.40	Graph 2
15.36/15.40	<l2, l5, y_6^0 <= x_5^0 /\ __disjvr_0^0 = undef16, {__disjvr_0^0 -> undef16, rest remain the same}>
15.36/15.40	
15.36/15.40	Map Locations to Subgraph:
15.36/15.40	( 0 , 0 )
15.36/15.40	( 2 , 1 )
15.36/15.40	( 5 , 2 )
15.36/15.41	
15.36/15.41	*******************************************************************************************
15.36/15.41	********************************    CHECKING ASSERTIONS    ********************************
15.36/15.41	*******************************************************************************************
15.36/15.41	
15.36/15.41	Proving termination of subgraph 0
15.36/15.41	Proving termination of subgraph 1
15.36/15.41	Checking unfeasibility...
15.36/15.41	Time used: 0.011619
15.36/15.41	
15.36/15.41	Checking conditional termination of SCC {l2}...
15.36/15.41	
15.36/15.41	LOG: CALL solveLinear
15.36/15.41	
15.36/15.41	LOG: RETURN solveLinear - Elapsed time: 0.001854s
15.36/15.41	Ranking function: -1 - x_5^0 + y_6^0
15.36/15.41	New Graphs: 
15.36/15.41	Transitions:
15.36/15.41	<l2, l2, x_5^0 = y_6^0 /\ undef33 = 0, {all remain the same}>
15.36/15.41	<l2, l2, __disjvr_1^0 = undef52 /\ x_5^0 = y_6^0, {__disjvr_1^0 -> undef52, x_5^0 -> 1 + x_5^0, rest remain the same}>
15.36/15.41	<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef75 = 0, {all remain the same}>
15.36/15.41	Variables:
15.36/15.41	__disjvr_1^0, x_5^0, y_6^0
15.36/15.41	Checking conditional termination of SCC {l2}...
15.36/15.41	
15.36/15.41	LOG: CALL solveLinear
15.36/15.41	
15.36/15.41	LOG: RETURN solveLinear - Elapsed time: 0.000714s
15.36/15.41	Ranking function: -x_5^0 + y_6^0
15.36/15.41	New Graphs: 
15.36/15.41	Transitions:
15.36/15.41	<l2, l2, x_5^0 = y_6^0 /\ undef33 = 0, {all remain the same}>
15.36/15.41	<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef75 = 0, {all remain the same}>
15.36/15.41	Variables:
15.36/15.41	x_5^0, y_6^0
15.36/15.41	> No variable changes in termination graph.
15.36/15.41	Checking conditional unfeasibility...
15.36/15.41	Termination failed. Trying to show unreachability...
15.36/15.41	Proving unreachability of entry: <l0, l2, true, {all remain the same}>
15.36/15.41	
15.36/15.41	LOG: CALL check - Post:1 <= 0 - Process 1
15.36/15.41	* Exit transition: <l0, l2, true, {all remain the same}>
15.36/15.41	* Postcondition  : 1 <= 0
15.36/15.41	
15.36/15.41	LOG: CALL solveLinear
15.36/15.41	
15.36/15.41	LOG: RETURN solveLinear - Elapsed time: 0.000279s
15.36/15.41	> Postcondition is not implied!
15.36/15.41	
15.36/15.41	LOG: RETURN check - Elapsed time: 0.000336s
15.36/15.41	Cannot prove unreachability
15.36/15.41	
15.36/15.41	Proving non-termination of subgraph 1
15.36/15.41	Transitions:
15.36/15.41	<l2, l2, x_5^0 = y_6^0 /\ undef33 = 0, {all remain the same}>
15.36/15.41	<l2, l2, __disjvr_1^0 = undef52 /\ x_5^0 = y_6^0, {__disjvr_1^0 -> undef52, x_5^0 -> 1 + x_5^0, rest remain the same}>
15.36/15.41	<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef75 = 0, {all remain the same}>
15.36/15.41	<l2, l2, 1 + x_5^0 <= y_6^0 /\ __disjvr_2^0 = undef95, {__disjvr_2^0 -> undef95, x_5^0 -> 1 + x_5^0, rest remain the same}>
15.36/15.41	Variables:
15.36/15.41	x_5^0, y_6^0, __disjvr_1^0, __disjvr_2^0
15.36/15.41	
15.36/15.41	Checking that every undef value has an assignment...
15.36/15.41	
15.36/15.41	LOG: CALL solveLinear
15.36/15.41	
15.36/15.41	LOG: RETURN solveLinear - Elapsed time: 0.001374s
15.36/15.41	Checking conditional non-termination of SCC {l2}...
15.36/15.41	EXIT TRANSITIONS:
15.36/15.41	<l2, end, 1 + y_6^0 <= x_5^0, {all remain the same}>
15.36/15.41	
15.36/15.41	Solving with 1 template(s).
15.36/15.41	
15.36/15.41	LOG: CALL solveNonLinearGetFirstSolution
15.36/15.41	
15.36/15.41	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.002673s
15.36/15.41	Time used: 5.0019
15.36/15.41	Solving with 2 template(s).
15.36/15.41	
15.36/15.41	LOG: CALL solveNonLinearGetFirstSolution
15.36/15.41	
15.36/15.41	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.021376s
15.36/15.41	Time used: 5.0012
15.36/15.41	Solving with 3 template(s).
15.36/15.41	
15.36/15.41	LOG: CALL solveNonLinearGetFirstSolution
15.36/15.41	
15.36/15.41	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.160486s
15.36/15.41	Time used: 5.00317
15.36/15.41	> Checking if the negation of the conditions of every pending exit is quasi-invariant... NO
15.36/15.41	
15.36/15.41	Proving non-termination of subgraph 1
15.36/15.41	Transitions:
15.36/15.41	<l2, l2, x_5^0 = y_6^0 /\ undef33 = 0, {all remain the same}>
15.36/15.41	<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef75 = 0, {all remain the same}>
15.36/15.41	Variables:
15.36/15.41	x_5^0, y_6^0
15.36/15.41	
15.36/15.41	Checking conditional non-termination of SCC {l2}...
15.36/15.41	EXIT TRANSITIONS:
15.36/15.41	<l2, end, 1 + y_6^0 <= x_5^0, {all remain the same}>
15.36/15.41	
15.36/15.41	Solving with 1 template(s).
15.36/15.41	
15.36/15.41	LOG: CALL solveNonLinearGetFirstSolution
15.36/15.41	
15.36/15.41	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016466s
15.36/15.41	Time used: 0.016251
15.36/15.41	Improving Solution with cost 1 ...
15.36/15.41	
15.36/15.41	LOG: CALL solveNonLinearGetNextSolution
15.36/15.41	
15.36/15.41	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.030322s
15.36/15.41	Time used: 0.030315
15.36/15.41	
15.36/15.41	LOG: SAT solveNonLinear - Elapsed time: 0.046788s
15.36/15.41	Cost: 1; Total time: 0.046566
15.36/15.41	Failed at location 2: x_5^0 <= y_6^0
15.36/15.41	Before Improving: 
15.36/15.41	Quasi-invariant at l2: x_5^0 <= y_6^0
15.36/15.41	Optimizing invariants...
15.36/15.41	
15.36/15.41	LOG: CALL solveLinear
15.36/15.41	
15.36/15.41	LOG: RETURN solveLinear - Elapsed time: 0.010794s
15.36/15.41	Remaining time after improvement: 0.998082
15.36/15.41	Minimizing number of undef constraints...
15.36/15.41	
15.36/15.41	LOG: CALL solveNonLinear
15.36/15.41	
15.36/15.41	LOG: RETURN solveNonLinear - Elapsed time: 0.003222s
15.36/15.41	Number of undef constraints reduced!
15.36/15.41	
15.36/15.41	Non-termination implied by a set of quasi-invariant(s):
15.36/15.41	Quasi-invariant at l2: x_5^0 <= y_6^0
15.36/15.41	
15.36/15.41	Strengthening and disabling EXIT transitions...
15.36/15.41	Closed exits from l2: 1
15.36/15.41	
15.36/15.41	Strengthening and disabling transitions...
15.36/15.41	
15.36/15.41	LOG: CALL solverLinear in Graph for feasibility
15.36/15.41	
15.36/15.41	LOG: RETURN solveLinear in Graph for feasibility
15.36/15.41	Strengthening transition (result): 
15.36/15.41	<l2, l2, x_5^0 = y_6^0 /\ undef33 = 0, {all remain the same}>
15.36/15.41	
15.36/15.41	LOG: CALL solverLinear in Graph for feasibility
15.36/15.41	
15.36/15.41	LOG: RETURN solveLinear in Graph for feasibility
15.36/15.41	Strengthening transition (result): 
15.36/15.41	<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef75 = 0, {all remain the same}>
15.36/15.41	
15.36/15.41	Calling reachability with...
15.36/15.41	Transition: <l2, end, true, {all remain the same}>
15.36/15.41	Conditions: x_5^0 <= y_6^0, 
15.36/15.41	OPEN EXITS: 
15.36/15.41	<l2, end, x_5^0 <= y_6^0, {all remain the same}>
15.36/15.41	
15.36/15.41	--- Reachability graph ---
15.36/15.41	> Graph without transitions.
15.36/15.41	
15.36/15.41	Calling reachability with...
15.36/15.41	Transition: <l0, l2, true, {all remain the same}>
15.36/15.41	Conditions: x_5^0 <= y_6^0, 
15.36/15.41	OPEN EXITS: 
15.36/15.41	<l0, l2, x_5^0 <= y_6^0, {all remain the same}>
15.36/15.41	
15.36/15.41	> Conditions are reachable!
15.36/15.41	
15.36/15.41	Program does NOT terminate
15.36/15.41	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
15.36/15.41	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
15.36/15.41	EOF