12.20/12.24	NO
12.20/12.24	
12.20/12.24	Solver Timeout: 4
12.20/12.24	Global Timeout: 300
12.20/12.24	No parsing errors!
12.20/12.24	Init Location: 0
12.20/12.24	Transitions:
12.20/12.24	<l0, l3, true>
12.20/12.24	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}>
12.20/12.24	<l2, l2, (5 = arg1), par{arg1 -> 5, arg2 -> undef4}>
12.20/12.24	<l2, l2, (arg1 < 5) /\ (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef6}>
12.20/12.24	<l2, l2, (arg1 > 5), par{arg1 -> (arg1 - 1), arg2 -> undef8}>
12.20/12.24	<l3, l1, true, par{arg1 -> undef9, arg2 -> undef10}>
12.20/12.24	
12.20/12.24	Fresh variables:
12.20/12.24	undef2, undef4, undef6, undef8, undef9, undef10, 
12.20/12.24	
12.20/12.24	Undef variables:
12.20/12.24	undef2, undef4, undef6, undef8, undef9, undef10, 
12.20/12.24	
12.20/12.24	Abstraction variables:
12.20/12.24	
12.20/12.24	Exit nodes:
12.20/12.24	
12.20/12.24	Accepting locations:
12.20/12.24	
12.20/12.24	Asserts:
12.20/12.24	
12.20/12.24	Preprocessed LLVMGraph
12.20/12.24	Init Location: 0
12.20/12.24	Transitions:
12.20/12.24	<l0, l2, (arg1 = undef10) /\ (undef9 > 0) /\ (undef10 > ~(1))>
12.20/12.24	<l2, l2, (5 = arg1), par{arg1 -> 5}>
12.20/12.24	<l2, l2, (arg1 < 5) /\ (arg1 > 0), par{arg1 -> (arg1 - 1)}>
12.20/12.24	<l2, l2, (arg1 > 5), par{arg1 -> (arg1 - 1)}>
12.20/12.24	
12.20/12.24	Fresh variables:
12.20/12.24	undef2, undef4, undef6, undef8, undef9, undef10, 
12.20/12.24	
12.20/12.24	Undef variables:
12.20/12.24	undef2, undef4, undef6, undef8, undef9, undef10, 
12.20/12.24	
12.20/12.24	Abstraction variables:
12.20/12.24	
12.20/12.24	Exit nodes:
12.20/12.24	
12.20/12.24	Accepting locations:
12.20/12.24	
12.20/12.24	Asserts:
12.20/12.24	
12.20/12.24	*************************************************************
12.20/12.24	*******************************************************************************************
12.20/12.24	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
12.20/12.24	*******************************************************************************************
12.20/12.24	
12.20/12.24	Init Location: 0
12.20/12.24	Graph 0:
12.20/12.24	Transitions:
12.20/12.24	Variables:
12.20/12.24	
12.20/12.24	Graph 1:
12.20/12.24	Transitions:
12.20/12.24	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.24	<l2, l2, 1 <= arg1 /\ arg1 <= 4, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.24	<l2, l2, 6 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.24	Variables:
12.20/12.24	arg1
12.20/12.24	
12.20/12.24	Precedence: 
12.20/12.24	Graph 0
12.20/12.24	
12.20/12.24	Graph 1
12.20/12.24	<l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
12.20/12.24	
12.20/12.24	Map Locations to Subgraph:
12.20/12.24	( 0 , 0 )
12.20/12.24	( 2 , 1 )
12.20/12.24	
12.20/12.24	*******************************************************************************************
12.20/12.24	********************************    CHECKING ASSERTIONS    ********************************
12.20/12.24	*******************************************************************************************
12.20/12.24	
12.20/12.24	Proving termination of subgraph 0
12.20/12.24	Proving termination of subgraph 1
12.20/12.24	Checking unfeasibility...
12.20/12.24	Time used: 0.004939
12.20/12.24	
12.20/12.24	Checking conditional termination of SCC {l2}...
12.20/12.24	
12.20/12.24	LOG: CALL solveLinear
12.20/12.24	
12.20/12.24	LOG: RETURN solveLinear - Elapsed time: 0.001173s
12.20/12.24	Ranking function: -1 + arg1
12.20/12.24	New Graphs: 
12.20/12.24	Transitions:
12.20/12.24	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.24	Variables:
12.20/12.24	arg1
12.20/12.24	Checking conditional termination of SCC {l2}...
12.20/12.24	
12.20/12.24	LOG: CALL solveLinear
12.20/12.24	
12.20/12.24	LOG: RETURN solveLinear - Elapsed time: 0.000366s
12.20/12.24	
12.20/12.24	LOG: CALL solveLinear
12.20/12.24	
12.20/12.24	LOG: RETURN solveLinear - Elapsed time: 0.001011s
12.20/12.24	Trying to remove transition: <l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.24	Solving with 1 template(s).
12.20/12.24	
12.20/12.24	LOG: CALL solveNonLinearGetFirstSolution
12.20/12.24	
12.20/12.24	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.614848s
12.20/12.24	Time used: 0.614707
12.20/12.24	Solving with 1 template(s).
12.20/12.24	
12.20/12.24	LOG: CALL solveNonLinearGetFirstSolution
12.20/12.24	
12.20/12.24	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011457s
12.20/12.24	Time used: 0.008604
12.20/12.24	Improving Solution with cost 1 ...
12.20/12.24	
12.20/12.24	LOG: CALL solveNonLinearGetNextSolution
12.20/12.24	
12.20/12.24	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022516s
12.20/12.24	Time used: 0.022509
12.20/12.24	
12.20/12.24	LOG: SAT solveNonLinear - Elapsed time: 0.033974s
12.20/12.24	Cost: 1; Total time: 0.031113
12.20/12.24	Failed at location 2: arg1 <= 0
12.20/12.24	Before Improving: 
12.20/12.24	Quasi-invariant at l2: arg1 <= 0
12.20/12.24	Optimizing invariants...
12.20/12.24	
12.20/12.24	LOG: CALL solveLinear
12.20/12.24	
12.20/12.24	LOG: RETURN solveLinear - Elapsed time: 0.004279s
12.20/12.24	Remaining time after improvement: 0.998817
12.20/12.24	Termination implied by a set of quasi-invariant(s):
12.20/12.24	Quasi-invariant at l2: arg1 <= 0
12.20/12.24	[ Invariant Graph ]
12.20/12.24	Strengthening and disabling transitions...
12.20/12.24	
12.20/12.24	LOG: CALL solverLinear in Graph for feasibility
12.20/12.24	
12.20/12.24	LOG: RETURN solveLinear in Graph for feasibility
12.20/12.24	It's unfeasible. Removing transition: 
12.20/12.24	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.24	
12.20/12.24	LOG: CALL solverLinear in Graph for feasibility
12.20/12.24	
12.20/12.24	LOG: RETURN solveLinear in Graph for feasibility
12.20/12.24	It's unfeasible. Removing transition: 
12.20/12.24	<l2, l2, 1 <= arg1 /\ arg1 <= 4, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.24	
12.20/12.24	LOG: CALL solverLinear in Graph for feasibility
12.20/12.24	
12.20/12.24	LOG: RETURN solveLinear in Graph for feasibility
12.20/12.24	It's unfeasible. Removing transition: 
12.20/12.24	<l2, l2, 6 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.24	[ Termination Graph ]
12.20/12.24	Strengthening and disabling transitions...
12.20/12.24	> It's unfeasible. Removing transition: 
12.20/12.24	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.24	New Graphs: 
12.20/12.24	Calling Safety with literal arg1 <= 0 and entry <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
12.20/12.24	
12.20/12.24	LOG: CALL check - Post:arg1 <= 0 - Process 1
12.20/12.24	* Exit transition: <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
12.20/12.24	* Postcondition  : arg1 <= 0
12.20/12.24	
12.20/12.24	LOG: CALL solveLinear
12.20/12.24	
12.20/12.24	LOG: RETURN solveLinear - Elapsed time: 0.000537s
12.20/12.24	> Postcondition is not implied!
12.20/12.24	
12.20/12.24	LOG: RETURN check - Elapsed time: 0.000631s
12.20/12.24	INVARIANTS: 
12.20/12.24	2: 
12.20/12.24	Quasi-INVARIANTS to narrow Graph: 
12.20/12.24	2: arg1 <= 0 , 
12.20/12.24	Narrowing transition: 
12.20/12.25	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	
12.20/12.25	LOG: Narrow transition size 1
12.20/12.25	Narrowing transition: 
12.20/12.25	<l2, l2, 1 <= arg1 /\ arg1 <= 4, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.25	
12.20/12.25	LOG: Narrow transition size 1
12.20/12.25	Narrowing transition: 
12.20/12.25	<l2, l2, 6 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.25	
12.20/12.25	LOG: Narrow transition size 1
12.20/12.25	invGraph after Narrowing: 
12.20/12.25	Transitions:
12.20/12.25	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	<l2, l2, 1 <= arg1 /\ arg1 <= 4, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.25	<l2, l2, 6 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.25	Variables:
12.20/12.25	arg1
12.20/12.25	Checking conditional termination of SCC {l2}...
12.20/12.25	
12.20/12.25	LOG: CALL solveLinear
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear - Elapsed time: 0.001065s
12.20/12.25	Ranking function: -1 + arg1
12.20/12.25	New Graphs: 
12.20/12.25	Transitions:
12.20/12.25	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	Variables:
12.20/12.25	arg1
12.20/12.25	Checking conditional termination of SCC {l2}...
12.20/12.25	
12.20/12.25	LOG: CALL solveLinear
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear - Elapsed time: 0.000365s
12.20/12.25	
12.20/12.25	LOG: CALL solveLinear
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear - Elapsed time: 0.001035s
12.20/12.25	Trying to remove transition: <l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	Solving with 1 template(s).
12.20/12.25	
12.20/12.25	LOG: CALL solveNonLinearGetFirstSolution
12.20/12.25	
12.20/12.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.609187s
12.20/12.25	Time used: 0.609039
12.20/12.25	Solving with 1 template(s).
12.20/12.25	
12.20/12.25	LOG: CALL solveNonLinearGetFirstSolution
12.20/12.25	
12.20/12.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013170s
12.20/12.25	Time used: 0.010207
12.20/12.25	Improving Solution with cost 1 ...
12.20/12.25	
12.20/12.25	LOG: CALL solveNonLinearGetNextSolution
12.20/12.25	
12.20/12.25	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.026010s
12.20/12.25	Time used: 0.026002
12.20/12.25	
12.20/12.25	LOG: SAT solveNonLinear - Elapsed time: 0.039180s
12.20/12.25	Cost: 1; Total time: 0.036209
12.20/12.25	Failed at location 2: arg1 <= 1
12.20/12.25	Before Improving: 
12.20/12.25	Quasi-invariant at l2: arg1 <= 1
12.20/12.25	Optimizing invariants...
12.20/12.25	
12.20/12.25	LOG: CALL solveLinear
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear - Elapsed time: 0.004834s
12.20/12.25	Quasi-invariant improved
12.20/12.25	
12.20/12.25	LOG: CALL solveLinear
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear - Elapsed time: 0.001184s
12.20/12.25	Remaining time after improvement: 0.997031
12.20/12.25	Termination implied by a set of quasi-invariant(s):
12.20/12.25	Quasi-invariant at l2: arg1 <= 2
12.20/12.25	[ Invariant Graph ]
12.20/12.25	Strengthening and disabling transitions...
12.20/12.25	
12.20/12.25	LOG: CALL solverLinear in Graph for feasibility
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear in Graph for feasibility
12.20/12.25	It's unfeasible. Removing transition: 
12.20/12.25	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	
12.20/12.25	LOG: CALL solverLinear in Graph for feasibility
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear in Graph for feasibility
12.20/12.25	Strengthening transition (result): 
12.20/12.25	<l2, l2, 1 <= arg1 /\ arg1 <= 2, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.25	
12.20/12.25	LOG: CALL solverLinear in Graph for feasibility
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear in Graph for feasibility
12.20/12.25	It's unfeasible. Removing transition: 
12.20/12.25	<l2, l2, 6 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.25	[ Termination Graph ]
12.20/12.25	Strengthening and disabling transitions...
12.20/12.25	
12.20/12.25	LOG: CALL solverLinear in Graph for feasibility
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear in Graph for feasibility
12.20/12.25	It's unfeasible. Removing transition: 
12.20/12.25	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	New Graphs: 
12.20/12.25	Calling Safety with literal arg1 <= 2 and entry <l0, l2, 0 <= undef10 /\ 1 <= arg1 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
12.20/12.25	
12.20/12.25	LOG: CALL check - Post:arg1 <= 2 - Process 2
12.20/12.25	* Exit transition: <l0, l2, 0 <= undef10 /\ 1 <= arg1 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
12.20/12.25	* Postcondition  : arg1 <= 2
12.20/12.25	
12.20/12.25	LOG: CALL solveLinear
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear - Elapsed time: 0.000474s
12.20/12.25	> Postcondition is not implied!
12.20/12.25	
12.20/12.25	LOG: RETURN check - Elapsed time: 0.000572s
12.20/12.25	INVARIANTS: 
12.20/12.25	2: 
12.20/12.25	Quasi-INVARIANTS to narrow Graph: 
12.20/12.25	2: arg1 <= 2 , 
12.20/12.25	Narrowing transition: 
12.20/12.25	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	
12.20/12.25	LOG: Narrow transition size 1
12.20/12.25	Narrowing transition: 
12.20/12.25	<l2, l2, 1 <= arg1 /\ arg1 <= 4, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.25	
12.20/12.25	LOG: Narrow transition size 1
12.20/12.25	Narrowing transition: 
12.20/12.25	<l2, l2, 6 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.25	
12.20/12.25	LOG: Narrow transition size 1
12.20/12.25	invGraph after Narrowing: 
12.20/12.25	Transitions:
12.20/12.25	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	<l2, l2, arg1 <= 4 /\ 3 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.25	<l2, l2, 6 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.25	Variables:
12.20/12.25	arg1
12.20/12.25	Checking conditional termination of SCC {l2}...
12.20/12.25	
12.20/12.25	LOG: CALL solveLinear
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear - Elapsed time: 0.001106s
12.20/12.25	Ranking function: -1 + arg1
12.20/12.25	New Graphs: 
12.20/12.25	Transitions:
12.20/12.25	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	Variables:
12.20/12.25	arg1
12.20/12.25	Checking conditional termination of SCC {l2}...
12.20/12.25	
12.20/12.25	LOG: CALL solveLinear
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear - Elapsed time: 0.000367s
12.20/12.25	
12.20/12.25	LOG: CALL solveLinear
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear - Elapsed time: 0.001060s
12.20/12.25	Trying to remove transition: <l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	Solving with 1 template(s).
12.20/12.25	
12.20/12.25	LOG: CALL solveNonLinearGetFirstSolution
12.20/12.25	
12.20/12.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.611381s
12.20/12.25	Time used: 0.611111
12.20/12.25	Solving with 1 template(s).
12.20/12.25	
12.20/12.25	LOG: CALL solveNonLinearGetFirstSolution
12.20/12.25	
12.20/12.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.055608s
12.20/12.25	Time used: 0.052712
12.20/12.25	Improving Solution with cost 1 ...
12.20/12.25	
12.20/12.25	LOG: CALL solveNonLinearGetNextSolution
12.20/12.25	
12.20/12.25	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.059496s
12.20/12.25	Time used: 0.059487
12.20/12.25	
12.20/12.25	LOG: SAT solveNonLinear - Elapsed time: 0.115105s
12.20/12.25	Cost: 1; Total time: 0.112199
12.20/12.25	Failed at location 2: arg1 <= 4
12.20/12.25	Before Improving: 
12.20/12.25	Quasi-invariant at l2: arg1 <= 4
12.20/12.25	Optimizing invariants...
12.20/12.25	
12.20/12.25	LOG: CALL solveLinear
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear - Elapsed time: 0.005292s
12.20/12.25	Remaining time after improvement: 0.998711
12.20/12.25	Termination implied by a set of quasi-invariant(s):
12.20/12.25	Quasi-invariant at l2: arg1 <= 4
12.20/12.25	[ Invariant Graph ]
12.20/12.25	Strengthening and disabling transitions...
12.20/12.25	
12.20/12.25	LOG: CALL solverLinear in Graph for feasibility
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear in Graph for feasibility
12.20/12.25	It's unfeasible. Removing transition: 
12.20/12.25	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	
12.20/12.25	LOG: CALL solverLinear in Graph for feasibility
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear in Graph for feasibility
12.20/12.25	Strengthening transition (result): 
12.20/12.25	<l2, l2, arg1 <= 4 /\ 3 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.25	
12.20/12.25	LOG: CALL solverLinear in Graph for feasibility
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear in Graph for feasibility
12.20/12.25	It's unfeasible. Removing transition: 
12.20/12.25	<l2, l2, 6 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.25	[ Termination Graph ]
12.20/12.25	Strengthening and disabling transitions...
12.20/12.25	
12.20/12.25	LOG: CALL solverLinear in Graph for feasibility
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear in Graph for feasibility
12.20/12.25	It's unfeasible. Removing transition: 
12.20/12.25	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	New Graphs: 
12.20/12.25	Calling Safety with literal arg1 <= 4 and entry <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ 3 <= arg1 /\ arg1 = undef10, {all remain the same}>
12.20/12.25	
12.20/12.25	LOG: CALL check - Post:arg1 <= 4 - Process 3
12.20/12.25	* Exit transition: <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ 3 <= arg1 /\ arg1 = undef10, {all remain the same}>
12.20/12.25	* Postcondition  : arg1 <= 4
12.20/12.25	
12.20/12.25	LOG: CALL solveLinear
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear - Elapsed time: 0.000495s
12.20/12.25	> Postcondition is not implied!
12.20/12.25	
12.20/12.25	LOG: RETURN check - Elapsed time: 0.000593s
12.20/12.25	INVARIANTS: 
12.20/12.25	2: 
12.20/12.25	Quasi-INVARIANTS to narrow Graph: 
12.20/12.25	2: arg1 <= 4 , 
12.20/12.25	Narrowing transition: 
12.20/12.25	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	
12.20/12.25	LOG: Narrow transition size 1
12.20/12.25	It's unfeasible. Removing transition: 
12.20/12.25	<l2, l2, arg1 <= 4 /\ 3 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.25	Narrowing transition: 
12.20/12.25	<l2, l2, 6 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.25	
12.20/12.25	LOG: Narrow transition size 1
12.20/12.25	invGraph after Narrowing: 
12.20/12.25	Transitions:
12.20/12.25	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	<l2, l2, 6 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.25	Variables:
12.20/12.25	arg1
12.20/12.25	Checking conditional termination of SCC {l2}...
12.20/12.25	
12.20/12.25	LOG: CALL solveLinear
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear - Elapsed time: 0.000837s
12.20/12.25	Ranking function: -5 + arg1
12.20/12.25	New Graphs: 
12.20/12.25	Transitions:
12.20/12.25	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	Variables:
12.20/12.25	arg1
12.20/12.25	Checking conditional termination of SCC {l2}...
12.20/12.25	
12.20/12.25	LOG: CALL solveLinear
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear - Elapsed time: 0.000364s
12.20/12.25	
12.20/12.25	LOG: CALL solveLinear
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear - Elapsed time: 0.001063s
12.20/12.25	Trying to remove transition: <l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	Solving with 1 template(s).
12.20/12.25	
12.20/12.25	LOG: CALL solveNonLinearGetFirstSolution
12.20/12.25	
12.20/12.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.614606s
12.20/12.25	Time used: 0.614466
12.20/12.25	Solving with 1 template(s).
12.20/12.25	
12.20/12.25	LOG: CALL solveNonLinearGetFirstSolution
12.20/12.25	
12.20/12.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004217s
12.20/12.25	Time used: 4.00103
12.20/12.25	Solving with 2 template(s).
12.20/12.25	
12.20/12.25	LOG: CALL solveNonLinearGetFirstSolution
12.20/12.25	
12.20/12.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005989s
12.20/12.25	Time used: 4.00084
12.20/12.25	Solving with 3 template(s).
12.20/12.25	
12.20/12.25	LOG: CALL solveNonLinearGetFirstSolution
12.20/12.25	
12.20/12.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010424s
12.20/12.25	Time used: 1.00069
12.20/12.25	Solving with 1 template(s).
12.20/12.25	
12.20/12.25	LOG: CALL solveNonLinearGetFirstSolution
12.20/12.25	
12.20/12.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.416277s
12.20/12.25	Time used: 0.409407
12.20/12.25	
12.20/12.25	Proving non-termination of subgraph 1
12.20/12.25	Transitions:
12.20/12.25	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	<l2, l2, 6 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.25	Variables:
12.20/12.25	arg1
12.20/12.25	
12.20/12.25	Checking conditional non-termination of SCC {l2}...
12.20/12.25	EXIT TRANSITIONS:
12.20/12.25	<l2, end, arg1 <= 4, {all remain the same}>
12.20/12.25	
12.20/12.25	Solving with 1 template(s).
12.20/12.25	
12.20/12.25	LOG: CALL solveNonLinearGetFirstSolution
12.20/12.25	
12.20/12.25	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026002s
12.20/12.25	Time used: 0.025808
12.20/12.25	Improving Solution with cost 1 ...
12.20/12.25	
12.20/12.25	LOG: CALL solveNonLinearGetNextSolution
12.20/12.25	
12.20/12.25	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.008607s
12.20/12.25	Time used: 0.008597
12.20/12.25	
12.20/12.25	LOG: SAT solveNonLinear - Elapsed time: 0.034608s
12.20/12.25	Cost: 1; Total time: 0.034405
12.20/12.25	Failed at location 2: 5 <= arg1
12.20/12.25	Before Improving: 
12.20/12.25	Quasi-invariant at l2: 5 <= arg1
12.20/12.25	Optimizing invariants...
12.20/12.25	
12.20/12.25	LOG: CALL solveLinear
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear - Elapsed time: 0.002224s
12.20/12.25	Remaining time after improvement: 0.999013
12.20/12.25	Non-termination implied by a set of quasi-invariant(s):
12.20/12.25	Quasi-invariant at l2: 5 <= arg1
12.20/12.25	
12.20/12.25	Strengthening and disabling EXIT transitions...
12.20/12.25	Closed exits from l2: 1
12.20/12.25	
12.20/12.25	Strengthening and disabling transitions...
12.20/12.25	
12.20/12.25	LOG: CALL solverLinear in Graph for feasibility
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear in Graph for feasibility
12.20/12.25	Strengthening transition (result): 
12.20/12.25	<l2, l2, arg1 = 5, {arg1 -> 5, rest remain the same}>
12.20/12.25	
12.20/12.25	LOG: CALL solverLinear in Graph for feasibility
12.20/12.25	
12.20/12.25	LOG: RETURN solveLinear in Graph for feasibility
12.20/12.25	Strengthening transition (result): 
12.20/12.25	<l2, l2, 6 <= arg1, {arg1 -> -1 + arg1, rest remain the same}>
12.20/12.25	
12.20/12.25	Calling reachability with...
12.20/12.25	Transition: <l2, end, true, {all remain the same}>
12.20/12.25	Conditions: 5 <= arg1, 
12.20/12.25	OPEN EXITS: 
12.20/12.25	<l2, end, 5 <= arg1, {all remain the same}>
12.20/12.25	
12.20/12.25	--- Reachability graph ---
12.20/12.25	> Graph without transitions.
12.20/12.25	
12.20/12.25	Calling reachability with...
12.20/12.25	Transition: <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
12.20/12.25	Conditions: 5 <= arg1, 
12.20/12.25	OPEN EXITS: 
12.20/12.25	<l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ 5 <= arg1 /\ arg1 = undef10, {all remain the same}>
12.20/12.25	
12.20/12.25	> Conditions are reachable!
12.20/12.25	
12.20/12.25	Program does NOT terminate
12.20/12.25	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
12.20/12.25	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
12.20/12.25	EOF