20.13/20.22	NO
20.13/20.22	
20.13/20.22	Solver Timeout: 4
20.13/20.22	Global Timeout: 300
20.13/20.22	No parsing errors!
20.13/20.22	Init Location: 0
20.13/20.22	Transitions:
20.13/20.22	<l0, l8, true>
20.13/20.22	<l1, l2, true>
20.13/20.22	<l2, l3, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef4 = undef4), par{Result_4^0 -> undef4}>
20.13/20.22	<l2, l4, ((0 + (~(1) * x_5^0)) <= 0) /\ (undef8 = undef8) /\ ((0 + undef8) <= 0) /\ (0 <= (0 + undef8)), par{tmp_6^0 -> undef8}>
20.13/20.22	<l4, l2, true>
20.13/20.22	<l2, l5, ((0 + (~(1) * x_5^0)) <= 0) /\ (undef14 = undef14), par{tmp_6^0 -> undef14}>
20.13/20.22	<l5, l6, ((1 + tmp_6^0) <= 0)>
20.13/20.22	<l5, l6, (1 <= (0 + tmp_6^0))>
20.13/20.22	<l6, l7, true, par{x_5^0 -> (~(1) + x_5^0)}>
20.13/20.22	<l7, l2, true>
20.13/20.22	<l8, l1, true>
20.13/20.22	
20.13/20.22	Fresh variables:
20.13/20.22	undef4, undef8, undef14, 
20.13/20.22	
20.13/20.22	Undef variables:
20.13/20.22	undef4, undef8, undef14, 
20.13/20.22	
20.13/20.22	Abstraction variables:
20.13/20.22	
20.13/20.22	Exit nodes:
20.13/20.22	
20.13/20.22	Accepting locations:
20.13/20.22	
20.13/20.22	Asserts:
20.13/20.22	
20.13/20.22	Preprocessed LLVMGraph
20.13/20.22	Init Location: 0
20.13/20.22	Transitions:
20.13/20.22	<l0, l2, true>
20.13/20.22	<l2, l3, (0 <= (~(1) + (~(1) * x_5^0))) /\ (undef4 = undef4)>
20.13/20.22	<l2, l2, ((0 + (~(1) * x_5^0)) <= 0) /\ (undef8 = undef8) /\ ((0 + undef8) <= 0) /\ (0 <= (0 + undef8))>
20.13/20.22	<l2, l2, ((0 + (~(1) * x_5^0)) <= 0) /\ (undef14 = undef14) /\ ((1 + undef14) <= 0), par{x_5^0 -> (~(1) + x_5^0)}>
20.13/20.22	<l2, l2, ((0 + (~(1) * x_5^0)) <= 0) /\ (undef14 = undef14) /\ (1 <= (0 + undef14)), par{x_5^0 -> (~(1) + x_5^0)}>
20.13/20.22	
20.13/20.22	Fresh variables:
20.13/20.22	undef4, undef8, undef14, 
20.13/20.22	
20.13/20.22	Undef variables:
20.13/20.22	undef4, undef8, undef14, 
20.13/20.22	
20.13/20.22	Abstraction variables:
20.13/20.22	
20.13/20.22	Exit nodes:
20.13/20.22	
20.13/20.22	Accepting locations:
20.13/20.22	
20.13/20.22	Asserts:
20.13/20.22	
20.13/20.22	*************************************************************
20.13/20.22	*******************************************************************************************
20.13/20.22	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
20.13/20.22	*******************************************************************************************
20.13/20.22	
20.13/20.22	Init Location: 0
20.13/20.22	Graph 0:
20.13/20.22	Transitions:
20.13/20.22	Variables:
20.13/20.22	
20.13/20.22	Graph 1:
20.13/20.22	Transitions:
20.13/20.22	<l2, l2, 0 <= x_5^0 /\ undef8 = 0, {all remain the same}>
20.13/20.22	<l2, l2, 0 <= x_5^0 /\ 1 + undef14 <= 0, {x_5^0 -> -1 + x_5^0, rest remain the same}>
20.13/20.22	<l2, l2, 0 <= x_5^0 /\ 1 <= undef14, {x_5^0 -> -1 + x_5^0, rest remain the same}>
20.13/20.22	Variables:
20.13/20.22	x_5^0
20.13/20.22	
20.13/20.22	Graph 2:
20.13/20.22	Transitions:
20.13/20.22	Variables:
20.13/20.22	
20.13/20.22	Precedence: 
20.13/20.22	Graph 0
20.13/20.22	
20.13/20.22	Graph 1
20.13/20.22	<l0, l2, true, {all remain the same}>
20.13/20.22	
20.13/20.22	Graph 2
20.13/20.22	<l2, l3, 1 + x_5^0 <= 0, {all remain the same}>
20.13/20.22	
20.13/20.22	Map Locations to Subgraph:
20.13/20.22	( 0 , 0 )
20.13/20.22	( 2 , 1 )
20.13/20.22	( 3 , 2 )
20.13/20.22	
20.13/20.22	*******************************************************************************************
20.13/20.22	********************************    CHECKING ASSERTIONS    ********************************
20.13/20.22	*******************************************************************************************
20.13/20.22	
20.13/20.22	Proving termination of subgraph 0
20.13/20.22	Proving termination of subgraph 1
20.13/20.22	Checking unfeasibility...
20.13/20.22	Time used: 0.003665
20.13/20.22	
20.13/20.22	Checking conditional termination of SCC {l2}...
20.13/20.22	
20.13/20.22	LOG: CALL solveLinear
20.13/20.22	
20.13/20.22	LOG: RETURN solveLinear - Elapsed time: 0.000991s
20.13/20.22	Ranking function: x_5^0
20.13/20.22	New Graphs: 
20.13/20.22	Transitions:
20.13/20.22	<l2, l2, 0 <= x_5^0 /\ undef8 = 0, {all remain the same}>
20.13/20.22	Variables:
20.13/20.22	x_5^0
20.13/20.22	> No variable changes in termination graph.
20.13/20.22	Checking conditional unfeasibility...
20.13/20.22	Calling Safety with literal 1 + x_5^0 <= 0 and entry <l2, l2, true, {all remain the same}>
20.13/20.22	
20.13/20.22	LOG: CALL check - Post:1 + x_5^0 <= 0 - Process 1
20.13/20.22	* Exit transition: <l2, l2, true, {all remain the same}>
20.13/20.22	* Postcondition  : 1 + x_5^0 <= 0
20.13/20.22	Quasi-invariants: 
20.13/20.22	Location 2: 1 + x_5^0 <= 0 ; 
20.13/20.22	Postcondition: 1 + x_5^0 <= 0
20.13/20.22	
20.13/20.22	LOG: CALL check - Post:1 + x_5^0 <= 0 - Process 2
20.13/20.22	* Exit transition: <l0, l2, true, {all remain the same}>
20.13/20.22	* Postcondition  : 1 + x_5^0 <= 0
20.13/20.22	
20.13/20.22	LOG: CALL solveLinear
20.13/20.22	
20.13/20.22	LOG: RETURN solveLinear - Elapsed time: 0.000226s
20.13/20.22	> Postcondition is not implied!
20.13/20.22	
20.13/20.22	LOG: RETURN check - Elapsed time: 0.000286s
20.13/20.22	
20.13/20.22	LOG: NarrowEntry size 1
20.13/20.22	Narrowing transition: 
20.13/20.22	<l2, l2, 0 <= x_5^0 /\ undef8 = 0, {all remain the same}>
20.13/20.22	
20.13/20.22	LOG: Narrow transition size 1
20.13/20.22	Narrowing transition: 
20.13/20.22	<l2, l2, 0 <= x_5^0 /\ 1 + undef14 <= 0, {x_5^0 -> -1 + x_5^0, rest remain the same}>
20.13/20.22	
20.13/20.22	LOG: Narrow transition size 1
20.13/20.22	Narrowing transition: 
20.13/20.22	<l2, l2, 0 <= x_5^0 /\ 1 <= undef14, {x_5^0 -> -1 + x_5^0, rest remain the same}>
20.13/20.22	
20.13/20.22	LOG: Narrow transition size 1
20.13/20.22	ENTRIES:
20.13/20.22	<l0, l2, 0 <= x_5^0, {all remain the same}>
20.13/20.22	END ENTRIES:
20.13/20.22	GRAPH:
20.13/20.22	<l2, l2, 0 <= x_5^0 /\ undef8 = 0, {all remain the same}>
20.13/20.22	<l2, l2, 0 <= x_5^0 /\ 1 + undef14 <= 0, {x_5^0 -> -1 + x_5^0, rest remain the same}>
20.13/20.22	<l2, l2, 0 <= x_5^0 /\ 1 <= undef14, {x_5^0 -> -1 + x_5^0, rest remain the same}>
20.13/20.22	END GRAPH:
20.13/20.22	EXIT: <l2, l2, true, {all remain the same}>
20.13/20.22	POST: 1 + x_5^0 <= 0
20.13/20.22	
20.13/20.22	
20.13/20.22	LOG: Try proving POST
20.13/20.22	Solving with 1 template(s).
20.13/20.22	
20.13/20.22	LOG: CALL solveNonLinearGetFirstSolution
20.13/20.22	
20.13/20.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007077s
20.13/20.22	Time used: 0.006976
20.13/20.22	Solving with 2 template(s).
20.13/20.22	
20.13/20.22	LOG: CALL solveNonLinearGetFirstSolution
20.13/20.22	
20.13/20.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001180s
20.13/20.22	Time used: 4.00051
20.13/20.22	Solving with 3 template(s).
20.13/20.22	
20.13/20.22	LOG: CALL solveNonLinearGetFirstSolution
20.13/20.22	
20.13/20.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.020793s
20.13/20.22	Time used: 1.01373
20.13/20.22	
20.13/20.22	LOG: Postcondition is not implied - no solution
20.13/20.22	> Postcondition is not implied!
20.13/20.22	
20.13/20.22	LOG: RETURN check - Elapsed time: 5.037676s
20.13/20.22	
20.13/20.22	Proving non-termination of subgraph 1
20.13/20.22	Transitions:
20.13/20.22	<l2, l2, 0 <= x_5^0 /\ undef8 = 0, {all remain the same}>
20.13/20.22	<l2, l2, 0 <= x_5^0 /\ 1 + undef14 <= 0, {x_5^0 -> -1 + x_5^0, rest remain the same}>
20.13/20.22	<l2, l2, 0 <= x_5^0 /\ 1 <= undef14, {x_5^0 -> -1 + x_5^0, rest remain the same}>
20.13/20.22	Variables:
20.13/20.22	x_5^0
20.13/20.22	
20.13/20.22	Checking conditional non-termination of SCC {l2}...
20.13/20.22	EXIT TRANSITIONS:
20.13/20.22	<l2, end, 1 + x_5^0 <= 0, {all remain the same}>
20.13/20.22	
20.13/20.22	Solving with 1 template(s).
20.13/20.22	
20.13/20.22	LOG: CALL solveNonLinearGetFirstSolution
20.13/20.22	
20.13/20.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.002134s
20.13/20.22	Time used: 5.00181
20.13/20.22	Solving with 2 template(s).
20.13/20.22	
20.13/20.22	LOG: CALL solveNonLinearGetFirstSolution
20.13/20.22	
20.13/20.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.005920s
20.13/20.22	Time used: 5.00123
20.13/20.22	Solving with 3 template(s).
20.13/20.22	
20.13/20.22	LOG: CALL solveNonLinearGetFirstSolution
20.13/20.22	
20.13/20.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.008227s
20.13/20.22	Time used: 5.00098
20.13/20.22	> Checking if the negation of the conditions of every pending exit is quasi-invariant... NO
20.13/20.22	
20.13/20.22	Proving non-termination of subgraph 1
20.13/20.22	Transitions:
20.13/20.22	<l2, l2, 0 <= x_5^0 /\ undef8 = 0, {all remain the same}>
20.13/20.22	Variables:
20.13/20.22	x_5^0
20.13/20.22	
20.13/20.22	Checking conditional non-termination of SCC {l2}...
20.13/20.22	EXIT TRANSITIONS:
20.13/20.22	<l2, end, 1 + x_5^0 <= 0, {all remain the same}>
20.13/20.22	
20.13/20.22	Solving with 1 template(s).
20.13/20.22	
20.13/20.22	LOG: CALL solveNonLinearGetFirstSolution
20.13/20.22	
20.13/20.22	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006632s
20.13/20.22	Time used: 0.006469
20.13/20.22	Improving Solution with cost 1 ...
20.13/20.22	
20.13/20.22	LOG: CALL solveNonLinearGetNextSolution
20.13/20.22	
20.13/20.22	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022873s
20.13/20.22	Time used: 0.022866
20.13/20.22	
20.13/20.22	LOG: SAT solveNonLinear - Elapsed time: 0.029505s
20.13/20.22	Cost: 1; Total time: 0.029335
20.13/20.22	Failed at location 2: 1 <= x_5^0
20.13/20.22	Before Improving: 
20.13/20.22	Quasi-invariant at l2: 1 <= x_5^0
20.13/20.22	Optimizing invariants...
20.13/20.22	
20.13/20.22	LOG: CALL solveLinear
20.13/20.22	
20.13/20.22	LOG: RETURN solveLinear - Elapsed time: 0.004355s
20.13/20.22	Remaining time after improvement: 0.99801
20.13/20.22	Minimizing number of undef constraints...
20.13/20.22	
20.13/20.22	LOG: CALL solveNonLinear
20.13/20.22	
20.13/20.22	LOG: RETURN solveNonLinear - Elapsed time: 0.002112s
20.13/20.22	Number of undef constraints reduced!
20.13/20.22	
20.13/20.22	Non-termination implied by a set of quasi-invariant(s):
20.13/20.22	Quasi-invariant at l2: 1 <= x_5^0
20.13/20.22	
20.13/20.22	Strengthening and disabling EXIT transitions...
20.13/20.22	Closed exits from l2: 1
20.13/20.22	
20.13/20.22	Strengthening and disabling transitions...
20.13/20.22	
20.13/20.22	LOG: CALL solverLinear in Graph for feasibility
20.13/20.22	
20.13/20.22	LOG: RETURN solveLinear in Graph for feasibility
20.13/20.22	Strengthening transition (result): 
20.13/20.22	<l2, l2, 1 <= x_5^0 /\ undef8 = 0, {all remain the same}>
20.13/20.22	
20.13/20.22	Calling reachability with...
20.13/20.22	Transition: <l2, end, true, {all remain the same}>
20.13/20.22	Conditions: 1 <= x_5^0, 
20.13/20.22	OPEN EXITS: 
20.13/20.22	<l2, end, 1 <= x_5^0, {all remain the same}>
20.13/20.22	
20.13/20.22	--- Reachability graph ---
20.13/20.22	> Graph without transitions.
20.13/20.22	
20.13/20.22	Calling reachability with...
20.13/20.22	Transition: <l0, l2, true, {all remain the same}>
20.13/20.22	Conditions: 1 <= x_5^0, 
20.13/20.22	OPEN EXITS: 
20.13/20.22	<l0, l2, 1 <= x_5^0, {all remain the same}>
20.13/20.22	
20.13/20.22	> Conditions are reachable!
20.13/20.22	
20.13/20.22	Program does NOT terminate
20.13/20.22	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
20.13/20.22	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
20.13/20.22	EOF