23.43/23.49	NO
23.43/23.49	
23.43/23.49	Solver Timeout: 4
23.43/23.49	Global Timeout: 300
23.43/23.49	No parsing errors!
23.43/23.49	Init Location: 0
23.43/23.49	Transitions:
23.43/23.49	<l0, l3, true>
23.43/23.49	<l1, l2, true, par{arg1 -> 3}>
23.43/23.49	<l2, l2, (arg1 > 5), par{arg1 -> (arg1 + 3)}>
23.43/23.49	<l2, l2, (arg1 < 11) /\ (arg1 < 6) /\ (arg1 > 2), par{arg1 -> (arg1 + 1)}>
23.43/23.49	<l3, l1, true, par{arg1 -> undef4}>
23.43/23.49	
23.43/23.49	Fresh variables:
23.43/23.49	undef4, 
23.43/23.49	
23.43/23.49	Undef variables:
23.43/23.49	undef4, 
23.43/23.49	
23.43/23.49	Abstraction variables:
23.43/23.49	
23.43/23.49	Exit nodes:
23.43/23.49	
23.43/23.49	Accepting locations:
23.43/23.49	
23.43/23.49	Asserts:
23.43/23.49	
23.43/23.49	Preprocessed LLVMGraph
23.43/23.49	Init Location: 0
23.43/23.49	Transitions:
23.43/23.49	<l0, l2, (arg1 = 3)>
23.43/23.49	<l2, l2, (arg1 > 5), par{arg1 -> (arg1 + 3)}>
23.43/23.49	<l2, l2, (arg1 < 11) /\ (arg1 < 6) /\ (arg1 > 2), par{arg1 -> (arg1 + 1)}>
23.43/23.49	
23.43/23.49	Fresh variables:
23.43/23.49	undef4, 
23.43/23.49	
23.43/23.49	Undef variables:
23.43/23.49	undef4, 
23.43/23.49	
23.43/23.49	Abstraction variables:
23.43/23.49	
23.43/23.49	Exit nodes:
23.43/23.49	
23.43/23.49	Accepting locations:
23.43/23.49	
23.43/23.49	Asserts:
23.43/23.49	
23.43/23.49	*************************************************************
23.43/23.49	*******************************************************************************************
23.43/23.49	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
23.43/23.49	*******************************************************************************************
23.43/23.49	
23.43/23.49	Init Location: 0
23.43/23.49	Graph 0:
23.43/23.49	Transitions:
23.43/23.49	Variables:
23.43/23.49	
23.43/23.49	Graph 1:
23.43/23.49	Transitions:
23.43/23.49	<l2, l2, 6 <= arg1, {arg1 -> 3 + arg1, rest remain the same}>
23.43/23.49	<l2, l2, 3 <= arg1 /\ arg1 <= 5, {arg1 -> 1 + arg1, rest remain the same}>
23.43/23.49	Variables:
23.43/23.49	arg1
23.43/23.49	
23.43/23.49	Precedence: 
23.43/23.49	Graph 0
23.43/23.49	
23.43/23.49	Graph 1
23.43/23.49	<l0, l2, arg1 = 3, {all remain the same}>
23.43/23.49	
23.43/23.49	Map Locations to Subgraph:
23.43/23.49	( 0 , 0 )
23.43/23.49	( 2 , 1 )
23.43/23.49	
23.43/23.49	*******************************************************************************************
23.43/23.49	********************************    CHECKING ASSERTIONS    ********************************
23.43/23.49	*******************************************************************************************
23.43/23.49	
23.43/23.49	Proving termination of subgraph 0
23.43/23.49	Proving termination of subgraph 1
23.43/23.49	Checking unfeasibility...
23.43/23.49	Time used: 0.265925
23.43/23.49	
23.43/23.49	Checking conditional termination of SCC {l2}...
23.43/23.49	
23.43/23.49	LOG: CALL solveLinear
23.43/23.49	
23.43/23.49	LOG: RETURN solveLinear - Elapsed time: 0.001406s
23.43/23.49	Ranking function: 6 - arg1
23.43/23.49	New Graphs: 
23.43/23.49	Transitions:
23.43/23.49	<l2, l2, 6 <= arg1, {arg1 -> 3 + arg1, rest remain the same}>
23.43/23.49	Variables:
23.43/23.49	arg1
23.43/23.49	Checking conditional termination of SCC {l2}...
23.43/23.49	
23.43/23.49	LOG: CALL solveLinear
23.43/23.49	
23.43/23.49	LOG: RETURN solveLinear - Elapsed time: 0.000376s
23.43/23.49	
23.43/23.49	LOG: CALL solveLinear
23.43/23.49	
23.43/23.49	LOG: RETURN solveLinear - Elapsed time: 0.001166s
23.43/23.49	Trying to remove transition: <l2, l2, 6 <= arg1, {arg1 -> 3 + arg1, rest remain the same}>
23.43/23.49	Solving with 1 template(s).
23.43/23.49	
23.43/23.49	LOG: CALL solveNonLinearGetFirstSolution
23.43/23.49	
23.43/23.49	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004247s
23.43/23.49	Time used: 0.004123
23.43/23.49	Solving with 1 template(s).
23.43/23.49	
23.43/23.49	LOG: CALL solveNonLinearGetFirstSolution
23.43/23.49	
23.43/23.49	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001456s
23.43/23.49	Time used: 4.0006
23.43/23.49	Solving with 2 template(s).
23.43/23.49	
23.43/23.49	LOG: CALL solveNonLinearGetFirstSolution
23.43/23.49	
23.43/23.49	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.014087s
23.43/23.49	Time used: 4.00079
23.43/23.49	Solving with 3 template(s).
23.43/23.49	
23.43/23.49	LOG: CALL solveNonLinearGetFirstSolution
23.43/23.49	
23.43/23.49	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.012156s
23.43/23.49	Time used: 1.00076
23.43/23.49	Solving with 1 template(s).
23.43/23.49	
23.43/23.49	LOG: CALL solveNonLinearGetFirstSolution
23.43/23.49	
23.43/23.49	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018597s
23.43/23.49	Time used: 0.009102
23.43/23.49	Improving Solution with cost 1 ...
23.43/23.49	
23.43/23.49	LOG: CALL solveNonLinearGetNextSolution
23.43/23.49	
23.43/23.49	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001027s
23.43/23.49	Time used: 1.00077
23.43/23.49	
23.43/23.49	LOG: SAT solveNonLinear - Elapsed time: 1.019625s
23.43/23.49	Cost: 1; Total time: 1.00987
23.43/23.49	Termination implied by a set of invariant(s):
23.43/23.49	Invariant at l2: 0 <= arg1
23.43/23.49	[ Invariant Graph ]
23.43/23.49	Strengthening and disabling transitions...
23.43/23.49	
23.43/23.49	LOG: CALL solverLinear in Graph for feasibility
23.43/23.49	
23.43/23.49	LOG: RETURN solveLinear in Graph for feasibility
23.43/23.49	Strengthening transition (result): 
23.43/23.49	<l2, l2, 6 <= arg1, {arg1 -> 3 + arg1, rest remain the same}>
23.43/23.49	
23.43/23.49	LOG: CALL solverLinear in Graph for feasibility
23.43/23.49	
23.43/23.49	LOG: RETURN solveLinear in Graph for feasibility
23.43/23.49	Strengthening transition (result): 
23.43/23.49	<l2, l2, 3 <= arg1 /\ arg1 <= 5, {arg1 -> 1 + arg1, rest remain the same}>
23.43/23.49	[ Termination Graph ]
23.43/23.49	Strengthening and disabling transitions...
23.43/23.49	
23.43/23.49	LOG: CALL solverLinear in Graph for feasibility
23.43/23.49	
23.43/23.49	LOG: RETURN solveLinear in Graph for feasibility
23.43/23.49	Strengthening transition (result): 
23.43/23.49	<l2, l2, 6 <= arg1, {arg1 -> 3 + arg1, rest remain the same}>
23.43/23.49	Quasi-ranking function: 50000 - arg1
23.43/23.49	New Graphs: 
23.43/23.49	Transitions:
23.43/23.49	<l2, l2, 50001 <= arg1, {arg1 -> 3 + arg1, rest remain the same}>
23.43/23.49	Variables:
23.43/23.49	arg1
23.43/23.49	Checking conditional termination of SCC {l2}...
23.43/23.49	
23.43/23.49	LOG: CALL solveLinear
23.43/23.49	
23.43/23.49	LOG: RETURN solveLinear - Elapsed time: 0.000435s
23.43/23.49	
23.43/23.49	LOG: CALL solveLinear
23.43/23.49	
23.43/23.49	LOG: RETURN solveLinear - Elapsed time: 0.001298s
23.43/23.49	Trying to remove transition: <l2, l2, 50001 <= arg1, {arg1 -> 3 + arg1, rest remain the same}>
23.43/23.49	Solving with 1 template(s).
23.43/23.49	
23.43/23.49	LOG: CALL solveNonLinearGetFirstSolution
23.43/23.49	
23.43/23.49	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004817s
23.43/23.49	Time used: 0.004692
23.43/23.49	Solving with 1 template(s).
23.43/23.49	
23.43/23.49	LOG: CALL solveNonLinearGetFirstSolution
23.43/23.49	
23.43/23.49	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002133s
23.43/23.49	Time used: 4.0013
23.43/23.49	Solving with 2 template(s).
23.43/23.49	
23.43/23.49	LOG: CALL solveNonLinearGetFirstSolution
23.43/23.49	
23.43/23.49	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.014569s
23.43/23.49	Time used: 4.00134
23.43/23.49	Solving with 3 template(s).
23.43/23.49	
23.43/23.49	LOG: CALL solveNonLinearGetFirstSolution
23.43/23.49	
23.43/23.49	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.010689s
23.43/23.49	Time used: 1.00056
23.43/23.49	Solving with 1 template(s).
23.43/23.49	
23.43/23.49	LOG: CALL solveNonLinearGetFirstSolution
23.43/23.49	
23.43/23.49	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008828s
23.43/23.49	Time used: 4.00177
23.43/23.49	Termination failed. Trying to show unreachability...
23.43/23.49	Proving unreachability of entry: <l0, l2, arg1 = 3, {all remain the same}>
23.43/23.49	
23.43/23.49	LOG: CALL check - Post:1 <= 0 - Process 1
23.43/23.49	* Exit transition: <l0, l2, arg1 = 3, {all remain the same}>
23.43/23.49	* Postcondition  : 1 <= 0
23.43/23.49	
23.43/23.49	LOG: CALL solveLinear
23.43/23.49	
23.43/23.49	LOG: RETURN solveLinear - Elapsed time: 0.015339s
23.43/23.49	> Postcondition is not implied!
23.43/23.49	
23.43/23.49	LOG: RETURN check - Elapsed time: 0.015458s
23.43/23.49	Cannot prove unreachability
23.43/23.49	
23.43/23.49	Proving non-termination of subgraph 1
23.43/23.49	Transitions:
23.43/23.49	<l2, l2, 6 <= arg1, {arg1 -> 3 + arg1, rest remain the same}>
23.43/23.49	<l2, l2, 3 <= arg1 /\ arg1 <= 5, {arg1 -> 1 + arg1, rest remain the same}>
23.43/23.49	Variables:
23.43/23.49	arg1
23.43/23.49	
23.43/23.49	Checking conditional non-termination of SCC {l2}...
23.43/23.49	EXIT TRANSITIONS:
23.43/23.49	<l2, end, arg1 <= 2, {all remain the same}>
23.43/23.49	
23.43/23.49	Solving with 1 template(s).
23.43/23.49	
23.43/23.49	LOG: CALL solveNonLinearGetFirstSolution
23.43/23.49	
23.43/23.49	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010473s
23.43/23.49	Time used: 0.010371
23.43/23.49	
23.43/23.49	LOG: SAT solveNonLinear - Elapsed time: 0.010473s
23.43/23.49	Cost: 0; Total time: 0.010371
23.43/23.49	Non-termination implied by a set of quasi-invariant(s):
23.43/23.49	Quasi-invariant at l2: 3 <= arg1
23.43/23.49	
23.43/23.49	Strengthening and disabling EXIT transitions...
23.43/23.49	Closed exits from l2: 1
23.43/23.49	
23.43/23.49	Strengthening and disabling transitions...
23.43/23.49	
23.43/23.49	LOG: CALL solverLinear in Graph for feasibility
23.43/23.49	
23.43/23.49	LOG: RETURN solveLinear in Graph for feasibility
23.43/23.49	Strengthening transition (result): 
23.43/23.49	<l2, l2, 6 <= arg1, {arg1 -> 3 + arg1, rest remain the same}>
23.43/23.49	
23.43/23.49	LOG: CALL solverLinear in Graph for feasibility
23.43/23.49	
23.43/23.49	LOG: RETURN solveLinear in Graph for feasibility
23.43/23.49	Strengthening transition (result): 
23.43/23.49	<l2, l2, 3 <= arg1 /\ arg1 <= 5, {arg1 -> 1 + arg1, rest remain the same}>
23.43/23.49	
23.43/23.49	Calling reachability with...
23.43/23.49	Transition: <l2, end, true, {all remain the same}>
23.43/23.49	Conditions: 3 <= arg1, 
23.43/23.49	OPEN EXITS: 
23.43/23.49	<l2, end, 3 <= arg1, {all remain the same}>
23.43/23.49	
23.43/23.49	--- Reachability graph ---
23.43/23.49	> Graph without transitions.
23.43/23.49	
23.43/23.49	Calling reachability with...
23.43/23.49	Transition: <l0, l2, arg1 = 3, {all remain the same}>
23.43/23.49	Conditions: 3 <= arg1, 
23.43/23.49	OPEN EXITS: 
23.43/23.49	<l0, l2, arg1 = 3, {all remain the same}>
23.43/23.49	
23.43/23.49	> Conditions are reachable!
23.43/23.49	
23.43/23.49	Program does NOT terminate
23.43/23.49	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
23.43/23.49	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
23.43/23.49	EOF