5.12/5.21	NO
5.12/5.21	
5.12/5.21	Solver Timeout: 4
5.12/5.21	Global Timeout: 300
5.12/5.21	No parsing errors!
5.12/5.21	Init Location: 0
5.12/5.21	Transitions:
5.12/5.21	<l0, l3, true>
5.12/5.21	<l1, l2, true, par{arg1 -> 1, arg2 -> 2, arg3 -> 3}>
5.12/5.21	<l2, l2, (arg3 < 5), par{arg1 -> (((arg1 - arg2) + arg2) - (arg1 - arg2)), arg2 -> ((arg1 - arg2) + arg2), arg3 -> ((((arg1 - arg2) + arg2) - (arg1 - arg2)) + ((arg1 - arg2) + arg2))}>
5.12/5.21	<l3, l1, true, par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}>
5.12/5.21	
5.12/5.21	Fresh variables:
5.12/5.21	undef7, undef8, undef9, 
5.12/5.21	
5.12/5.21	Undef variables:
5.12/5.21	undef7, undef8, undef9, 
5.12/5.21	
5.12/5.21	Abstraction variables:
5.12/5.21	
5.12/5.21	Exit nodes:
5.12/5.21	
5.12/5.21	Accepting locations:
5.12/5.21	
5.12/5.21	Asserts:
5.12/5.21	
5.12/5.21	Preprocessed LLVMGraph
5.12/5.21	Init Location: 0
5.12/5.21	Transitions:
5.12/5.21	<l0, l2, (arg1 = 1) /\ (arg2 = 2) /\ (arg3 = 3)>
5.12/5.21	<l2, l2, (arg3 < 5), par{arg1 -> (((arg1 - arg2) + arg2) - (arg1 - arg2)), arg2 -> ((arg1 - arg2) + arg2), arg3 -> ((((arg1 - arg2) + arg2) - (arg1 - arg2)) + ((arg1 - arg2) + arg2))}>
5.12/5.21	
5.12/5.21	Fresh variables:
5.12/5.21	undef7, undef8, undef9, 
5.12/5.21	
5.12/5.21	Undef variables:
5.12/5.21	undef7, undef8, undef9, 
5.12/5.21	
5.12/5.21	Abstraction variables:
5.12/5.21	
5.12/5.21	Exit nodes:
5.12/5.21	
5.12/5.21	Accepting locations:
5.12/5.21	
5.12/5.21	Asserts:
5.12/5.21	
5.12/5.21	*************************************************************
5.12/5.21	*******************************************************************************************
5.12/5.21	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.12/5.21	*******************************************************************************************
5.12/5.21	
5.12/5.21	Init Location: 0
5.12/5.21	Graph 0:
5.12/5.21	Transitions:
5.12/5.21	Variables:
5.12/5.21	
5.12/5.21	Graph 1:
5.12/5.21	Transitions:
5.12/5.21	<l2, l2, arg3 <= 4, {arg1 -> arg2, arg2 -> arg1, arg3 -> arg1 + arg2, rest remain the same}>
5.12/5.21	Variables:
5.12/5.21	arg1, arg2, arg3
5.12/5.21	
5.12/5.21	Precedence: 
5.12/5.21	Graph 0
5.12/5.21	
5.12/5.21	Graph 1
5.12/5.21	<l0, l2, arg1 = 1 /\ arg2 = 2 /\ arg3 = 3, {all remain the same}>
5.12/5.21	
5.12/5.21	Map Locations to Subgraph:
5.12/5.21	( 0 , 0 )
5.12/5.21	( 2 , 1 )
5.12/5.21	
5.12/5.21	*******************************************************************************************
5.12/5.21	********************************    CHECKING ASSERTIONS    ********************************
5.12/5.21	*******************************************************************************************
5.12/5.21	
5.12/5.21	Proving termination of subgraph 0
5.12/5.21	Proving termination of subgraph 1
5.12/5.21	Checking unfeasibility...
5.12/5.21	Time used: 0.007288
5.12/5.21	
5.12/5.21	Checking conditional termination of SCC {l2}...
5.12/5.21	
5.12/5.21	LOG: CALL solveLinear
5.12/5.21	
5.12/5.21	LOG: RETURN solveLinear - Elapsed time: 0.000657s
5.12/5.21	
5.12/5.21	LOG: CALL solveLinear
5.12/5.21	
5.12/5.21	LOG: RETURN solveLinear - Elapsed time: 0.001666s
5.12/5.21	Trying to remove transition: <l2, l2, arg3 <= 4, {arg1 -> arg2, arg2 -> arg1, arg3 -> arg1 + arg2, rest remain the same}>
5.12/5.21	Solving with 1 template(s).
5.12/5.21	
5.12/5.21	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.21	
5.12/5.21	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005759s
5.12/5.21	Time used: 0.005621
5.12/5.21	Solving with 1 template(s).
5.12/5.21	
5.12/5.21	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.21	
5.12/5.21	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.078161s
5.12/5.21	Time used: 0.077785
5.12/5.21	Solving with 2 template(s).
5.12/5.21	
5.12/5.21	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.21	
5.12/5.21	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.893509s
5.12/5.21	Time used: 3.8929
5.12/5.21	Solving with 3 template(s).
5.12/5.21	
5.12/5.21	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.21	
5.12/5.21	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003560s
5.12/5.21	Time used: 1.00023
5.12/5.21	Solving with 1 template(s).
5.12/5.21	
5.12/5.21	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.21	
5.12/5.21	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.075725s
5.12/5.21	Time used: 0.06904
5.12/5.21	Termination failed. Trying to show unreachability...
5.12/5.21	Proving unreachability of entry: <l0, l2, arg1 = 1 /\ arg2 = 2 /\ arg3 = 3, {all remain the same}>
5.12/5.21	
5.12/5.21	LOG: CALL check - Post:1 <= 0 - Process 1
5.12/5.21	* Exit transition: <l0, l2, arg1 = 1 /\ arg2 = 2 /\ arg3 = 3, {all remain the same}>
5.12/5.21	* Postcondition  : 1 <= 0
5.12/5.21	
5.12/5.21	LOG: CALL solveLinear
5.12/5.21	
5.12/5.21	LOG: RETURN solveLinear - Elapsed time: 0.001166s
5.12/5.21	> Postcondition is not implied!
5.12/5.21	
5.12/5.21	LOG: RETURN check - Elapsed time: 0.001262s
5.12/5.21	Cannot prove unreachability
5.12/5.21	
5.12/5.21	Proving non-termination of subgraph 1
5.12/5.21	Transitions:
5.12/5.21	<l2, l2, arg3 <= 4, {arg1 -> arg2, arg2 -> arg1, arg3 -> arg1 + arg2, rest remain the same}>
5.12/5.21	Variables:
5.12/5.21	arg1, arg2, arg3
5.12/5.21	
5.12/5.21	Checking conditional non-termination of SCC {l2}...
5.12/5.21	EXIT TRANSITIONS:
5.12/5.21	<l2, end, 5 <= arg3, {all remain the same}>
5.12/5.21	
5.12/5.21	Solving with 1 template(s).
5.12/5.21	
5.12/5.21	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.21	
5.12/5.21	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007603s
5.12/5.21	Time used: 0.007503
5.12/5.21	Solving with 2 template(s).
5.12/5.21	
5.12/5.21	LOG: CALL solveNonLinearGetFirstSolution
5.12/5.21	
5.12/5.21	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.039317s
5.12/5.21	Time used: 0.038765
5.12/5.21	Improving Solution with cost 2 ...
5.12/5.21	
5.12/5.21	LOG: CALL solveNonLinearGetNextSolution
5.12/5.21	
5.12/5.21	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.051242s
5.12/5.21	Time used: 0.051236
5.12/5.21	
5.12/5.21	LOG: SAT solveNonLinear - Elapsed time: 0.090559s
5.12/5.21	Cost: 0; Total time: 0.090001
5.12/5.21	Non-termination implied by a set of quasi-invariant(s):
5.12/5.21	Quasi-invariant at l2: arg1 + arg2 <= 3
5.12/5.21	Quasi-invariant at l2: arg3 <= 3
5.12/5.21	
5.12/5.21	Strengthening and disabling EXIT transitions...
5.12/5.21	Closed exits from l2: 1
5.12/5.21	
5.12/5.21	Strengthening and disabling transitions...
5.12/5.21	
5.12/5.21	LOG: CALL solverLinear in Graph for feasibility
5.12/5.21	
5.12/5.21	LOG: RETURN solveLinear in Graph for feasibility
5.12/5.21	Strengthening transition (result): 
5.12/5.21	<l2, l2, arg1 + arg2 <= 3 /\ arg3 <= 3, {arg1 -> arg2, arg2 -> arg1, arg3 -> arg1 + arg2, rest remain the same}>
5.12/5.21	
5.12/5.21	Calling reachability with...
5.12/5.21	Transition: <l2, end, true, {all remain the same}>
5.12/5.21	Conditions: arg1 + arg2 <= 3, arg3 <= 3, 
5.12/5.21	OPEN EXITS: 
5.12/5.21	<l2, end, arg1 + arg2 <= 3 /\ arg3 <= 3, {all remain the same}>
5.12/5.21	
5.12/5.21	--- Reachability graph ---
5.12/5.21	> Graph without transitions.
5.12/5.21	
5.12/5.21	Calling reachability with...
5.12/5.21	Transition: <l0, l2, arg1 = 1 /\ arg2 = 2 /\ arg3 = 3, {all remain the same}>
5.12/5.21	Conditions: arg1 + arg2 <= 3, arg3 <= 3, 
5.12/5.21	OPEN EXITS: 
5.12/5.21	<l0, l2, arg1 + arg2 <= 3 /\ arg1 = 1 /\ arg2 = 2 /\ arg3 = 3, {all remain the same}>
5.12/5.21	
5.12/5.21	> Conditions are reachable!
5.12/5.21	
5.12/5.21	Program does NOT terminate
5.12/5.21	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.12/5.21	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.12/5.21	EOF