10.28/10.35	NO
10.28/10.35	
10.28/10.35	Solver Timeout: 4
10.28/10.35	Global Timeout: 300
10.28/10.35	No parsing errors!
10.28/10.35	Init Location: 0
10.28/10.35	Transitions:
10.28/10.35	<l0, l5, true>
10.28/10.35	<l1, l2, (undef1 = __disjvr_0^0) /\ (__disjvr_0^0 = undef1), par{__disjvr_0^0 -> undef1}>
10.28/10.35	<l2, l3, true, par{deltaext^0 -> (0 + deltaext_new^0)}>
10.28/10.35	<l3, l1, ((~(1) + (2 * deltaext^0)) <= ((0 + c0^0) + wnt^0)) /\ (((0 + c0^0) + wnt^0) <= (0 + (2 * deltaext^0))), par{deltaext_new^0 -> (0 + deltaext^0)}>
10.28/10.35	<l3, l1, (((1 + c0^0) + wnt^0) <= (~(1) + (2 * deltaext^0))), par{deltaext_new^0 -> (~(1) + deltaext^0)}>
10.28/10.35	<l3, l1, ((1 + (2 * deltaext^0)) <= ((0 + c0^0) + wnt^0)), par{deltaext_new^0 -> (1 + deltaext^0)}>
10.28/10.35	<l4, l3, (0 <= (0 + wnt^0)) /\ ((0 + wnt^0) <= 3) /\ (0 <= (0 + deltaext^0)) /\ ((0 + deltaext^0) <= 3), par{c0^0 -> 2}>
10.28/10.35	<l5, l4, true>
10.28/10.35	
10.28/10.35	Fresh variables:
10.28/10.35	undef1, 
10.28/10.35	
10.28/10.35	Undef variables:
10.28/10.35	undef1, 
10.28/10.35	
10.28/10.35	Abstraction variables:
10.28/10.35	
10.28/10.35	Exit nodes:
10.28/10.35	
10.28/10.35	Accepting locations:
10.28/10.35	
10.28/10.35	Asserts:
10.28/10.35	
10.28/10.35	Preprocessed LLVMGraph
10.28/10.35	Init Location: 0
10.28/10.35	Transitions:
10.28/10.35	<l0, l3, (2 = 2) /\ (0 <= (0 + wnt^0)) /\ ((0 + wnt^0) <= 3) /\ (0 <= (0 + deltaext^0)) /\ ((0 + deltaext^0) <= 3)>
10.28/10.35	<l3, l3, ((~(1) + (2 * deltaext^0)) <= ((0 + 2) + wnt^0)) /\ (((0 + 2) + wnt^0) <= (0 + (2 * deltaext^0))) /\ (undef1 = __disjvr_0^0) /\ (__disjvr_0^0 = undef1), par{__disjvr_0^0 -> undef1, deltaext^0 -> (0 + (0 + deltaext^0))}>
10.28/10.35	<l3, l3, (((1 + 2) + wnt^0) <= (~(1) + (2 * deltaext^0))) /\ (undef1 = __disjvr_0^0) /\ (__disjvr_0^0 = undef1), par{__disjvr_0^0 -> undef1, deltaext^0 -> (0 + (~(1) + deltaext^0))}>
10.28/10.35	<l3, l3, ((1 + (2 * deltaext^0)) <= ((0 + 2) + wnt^0)) /\ (undef1 = __disjvr_0^0) /\ (__disjvr_0^0 = undef1), par{__disjvr_0^0 -> undef1, deltaext^0 -> (0 + (1 + deltaext^0))}>
10.28/10.35	
10.28/10.35	Fresh variables:
10.28/10.35	undef1, 
10.28/10.35	
10.28/10.35	Undef variables:
10.28/10.35	undef1, 
10.28/10.35	
10.28/10.35	Abstraction variables:
10.28/10.35	
10.28/10.35	Exit nodes:
10.28/10.35	
10.28/10.35	Accepting locations:
10.28/10.35	
10.28/10.35	Asserts:
10.28/10.35	
10.28/10.35	*************************************************************
10.28/10.35	*******************************************************************************************
10.28/10.35	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
10.28/10.35	*******************************************************************************************
10.28/10.35	
10.28/10.35	Init Location: 0
10.28/10.35	Graph 0:
10.28/10.35	Transitions:
10.28/10.35	Variables:
10.28/10.35	
10.28/10.35	Graph 1:
10.28/10.35	Transitions:
10.28/10.35	<l3, l3, 2 + wnt^0 <= 2*deltaext^0 /\ 2*deltaext^0 <= 3 + wnt^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, rest remain the same}>
10.28/10.35	<l3, l3, 4 + wnt^0 <= 2*deltaext^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> -1 + deltaext^0, rest remain the same}>
10.28/10.35	<l3, l3, 2*deltaext^0 <= 1 + wnt^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> 1 + deltaext^0, rest remain the same}>
10.28/10.35	Variables:
10.28/10.35	__disjvr_0^0, deltaext^0, wnt^0
10.28/10.35	
10.28/10.35	Precedence: 
10.28/10.35	Graph 0
10.28/10.35	
10.28/10.35	Graph 1
10.28/10.35	<l0, l3, 0 <= deltaext^0 /\ 0 <= wnt^0 /\ deltaext^0 <= 3 /\ wnt^0 <= 3, {all remain the same}>
10.28/10.35	
10.28/10.35	Map Locations to Subgraph:
10.28/10.35	( 0 , 0 )
10.28/10.35	( 3 , 1 )
10.28/10.35	
10.28/10.35	*******************************************************************************************
10.28/10.35	********************************    CHECKING ASSERTIONS    ********************************
10.28/10.35	*******************************************************************************************
10.28/10.35	
10.28/10.35	Proving termination of subgraph 0
10.28/10.35	Proving termination of subgraph 1
10.28/10.35	Checking unfeasibility...
10.28/10.35	Time used: 0.009157
10.28/10.35	
10.28/10.35	Checking conditional termination of SCC {l3}...
10.28/10.35	
10.28/10.35	LOG: CALL solveLinear
10.28/10.35	
10.28/10.35	LOG: RETURN solveLinear - Elapsed time: 0.001597s
10.28/10.35	
10.28/10.35	LOG: CALL solveLinear
10.28/10.35	
10.28/10.35	LOG: RETURN solveLinear - Elapsed time: 0.020046s
10.28/10.35	Trying to remove transition: <l3, l3, 2*deltaext^0 <= 1 + wnt^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> 1 + deltaext^0, rest remain the same}>
10.28/10.35	Solving with 1 template(s).
10.28/10.35	
10.28/10.35	LOG: CALL solveNonLinearGetFirstSolution
10.28/10.35	
10.28/10.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025009s
10.28/10.35	Time used: 0.024526
10.28/10.35	Trying to remove transition: <l3, l3, 4 + wnt^0 <= 2*deltaext^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> -1 + deltaext^0, rest remain the same}>
10.28/10.35	Solving with 1 template(s).
10.28/10.35	
10.28/10.35	LOG: CALL solveNonLinearGetFirstSolution
10.28/10.35	
10.28/10.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017895s
10.28/10.35	Time used: 0.016798
10.28/10.35	Trying to remove transition: <l3, l3, 2 + wnt^0 <= 2*deltaext^0 /\ 2*deltaext^0 <= 3 + wnt^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, rest remain the same}>
10.28/10.35	Solving with 1 template(s).
10.28/10.35	
10.28/10.35	LOG: CALL solveNonLinearGetFirstSolution
10.28/10.35	
10.28/10.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011307s
10.28/10.35	Time used: 0.010333
10.28/10.35	Solving with 1 template(s).
10.28/10.35	
10.28/10.35	LOG: CALL solveNonLinearGetFirstSolution
10.28/10.35	
10.28/10.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.050427s
10.28/10.35	Time used: 0.049456
10.28/10.35	Solving with 2 template(s).
10.28/10.35	
10.28/10.35	LOG: CALL solveNonLinearGetFirstSolution
10.28/10.35	
10.28/10.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003722s
10.28/10.35	Time used: 4.00074
10.28/10.35	Solving with 3 template(s).
10.28/10.35	
10.28/10.35	LOG: CALL solveNonLinearGetFirstSolution
10.28/10.35	
10.28/10.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.713000s
10.28/10.35	Time used: 0.703363
10.28/10.35	Improving Solution with cost 2 ...
10.28/10.35	
10.28/10.35	LOG: CALL solveNonLinearGetNextSolution
10.28/10.35	
10.28/10.35	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.297463s
10.28/10.35	Time used: 0.297445
10.28/10.35	
10.28/10.35	LOG: SAT solveNonLinear - Elapsed time: 1.010463s
10.28/10.35	Cost: 2; Total time: 1.00081
10.28/10.35	Failed at location 3: wnt^0 <= 0
10.28/10.35	Failed at location 3: deltaext^0 <= 1 + wnt^0
10.28/10.35	Before Improving: 
10.28/10.35	Quasi-invariant at l3: wnt^0 <= 0
10.28/10.35	Quasi-invariant at l3: deltaext^0 <= 1 + wnt^0
10.28/10.35	Quasi-invariant at l3: 0 <= deltaext^0 + wnt^0
10.28/10.35	Optimizing invariants...
10.28/10.35	
10.28/10.35	LOG: CALL solveLinear
10.28/10.35	
10.28/10.35	LOG: RETURN solveLinear - Elapsed time: 0.010587s
10.28/10.35	Quasi-invariant improved
10.28/10.35	
10.28/10.35	LOG: CALL solveLinear
10.28/10.35	
10.28/10.35	LOG: RETURN solveLinear - Elapsed time: 0.004864s
10.28/10.35	Remaining time after improvement: 0.989696
10.28/10.35	Termination implied by a set of quasi-invariant(s):
10.28/10.35	Quasi-invariant at l3: wnt^0 <= 1
10.28/10.35	Quasi-invariant at l3: deltaext^0 <= 1 + wnt^0
10.28/10.35	Quasi-invariant at l3: 0 <= deltaext^0 + wnt^0
10.28/10.35	[ Invariant Graph ]
10.28/10.35	Strengthening and disabling transitions...
10.28/10.35	
10.28/10.35	LOG: CALL solverLinear in Graph for feasibility
10.28/10.35	
10.28/10.35	LOG: RETURN solveLinear in Graph for feasibility
10.28/10.35	Strengthening transition (result): 
10.28/10.35	<l3, l3, 0 <= deltaext^0 + wnt^0 /\ deltaext^0 <= 1 + wnt^0 /\ wnt^0 <= 1 /\ 2 + wnt^0 <= 2*deltaext^0 /\ 2*deltaext^0 <= 3 + wnt^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, rest remain the same}>
10.28/10.35	
10.28/10.35	LOG: CALL solverLinear in Graph for feasibility
10.28/10.35	
10.28/10.35	LOG: RETURN solveLinear in Graph for feasibility
10.28/10.35	It's unfeasible. Removing transition: 
10.28/10.35	<l3, l3, 4 + wnt^0 <= 2*deltaext^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> -1 + deltaext^0, rest remain the same}>
10.28/10.35	
10.28/10.35	LOG: CALL solverLinear in Graph for feasibility
10.28/10.35	
10.28/10.35	LOG: RETURN solveLinear in Graph for feasibility
10.28/10.35	Strengthening transition (result): 
10.28/10.35	<l3, l3, 0 <= deltaext^0 + wnt^0 /\ deltaext^0 <= 1 + wnt^0 /\ 2*deltaext^0 <= 1 + wnt^0 /\ wnt^0 <= 1 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> 1 + deltaext^0, rest remain the same}>
10.28/10.35	[ Termination Graph ]
10.28/10.35	Strengthening and disabling transitions...
10.28/10.35	
10.28/10.35	LOG: CALL solverLinear in Graph for feasibility
10.28/10.35	
10.28/10.35	LOG: RETURN solveLinear in Graph for feasibility
10.28/10.35	Strengthening transition (result): 
10.28/10.35	<l3, l3, 0 <= deltaext^0 + wnt^0 /\ deltaext^0 <= 1 + wnt^0 /\ wnt^0 <= 1 /\ 2 + wnt^0 <= 2*deltaext^0 /\ 2*deltaext^0 <= 3 + wnt^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, rest remain the same}>
10.28/10.35	
10.28/10.35	LOG: CALL solverLinear in Graph for feasibility
10.28/10.35	
10.28/10.35	LOG: RETURN solveLinear in Graph for feasibility
10.28/10.35	It's unfeasible. Removing transition: 
10.28/10.35	<l3, l3, 4 + wnt^0 <= 2*deltaext^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> -1 + deltaext^0, rest remain the same}>
10.28/10.35	
10.28/10.35	LOG: CALL solverLinear in Graph for feasibility
10.28/10.35	
10.28/10.35	LOG: RETURN solveLinear in Graph for feasibility
10.28/10.35	Strengthening transition (result): 
10.28/10.35	<l3, l3, 0 <= deltaext^0 + wnt^0 /\ deltaext^0 <= 1 + wnt^0 /\ 2*deltaext^0 <= 1 + wnt^0 /\ wnt^0 <= 1 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> 1 + deltaext^0, rest remain the same}>
10.28/10.35	New Graphs: 
10.28/10.35	Transitions:
10.28/10.35	<l3, l3, 0 <= deltaext^0 + wnt^0 /\ deltaext^0 <= 1 + wnt^0 /\ wnt^0 <= 1 /\ 2 + wnt^0 <= 2*deltaext^0 /\ 2*deltaext^0 <= 3 + wnt^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, rest remain the same}>
10.28/10.35	<l3, l3, 0 <= deltaext^0 + wnt^0 /\ deltaext^0 <= 1 + wnt^0 /\ 2*deltaext^0 <= 1 + wnt^0 /\ wnt^0 <= 1 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> 1 + deltaext^0, rest remain the same}>
10.28/10.35	Variables:
10.28/10.35	__disjvr_0^0, deltaext^0, wnt^0
10.28/10.35	Checking conditional termination of SCC {l3}...
10.28/10.35	
10.28/10.35	LOG: CALL solveLinear
10.28/10.35	
10.28/10.35	LOG: RETURN solveLinear - Elapsed time: 0.002230s
10.28/10.35	Ranking function: (15 / 2) - 15*deltaext^0 + (15 / 2)*wnt^0
10.28/10.35	New Graphs: 
10.28/10.35	Transitions:
10.28/10.35	<l3, l3, 0 <= deltaext^0 + wnt^0 /\ deltaext^0 <= 1 + wnt^0 /\ wnt^0 <= 1 /\ 2 + wnt^0 <= 2*deltaext^0 /\ 2*deltaext^0 <= 3 + wnt^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, rest remain the same}>
10.28/10.35	Variables:
10.28/10.35	__disjvr_0^0, deltaext^0, wnt^0
10.28/10.35	Checking conditional termination of SCC {l3}...
10.28/10.35	
10.28/10.35	LOG: CALL solveLinear
10.28/10.35	
10.28/10.35	LOG: RETURN solveLinear - Elapsed time: 0.000872s
10.28/10.35	
10.28/10.35	LOG: CALL solveLinear
10.28/10.35	
10.28/10.35	LOG: RETURN solveLinear - Elapsed time: 0.003351s
10.28/10.35	Trying to remove transition: <l3, l3, 0 <= deltaext^0 + wnt^0 /\ deltaext^0 <= 1 + wnt^0 /\ wnt^0 <= 1 /\ 2 + wnt^0 <= 2*deltaext^0 /\ 2*deltaext^0 <= 3 + wnt^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, rest remain the same}>
10.28/10.35	Solving with 1 template(s).
10.28/10.35	
10.28/10.35	LOG: CALL solveNonLinearGetFirstSolution
10.28/10.35	
10.28/10.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007547s
10.28/10.35	Time used: 0.007352
10.28/10.35	Solving with 1 template(s).
10.28/10.35	
10.28/10.35	LOG: CALL solveNonLinearGetFirstSolution
10.28/10.35	
10.28/10.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.051267s
10.28/10.35	Time used: 0.050701
10.28/10.35	Solving with 2 template(s).
10.28/10.35	
10.28/10.35	LOG: CALL solveNonLinearGetFirstSolution
10.28/10.35	
10.28/10.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001978s
10.28/10.35	Time used: 4.00069
10.28/10.35	Solving with 3 template(s).
10.28/10.35	
10.28/10.35	LOG: CALL solveNonLinearGetFirstSolution
10.28/10.35	
10.28/10.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005611s
10.28/10.35	Time used: 1.00015
10.28/10.35	Solving with 1 template(s).
10.28/10.35	
10.28/10.35	LOG: CALL solveNonLinearGetFirstSolution
10.28/10.35	
10.28/10.35	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024125s
10.28/10.35	Time used: 0.011142
10.28/10.35	Termination failed. Trying to show unreachability...
10.28/10.35	Proving unreachability of entry: <l0, l3, 0 <= deltaext^0 /\ 0 <= wnt^0 /\ deltaext^0 <= 3 /\ wnt^0 <= 3, {all remain the same}>
10.28/10.36	
10.28/10.36	LOG: CALL check - Post:1 <= 0 - Process 1
10.28/10.36	* Exit transition: <l0, l3, 0 <= deltaext^0 /\ 0 <= wnt^0 /\ deltaext^0 <= 3 /\ wnt^0 <= 3, {all remain the same}>
10.28/10.36	* Postcondition  : 1 <= 0
10.28/10.36	
10.28/10.36	LOG: CALL solveLinear
10.28/10.36	
10.28/10.36	LOG: RETURN solveLinear - Elapsed time: 0.001681s
10.28/10.36	> Postcondition is not implied!
10.28/10.36	
10.28/10.36	LOG: RETURN check - Elapsed time: 0.001780s
10.28/10.36	Cannot prove unreachability
10.28/10.36	
10.28/10.36	Proving non-termination of subgraph 1
10.28/10.36	Transitions:
10.28/10.36	<l3, l3, 2 + wnt^0 <= 2*deltaext^0 /\ 2*deltaext^0 <= 3 + wnt^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, rest remain the same}>
10.28/10.36	<l3, l3, 4 + wnt^0 <= 2*deltaext^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> -1 + deltaext^0, rest remain the same}>
10.28/10.36	<l3, l3, 2*deltaext^0 <= 1 + wnt^0 /\ __disjvr_0^0 = undef1, {__disjvr_0^0 -> undef1, deltaext^0 -> 1 + deltaext^0, rest remain the same}>
10.28/10.36	Variables:
10.28/10.36	__disjvr_0^0, deltaext^0, wnt^0
10.28/10.36	
10.28/10.36	Checking conditional non-termination of SCC {l3}...
10.28/10.36	> No exit transition to close.
10.28/10.36	Checking that every undef value has an assignment...
10.28/10.36	
10.28/10.36	LOG: CALL solveLinear
10.28/10.36	
10.28/10.36	LOG: RETURN solveLinear - Elapsed time: 0.002426s
10.28/10.36	Calling reachability with...
10.28/10.36	Transition: <l3, end, true, {all remain the same}>
10.28/10.36	Conditions: 
10.28/10.36	OPEN EXITS: 
10.28/10.36	<l3, end, true, {all remain the same}>
10.28/10.36	
10.28/10.36	--- Reachability graph ---
10.28/10.36	> Graph without transitions.
10.28/10.36	
10.28/10.36	Calling reachability with...
10.28/10.36	Transition: <l0, l3, 0 <= deltaext^0 /\ 0 <= wnt^0 /\ deltaext^0 <= 3 /\ wnt^0 <= 3, {all remain the same}>
10.28/10.36	Conditions: 
10.28/10.36	OPEN EXITS: 
10.28/10.36	<l0, l3, 0 <= deltaext^0 /\ 0 <= wnt^0 /\ deltaext^0 <= 3 /\ wnt^0 <= 3, {all remain the same}>
10.28/10.36	
10.28/10.36	> Conditions are reachable!
10.28/10.36	
10.28/10.36	Program does NOT terminate
10.28/10.36	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
10.28/10.36	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
10.28/10.36	EOF