5.09/5.11	NO
5.09/5.11	
5.09/5.11	Solver Timeout: 4
5.09/5.11	Global Timeout: 300
5.09/5.11	No parsing errors!
5.09/5.11	Init Location: 0
5.09/5.11	Transitions:
5.09/5.11	<l0, l3, true>
5.09/5.11	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}>
5.09/5.11	<l2, l2, (arg1 > 0), par{arg1 -> 0, arg2 -> undef4}>
5.09/5.11	<l2, l2, (0 = arg1), par{arg1 -> 1, arg2 -> undef6}>
5.09/5.11	<l3, l1, true, par{arg1 -> undef7, arg2 -> undef8}>
5.09/5.11	
5.09/5.11	Fresh variables:
5.09/5.11	undef2, undef4, undef6, undef7, undef8, 
5.09/5.11	
5.09/5.11	Undef variables:
5.09/5.11	undef2, undef4, undef6, undef7, undef8, 
5.09/5.11	
5.09/5.11	Abstraction variables:
5.09/5.11	
5.09/5.11	Exit nodes:
5.09/5.11	
5.09/5.11	Accepting locations:
5.09/5.11	
5.09/5.11	Asserts:
5.09/5.11	
5.09/5.11	Preprocessed LLVMGraph
5.09/5.11	Init Location: 0
5.09/5.11	Transitions:
5.09/5.11	<l0, l2, (arg1 = undef8) /\ (undef7 > 0) /\ (undef8 > ~(1))>
5.09/5.11	<l2, l2, (arg1 > 0), par{arg1 -> 0}>
5.09/5.11	<l2, l2, (0 = arg1), par{arg1 -> 1}>
5.09/5.11	
5.09/5.11	Fresh variables:
5.09/5.11	undef2, undef4, undef6, undef7, undef8, 
5.09/5.11	
5.09/5.11	Undef variables:
5.09/5.11	undef2, undef4, undef6, undef7, undef8, 
5.09/5.11	
5.09/5.11	Abstraction variables:
5.09/5.11	
5.09/5.11	Exit nodes:
5.09/5.11	
5.09/5.11	Accepting locations:
5.09/5.11	
5.09/5.11	Asserts:
5.09/5.11	
5.09/5.11	*************************************************************
5.09/5.11	*******************************************************************************************
5.09/5.11	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.09/5.11	*******************************************************************************************
5.09/5.11	
5.09/5.11	Init Location: 0
5.09/5.11	Graph 0:
5.09/5.11	Transitions:
5.09/5.11	Variables:
5.09/5.11	
5.09/5.11	Graph 1:
5.09/5.11	Transitions:
5.09/5.11	<l2, l2, 1 <= arg1, {arg1 -> 0, rest remain the same}>
5.09/5.11	<l2, l2, arg1 = 0, {arg1 -> 1, rest remain the same}>
5.09/5.11	Variables:
5.09/5.11	arg1
5.09/5.11	
5.09/5.11	Precedence: 
5.09/5.11	Graph 0
5.09/5.11	
5.09/5.11	Graph 1
5.09/5.11	<l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
5.09/5.11	
5.09/5.11	Map Locations to Subgraph:
5.09/5.11	( 0 , 0 )
5.09/5.11	( 2 , 1 )
5.09/5.11	
5.09/5.11	*******************************************************************************************
5.09/5.11	********************************    CHECKING ASSERTIONS    ********************************
5.09/5.11	*******************************************************************************************
5.09/5.11	
5.09/5.11	Proving termination of subgraph 0
5.09/5.11	Proving termination of subgraph 1
5.09/5.11	Checking unfeasibility...
5.09/5.11	Time used: 0.00288
5.09/5.11	
5.09/5.11	Checking conditional termination of SCC {l2}...
5.09/5.11	
5.09/5.11	LOG: CALL solveLinear
5.09/5.11	
5.09/5.11	LOG: RETURN solveLinear - Elapsed time: 0.000750s
5.09/5.11	
5.09/5.11	LOG: CALL solveLinear
5.09/5.11	
5.09/5.11	LOG: RETURN solveLinear - Elapsed time: 0.002846s
5.09/5.11	Trying to remove transition: <l2, l2, arg1 = 0, {arg1 -> 1, rest remain the same}>
5.09/5.11	Solving with 1 template(s).
5.09/5.11	
5.09/5.11	LOG: CALL solveNonLinearGetFirstSolution
5.09/5.11	
5.09/5.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005808s
5.09/5.11	Time used: 0.005641
5.09/5.11	Trying to remove transition: <l2, l2, 1 <= arg1, {arg1 -> 0, rest remain the same}>
5.09/5.11	Solving with 1 template(s).
5.09/5.11	
5.09/5.11	LOG: CALL solveNonLinearGetFirstSolution
5.09/5.11	
5.09/5.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005221s
5.09/5.11	Time used: 0.004941
5.09/5.11	Solving with 1 template(s).
5.09/5.11	
5.09/5.11	LOG: CALL solveNonLinearGetFirstSolution
5.09/5.11	
5.09/5.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012297s
5.09/5.11	Time used: 0.012013
5.09/5.11	Solving with 2 template(s).
5.09/5.11	
5.09/5.11	LOG: CALL solveNonLinearGetFirstSolution
5.09/5.11	
5.09/5.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001342s
5.09/5.11	Time used: 4.00052
5.09/5.11	Solving with 3 template(s).
5.09/5.11	
5.09/5.11	LOG: CALL solveNonLinearGetFirstSolution
5.09/5.11	
5.09/5.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.013663s
5.09/5.11	Time used: 1.00046
5.09/5.11	Solving with 1 template(s).
5.09/5.11	
5.09/5.11	LOG: CALL solveNonLinearGetFirstSolution
5.09/5.11	
5.09/5.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014510s
5.09/5.11	Time used: 0.008426
5.09/5.11	Termination failed. Trying to show unreachability...
5.09/5.11	Proving unreachability of entry: <l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
5.09/5.11	
5.09/5.11	LOG: CALL check - Post:1 <= 0 - Process 1
5.09/5.11	* Exit transition: <l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
5.09/5.11	* Postcondition  : 1 <= 0
5.09/5.11	
5.09/5.11	LOG: CALL solveLinear
5.09/5.11	
5.09/5.11	LOG: RETURN solveLinear - Elapsed time: 0.001003s
5.09/5.11	> Postcondition is not implied!
5.09/5.11	
5.09/5.11	LOG: RETURN check - Elapsed time: 0.001103s
5.09/5.11	Cannot prove unreachability
5.09/5.11	
5.09/5.11	Proving non-termination of subgraph 1
5.09/5.11	Transitions:
5.09/5.11	<l2, l2, 1 <= arg1, {arg1 -> 0, rest remain the same}>
5.09/5.11	<l2, l2, arg1 = 0, {arg1 -> 1, rest remain the same}>
5.09/5.11	Variables:
5.09/5.11	arg1
5.09/5.11	
5.09/5.11	Checking conditional non-termination of SCC {l2}...
5.09/5.11	EXIT TRANSITIONS:
5.09/5.11	<l2, end, 1 + arg1 <= 0, {all remain the same}>
5.09/5.11	
5.09/5.11	Solving with 1 template(s).
5.09/5.11	
5.09/5.11	LOG: CALL solveNonLinearGetFirstSolution
5.09/5.11	
5.09/5.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004659s
5.09/5.11	Time used: 0.004551
5.09/5.11	
5.09/5.11	LOG: SAT solveNonLinear - Elapsed time: 0.004659s
5.09/5.11	Cost: 0; Total time: 0.004551
5.09/5.11	Non-termination implied by a set of quasi-invariant(s):
5.09/5.11	Quasi-invariant at l2: 0 <= arg1
5.09/5.11	
5.09/5.11	Strengthening and disabling EXIT transitions...
5.09/5.11	Closed exits from l2: 1
5.09/5.11	
5.09/5.11	Strengthening and disabling transitions...
5.09/5.11	
5.09/5.11	LOG: CALL solverLinear in Graph for feasibility
5.09/5.11	
5.09/5.11	LOG: RETURN solveLinear in Graph for feasibility
5.09/5.11	Strengthening transition (result): 
5.09/5.11	<l2, l2, 1 <= arg1, {arg1 -> 0, rest remain the same}>
5.09/5.11	
5.09/5.11	LOG: CALL solverLinear in Graph for feasibility
5.09/5.11	
5.09/5.11	LOG: RETURN solveLinear in Graph for feasibility
5.09/5.11	Strengthening transition (result): 
5.09/5.11	<l2, l2, arg1 = 0, {arg1 -> 1, rest remain the same}>
5.09/5.11	
5.09/5.11	Calling reachability with...
5.09/5.11	Transition: <l2, end, true, {all remain the same}>
5.09/5.11	Conditions: 0 <= arg1, 
5.09/5.11	OPEN EXITS: 
5.09/5.11	<l2, end, 0 <= arg1, {all remain the same}>
5.09/5.11	
5.09/5.11	--- Reachability graph ---
5.09/5.11	> Graph without transitions.
5.09/5.11	
5.09/5.11	Calling reachability with...
5.09/5.11	Transition: <l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
5.09/5.11	Conditions: 0 <= arg1, 
5.09/5.11	OPEN EXITS: 
5.09/5.11	<l0, l2, 0 <= arg1 /\ 0 <= undef8 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
5.09/5.11	
5.09/5.11	> Conditions are reachable!
5.09/5.11	
5.09/5.11	Program does NOT terminate
5.09/5.11	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.09/5.11	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.09/5.11	EOF