15.32/15.37	NO
15.32/15.37	
15.32/15.37	Solver Timeout: 4
15.32/15.37	Global Timeout: 300
15.32/15.37	No parsing errors!
15.32/15.37	Init Location: 0
15.32/15.37	Transitions:
15.32/15.37	<l0, l3, true>
15.32/15.37	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}>
15.32/15.37	<l2, l2, (arg1 < 2) /\ (arg1 < 0) /\ (0 < (~(1) * arg1)) /\ (arg1 < 1), par{arg1 -> ((~(1) * arg1) + 1), arg2 -> undef4}>
15.32/15.37	<l2, l2, (arg1 > 0) /\ (2 > (~(1) * arg1)), par{arg1 -> ((~(1) * arg1) - 1), arg2 -> undef6}>
15.32/15.37	<l3, l1, true, par{arg1 -> undef7, arg2 -> undef8}>
15.32/15.37	
15.32/15.37	Fresh variables:
15.32/15.37	undef2, undef4, undef6, undef7, undef8, 
15.32/15.37	
15.32/15.37	Undef variables:
15.32/15.37	undef2, undef4, undef6, undef7, undef8, 
15.32/15.37	
15.32/15.37	Abstraction variables:
15.32/15.37	
15.32/15.37	Exit nodes:
15.32/15.37	
15.32/15.37	Accepting locations:
15.32/15.37	
15.32/15.37	Asserts:
15.32/15.37	
15.32/15.37	Preprocessed LLVMGraph
15.32/15.37	Init Location: 0
15.32/15.37	Transitions:
15.32/15.37	<l0, l2, (arg1 = undef8) /\ (undef7 > 0) /\ (undef8 > ~(1))>
15.32/15.37	<l2, l2, (arg1 < 2) /\ (arg1 < 0) /\ (0 < (~(1) * arg1)) /\ (arg1 < 1), par{arg1 -> ((~(1) * arg1) + 1)}>
15.32/15.37	<l2, l2, (arg1 > 0) /\ (2 > (~(1) * arg1)), par{arg1 -> ((~(1) * arg1) - 1)}>
15.32/15.37	
15.32/15.37	Fresh variables:
15.32/15.37	undef2, undef4, undef6, undef7, undef8, 
15.32/15.37	
15.32/15.37	Undef variables:
15.32/15.37	undef2, undef4, undef6, undef7, undef8, 
15.32/15.37	
15.32/15.37	Abstraction variables:
15.32/15.37	
15.32/15.37	Exit nodes:
15.32/15.37	
15.32/15.37	Accepting locations:
15.32/15.37	
15.32/15.37	Asserts:
15.32/15.37	
15.32/15.37	*************************************************************
15.32/15.37	*******************************************************************************************
15.32/15.37	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
15.32/15.37	*******************************************************************************************
15.32/15.37	
15.32/15.37	Init Location: 0
15.32/15.37	Graph 0:
15.32/15.37	Transitions:
15.32/15.37	Variables:
15.32/15.37	
15.32/15.37	Graph 1:
15.32/15.37	Transitions:
15.32/15.37	<l2, l2, 1 + arg1 <= 0, {arg1 -> 1 - arg1, rest remain the same}>
15.32/15.37	<l2, l2, 1 <= arg1, {arg1 -> -1 - arg1, rest remain the same}>
15.32/15.37	Variables:
15.32/15.37	arg1
15.32/15.37	
15.32/15.37	Precedence: 
15.32/15.37	Graph 0
15.32/15.37	
15.32/15.37	Graph 1
15.32/15.37	<l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
15.32/15.37	
15.32/15.37	Map Locations to Subgraph:
15.32/15.37	( 0 , 0 )
15.32/15.37	( 2 , 1 )
15.32/15.37	
15.32/15.37	*******************************************************************************************
15.32/15.37	********************************    CHECKING ASSERTIONS    ********************************
15.32/15.37	*******************************************************************************************
15.32/15.37	
15.32/15.37	Proving termination of subgraph 0
15.32/15.37	Proving termination of subgraph 1
15.32/15.37	Checking unfeasibility...
15.32/15.37	Time used: 0.002867
15.32/15.37	
15.32/15.37	Checking conditional termination of SCC {l2}...
15.32/15.37	
15.32/15.37	LOG: CALL solveLinear
15.32/15.37	
15.32/15.37	LOG: RETURN solveLinear - Elapsed time: 0.000760s
15.32/15.37	
15.32/15.37	LOG: CALL solveLinear
15.32/15.37	
15.32/15.37	LOG: RETURN solveLinear - Elapsed time: 0.009256s
15.32/15.37	Trying to remove transition: <l2, l2, 1 <= arg1, {arg1 -> -1 - arg1, rest remain the same}>
15.32/15.37	Solving with 1 template(s).
15.32/15.37	
15.32/15.37	LOG: CALL solveNonLinearGetFirstSolution
15.32/15.37	
15.32/15.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005886s
15.32/15.37	Time used: 0.005718
15.32/15.37	Trying to remove transition: <l2, l2, 1 + arg1 <= 0, {arg1 -> 1 - arg1, rest remain the same}>
15.32/15.37	Solving with 1 template(s).
15.32/15.37	
15.32/15.37	LOG: CALL solveNonLinearGetFirstSolution
15.32/15.37	
15.32/15.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005092s
15.32/15.37	Time used: 0.00482
15.32/15.37	Solving with 1 template(s).
15.32/15.37	
15.32/15.37	LOG: CALL solveNonLinearGetFirstSolution
15.32/15.37	
15.32/15.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011453s
15.32/15.37	Time used: 0.011177
15.32/15.37	Solving with 2 template(s).
15.32/15.37	
15.32/15.37	LOG: CALL solveNonLinearGetFirstSolution
15.32/15.37	
15.32/15.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026550s
15.32/15.37	Time used: 0.025939
15.32/15.37	Improving Solution with cost 1 ...
15.32/15.37	
15.32/15.37	LOG: CALL solveNonLinearGetNextSolution
15.32/15.37	
15.32/15.37	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.139528s
15.32/15.37	Time used: 0.139517
15.32/15.37	
15.32/15.37	LOG: SAT solveNonLinear - Elapsed time: 0.166078s
15.32/15.37	Cost: 1; Total time: 0.165456
15.32/15.37	Failed at location 2: arg1 <= 0
15.32/15.37	Before Improving: 
15.32/15.37	Quasi-invariant at l2: arg1 <= 0
15.32/15.37	Quasi-invariant at l2: 0 <= arg1
15.32/15.37	Optimizing invariants...
15.32/15.37	
15.32/15.37	LOG: CALL solveLinear
15.32/15.37	
15.32/15.37	LOG: RETURN solveLinear - Elapsed time: 0.011245s
15.32/15.37	Remaining time after improvement: 0.998454
15.32/15.37	Termination implied by a set of quasi-invariant(s):
15.32/15.37	Quasi-invariant at l2: arg1 <= 0
15.32/15.37	Quasi-invariant at l2: 0 <= arg1
15.32/15.37	[ Invariant Graph ]
15.32/15.37	Strengthening and disabling transitions...
15.32/15.37	
15.32/15.37	LOG: CALL solverLinear in Graph for feasibility
15.32/15.37	
15.32/15.37	LOG: RETURN solveLinear in Graph for feasibility
15.32/15.37	It's unfeasible. Removing transition: 
15.32/15.37	<l2, l2, 1 + arg1 <= 0, {arg1 -> 1 - arg1, rest remain the same}>
15.32/15.37	
15.32/15.37	LOG: CALL solverLinear in Graph for feasibility
15.32/15.37	
15.32/15.37	LOG: RETURN solveLinear in Graph for feasibility
15.32/15.37	It's unfeasible. Removing transition: 
15.32/15.37	<l2, l2, 1 <= arg1, {arg1 -> -1 - arg1, rest remain the same}>
15.32/15.37	[ Termination Graph ]
15.32/15.37	Strengthening and disabling transitions...
15.32/15.37	
15.32/15.37	LOG: CALL solverLinear in Graph for feasibility
15.32/15.37	
15.32/15.37	LOG: RETURN solveLinear in Graph for feasibility
15.32/15.37	It's unfeasible. Removing transition: 
15.32/15.37	<l2, l2, 1 + arg1 <= 0, {arg1 -> 1 - arg1, rest remain the same}>
15.32/15.37	
15.32/15.37	LOG: CALL solverLinear in Graph for feasibility
15.32/15.37	
15.32/15.37	LOG: RETURN solveLinear in Graph for feasibility
15.32/15.37	It's unfeasible. Removing transition: 
15.32/15.37	<l2, l2, 1 <= arg1, {arg1 -> -1 - arg1, rest remain the same}>
15.32/15.37	New Graphs: 
15.32/15.37	Calling Safety with literal arg1 <= 0 and entry <l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
15.32/15.37	
15.32/15.37	LOG: CALL check - Post:arg1 <= 0 - Process 1
15.32/15.37	* Exit transition: <l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
15.32/15.37	* Postcondition  : arg1 <= 0
15.32/15.37	
15.32/15.37	LOG: CALL solveLinear
15.32/15.37	
15.32/15.37	LOG: RETURN solveLinear - Elapsed time: 0.000600s
15.32/15.37	> Postcondition is not implied!
15.32/15.37	
15.32/15.37	LOG: RETURN check - Elapsed time: 0.000692s
15.32/15.37	INVARIANTS: 
15.32/15.37	2: 
15.32/15.37	Quasi-INVARIANTS to narrow Graph: 
15.32/15.37	2: arg1 <= 0 , 0 <= arg1 , 
15.32/15.37	Narrowing transition: 
15.32/15.37	<l2, l2, 1 + arg1 <= 0, {arg1 -> 1 - arg1, rest remain the same}>
15.32/15.37	
15.32/15.37	LOG: Narrow transition size 2
15.32/15.37	Narrowing transition: 
15.32/15.37	<l2, l2, 1 <= arg1, {arg1 -> -1 - arg1, rest remain the same}>
15.32/15.37	
15.32/15.37	LOG: Narrow transition size 2
15.32/15.37	invGraph after Narrowing: 
15.32/15.37	Transitions:
15.32/15.37	<l2, l2, 1 + arg1 <= 0, {arg1 -> 1 - arg1, rest remain the same}>
15.32/15.37	<l2, l2, 1 <= arg1, {arg1 -> -1 - arg1, rest remain the same}>
15.32/15.37	Variables:
15.32/15.37	arg1
15.32/15.37	Checking conditional termination of SCC {l2}...
15.32/15.37	
15.32/15.37	LOG: CALL solveLinear
15.32/15.37	
15.32/15.37	LOG: RETURN solveLinear - Elapsed time: 0.000722s
15.32/15.37	
15.32/15.37	LOG: CALL solveLinear
15.32/15.37	
15.32/15.37	LOG: RETURN solveLinear - Elapsed time: 0.009233s
15.32/15.37	Trying to remove transition: <l2, l2, 1 <= arg1, {arg1 -> -1 - arg1, rest remain the same}>
15.32/15.37	Solving with 1 template(s).
15.32/15.37	
15.32/15.37	LOG: CALL solveNonLinearGetFirstSolution
15.32/15.37	
15.32/15.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005476s
15.32/15.37	Time used: 0.005321
15.32/15.37	Trying to remove transition: <l2, l2, 1 + arg1 <= 0, {arg1 -> 1 - arg1, rest remain the same}>
15.32/15.37	Solving with 1 template(s).
15.32/15.37	
15.32/15.37	LOG: CALL solveNonLinearGetFirstSolution
15.32/15.37	
15.32/15.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005152s
15.32/15.37	Time used: 0.00487
15.32/15.37	Solving with 1 template(s).
15.32/15.37	
15.32/15.37	LOG: CALL solveNonLinearGetFirstSolution
15.32/15.37	
15.32/15.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010184s
15.32/15.37	Time used: 0.009896
15.32/15.37	Solving with 2 template(s).
15.32/15.37	
15.32/15.37	LOG: CALL solveNonLinearGetFirstSolution
15.32/15.37	
15.32/15.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001807s
15.32/15.37	Time used: 4.00093
15.32/15.37	Solving with 3 template(s).
15.32/15.37	
15.32/15.37	LOG: CALL solveNonLinearGetFirstSolution
15.32/15.37	
15.32/15.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.011109s
15.32/15.37	Time used: 1.00078
15.32/15.37	Solving with 1 template(s).
15.32/15.37	
15.32/15.37	LOG: CALL solveNonLinearGetFirstSolution
15.32/15.37	
15.32/15.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015491s
15.32/15.37	Time used: 0.009427
15.32/15.37	
15.32/15.37	Proving non-termination of subgraph 1
15.32/15.37	Transitions:
15.32/15.37	<l2, l2, 1 + arg1 <= 0, {arg1 -> 1 - arg1, rest remain the same}>
15.32/15.37	<l2, l2, 1 <= arg1, {arg1 -> -1 - arg1, rest remain the same}>
15.32/15.37	Variables:
15.32/15.37	arg1
15.32/15.37	
15.32/15.37	Checking conditional non-termination of SCC {l2}...
15.32/15.37	EXIT TRANSITIONS:
15.32/15.37	<l2, end, arg1 = 0, {all remain the same}>
15.32/15.37	
15.32/15.37	Solving with 1 template(s).
15.32/15.37	
15.32/15.37	LOG: CALL solveNonLinearGetFirstSolution
15.32/15.37	
15.32/15.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004638s
15.32/15.37	Time used: 0.004539
15.32/15.37	Solving with 2 template(s).
15.32/15.37	
15.32/15.37	LOG: CALL solveNonLinearGetFirstSolution
15.32/15.37	
15.32/15.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.014083s
15.32/15.37	Time used: 5.01327
15.32/15.37	Solving with 3 template(s).
15.32/15.37	
15.32/15.37	LOG: CALL solveNonLinearGetFirstSolution
15.32/15.37	
15.32/15.37	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.006757s
15.32/15.37	Time used: 5.00099
15.32/15.37	> Checking if the negation of the conditions of every pending exit is quasi-invariant... YES
15.32/15.37	Calling reachability with...
15.32/15.37	Transition: <l2, end, true, {all remain the same}>
15.32/15.37	Conditions: 0 <= arg1, 1 <= arg1, 
15.32/15.37	Transition: <l2, end, true, {all remain the same}>
15.32/15.37	Conditions: 1 + arg1 <= 0, arg1 <= 0, 
15.32/15.37	OPEN EXITS: 
15.32/15.37	<l2, end, 1 <= arg1, {all remain the same}>
15.32/15.37	<l2, end, 1 + arg1 <= 0, {all remain the same}>
15.32/15.37	
15.32/15.37	--- Reachability graph ---
15.32/15.37	> Graph without transitions.
15.32/15.37	
15.32/15.37	Calling reachability with...
15.32/15.37	Transition: <l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
15.32/15.37	Conditions: 1 <= arg1, 
15.32/15.37	Transition: <l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
15.32/15.37	Conditions: 1 + arg1 <= 0, 
15.32/15.37	OPEN EXITS: 
15.32/15.37	<l0, l2, 0 <= undef8 /\ 1 <= arg1 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
15.32/15.37	
15.32/15.37	> Conditions are reachable!
15.32/15.37	
15.32/15.37	Program does NOT terminate
15.32/15.37	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
15.32/15.37	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
15.32/15.37	EOF