25.54/25.61	NO
25.54/25.61	
25.55/25.61	Solver Timeout: 4
25.55/25.61	Global Timeout: 300
25.55/25.61	No parsing errors!
25.55/25.61	Init Location: 0
25.55/25.61	Transitions:
25.55/25.61	<l0, l3, true>
25.55/25.61	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2}>
25.55/25.61	<l2, l2, (arg1 > 4) /\ (arg2 > 0) /\ (arg2 >= arg1), par{arg1 -> (arg1 - 1), arg2 -> (arg2 - 1)}>
25.55/25.61	<l2, l2, (arg2 > 0) /\ (arg2 >= arg1) /\ (arg1 < 5) /\ (((arg2 - 1) - (arg1 + 1)) <= 2) /\ (arg1 > ~(1)), par{arg1 -> (arg1 + 2), arg2 -> (arg2 - 1)}>
25.55/25.61	<l2, l2, (arg2 > 0) /\ (arg2 >= arg1) /\ (arg1 < 5) /\ (((arg2 - 1) - (arg1 + 1)) > 2) /\ (arg1 > ~(1)), par{arg1 -> (arg1 + 1)}>
25.55/25.61	<l2, l2, (arg2 < arg1) /\ (arg1 > 1) /\ ((arg2 + 1) >= (2 * arg1)) /\ (arg2 > 0), par{arg1 -> (arg1 + 1), arg2 -> (arg2 + 1)}>
25.55/25.61	<l2, l2, (arg2 < arg1) /\ (arg1 > 1) /\ ((arg2 + 1) < (2 * arg1)) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}>
25.55/25.61	<l3, l1, true, par{arg1 -> undef13, arg2 -> undef14}>
25.55/25.61	
25.55/25.61	Fresh variables:
25.55/25.61	undef13, undef14, 
25.55/25.61	
25.55/25.61	Undef variables:
25.55/25.61	undef13, undef14, 
25.55/25.61	
25.55/25.61	Abstraction variables:
25.55/25.61	
25.55/25.61	Exit nodes:
25.55/25.61	
25.55/25.61	Accepting locations:
25.55/25.61	
25.55/25.61	Asserts:
25.55/25.61	
25.55/25.61	Preprocessed LLVMGraph
25.55/25.61	Init Location: 0
25.55/25.61	Transitions:
25.55/25.61	<l0, l2, (arg1 = undef14) /\ (arg2 = undef14) /\ (undef13 > 0) /\ (undef14 > ~(1))>
25.55/25.61	<l2, l2, (arg1 > 4) /\ (arg2 > 0) /\ (arg2 >= arg1), par{arg1 -> (arg1 - 1), arg2 -> (arg2 - 1)}>
25.55/25.61	<l2, l2, (arg2 > 0) /\ (arg2 >= arg1) /\ (arg1 < 5) /\ (((arg2 - 1) - (arg1 + 1)) <= 2) /\ (arg1 > ~(1)), par{arg1 -> (arg1 + 2), arg2 -> (arg2 - 1)}>
25.55/25.61	<l2, l2, (arg2 > 0) /\ (arg2 >= arg1) /\ (arg1 < 5) /\ (((arg2 - 1) - (arg1 + 1)) > 2) /\ (arg1 > ~(1)), par{arg1 -> (arg1 + 1)}>
25.55/25.61	<l2, l2, (arg2 < arg1) /\ (arg1 > 1) /\ ((arg2 + 1) < (2 * arg1)) /\ (arg2 > 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + 1)}>
25.55/25.61	
25.55/25.61	Fresh variables:
25.55/25.61	undef13, undef14, 
25.55/25.61	
25.55/25.61	Undef variables:
25.55/25.61	undef13, undef14, 
25.55/25.61	
25.55/25.61	Abstraction variables:
25.55/25.61	
25.55/25.61	Exit nodes:
25.55/25.61	
25.55/25.61	Accepting locations:
25.55/25.61	
25.55/25.61	Asserts:
25.55/25.61	
25.55/25.61	*************************************************************
25.55/25.61	*******************************************************************************************
25.55/25.61	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
25.55/25.61	*******************************************************************************************
25.55/25.61	
25.55/25.61	Init Location: 0
25.55/25.61	Graph 0:
25.55/25.61	Transitions:
25.55/25.61	Variables:
25.55/25.61	
25.55/25.61	Graph 1:
25.55/25.61	Transitions:
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 1 <= arg2 /\ 5 <= arg1, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ 1 <= arg2 /\ arg1 <= 4 /\ arg2 <= 4 + arg1, {arg1 -> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	<l2, l2, 0 <= arg1 /\ 1 <= arg2 /\ 5 + arg1 <= arg2 /\ arg1 <= 4, {arg1 -> 1 + arg1, rest remain the same}>
25.55/25.61	<l2, l2, 1 + arg2 <= arg1 /\ 1 <= arg2 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
25.55/25.61	Variables:
25.55/25.61	arg1, arg2
25.55/25.61	
25.55/25.61	Precedence: 
25.55/25.61	Graph 0
25.55/25.61	
25.55/25.61	Graph 1
25.55/25.61	<l0, l2, 0 <= undef14 /\ 1 <= undef13 /\ arg1 = undef14 /\ arg2 = undef14, {all remain the same}>
25.55/25.61	
25.55/25.61	Map Locations to Subgraph:
25.55/25.61	( 0 , 0 )
25.55/25.61	( 2 , 1 )
25.55/25.61	
25.55/25.61	*******************************************************************************************
25.55/25.61	********************************    CHECKING ASSERTIONS    ********************************
25.55/25.61	*******************************************************************************************
25.55/25.61	
25.55/25.61	Proving termination of subgraph 0
25.55/25.61	Proving termination of subgraph 1
25.55/25.61	Checking unfeasibility...
25.55/25.61	Time used: 0.013317
25.55/25.61	Some transition disabled by a set of invariant(s):
25.55/25.61	Invariant at l2: arg2 <= 1 + arg1
25.55/25.61	
25.55/25.61	Strengthening and disabling transitions...
25.55/25.61	> It's unfeasible. Removing transition: 
25.55/25.61	<l2, l2, 0 <= arg1 /\ 1 <= arg2 /\ 5 + arg1 <= arg2 /\ arg1 <= 4, {arg1 -> 1 + arg1, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	Strengthening transition (result): 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 5 <= arg1, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	Strengthening transition (result): 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ arg1 <= 4, {arg1 -> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	Strengthening transition (result): 
25.55/25.61	<l2, l2, 1 + arg2 <= arg1 /\ 1 <= arg2 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
25.55/25.61	Checking unfeasibility...
25.55/25.61	Time used: 0.045367
25.55/25.61	
25.55/25.61	Checking conditional termination of SCC {l2}...
25.55/25.61	
25.55/25.61	LOG: CALL solveLinear
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear - Elapsed time: 0.002093s
25.55/25.61	
25.55/25.61	LOG: CALL solveLinear
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear - Elapsed time: 0.311777s
25.55/25.61	Trying to remove transition: <l2, l2, 1 + arg2 <= arg1 /\ 1 <= arg2 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
25.55/25.61	Solving with 1 template(s).
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetFirstSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.253654s
25.55/25.61	Time used: 0.253145
25.55/25.61	Trying to remove transition: <l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ arg1 <= 4, {arg1 -> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	Solving with 1 template(s).
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetFirstSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.035217s
25.55/25.61	Time used: 1.03349
25.55/25.61	Trying to remove transition: <l2, l2, arg1 <= arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 5 <= arg1, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	Solving with 1 template(s).
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetFirstSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.255455s
25.55/25.61	Time used: 2.25147
25.55/25.61	Solving with 1 template(s).
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetFirstSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.058789s
25.55/25.61	Time used: 0.053661
25.55/25.61	Improving Solution with cost 1 ...
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetNextSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.207354s
25.55/25.61	Time used: 0.207353
25.55/25.61	
25.55/25.61	LOG: SAT solveNonLinear - Elapsed time: 0.266143s
25.55/25.61	Cost: 1; Total time: 0.261014
25.55/25.61	Failed at location 2: arg1 + arg2 <= 0
25.55/25.61	Before Improving: 
25.55/25.61	Quasi-invariant at l2: arg1 + arg2 <= 0
25.55/25.61	Optimizing invariants...
25.55/25.61	
25.55/25.61	LOG: CALL solveLinear
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear - Elapsed time: 0.011725s
25.55/25.61	Remaining time after improvement: 0.996532
25.55/25.61	Termination implied by a set of quasi-invariant(s):
25.55/25.61	Quasi-invariant at l2: arg1 + arg2 <= 0
25.55/25.61	[ Invariant Graph ]
25.55/25.61	Strengthening and disabling transitions...
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	It's unfeasible. Removing transition: 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 5 <= arg1, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	It's unfeasible. Removing transition: 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ arg1 <= 4, {arg1 -> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	It's unfeasible. Removing transition: 
25.55/25.61	<l2, l2, 1 + arg2 <= arg1 /\ 1 <= arg2 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
25.55/25.61	[ Termination Graph ]
25.55/25.61	Strengthening and disabling transitions...
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	It's unfeasible. Removing transition: 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 5 <= arg1, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	It's unfeasible. Removing transition: 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ arg1 <= 4, {arg1 -> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	It's unfeasible. Removing transition: 
25.55/25.61	<l2, l2, 1 + arg2 <= arg1 /\ 1 <= arg2 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
25.55/25.61	New Graphs: 
25.55/25.61	Calling Safety with literal arg1 + arg2 <= 0 and entry <l0, l2, 0 <= undef14 /\ 1 <= undef13 /\ arg1 = undef14 /\ arg2 = undef14, {all remain the same}>
25.55/25.61	
25.55/25.61	LOG: CALL check - Post:arg1 + arg2 <= 0 - Process 1
25.55/25.61	* Exit transition: <l0, l2, 0 <= undef14 /\ 1 <= undef13 /\ arg1 = undef14 /\ arg2 = undef14, {all remain the same}>
25.55/25.61	* Postcondition  : arg1 + arg2 <= 0
25.55/25.61	
25.55/25.61	LOG: CALL solveLinear
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear - Elapsed time: 0.000854s
25.55/25.61	> Postcondition is not implied!
25.55/25.61	
25.55/25.61	LOG: RETURN check - Elapsed time: 0.000965s
25.55/25.61	INVARIANTS: 
25.55/25.61	2: 
25.55/25.61	Quasi-INVARIANTS to narrow Graph: 
25.55/25.61	2: arg1 + arg2 <= 0 , 
25.55/25.61	Narrowing transition: 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 5 <= arg1, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: Narrow transition size 1
25.55/25.61	Narrowing transition: 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ arg1 <= 4, {arg1 -> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: Narrow transition size 1
25.55/25.61	Narrowing transition: 
25.55/25.61	<l2, l2, 1 + arg2 <= arg1 /\ 1 <= arg2 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: Narrow transition size 1
25.55/25.61	invGraph after Narrowing: 
25.55/25.61	Transitions:
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 5 <= arg1, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ arg1 <= 4, {arg1 -> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	<l2, l2, 1 + arg2 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
25.55/25.61	Variables:
25.55/25.61	arg1, arg2
25.55/25.61	Checking conditional termination of SCC {l2}...
25.55/25.61	
25.55/25.61	LOG: CALL solveLinear
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear - Elapsed time: 0.001992s
25.55/25.61	
25.55/25.61	LOG: CALL solveLinear
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear - Elapsed time: 0.294910s
25.55/25.61	Trying to remove transition: <l2, l2, 1 + arg2 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
25.55/25.61	Solving with 1 template(s).
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetFirstSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.242435s
25.55/25.61	Time used: 0.241827
25.55/25.61	Trying to remove transition: <l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ arg1 <= 4, {arg1 -> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	Solving with 1 template(s).
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetFirstSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.934139s
25.55/25.61	Time used: 0.931559
25.55/25.61	Trying to remove transition: <l2, l2, arg1 <= arg2 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 5 <= arg1, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	Solving with 1 template(s).
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetFirstSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.330488s
25.55/25.61	Time used: 2.32635
25.55/25.61	Solving with 1 template(s).
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetFirstSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.600842s
25.55/25.61	Time used: 0.595586
25.55/25.61	Improving Solution with cost 1 ...
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetNextSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.318471s
25.55/25.61	Time used: 0.318473
25.55/25.61	
25.55/25.61	LOG: SAT solveNonLinear - Elapsed time: 0.919312s
25.55/25.61	Cost: 1; Total time: 0.914059
25.55/25.61	Failed at location 2: arg1 + 2*arg2 <= 3
25.55/25.61	Before Improving: 
25.55/25.61	Quasi-invariant at l2: arg1 + 2*arg2 <= 3
25.55/25.61	Optimizing invariants...
25.55/25.61	
25.55/25.61	LOG: CALL solveLinear
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear - Elapsed time: 0.013927s
25.55/25.61	Remaining time after improvement: 0.996045
25.55/25.61	Termination implied by a set of quasi-invariant(s):
25.55/25.61	Quasi-invariant at l2: arg1 + 2*arg2 <= 3
25.55/25.61	[ Invariant Graph ]
25.55/25.61	Strengthening and disabling transitions...
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	It's unfeasible. Removing transition: 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 5 <= arg1, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	Strengthening transition (result): 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ arg1 <= 4 /\ arg1 + 2*arg2 <= 3, {arg1 -> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	It's unfeasible. Removing transition: 
25.55/25.61	<l2, l2, 1 + arg2 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
25.55/25.61	[ Termination Graph ]
25.55/25.61	Strengthening and disabling transitions...
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	It's unfeasible. Removing transition: 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 5 <= arg1, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	Strengthening transition (result): 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ arg1 <= 4 /\ arg1 + 2*arg2 <= 3, {arg1 -> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	It's unfeasible. Removing transition: 
25.55/25.61	<l2, l2, 1 + arg2 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
25.55/25.61	Ranking function: arg1 + 3*arg2
25.55/25.61	New Graphs: 
25.55/25.61	Calling Safety with literal arg1 + 2*arg2 <= 3 and entry <l0, l2, 0 <= undef14 /\ 1 <= arg1 + arg2 /\ 1 <= undef13 /\ arg1 = undef14 /\ arg2 = undef14, {all remain the same}>
25.55/25.61	
25.55/25.61	LOG: CALL check - Post:arg1 + 2*arg2 <= 3 - Process 2
25.55/25.61	* Exit transition: <l0, l2, 0 <= undef14 /\ 1 <= arg1 + arg2 /\ 1 <= undef13 /\ arg1 = undef14 /\ arg2 = undef14, {all remain the same}>
25.55/25.61	* Postcondition  : arg1 + 2*arg2 <= 3
25.55/25.61	
25.55/25.61	LOG: CALL solveLinear
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear - Elapsed time: 0.000694s
25.55/25.61	> Postcondition is not implied!
25.55/25.61	
25.55/25.61	LOG: RETURN check - Elapsed time: 0.000812s
25.55/25.61	INVARIANTS: 
25.55/25.61	2: 
25.55/25.61	Quasi-INVARIANTS to narrow Graph: 
25.55/25.61	2: arg1 + 2*arg2 <= 3 , 
25.55/25.61	Narrowing transition: 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 5 <= arg1, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: Narrow transition size 1
25.55/25.61	Narrowing transition: 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ arg1 <= 4, {arg1 -> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: Narrow transition size 1
25.55/25.61	Narrowing transition: 
25.55/25.61	<l2, l2, 1 + arg2 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: Narrow transition size 1
25.55/25.61	invGraph after Narrowing: 
25.55/25.61	Transitions:
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 4 <= arg1 + 2*arg2 /\ 5 <= arg1, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 4 <= arg1 + 2*arg2 /\ arg1 <= 4, {arg1 -> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	<l2, l2, 1 + arg2 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ 4 <= arg1 + 2*arg2 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
25.55/25.61	Variables:
25.55/25.61	arg1, arg2
25.55/25.61	Checking conditional termination of SCC {l2}...
25.55/25.61	
25.55/25.61	LOG: CALL solveLinear
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear - Elapsed time: 0.002392s
25.55/25.61	
25.55/25.61	LOG: CALL solveLinear
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear - Elapsed time: 0.430467s
25.55/25.61	Trying to remove transition: <l2, l2, 1 + arg2 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ 4 <= arg1 + 2*arg2 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
25.55/25.61	Solving with 1 template(s).
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetFirstSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.281098s
25.55/25.61	Time used: 0.279824
25.55/25.61	Trying to remove transition: <l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 4 <= arg1 + 2*arg2 /\ arg1 <= 4, {arg1 -> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	Solving with 1 template(s).
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetFirstSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.036080s
25.55/25.61	Time used: 2.034
25.55/25.61	Trying to remove transition: <l2, l2, arg1 <= arg2 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 4 <= arg1 + 2*arg2 /\ 5 <= arg1, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	Solving with 1 template(s).
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetFirstSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.504561s
25.55/25.61	Time used: 2.49985
25.55/25.61	Solving with 1 template(s).
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetFirstSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005155s
25.55/25.61	Time used: 4.00082
25.55/25.61	Solving with 2 template(s).
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetFirstSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010045s
25.55/25.61	Time used: 4.00079
25.55/25.61	Solving with 3 template(s).
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetFirstSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010115s
25.55/25.61	Time used: 1.00008
25.55/25.61	Solving with 1 template(s).
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetFirstSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.050064s
25.55/25.61	Time used: 1.02947
25.55/25.61	
25.55/25.61	Proving non-termination of subgraph 1
25.55/25.61	Transitions:
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 4 <= arg1 + 2*arg2 /\ 5 <= arg1, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 4 <= arg1 + 2*arg2 /\ arg1 <= 4, {arg1 -> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	<l2, l2, 1 + arg2 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ 4 <= arg1 + 2*arg2 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
25.55/25.61	Variables:
25.55/25.61	arg1, arg2
25.55/25.61	
25.55/25.61	Checking conditional non-termination of SCC {l2}...
25.55/25.61	EXIT TRANSITIONS:
25.55/25.61	<l2, end, arg2 <= 0 /\ 1 + arg2 <= arg1 /\ 1 <= arg1 + arg2 /\ 4 <= arg1 + 2*arg2 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1, {all remain the same}>
25.55/25.61	<l2, end, arg2 <= 0 /\ 1 + arg2 <= arg1 /\ 1 <= arg1 + arg2 /\ 5 <= arg1 /\ 2 + arg2 <= 2*arg1 /\ arg1 + 2*arg2 <= 3, {all remain the same}>
25.55/25.61	<l2, end, 0 <= arg1 /\ arg2 <= 0 /\ 1 + arg2 <= arg1 /\ 1 <= arg1 + arg2 /\ 2 + arg2 <= 2*arg1 /\ arg1 <= 4 /\ arg1 + 2*arg2 <= 3, {all remain the same}>
25.55/25.61	<l2, end, arg1 + arg2 <= 0 /\ arg2 <= 0 /\ 1 + arg2 <= arg1 /\ 5 <= arg1 /\ 2 + arg2 <= 2*arg1 /\ arg1 + 2*arg2 <= 3, {all remain the same}>
25.55/25.61	<l2, end, arg1 + arg2 <= 0 /\ arg2 <= 0 /\ 1 + arg2 <= arg1 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1 /\ arg1 <= 4 /\ arg1 + 2*arg2 <= 3, {all remain the same}>
25.55/25.61	<l2, end, arg1 + arg2 <= 0 /\ 0 <= arg1 /\ arg2 <= 0 /\ 1 + arg2 <= arg1 /\ arg1 <= 1 /\ arg1 + 2*arg2 <= 3, {all remain the same}>
25.55/25.61	<l2, end, arg1 + arg2 <= 0 /\ arg2 <= 0 /\ 1 + arg1 <= 0 /\ 1 + arg2 <= arg1 /\ arg1 + 2*arg2 <= 3, {all remain the same}>
25.55/25.61	<l2, end, arg1 <= arg2 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg1 <= 1 /\ arg2 <= 1 + arg1 /\ 2*arg1 <= 1 + arg2 /\ arg1 + 2*arg2 <= 3, {all remain the same}>
25.55/25.61	<l2, end, arg1 + arg2 <= 0 /\ arg1 <= arg2 /\ 0 <= arg1 /\ arg2 <= 0 /\ arg1 <= 1 /\ arg2 <= 1 + arg1 /\ 2*arg1 <= 1 + arg2 /\ arg1 + 2*arg2 <= 3, {all remain the same}>
25.55/25.61	<l2, end, arg1 + arg2 <= 0 /\ arg1 <= arg2 /\ arg2 <= 0 /\ 1 + arg1 <= 0 /\ arg2 <= 1 + arg1 /\ 2*arg1 <= 1 + arg2 /\ arg1 + 2*arg2 <= 3, {all remain the same}>
25.55/25.61	
25.55/25.61	Solving with 1 template(s).
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetFirstSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040425s
25.55/25.61	Time used: 0.039906
25.55/25.61	Improving Solution with cost 3 ...
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetNextSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000716s
25.55/25.61	Time used: 1.00074
25.55/25.61	
25.55/25.61	LOG: SAT solveNonLinear - Elapsed time: 1.041141s
25.55/25.61	Cost: 3; Total time: 1.04064
25.55/25.61	Failed at location 2: 1 <= arg2
25.55/25.61	Before Improving: 
25.55/25.61	Quasi-invariant at l2: 1 <= arg2
25.55/25.61	Optimizing invariants...
25.55/25.61	
25.55/25.61	LOG: CALL solveLinear
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear - Elapsed time: 0.013443s
25.55/25.61	Remaining time after improvement: 0.995619
25.55/25.61	Non-termination implied by a set of quasi-invariant(s):
25.55/25.61	Quasi-invariant at l2: 1 <= arg2
25.55/25.61	
25.55/25.61	Strengthening and disabling EXIT transitions...
25.55/25.61	Closed exits from l2: 9
25.55/25.61	Strengthening exit transition (result): 
25.55/25.61	<l2, end, arg1 <= arg2 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg1 <= 1 /\ arg2 <= 1 + arg1 /\ 2*arg1 <= 1 + arg2 /\ arg1 + 2*arg2 <= 3, {all remain the same}>
25.55/25.61	
25.55/25.61	Strengthening and disabling transitions...
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	Strengthening transition (result): 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 4 <= arg1 + 2*arg2 /\ 5 <= arg1, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	Strengthening transition (result): 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 4 <= arg1 + 2*arg2 /\ arg1 <= 4, {arg1 -> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	Strengthening transition (result): 
25.55/25.61	<l2, l2, 1 + arg2 <= arg1 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ 4 <= arg1 + 2*arg2 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	Checking conditional non-termination of SCC {l2}...
25.55/25.61	EXIT TRANSITIONS:
25.55/25.61	<l2, end, arg1 <= arg2 /\ 1 <= arg1 + arg2 /\ 1 <= arg2 /\ arg1 <= 1 /\ arg2 <= 1 + arg1 /\ 2*arg1 <= 1 + arg2 /\ arg1 + 2*arg2 <= 3, {all remain the same}>
25.55/25.61	
25.55/25.61	Solving with 1 template(s).
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetFirstSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.052884s
25.55/25.61	Time used: 0.05259
25.55/25.61	Improving Solution with cost 1 ...
25.55/25.61	
25.55/25.61	LOG: CALL solveNonLinearGetNextSolution
25.55/25.61	
25.55/25.61	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015097s
25.55/25.61	Time used: 0.015091
25.55/25.61	
25.55/25.61	LOG: SAT solveNonLinear - Elapsed time: 0.067981s
25.55/25.61	Cost: 1; Total time: 0.067681
25.55/25.61	Failed at location 2: 3 <= arg1 + arg2
25.55/25.61	Before Improving: 
25.55/25.61	Quasi-invariant at l2: 3 <= arg1 + arg2
25.55/25.61	Optimizing invariants...
25.55/25.61	
25.55/25.61	LOG: CALL solveLinear
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear - Elapsed time: 0.005193s
25.55/25.61	Remaining time after improvement: 0.997205
25.55/25.61	Non-termination implied by a set of quasi-invariant(s):
25.55/25.61	Quasi-invariant at l2: 3 <= arg1 + arg2
25.55/25.61	
25.55/25.61	Strengthening and disabling EXIT transitions...
25.55/25.61	Closed exits from l2: 1
25.55/25.61	
25.55/25.61	Strengthening and disabling transitions...
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	Strengthening transition (result): 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 4 <= arg1 + 2*arg2 /\ 5 <= arg1 /\ 3 <= arg1 + arg2, {arg1 -> -1 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	Strengthening transition (result): 
25.55/25.61	<l2, l2, arg1 <= arg2 /\ 0 <= arg1 /\ 1 <= arg2 /\ arg2 <= 1 + arg1 /\ 4 <= arg1 + 2*arg2 /\ arg1 <= 4 /\ 3 <= arg1 + arg2, {arg1 -> 2 + arg1, arg2 -> -1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	LOG: CALL solverLinear in Graph for feasibility
25.55/25.61	
25.55/25.61	LOG: RETURN solveLinear in Graph for feasibility
25.55/25.61	Strengthening transition (result): 
25.55/25.61	<l2, l2, 1 + arg2 <= arg1 /\ 1 <= arg2 /\ 4 <= arg1 + 2*arg2 /\ 2 <= arg1 /\ 2 + arg2 <= 2*arg1 /\ 3 <= arg1 + arg2, {arg1 -> -1 + arg1, arg2 -> 1 + arg2, rest remain the same}>
25.55/25.61	
25.55/25.61	Calling reachability with...
25.55/25.61	Transition: <l2, end, true, {all remain the same}>
25.55/25.61	Conditions: 1 <= arg2, 3 <= arg1 + arg2, 
25.55/25.61	OPEN EXITS: 
25.55/25.61	<l2, end, 1 <= arg2 /\ 3 <= arg1 + arg2, {all remain the same}>
25.55/25.61	
25.55/25.61	--- Reachability graph ---
25.55/25.61	> Graph without transitions.
25.55/25.61	
25.55/25.61	Calling reachability with...
25.55/25.61	Transition: <l0, l2, 0 <= undef14 /\ 1 <= undef13 /\ arg1 = undef14 /\ arg2 = undef14, {all remain the same}>
25.55/25.61	Conditions: 1 <= arg2, 3 <= arg1 + arg2, 
25.55/25.61	OPEN EXITS: 
25.55/25.61	<l0, l2, 0 <= undef14 /\ 1 <= arg2 /\ 1 <= undef13 /\ 3 <= arg1 + arg2 /\ arg1 = undef14 /\ arg2 = undef14, {all remain the same}>
25.55/25.61	
25.55/25.61	> Conditions are reachable!
25.55/25.61	
25.55/25.61	Program does NOT terminate
25.55/25.61	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
25.55/25.61	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
25.55/25.61	EOF