5.64/5.65	NO
5.64/5.65	
5.64/5.66	Solver Timeout: 4
5.64/5.66	Global Timeout: 300
5.64/5.66	No parsing errors!
5.64/5.66	Init Location: 0
5.64/5.66	Transitions:
5.64/5.66	<l0, l3, true>
5.64/5.66	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}>
5.64/5.66	<l2, l2, (3 = arg1), par{arg1 -> 3, arg2 -> undef4}>
5.64/5.66	<l2, l2, (arg1 < 3) /\ (arg1 < 10), par{arg1 -> (arg1 + 1), arg2 -> undef6}>
5.64/5.66	<l2, l2, (arg1 > 3) /\ (arg1 < 10), par{arg1 -> (arg1 + 1), arg2 -> undef8}>
5.64/5.66	<l3, l1, true, par{arg1 -> undef9, arg2 -> undef10}>
5.64/5.66	
5.64/5.66	Fresh variables:
5.64/5.66	undef2, undef4, undef6, undef8, undef9, undef10, 
5.64/5.66	
5.64/5.66	Undef variables:
5.64/5.66	undef2, undef4, undef6, undef8, undef9, undef10, 
5.64/5.66	
5.64/5.66	Abstraction variables:
5.64/5.66	
5.64/5.66	Exit nodes:
5.64/5.66	
5.64/5.66	Accepting locations:
5.64/5.66	
5.64/5.66	Asserts:
5.64/5.66	
5.64/5.66	Preprocessed LLVMGraph
5.64/5.66	Init Location: 0
5.64/5.66	Transitions:
5.64/5.66	<l0, l2, (arg1 = undef10) /\ (undef9 > 0) /\ (undef10 > ~(1))>
5.64/5.66	<l2, l2, (3 = arg1), par{arg1 -> 3}>
5.64/5.66	<l2, l2, (arg1 < 3) /\ (arg1 < 10), par{arg1 -> (arg1 + 1)}>
5.64/5.66	<l2, l2, (arg1 > 3) /\ (arg1 < 10), par{arg1 -> (arg1 + 1)}>
5.64/5.66	
5.64/5.66	Fresh variables:
5.64/5.66	undef2, undef4, undef6, undef8, undef9, undef10, 
5.64/5.66	
5.64/5.66	Undef variables:
5.64/5.66	undef2, undef4, undef6, undef8, undef9, undef10, 
5.64/5.66	
5.64/5.66	Abstraction variables:
5.64/5.66	
5.64/5.66	Exit nodes:
5.64/5.66	
5.64/5.66	Accepting locations:
5.64/5.66	
5.64/5.66	Asserts:
5.64/5.66	
5.64/5.66	*************************************************************
5.64/5.66	*******************************************************************************************
5.64/5.66	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.64/5.66	*******************************************************************************************
5.64/5.66	
5.64/5.66	Init Location: 0
5.64/5.66	Graph 0:
5.64/5.66	Transitions:
5.64/5.66	Variables:
5.64/5.66	
5.64/5.66	Graph 1:
5.64/5.66	Transitions:
5.64/5.66	<l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>
5.64/5.66	<l2, l2, arg1 <= 2, {arg1 -> 1 + arg1, rest remain the same}>
5.64/5.66	<l2, l2, arg1 <= 9 /\ 4 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
5.64/5.66	Variables:
5.64/5.66	arg1
5.64/5.66	
5.64/5.66	Precedence: 
5.64/5.66	Graph 0
5.64/5.66	
5.64/5.66	Graph 1
5.64/5.66	<l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
5.64/5.66	
5.64/5.66	Map Locations to Subgraph:
5.64/5.66	( 0 , 0 )
5.64/5.66	( 2 , 1 )
5.64/5.66	
5.64/5.66	*******************************************************************************************
5.64/5.66	********************************    CHECKING ASSERTIONS    ********************************
5.64/5.66	*******************************************************************************************
5.64/5.66	
5.64/5.66	Proving termination of subgraph 0
5.64/5.66	Proving termination of subgraph 1
5.64/5.66	Checking unfeasibility...
5.64/5.66	Time used: 0.004862
5.64/5.66	
5.64/5.66	Checking conditional termination of SCC {l2}...
5.64/5.66	
5.64/5.66	LOG: CALL solveLinear
5.64/5.66	
5.64/5.66	LOG: RETURN solveLinear - Elapsed time: 0.001139s
5.64/5.66	Ranking function: 10 - 5*arg1
5.64/5.66	New Graphs: 
5.64/5.66	Transitions:
5.64/5.66	<l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>
5.64/5.66	<l2, l2, arg1 <= 9 /\ 4 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
5.64/5.66	Variables:
5.64/5.66	arg1
5.64/5.66	Checking conditional termination of SCC {l2}...
5.64/5.66	
5.64/5.66	LOG: CALL solveLinear
5.64/5.66	
5.64/5.66	LOG: RETURN solveLinear - Elapsed time: 0.000793s
5.64/5.66	Ranking function: 9 - arg1
5.64/5.66	New Graphs: 
5.64/5.66	Transitions:
5.64/5.66	<l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>
5.64/5.66	Variables:
5.64/5.66	arg1
5.64/5.66	Checking conditional termination of SCC {l2}...
5.64/5.66	
5.64/5.66	LOG: CALL solveLinear
5.64/5.66	
5.64/5.66	LOG: RETURN solveLinear - Elapsed time: 0.000369s
5.64/5.66	
5.64/5.66	LOG: CALL solveLinear
5.64/5.66	
5.64/5.66	LOG: RETURN solveLinear - Elapsed time: 0.001004s
5.64/5.66	Trying to remove transition: <l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>
5.64/5.66	Solving with 1 template(s).
5.64/5.66	
5.64/5.66	LOG: CALL solveNonLinearGetFirstSolution
5.64/5.66	
5.64/5.66	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.112217s
5.64/5.66	Time used: 0.112085
5.64/5.66	Solving with 1 template(s).
5.64/5.66	
5.64/5.66	LOG: CALL solveNonLinearGetFirstSolution
5.64/5.66	
5.64/5.66	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035714s
5.64/5.66	Time used: 0.035006
5.64/5.66	Improving Solution with cost 1 ...
5.64/5.66	
5.64/5.66	LOG: CALL solveNonLinearGetNextSolution
5.64/5.66	
5.64/5.66	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.027707s
5.64/5.66	Time used: 0.027698
5.64/5.66	
5.64/5.66	LOG: SAT solveNonLinear - Elapsed time: 0.063421s
5.64/5.66	Cost: 1; Total time: 0.062704
5.64/5.66	Failed at location 2: 4 <= arg1
5.64/5.66	Before Improving: 
5.64/5.66	Quasi-invariant at l2: 4 <= arg1
5.64/5.66	Optimizing invariants...
5.64/5.66	
5.64/5.66	LOG: CALL solveLinear
5.64/5.66	
5.64/5.66	LOG: RETURN solveLinear - Elapsed time: 0.003974s
5.64/5.66	Remaining time after improvement: 0.998849
5.64/5.66	Termination implied by a set of quasi-invariant(s):
5.64/5.66	Quasi-invariant at l2: 4 <= arg1
5.64/5.66	[ Invariant Graph ]
5.64/5.66	Strengthening and disabling transitions...
5.64/5.66	
5.64/5.66	LOG: CALL solverLinear in Graph for feasibility
5.64/5.66	
5.64/5.66	LOG: RETURN solveLinear in Graph for feasibility
5.64/5.66	It's unfeasible. Removing transition: 
5.64/5.66	<l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>
5.64/5.66	
5.64/5.66	LOG: CALL solverLinear in Graph for feasibility
5.64/5.66	
5.64/5.66	LOG: RETURN solveLinear in Graph for feasibility
5.64/5.66	It's unfeasible. Removing transition: 
5.64/5.66	<l2, l2, arg1 <= 2, {arg1 -> 1 + arg1, rest remain the same}>
5.64/5.66	
5.64/5.66	LOG: CALL solverLinear in Graph for feasibility
5.64/5.66	
5.64/5.66	LOG: RETURN solveLinear in Graph for feasibility
5.64/5.66	Strengthening transition (result): 
5.64/5.66	<l2, l2, arg1 <= 9 /\ 4 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
5.64/5.66	[ Termination Graph ]
5.64/5.66	Strengthening and disabling transitions...
5.64/5.66	
5.64/5.66	LOG: CALL solverLinear in Graph for feasibility
5.64/5.66	
5.64/5.66	LOG: RETURN solveLinear in Graph for feasibility
5.64/5.66	It's unfeasible. Removing transition: 
5.64/5.66	<l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>
5.64/5.66	New Graphs: 
5.64/5.66	Calling Safety with literal 4 <= arg1 and entry <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
5.64/5.66	
5.64/5.66	LOG: CALL check - Post:4 <= arg1 - Process 1
5.64/5.66	* Exit transition: <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
5.64/5.66	* Postcondition  : 4 <= arg1
5.64/5.66	
5.64/5.66	LOG: CALL solveLinear
5.64/5.66	
5.64/5.66	LOG: RETURN solveLinear - Elapsed time: 0.000447s
5.64/5.66	> Postcondition is not implied!
5.64/5.66	
5.64/5.66	LOG: RETURN check - Elapsed time: 0.000542s
5.64/5.66	INVARIANTS: 
5.64/5.66	2: 
5.64/5.66	Quasi-INVARIANTS to narrow Graph: 
5.64/5.66	2: 4 <= arg1 , 
5.64/5.66	Narrowing transition: 
5.64/5.66	<l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>
5.64/5.66	
5.64/5.66	LOG: Narrow transition size 1
5.64/5.66	Narrowing transition: 
5.64/5.66	<l2, l2, arg1 <= 2, {arg1 -> 1 + arg1, rest remain the same}>
5.64/5.66	
5.64/5.66	LOG: Narrow transition size 1
5.64/5.66	It's unfeasible. Removing transition: 
5.64/5.66	<l2, l2, arg1 <= 9 /\ 4 <= arg1, {arg1 -> 1 + arg1, rest remain the same}>
5.64/5.66	invGraph after Narrowing: 
5.64/5.66	Transitions:
5.64/5.66	<l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>
5.64/5.66	<l2, l2, arg1 <= 2, {arg1 -> 1 + arg1, rest remain the same}>
5.64/5.66	Variables:
5.64/5.66	arg1
5.64/5.66	Checking conditional termination of SCC {l2}...
5.64/5.66	
5.64/5.66	LOG: CALL solveLinear
5.64/5.66	
5.64/5.66	LOG: RETURN solveLinear - Elapsed time: 0.000769s
5.64/5.66	Ranking function: 3 - arg1
5.64/5.66	New Graphs: 
5.64/5.66	Transitions:
5.64/5.66	<l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>
5.64/5.66	Variables:
5.64/5.66	arg1
5.64/5.66	Checking conditional termination of SCC {l2}...
5.64/5.66	
5.64/5.66	LOG: CALL solveLinear
5.64/5.66	
5.64/5.66	LOG: RETURN solveLinear - Elapsed time: 0.000362s
5.64/5.66	
5.64/5.66	LOG: CALL solveLinear
5.64/5.66	
5.64/5.66	LOG: RETURN solveLinear - Elapsed time: 0.001024s
5.64/5.66	Trying to remove transition: <l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>
5.64/5.66	Solving with 1 template(s).
5.64/5.66	
5.64/5.66	LOG: CALL solveNonLinearGetFirstSolution
5.64/5.66	
5.64/5.66	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.111144s
5.64/5.66	Time used: 0.111015
5.64/5.66	Solving with 1 template(s).
5.64/5.66	
5.64/5.66	LOG: CALL solveNonLinearGetFirstSolution
5.64/5.66	
5.64/5.66	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.219932s
5.64/5.66	Time used: 0.219281
5.64/5.66	Solving with 2 template(s).
5.64/5.66	
5.64/5.66	LOG: CALL solveNonLinearGetFirstSolution
5.64/5.66	
5.64/5.66	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002603s
5.64/5.66	Time used: 4.00044
5.64/5.66	Solving with 3 template(s).
5.64/5.66	
5.64/5.66	LOG: CALL solveNonLinearGetFirstSolution
5.64/5.66	
5.64/5.66	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007106s
5.64/5.66	Time used: 1.00164
5.64/5.66	Solving with 1 template(s).
5.64/5.66	
5.64/5.66	LOG: CALL solveNonLinearGetFirstSolution
5.64/5.66	
5.64/5.66	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041167s
5.64/5.66	Time used: 0.035532
5.64/5.66	
5.64/5.66	Proving non-termination of subgraph 1
5.64/5.66	Transitions:
5.64/5.66	<l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>
5.64/5.66	<l2, l2, arg1 <= 2, {arg1 -> 1 + arg1, rest remain the same}>
5.64/5.66	Variables:
5.64/5.66	arg1
5.64/5.66	
5.64/5.66	Checking conditional non-termination of SCC {l2}...
5.64/5.66	EXIT TRANSITIONS:
5.64/5.66	<l2, end, 4 <= arg1, {all remain the same}>
5.64/5.66	
5.64/5.66	Solving with 1 template(s).
5.64/5.66	
5.64/5.66	LOG: CALL solveNonLinearGetFirstSolution
5.64/5.66	
5.64/5.66	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012847s
5.64/5.66	Time used: 0.012679
5.64/5.66	Improving Solution with cost 1 ...
5.64/5.66	
5.64/5.66	LOG: CALL solveNonLinearGetNextSolution
5.64/5.66	
5.64/5.66	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007985s
5.64/5.66	Time used: 0.00798
5.64/5.66	
5.64/5.66	LOG: SAT solveNonLinear - Elapsed time: 0.020832s
5.64/5.66	Cost: 1; Total time: 0.020659
5.64/5.66	Failed at location 2: arg1 <= 3
5.64/5.66	Before Improving: 
5.64/5.66	Quasi-invariant at l2: arg1 <= 3
5.64/5.66	Optimizing invariants...
5.64/5.66	
5.64/5.66	LOG: CALL solveLinear
5.64/5.66	
5.64/5.66	LOG: RETURN solveLinear - Elapsed time: 0.001614s
5.64/5.66	Remaining time after improvement: 0.999325
5.64/5.66	Non-termination implied by a set of quasi-invariant(s):
5.64/5.66	Quasi-invariant at l2: arg1 <= 3
5.64/5.66	
5.64/5.66	Strengthening and disabling EXIT transitions...
5.64/5.66	Closed exits from l2: 1
5.64/5.66	
5.64/5.66	Strengthening and disabling transitions...
5.64/5.66	
5.64/5.66	LOG: CALL solverLinear in Graph for feasibility
5.64/5.66	
5.64/5.66	LOG: RETURN solveLinear in Graph for feasibility
5.64/5.66	Strengthening transition (result): 
5.64/5.66	<l2, l2, arg1 = 3, {arg1 -> 3, rest remain the same}>
5.64/5.66	
5.64/5.66	LOG: CALL solverLinear in Graph for feasibility
5.64/5.66	
5.64/5.66	LOG: RETURN solveLinear in Graph for feasibility
5.64/5.66	Strengthening transition (result): 
5.64/5.66	<l2, l2, arg1 <= 2, {arg1 -> 1 + arg1, rest remain the same}>
5.64/5.66	
5.64/5.66	Calling reachability with...
5.64/5.66	Transition: <l2, end, true, {all remain the same}>
5.64/5.66	Conditions: arg1 <= 3, 
5.64/5.66	OPEN EXITS: 
5.64/5.66	<l2, end, arg1 <= 3, {all remain the same}>
5.64/5.66	
5.64/5.66	--- Reachability graph ---
5.64/5.66	> Graph without transitions.
5.64/5.66	
5.64/5.66	Calling reachability with...
5.64/5.66	Transition: <l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 = undef10, {all remain the same}>
5.64/5.66	Conditions: arg1 <= 3, 
5.64/5.66	OPEN EXITS: 
5.64/5.66	<l0, l2, 0 <= undef10 /\ 1 <= undef9 /\ arg1 <= 3 /\ arg1 = undef10, {all remain the same}>
5.64/5.66	
5.64/5.66	> Conditions are reachable!
5.64/5.66	
5.64/5.66	Program does NOT terminate
5.64/5.66	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.64/5.66	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.64/5.66	EOF