20.56/20.70	NO
20.56/20.70	
20.66/20.70	Solver Timeout: 4
20.66/20.70	Global Timeout: 300
20.66/20.70	No parsing errors!
20.66/20.70	Init Location: 0
20.66/20.70	Transitions:
20.66/20.70	<l0, l6, true>
20.66/20.70	<l1, l2, (undef1 <= arg1) /\ (arg1 > ~(1)) /\ (undef1 > ~(1)), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4}>
20.66/20.70	<l3, l2, (arg1 > 0) /\ (undef5 > ~(1)), par{arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8}>
20.66/20.70	<l2, l2, ((undef9 + 2) <= arg1) /\ (arg1 > 2) /\ (undef9 > ~(1)), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}>
20.66/20.70	<l2, l2, ((undef13 + 2) <= arg1) /\ (arg1 > 1) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16}>
20.66/20.70	<l2, l2, (arg1 >= undef17) /\ (arg1 > 2) /\ (undef17 > 0), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}>
20.66/20.70	<l3, l4, (arg2 > ~(1)) /\ (undef22 > ~(1)) /\ (arg1 > 0), par{arg1 -> 0, arg2 -> undef22, arg3 -> 1, arg4 -> undef24}>
20.66/20.70	<l4, l5, (undef27 > ~(1)) /\ (arg2 > arg1) /\ (arg3 > 0), par{arg1 -> arg2, arg2 -> arg1, arg3 -> undef27, arg4 -> (arg3 + 1)}>
20.66/20.70	<l5, l4, (0 = arg3), par{arg1 -> (arg2 + 1), arg2 -> arg1, arg3 -> arg4, arg4 -> undef32}>
20.66/20.70	<l5, l5, (arg3 > 0), par{arg3 -> (arg3 - 1)}>
20.66/20.70	<l6, l3, true, par{arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40}>
20.66/20.70	
20.66/20.70	Fresh variables:
20.66/20.70	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef22, undef24, undef27, undef32, undef37, undef38, undef39, undef40, 
20.66/20.70	
20.66/20.70	Undef variables:
20.66/20.70	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef22, undef24, undef27, undef32, undef37, undef38, undef39, undef40, 
20.66/20.70	
20.66/20.70	Abstraction variables:
20.66/20.70	
20.66/20.70	Exit nodes:
20.66/20.70	
20.66/20.70	Accepting locations:
20.66/20.70	
20.66/20.70	Asserts:
20.66/20.70	
20.66/20.70	Preprocessed LLVMGraph
20.66/20.70	Init Location: 0
20.66/20.70	Transitions:
20.66/20.70	<l0, l2, (undef37 > 0) /\ (undef5 > ~(1)), par{arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8}>
20.66/20.70	<l0, l5, (undef38 > ~(1)) /\ (undef22 > ~(1)) /\ (undef37 > 0) /\ (undef27 > ~(1)) /\ (undef22 > 0) /\ (1 > 0), par{arg1 -> undef22, arg2 -> 0, arg3 -> undef27, arg4 -> (1 + 1)}>
20.66/20.70	<l2, l2, ((undef9 + 2) <= arg1) /\ (arg1 > 2) /\ (undef9 > ~(1)), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}>
20.66/20.70	<l2, l2, ((undef13 + 2) <= arg1) /\ (arg1 > 1) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16}>
20.66/20.70	<l2, l2, (arg1 >= undef17) /\ (arg1 > 2) /\ (undef17 > 0), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}>
20.66/20.70	<l5, l5, (0 = arg3) /\ (undef27 > ~(1)) /\ (arg1 > (arg2 + 1)) /\ (arg4 > 0), par{arg1 -> arg1, arg2 -> (arg2 + 1), arg3 -> undef27, arg4 -> (arg4 + 1)}>
20.66/20.70	<l5, l5, (arg3 > 0), par{arg3 -> (arg3 - 1)}>
20.66/20.70	
20.66/20.70	Fresh variables:
20.66/20.70	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef22, undef24, undef27, undef32, undef37, undef38, undef39, undef40, 
20.66/20.70	
20.66/20.70	Undef variables:
20.66/20.70	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef22, undef24, undef27, undef32, undef37, undef38, undef39, undef40, 
20.66/20.70	
20.66/20.70	Abstraction variables:
20.66/20.70	
20.66/20.70	Exit nodes:
20.66/20.70	
20.66/20.70	Accepting locations:
20.66/20.70	
20.66/20.70	Asserts:
20.66/20.70	
20.66/20.70	*************************************************************
20.66/20.70	*******************************************************************************************
20.66/20.70	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
20.66/20.70	*******************************************************************************************
20.66/20.70	
20.66/20.70	Init Location: 0
20.66/20.70	Graph 0:
20.66/20.70	Transitions:
20.66/20.70	Variables:
20.66/20.70	
20.66/20.70	Graph 1:
20.66/20.70	Transitions:
20.66/20.70	<l5, l5, 1 <= arg4 /\ 0 <= undef27 /\ 2 + arg2 <= arg1 /\ arg3 = 0, {arg2 -> 1 + arg2, arg3 -> undef27, arg4 -> 1 + arg4, rest remain the same}>
20.66/20.70	<l5, l5, 1 <= arg3, {arg3 -> -1 + arg3, rest remain the same}>
20.66/20.70	Variables:
20.66/20.70	arg1, arg2, arg3, arg4
20.66/20.70	
20.66/20.70	Graph 2:
20.66/20.70	Transitions:
20.66/20.70	<l2, l2, 0 <= undef9 /\ 2 + undef9 <= arg1 /\ 3 <= arg1, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
20.66/20.70	<l2, l2, 0 <= undef13 /\ 2 <= arg1 /\ 2 + undef13 <= arg1, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
20.66/20.70	<l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	Variables:
20.66/20.70	arg1, arg2, arg3, arg4
20.66/20.70	
20.66/20.70	Precedence: 
20.66/20.70	Graph 0
20.66/20.70	
20.66/20.70	Graph 1
20.66/20.70	<l0, l5, 1 <= undef22 /\ 1 <= undef37 /\ 0 <= undef27 /\ 0 <= undef38, {arg1 -> undef22, arg2 -> 0, arg3 -> undef27, arg4 -> 2, rest remain the same}>
20.66/20.70	
20.66/20.70	Graph 2
20.66/20.70	<l0, l2, 1 <= undef37 /\ 0 <= undef5, {arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}>
20.66/20.70	
20.66/20.70	Map Locations to Subgraph:
20.66/20.70	( 0 , 0 )
20.66/20.70	( 2 , 2 )
20.66/20.70	( 5 , 1 )
20.66/20.70	
20.66/20.70	*******************************************************************************************
20.66/20.70	********************************    CHECKING ASSERTIONS    ********************************
20.66/20.70	*******************************************************************************************
20.66/20.70	
20.66/20.70	Proving termination of subgraph 0
20.66/20.70	Proving termination of subgraph 1
20.66/20.70	Checking unfeasibility...
20.66/20.70	Time used: 0.008126
20.66/20.70	
20.66/20.70	Checking conditional termination of SCC {l5}...
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.001497s
20.66/20.70	Ranking function: -2 + 2*arg1 - 2*arg2 + arg4
20.66/20.70	New Graphs: 
20.66/20.70	Transitions:
20.66/20.70	<l5, l5, 1 <= arg3, {arg3 -> -1 + arg3, rest remain the same}>
20.66/20.70	Variables:
20.66/20.70	arg3
20.66/20.70	Checking conditional termination of SCC {l5}...
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.000497s
20.66/20.70	Ranking function: -1 + arg3
20.66/20.70	New Graphs: 
20.66/20.70	Proving termination of subgraph 2
20.66/20.70	Checking unfeasibility...
20.66/20.70	Time used: 0.007652
20.66/20.70	
20.66/20.70	Checking conditional termination of SCC {l2}...
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.002267s
20.66/20.70	Ranking function: -1 + (1 / 2)*arg1
20.66/20.70	New Graphs: 
20.66/20.70	Transitions:
20.66/20.70	<l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	Variables:
20.66/20.70	arg1, arg2, arg3, arg4
20.66/20.70	Checking conditional termination of SCC {l2}...
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.000708s
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.002499s
20.66/20.70	Trying to remove transition: <l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	Solving with 1 template(s).
20.66/20.70	
20.66/20.70	LOG: CALL solveNonLinearGetFirstSolution
20.66/20.70	
20.66/20.70	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007574s
20.66/20.70	Time used: 0.007379
20.66/20.70	Solving with 1 template(s).
20.66/20.70	
20.66/20.70	LOG: CALL solveNonLinearGetFirstSolution
20.66/20.70	
20.66/20.70	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018998s
20.66/20.70	Time used: 0.018378
20.66/20.70	Improving Solution with cost 1 ...
20.66/20.70	
20.66/20.70	LOG: CALL solveNonLinearGetNextSolution
20.66/20.70	
20.66/20.70	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.029410s
20.66/20.70	Time used: 0.029402
20.66/20.70	
20.66/20.70	LOG: SAT solveNonLinear - Elapsed time: 0.048408s
20.66/20.70	Cost: 1; Total time: 0.04778
20.66/20.70	Failed at location 2: arg1 <= 1
20.66/20.70	Before Improving: 
20.66/20.70	Quasi-invariant at l2: arg1 <= 1
20.66/20.70	Optimizing invariants...
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.005465s
20.66/20.70	Remaining time after improvement: 0.998091
20.66/20.70	Termination implied by a set of quasi-invariant(s):
20.66/20.70	Quasi-invariant at l2: arg1 <= 1
20.66/20.70	[ Invariant Graph ]
20.66/20.70	Strengthening and disabling transitions...
20.66/20.70	
20.66/20.70	LOG: CALL solverLinear in Graph for feasibility
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear in Graph for feasibility
20.66/20.70	It's unfeasible. Removing transition: 
20.66/20.70	<l2, l2, 0 <= undef9 /\ 2 + undef9 <= arg1 /\ 3 <= arg1, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
20.66/20.70	
20.66/20.70	LOG: CALL solverLinear in Graph for feasibility
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear in Graph for feasibility
20.66/20.70	It's unfeasible. Removing transition: 
20.66/20.70	<l2, l2, 0 <= undef13 /\ 2 <= arg1 /\ 2 + undef13 <= arg1, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
20.66/20.70	
20.66/20.70	LOG: CALL solverLinear in Graph for feasibility
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear in Graph for feasibility
20.66/20.70	It's unfeasible. Removing transition: 
20.66/20.70	<l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	[ Termination Graph ]
20.66/20.70	Strengthening and disabling transitions...
20.66/20.70	> It's unfeasible. Removing transition: 
20.66/20.70	<l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	New Graphs: 
20.66/20.70	Calling Safety with literal arg1 <= 1 and entry <l0, l2, 1 <= undef37 /\ 0 <= undef5, {arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}>
20.66/20.70	
20.66/20.70	LOG: CALL check - Post:arg1 <= 1 - Process 1
20.66/20.70	* Exit transition: <l0, l2, 1 <= undef37 /\ 0 <= undef5, {arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}>
20.66/20.70	* Postcondition  : arg1 <= 1
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.000585s
20.66/20.70	> Postcondition is not implied!
20.66/20.70	
20.66/20.70	LOG: RETURN check - Elapsed time: 0.000680s
20.66/20.70	INVARIANTS: 
20.66/20.70	2: 
20.66/20.70	Quasi-INVARIANTS to narrow Graph: 
20.66/20.70	2: arg1 <= 1 , 
20.66/20.70	Narrowing transition: 
20.66/20.70	<l2, l2, 0 <= undef9 /\ 2 + undef9 <= arg1 /\ 3 <= arg1, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
20.66/20.70	
20.66/20.70	LOG: Narrow transition size 1
20.66/20.70	Narrowing transition: 
20.66/20.70	<l2, l2, 0 <= undef13 /\ 2 <= arg1 /\ 2 + undef13 <= arg1, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
20.66/20.70	
20.66/20.70	LOG: Narrow transition size 1
20.66/20.70	Narrowing transition: 
20.66/20.70	<l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	
20.66/20.70	LOG: Narrow transition size 1
20.66/20.70	invGraph after Narrowing: 
20.66/20.70	Transitions:
20.66/20.70	<l2, l2, 0 <= undef9 /\ 2 + undef9 <= arg1 /\ 3 <= arg1, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
20.66/20.70	<l2, l2, 0 <= undef13 /\ 2 <= arg1 /\ 2 + undef13 <= arg1, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
20.66/20.70	<l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	Variables:
20.66/20.70	arg1, arg2, arg3, arg4
20.66/20.70	Checking conditional termination of SCC {l2}...
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.002050s
20.66/20.70	Ranking function: -1 + (1 / 2)*arg1
20.66/20.70	New Graphs: 
20.66/20.70	Transitions:
20.66/20.70	<l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	Variables:
20.66/20.70	arg1, arg2, arg3, arg4
20.66/20.70	Checking conditional termination of SCC {l2}...
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.000721s
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.002583s
20.66/20.70	Trying to remove transition: <l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	Solving with 1 template(s).
20.66/20.70	
20.66/20.70	LOG: CALL solveNonLinearGetFirstSolution
20.66/20.70	
20.66/20.70	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007641s
20.66/20.70	Time used: 0.007486
20.66/20.70	Solving with 1 template(s).
20.66/20.70	
20.66/20.70	LOG: CALL solveNonLinearGetFirstSolution
20.66/20.70	
20.66/20.70	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.036958s
20.66/20.70	Time used: 0.036249
20.66/20.70	Improving Solution with cost 1 ...
20.66/20.70	
20.66/20.70	LOG: CALL solveNonLinearGetNextSolution
20.66/20.70	
20.66/20.70	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.026358s
20.66/20.70	Time used: 0.026349
20.66/20.70	
20.66/20.70	LOG: SAT solveNonLinear - Elapsed time: 0.063315s
20.66/20.70	Cost: 1; Total time: 0.062598
20.66/20.70	Failed at location 2: arg1 <= 2
20.66/20.70	Before Improving: 
20.66/20.70	Quasi-invariant at l2: arg1 <= 2
20.66/20.70	Optimizing invariants...
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.005625s
20.66/20.70	Remaining time after improvement: 0.998003
20.66/20.70	Termination implied by a set of quasi-invariant(s):
20.66/20.70	Quasi-invariant at l2: arg1 <= 2
20.66/20.70	[ Invariant Graph ]
20.66/20.70	Strengthening and disabling transitions...
20.66/20.70	
20.66/20.70	LOG: CALL solverLinear in Graph for feasibility
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear in Graph for feasibility
20.66/20.70	It's unfeasible. Removing transition: 
20.66/20.70	<l2, l2, 0 <= undef9 /\ 2 + undef9 <= arg1 /\ 3 <= arg1, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
20.66/20.70	
20.66/20.70	LOG: CALL solverLinear in Graph for feasibility
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear in Graph for feasibility
20.66/20.70	Strengthening transition (result): 
20.66/20.70	<l2, l2, 0 <= undef13 /\ 2 + undef13 <= arg1 /\ arg1 = 2, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
20.66/20.70	
20.66/20.70	LOG: CALL solverLinear in Graph for feasibility
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear in Graph for feasibility
20.66/20.70	It's unfeasible. Removing transition: 
20.66/20.70	<l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	[ Termination Graph ]
20.66/20.70	Strengthening and disabling transitions...
20.66/20.70	> It's unfeasible. Removing transition: 
20.66/20.70	<l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	New Graphs: 
20.66/20.70	Calling Safety with literal arg1 <= 2 and entry <l0, l2, 1 <= undef37 /\ 2 <= undef5, {arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}>
20.66/20.70	
20.66/20.70	LOG: CALL check - Post:arg1 <= 2 - Process 2
20.66/20.70	* Exit transition: <l0, l2, 1 <= undef37 /\ 2 <= undef5, {arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}>
20.66/20.70	* Postcondition  : arg1 <= 2
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.000472s
20.66/20.70	> Postcondition is not implied!
20.66/20.70	
20.66/20.70	LOG: RETURN check - Elapsed time: 0.000563s
20.66/20.70	INVARIANTS: 
20.66/20.70	2: 
20.66/20.70	Quasi-INVARIANTS to narrow Graph: 
20.66/20.70	2: arg1 <= 2 , 
20.66/20.70	Narrowing transition: 
20.66/20.70	<l2, l2, 0 <= undef9 /\ 2 + undef9 <= arg1 /\ 3 <= arg1, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
20.66/20.70	
20.66/20.70	LOG: Narrow transition size 1
20.66/20.70	Narrowing transition: 
20.66/20.70	<l2, l2, 0 <= undef13 /\ 2 <= arg1 /\ 2 + undef13 <= arg1, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
20.66/20.70	
20.66/20.70	LOG: Narrow transition size 1
20.66/20.70	Narrowing transition: 
20.66/20.70	<l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	
20.66/20.70	LOG: Narrow transition size 1
20.66/20.70	invGraph after Narrowing: 
20.66/20.70	Transitions:
20.66/20.70	<l2, l2, 0 <= undef9 /\ 2 + undef9 <= arg1 /\ 3 <= arg1, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
20.66/20.70	<l2, l2, 0 <= undef13 /\ 2 + undef13 <= arg1 /\ 3 <= arg1, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
20.66/20.70	<l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	Variables:
20.66/20.70	arg1, arg2, arg3, arg4
20.66/20.70	Checking conditional termination of SCC {l2}...
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.002137s
20.66/20.70	Ranking function: (~(3) / 2) + (1 / 2)*arg1
20.66/20.70	New Graphs: 
20.66/20.70	Transitions:
20.66/20.70	<l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	Variables:
20.66/20.70	arg1, arg2, arg3, arg4
20.66/20.70	Checking conditional termination of SCC {l2}...
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.000738s
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.002578s
20.66/20.70	Trying to remove transition: <l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	Solving with 1 template(s).
20.66/20.70	
20.66/20.70	LOG: CALL solveNonLinearGetFirstSolution
20.66/20.70	
20.66/20.70	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007699s
20.66/20.70	Time used: 0.007535
20.66/20.70	Solving with 1 template(s).
20.66/20.70	
20.66/20.70	LOG: CALL solveNonLinearGetFirstSolution
20.66/20.70	
20.66/20.70	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037568s
20.66/20.70	Time used: 0.037004
20.66/20.70	Solving with 2 template(s).
20.66/20.70	
20.66/20.70	LOG: CALL solveNonLinearGetFirstSolution
20.66/20.70	
20.66/20.70	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002669s
20.66/20.70	Time used: 4.00083
20.66/20.70	Solving with 3 template(s).
20.66/20.70	
20.66/20.70	LOG: CALL solveNonLinearGetFirstSolution
20.66/20.70	
20.66/20.70	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008449s
20.66/20.70	Time used: 1.00066
20.66/20.70	Solving with 1 template(s).
20.66/20.70	
20.66/20.70	LOG: CALL solveNonLinearGetFirstSolution
20.66/20.70	
20.66/20.70	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045840s
20.66/20.70	Time used: 0.014822
20.66/20.70	
20.66/20.70	Proving non-termination of subgraph 2
20.66/20.70	Transitions:
20.66/20.70	<l2, l2, 0 <= undef9 /\ 2 + undef9 <= arg1 /\ 3 <= arg1, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
20.66/20.70	<l2, l2, 0 <= undef13 /\ 2 + undef13 <= arg1 /\ 3 <= arg1, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
20.66/20.70	<l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	Variables:
20.66/20.70	arg1, arg2, arg3, arg4
20.66/20.70	
20.66/20.70	Checking that every undef value has an assignment...
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.002081s
20.66/20.70	Checking conditional non-termination of SCC {l2}...
20.66/20.70	EXIT TRANSITIONS:
20.66/20.70	<l2, end, arg1 <= 2, {all remain the same}>
20.66/20.70	
20.66/20.70	Solving with 1 template(s).
20.66/20.70	
20.66/20.70	LOG: CALL solveNonLinearGetFirstSolution
20.66/20.70	
20.66/20.70	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.001652s
20.66/20.70	Time used: 5.00099
20.66/20.70	Solving with 2 template(s).
20.66/20.70	
20.66/20.70	LOG: CALL solveNonLinearGetFirstSolution
20.66/20.70	
20.66/20.70	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.019694s
20.66/20.70	Time used: 5.00144
20.66/20.70	Solving with 3 template(s).
20.66/20.70	
20.66/20.70	LOG: CALL solveNonLinearGetFirstSolution
20.66/20.70	
20.66/20.70	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.033205s
20.66/20.70	Time used: 5.00357
20.66/20.70	> Checking if the negation of the conditions of every pending exit is quasi-invariant... NO
20.66/20.70	
20.66/20.70	Proving non-termination of subgraph 2
20.66/20.70	Transitions:
20.66/20.70	<l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	Variables:
20.66/20.70	arg1, arg2, arg3, arg4
20.66/20.70	
20.66/20.70	Checking that every undef value has an assignment...
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.002469s
20.66/20.70	Checking conditional non-termination of SCC {l2}...
20.66/20.70	EXIT TRANSITIONS:
20.66/20.70	<l2, end, arg1 <= 2, {all remain the same}>
20.66/20.70	
20.66/20.70	Solving with 1 template(s).
20.66/20.70	
20.66/20.70	LOG: CALL solveNonLinearGetFirstSolution
20.66/20.70	
20.66/20.70	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.098118s
20.66/20.70	Time used: 0.097757
20.66/20.70	Improving Solution with cost 1 ...
20.66/20.70	
20.66/20.70	LOG: CALL solveNonLinearGetNextSolution
20.66/20.70	
20.66/20.70	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.057231s
20.66/20.70	Time used: 0.057221
20.66/20.70	
20.66/20.70	LOG: SAT solveNonLinear - Elapsed time: 0.155349s
20.66/20.70	Cost: 1; Total time: 0.154978
20.66/20.70	Failed at location 2: 3 <= arg1
20.66/20.70	Before Improving: 
20.66/20.70	Quasi-invariant at l2: 3 <= arg1
20.66/20.70	Optimizing invariants...
20.66/20.70	
20.66/20.70	LOG: CALL solveLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear - Elapsed time: 0.014365s
20.66/20.70	Remaining time after improvement: 0.997491
20.66/20.70	Minimizing number of undef constraints...
20.66/20.70	
20.66/20.70	LOG: CALL solveNonLinear
20.66/20.70	
20.66/20.70	LOG: RETURN solveNonLinear - Elapsed time: 0.004378s
20.66/20.70	Non-termination implied by a set of quasi-invariant(s):
20.66/20.70	Quasi-invariant at l2: 3 <= arg1
20.66/20.70	Constraint over undef 'arg1 <= undef17' in transition:
20.66/20.70	<l2, l2, 1 <= undef17 /\ undef17 <= arg1 /\ 3 <= arg1, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	
20.66/20.70	Strengthening and disabling EXIT transitions...
20.66/20.70	Closed exits from l2: 1
20.66/20.70	
20.66/20.70	Strengthening and disabling transitions...
20.66/20.70	
20.66/20.70	LOG: CALL solverLinear in Graph for feasibility
20.66/20.70	
20.66/20.70	LOG: RETURN solveLinear in Graph for feasibility
20.66/20.70	Strengthening transition (result): 
20.66/20.70	<l2, l2, 1 <= undef17 /\ 3 <= arg1 /\ arg1 = undef17, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
20.66/20.70	
20.66/20.70	Calling reachability with...
20.66/20.70	Transition: <l2, end, true, {all remain the same}>
20.66/20.70	Conditions: 3 <= arg1, 
20.66/20.70	OPEN EXITS: 
20.66/20.70	<l2, end, 3 <= arg1, {all remain the same}>
20.66/20.70	
20.66/20.70	--- Reachability graph ---
20.66/20.70	> Graph without transitions.
20.66/20.70	
20.66/20.70	Calling reachability with...
20.66/20.70	Transition: <l0, l2, 1 <= undef37 /\ 0 <= undef5, {arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}>
20.66/20.70	Conditions: 3 <= arg1, 
20.66/20.70	OPEN EXITS: 
20.66/20.70	<l0, l2, 1 <= undef37 /\ 3 <= undef5, {arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}>
20.66/20.70	
20.66/20.70	> Conditions are reachable!
20.66/20.70	
20.66/20.70	Program does NOT terminate
20.66/20.70	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
20.66/20.70	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
20.66/20.70	EOF