20.40/20.51	NO
20.40/20.51	
20.40/20.51	Solver Timeout: 4
20.40/20.51	Global Timeout: 300
20.40/20.51	No parsing errors!
20.40/20.51	Init Location: 0
20.40/20.51	Transitions:
20.40/20.51	<l0, l8, true>
20.40/20.51	<l1, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef1 = undef1), par{Result_4^0 -> undef1}>
20.40/20.51	<l1, l3, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef8 = undef8) /\ ((0 + undef8) <= 0) /\ (0 <= (0 + undef8)), par{tmp_7^0 -> undef8}>
20.40/20.51	<l3, l1, true>
20.40/20.51	<l1, l4, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef18 = undef18), par{tmp_7^0 -> undef18}>
20.40/20.51	<l4, l5, (undef22 = __disjvr_0^0) /\ (__disjvr_0^0 = undef22), par{__disjvr_0^0 -> undef22}>
20.40/20.51	<l5, l6, true, par{x_5^0 -> (1 + x_5^0)}>
20.40/20.51	<l6, l1, true>
20.40/20.51	<l7, l1, true>
20.40/20.51	<l8, l7, true>
20.40/20.51	
20.40/20.51	Fresh variables:
20.40/20.51	undef1, undef8, undef18, undef22, 
20.40/20.51	
20.40/20.51	Undef variables:
20.40/20.51	undef1, undef8, undef18, undef22, 
20.40/20.51	
20.40/20.51	Abstraction variables:
20.40/20.51	
20.40/20.51	Exit nodes:
20.40/20.51	
20.40/20.51	Accepting locations:
20.40/20.51	
20.40/20.51	Asserts:
20.40/20.51	
20.40/20.51	Preprocessed LLVMGraph
20.40/20.51	Init Location: 0
20.40/20.51	Transitions:
20.40/20.51	<l0, l1, true>
20.40/20.51	<l1, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (undef1 = undef1)>
20.40/20.51	<l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef8 = undef8) /\ ((0 + undef8) <= 0) /\ (0 <= (0 + undef8))>
20.40/20.51	<l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef18 = undef18) /\ (undef22 = __disjvr_0^0) /\ (__disjvr_0^0 = undef22), par{__disjvr_0^0 -> undef22, x_5^0 -> (1 + x_5^0)}>
20.40/20.51	
20.40/20.51	Fresh variables:
20.40/20.51	undef1, undef8, undef18, undef22, 
20.40/20.51	
20.40/20.51	Undef variables:
20.40/20.51	undef1, undef8, undef18, undef22, 
20.40/20.51	
20.40/20.51	Abstraction variables:
20.40/20.51	
20.40/20.51	Exit nodes:
20.40/20.51	
20.40/20.51	Accepting locations:
20.40/20.51	
20.40/20.51	Asserts:
20.40/20.51	
20.40/20.51	*************************************************************
20.40/20.51	*******************************************************************************************
20.40/20.51	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
20.40/20.51	*******************************************************************************************
20.40/20.51	
20.40/20.51	Init Location: 0
20.40/20.51	Graph 0:
20.40/20.51	Transitions:
20.40/20.51	Variables:
20.40/20.51	
20.40/20.51	Graph 1:
20.40/20.51	Transitions:
20.40/20.51	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef8 = 0, {all remain the same}>
20.40/20.51	<l1, l1, 1 + x_5^0 <= y_6^0 /\ __disjvr_0^0 = undef22, {__disjvr_0^0 -> undef22, x_5^0 -> 1 + x_5^0, rest remain the same}>
20.40/20.51	Variables:
20.40/20.51	x_5^0, y_6^0, __disjvr_0^0
20.40/20.51	
20.40/20.51	Graph 2:
20.40/20.51	Transitions:
20.40/20.51	Variables:
20.40/20.51	
20.40/20.51	Precedence: 
20.40/20.51	Graph 0
20.40/20.51	
20.40/20.51	Graph 1
20.40/20.51	<l0, l1, true, {all remain the same}>
20.40/20.51	
20.40/20.51	Graph 2
20.40/20.51	<l1, l2, y_6^0 <= x_5^0, {all remain the same}>
20.40/20.51	
20.40/20.51	Map Locations to Subgraph:
20.40/20.51	( 0 , 0 )
20.40/20.51	( 1 , 1 )
20.40/20.51	( 2 , 2 )
20.40/20.51	
20.40/20.51	*******************************************************************************************
20.40/20.51	********************************    CHECKING ASSERTIONS    ********************************
20.40/20.51	*******************************************************************************************
20.40/20.51	
20.40/20.51	Proving termination of subgraph 0
20.40/20.51	Proving termination of subgraph 1
20.40/20.51	Checking unfeasibility...
20.40/20.51	Time used: 0.003912
20.40/20.51	
20.40/20.51	Checking conditional termination of SCC {l1}...
20.40/20.51	
20.40/20.51	LOG: CALL solveLinear
20.40/20.51	
20.40/20.51	LOG: RETURN solveLinear - Elapsed time: 0.000878s
20.40/20.51	Ranking function: -1 - x_5^0 + y_6^0
20.40/20.51	New Graphs: 
20.40/20.51	Transitions:
20.40/20.51	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef8 = 0, {all remain the same}>
20.40/20.51	Variables:
20.40/20.51	x_5^0, y_6^0
20.40/20.51	> No variable changes in termination graph.
20.40/20.51	Checking conditional unfeasibility...
20.40/20.51	Calling Safety with literal y_6^0 <= x_5^0 and entry <l1, l1, true, {all remain the same}>
20.40/20.51	
20.40/20.51	LOG: CALL check - Post:y_6^0 <= x_5^0 - Process 1
20.40/20.51	* Exit transition: <l1, l1, true, {all remain the same}>
20.40/20.51	* Postcondition  : y_6^0 <= x_5^0
20.40/20.51	Quasi-invariants: 
20.40/20.51	Location 1: y_6^0 <= x_5^0 ; 
20.40/20.51	Postcondition: y_6^0 <= x_5^0
20.40/20.51	
20.40/20.51	LOG: CALL check - Post:y_6^0 <= x_5^0 - Process 2
20.40/20.51	* Exit transition: <l0, l1, true, {all remain the same}>
20.40/20.51	* Postcondition  : y_6^0 <= x_5^0
20.40/20.51	
20.40/20.51	LOG: CALL solveLinear
20.40/20.51	
20.40/20.51	LOG: RETURN solveLinear - Elapsed time: 0.000259s
20.40/20.51	> Postcondition is not implied!
20.40/20.51	
20.40/20.51	LOG: RETURN check - Elapsed time: 0.000335s
20.40/20.51	
20.40/20.51	LOG: NarrowEntry size 1
20.40/20.51	Narrowing transition: 
20.40/20.51	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef8 = 0, {all remain the same}>
20.40/20.51	
20.40/20.51	LOG: Narrow transition size 1
20.40/20.51	Narrowing transition: 
20.40/20.51	<l1, l1, 1 + x_5^0 <= y_6^0 /\ __disjvr_0^0 = undef22, {__disjvr_0^0 -> undef22, x_5^0 -> 1 + x_5^0, rest remain the same}>
20.40/20.51	
20.40/20.51	LOG: Narrow transition size 1
20.40/20.51	ENTRIES:
20.40/20.51	<l0, l1, 1 + x_5^0 <= y_6^0, {all remain the same}>
20.40/20.51	END ENTRIES:
20.40/20.51	GRAPH:
20.40/20.51	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef8 = 0, {all remain the same}>
20.40/20.51	<l1, l1, 1 + x_5^0 <= y_6^0 /\ __disjvr_0^0 = undef22, {__disjvr_0^0 -> undef22, x_5^0 -> 1 + x_5^0, rest remain the same}>
20.40/20.51	END GRAPH:
20.40/20.51	EXIT: <l1, l1, true, {all remain the same}>
20.40/20.51	POST: y_6^0 <= x_5^0
20.40/20.51	
20.40/20.51	
20.40/20.51	LOG: Try proving POST
20.40/20.51	Solving with 1 template(s).
20.40/20.51	
20.40/20.51	LOG: CALL solveNonLinearGetFirstSolution
20.40/20.51	
20.40/20.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013372s
20.40/20.51	Time used: 0.013269
20.40/20.51	Solving with 2 template(s).
20.40/20.51	
20.40/20.51	LOG: CALL solveNonLinearGetFirstSolution
20.40/20.51	
20.40/20.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001111s
20.40/20.51	Time used: 4.00039
20.40/20.51	Solving with 3 template(s).
20.40/20.51	
20.40/20.51	LOG: CALL solveNonLinearGetFirstSolution
20.40/20.51	
20.40/20.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003137s
20.40/20.51	Time used: 1.00022
20.40/20.51	
20.40/20.51	LOG: Postcondition is not implied - no solution
20.40/20.51	> Postcondition is not implied!
20.40/20.51	
20.40/20.51	LOG: RETURN check - Elapsed time: 5.026093s
20.40/20.51	
20.40/20.51	Proving non-termination of subgraph 1
20.40/20.51	Transitions:
20.40/20.51	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef8 = 0, {all remain the same}>
20.40/20.51	<l1, l1, 1 + x_5^0 <= y_6^0 /\ __disjvr_0^0 = undef22, {__disjvr_0^0 -> undef22, x_5^0 -> 1 + x_5^0, rest remain the same}>
20.40/20.51	Variables:
20.40/20.51	x_5^0, y_6^0, __disjvr_0^0
20.40/20.51	
20.40/20.51	Checking that every undef value has an assignment...
20.40/20.51	
20.40/20.51	LOG: CALL solveLinear
20.40/20.51	
20.40/20.51	LOG: RETURN solveLinear - Elapsed time: 0.001018s
20.40/20.51	Checking conditional non-termination of SCC {l1}...
20.40/20.51	EXIT TRANSITIONS:
20.40/20.51	<l1, end, y_6^0 <= x_5^0, {all remain the same}>
20.40/20.51	
20.40/20.51	Solving with 1 template(s).
20.40/20.51	
20.40/20.51	LOG: CALL solveNonLinearGetFirstSolution
20.40/20.51	
20.40/20.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.003426s
20.40/20.51	Time used: 5.00258
20.40/20.51	Solving with 2 template(s).
20.40/20.51	
20.40/20.51	LOG: CALL solveNonLinearGetFirstSolution
20.40/20.51	
20.40/20.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.007159s
20.40/20.51	Time used: 5.00104
20.40/20.51	Solving with 3 template(s).
20.40/20.51	
20.40/20.51	LOG: CALL solveNonLinearGetFirstSolution
20.40/20.51	
20.40/20.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.156702s
20.40/20.51	Time used: 5.01238
20.40/20.51	> Checking if the negation of the conditions of every pending exit is quasi-invariant... NO
20.40/20.51	
20.40/20.51	Proving non-termination of subgraph 1
20.40/20.51	Transitions:
20.40/20.51	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef8 = 0, {all remain the same}>
20.40/20.51	Variables:
20.40/20.51	x_5^0, y_6^0
20.40/20.51	
20.40/20.51	Checking conditional non-termination of SCC {l1}...
20.40/20.51	EXIT TRANSITIONS:
20.40/20.51	<l1, end, y_6^0 <= x_5^0, {all remain the same}>
20.40/20.51	
20.40/20.51	Solving with 1 template(s).
20.40/20.51	
20.40/20.51	LOG: CALL solveNonLinearGetFirstSolution
20.40/20.51	
20.40/20.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010694s
20.40/20.51	Time used: 0.010513
20.40/20.51	Improving Solution with cost 1 ...
20.40/20.51	
20.40/20.51	LOG: CALL solveNonLinearGetNextSolution
20.40/20.51	
20.40/20.51	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015445s
20.40/20.51	Time used: 0.015438
20.40/20.51	
20.40/20.51	LOG: SAT solveNonLinear - Elapsed time: 0.026139s
20.40/20.51	Cost: 1; Total time: 0.025951
20.40/20.51	Failed at location 1: 1 + x_5^0 <= y_6^0
20.40/20.51	Before Improving: 
20.40/20.51	Quasi-invariant at l1: 1 + x_5^0 <= y_6^0
20.40/20.51	Optimizing invariants...
20.40/20.51	
20.40/20.51	LOG: CALL solveLinear
20.40/20.51	
20.40/20.51	LOG: RETURN solveLinear - Elapsed time: 0.004555s
20.40/20.51	Remaining time after improvement: 0.998917
20.40/20.51	Minimizing number of undef constraints...
20.40/20.51	
20.40/20.51	LOG: CALL solveNonLinear
20.40/20.51	
20.40/20.51	LOG: RETURN solveNonLinear - Elapsed time: 0.002152s
20.40/20.51	Number of undef constraints reduced!
20.40/20.51	
20.40/20.51	Non-termination implied by a set of quasi-invariant(s):
20.40/20.51	Quasi-invariant at l1: 1 + x_5^0 <= y_6^0
20.40/20.51	
20.40/20.51	Strengthening and disabling EXIT transitions...
20.40/20.51	Closed exits from l1: 1
20.40/20.51	
20.40/20.51	Strengthening and disabling transitions...
20.40/20.51	
20.40/20.51	LOG: CALL solverLinear in Graph for feasibility
20.40/20.51	
20.40/20.51	LOG: RETURN solveLinear in Graph for feasibility
20.40/20.51	Strengthening transition (result): 
20.40/20.51	<l1, l1, 1 + x_5^0 <= y_6^0 /\ undef8 = 0, {all remain the same}>
20.40/20.51	
20.40/20.51	Calling reachability with...
20.40/20.51	Transition: <l1, end, true, {all remain the same}>
20.40/20.51	Conditions: 1 + x_5^0 <= y_6^0, 
20.40/20.51	OPEN EXITS: 
20.40/20.51	<l1, end, 1 + x_5^0 <= y_6^0, {all remain the same}>
20.40/20.51	
20.40/20.51	--- Reachability graph ---
20.40/20.51	> Graph without transitions.
20.40/20.51	
20.40/20.51	Calling reachability with...
20.40/20.51	Transition: <l0, l1, true, {all remain the same}>
20.40/20.51	Conditions: 1 + x_5^0 <= y_6^0, 
20.40/20.51	OPEN EXITS: 
20.40/20.51	<l0, l1, 1 + x_5^0 <= y_6^0, {all remain the same}>
20.40/20.51	
20.40/20.51	> Conditions are reachable!
20.40/20.51	
20.40/20.51	Program does NOT terminate
20.40/20.51	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
20.40/20.51	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
20.40/20.51	EOF