5.05/5.09	NO
5.05/5.09	
5.05/5.09	Solver Timeout: 4
5.05/5.09	Global Timeout: 300
5.05/5.09	No parsing errors!
5.05/5.09	Init Location: 0
5.05/5.09	Transitions:
5.05/5.09	<l0, l3, true>
5.05/5.09	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}>
5.05/5.09	<l2, l2, (arg1 > 4), par{arg2 -> undef4}>
5.05/5.09	<l2, l2, (arg1 > 0) /\ (arg1 < 5), par{arg1 -> (arg1 - 1), arg2 -> undef6}>
5.05/5.09	<l3, l1, true, par{arg1 -> undef7, arg2 -> undef8}>
5.05/5.09	
5.05/5.09	Fresh variables:
5.05/5.09	undef2, undef4, undef6, undef7, undef8, 
5.05/5.09	
5.05/5.09	Undef variables:
5.05/5.09	undef2, undef4, undef6, undef7, undef8, 
5.05/5.09	
5.05/5.09	Abstraction variables:
5.05/5.09	
5.05/5.09	Exit nodes:
5.05/5.09	
5.05/5.09	Accepting locations:
5.05/5.09	
5.05/5.09	Asserts:
5.05/5.09	
5.05/5.09	Preprocessed LLVMGraph
5.05/5.09	Init Location: 0
5.05/5.09	Transitions:
5.05/5.09	<l0, l2, (arg1 = undef8) /\ (undef7 > 0) /\ (undef8 > ~(1))>
5.05/5.09	<l2, l2, (arg1 > 4)>
5.05/5.09	<l2, l2, (arg1 > 0) /\ (arg1 < 5), par{arg1 -> (arg1 - 1)}>
5.05/5.09	
5.05/5.09	Fresh variables:
5.05/5.09	undef2, undef4, undef6, undef7, undef8, 
5.05/5.09	
5.05/5.09	Undef variables:
5.05/5.09	undef2, undef4, undef6, undef7, undef8, 
5.05/5.09	
5.05/5.09	Abstraction variables:
5.05/5.09	
5.05/5.09	Exit nodes:
5.05/5.09	
5.05/5.09	Accepting locations:
5.05/5.09	
5.05/5.09	Asserts:
5.05/5.09	
5.05/5.09	*************************************************************
5.05/5.09	*******************************************************************************************
5.05/5.10	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.05/5.10	*******************************************************************************************
5.05/5.10	
5.05/5.10	Init Location: 0
5.05/5.10	Graph 0:
5.05/5.10	Transitions:
5.05/5.10	Variables:
5.05/5.10	
5.05/5.10	Graph 1:
5.05/5.10	Transitions:
5.05/5.10	<l2, l2, 5 <= arg1, {all remain the same}>
5.05/5.10	<l2, l2, 1 <= arg1 /\ arg1 <= 4, {arg1 -> -1 + arg1, rest remain the same}>
5.05/5.10	Variables:
5.05/5.10	arg1
5.05/5.10	
5.05/5.10	Precedence: 
5.05/5.10	Graph 0
5.05/5.10	
5.05/5.10	Graph 1
5.05/5.10	<l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
5.05/5.10	
5.05/5.10	Map Locations to Subgraph:
5.05/5.10	( 0 , 0 )
5.05/5.10	( 2 , 1 )
5.05/5.10	
5.05/5.10	*******************************************************************************************
5.05/5.10	********************************    CHECKING ASSERTIONS    ********************************
5.05/5.10	*******************************************************************************************
5.05/5.10	
5.05/5.10	Proving termination of subgraph 0
5.05/5.10	Proving termination of subgraph 1
5.05/5.10	Checking unfeasibility...
5.05/5.10	Time used: 0.002876
5.05/5.10	
5.05/5.10	Checking conditional termination of SCC {l2}...
5.05/5.10	
5.05/5.10	LOG: CALL solveLinear
5.05/5.10	
5.05/5.10	LOG: RETURN solveLinear - Elapsed time: 0.000658s
5.05/5.10	Ranking function: -1 + arg1
5.05/5.10	New Graphs: 
5.05/5.10	Transitions:
5.05/5.10	<l2, l2, 5 <= arg1, {all remain the same}>
5.05/5.10	Variables:
5.05/5.10	arg1
5.05/5.10	> No variable changes in termination graph.
5.05/5.10	Checking conditional unfeasibility...
5.05/5.10	Calling Safety with literal arg1 <= 4 and entry <l2, l2, true, {all remain the same}>
5.05/5.10	
5.05/5.10	LOG: CALL check - Post:arg1 <= 4 - Process 1
5.05/5.10	* Exit transition: <l2, l2, true, {all remain the same}>
5.05/5.10	* Postcondition  : arg1 <= 4
5.05/5.10	Quasi-invariants: 
5.05/5.10	Location 2: arg1 <= 4 ; 
5.05/5.10	Postcondition: arg1 <= 4
5.05/5.10	
5.05/5.10	LOG: CALL check - Post:arg1 <= 4 - Process 2
5.05/5.10	* Exit transition: <l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
5.05/5.10	* Postcondition  : arg1 <= 4
5.05/5.10	
5.05/5.10	LOG: CALL solveLinear
5.05/5.10	
5.05/5.10	LOG: RETURN solveLinear - Elapsed time: 0.000400s
5.05/5.10	> Postcondition is not implied!
5.05/5.10	
5.05/5.10	LOG: RETURN check - Elapsed time: 0.000492s
5.05/5.10	
5.05/5.10	LOG: NarrowEntry size 1
5.05/5.10	Narrowing transition: 
5.05/5.10	<l2, l2, 5 <= arg1, {all remain the same}>
5.05/5.10	
5.05/5.10	LOG: Narrow transition size 1
5.05/5.10	It's unfeasible. Removing transition: 
5.05/5.10	<l2, l2, 1 <= arg1 /\ arg1 <= 4, {arg1 -> -1 + arg1, rest remain the same}>
5.05/5.10	ENTRIES:
5.05/5.10	<l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ 5 <= arg1 /\ arg1 = undef8, {all remain the same}>
5.05/5.10	END ENTRIES:
5.05/5.10	GRAPH:
5.05/5.10	<l2, l2, 5 <= arg1, {all remain the same}>
5.05/5.10	END GRAPH:
5.05/5.10	EXIT: <l2, l2, true, {all remain the same}>
5.05/5.10	POST: arg1 <= 4
5.05/5.10	
5.05/5.10	
5.05/5.10	LOG: Try proving POST
5.05/5.10	Solving with 1 template(s).
5.05/5.10	
5.05/5.10	LOG: CALL solveNonLinearGetFirstSolution
5.05/5.10	
5.05/5.10	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008866s
5.05/5.10	Time used: 0.008765
5.05/5.10	Solving with 2 template(s).
5.05/5.10	
5.05/5.10	LOG: CALL solveNonLinearGetFirstSolution
5.05/5.10	
5.05/5.10	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001978s
5.05/5.10	Time used: 4.00114
5.05/5.10	Solving with 3 template(s).
5.05/5.10	
5.05/5.10	LOG: CALL solveNonLinearGetFirstSolution
5.05/5.10	
5.05/5.10	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006579s
5.05/5.10	Time used: 1.00035
5.05/5.10	
5.05/5.10	LOG: Postcondition is not implied - no solution
5.05/5.10	> Postcondition is not implied!
5.05/5.10	
5.05/5.10	LOG: RETURN check - Elapsed time: 5.023649s
5.05/5.10	
5.05/5.10	Proving non-termination of subgraph 1
5.05/5.10	Transitions:
5.05/5.10	<l2, l2, 5 <= arg1, {all remain the same}>
5.05/5.10	<l2, l2, 1 <= arg1 /\ arg1 <= 4, {arg1 -> -1 + arg1, rest remain the same}>
5.05/5.10	Variables:
5.05/5.10	arg1
5.05/5.10	
5.05/5.10	Checking conditional non-termination of SCC {l2}...
5.05/5.10	EXIT TRANSITIONS:
5.05/5.10	<l2, end, arg1 <= 0, {all remain the same}>
5.05/5.10	
5.05/5.10	Solving with 1 template(s).
5.05/5.10	
5.05/5.10	LOG: CALL solveNonLinearGetFirstSolution
5.05/5.10	
5.05/5.10	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020644s
5.05/5.10	Time used: 0.020476
5.05/5.10	Improving Solution with cost 1 ...
5.05/5.10	
5.05/5.10	LOG: CALL solveNonLinearGetNextSolution
5.05/5.10	
5.05/5.10	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.006081s
5.05/5.10	Time used: 0.006075
5.05/5.10	
5.05/5.10	LOG: SAT solveNonLinear - Elapsed time: 0.026724s
5.05/5.10	Cost: 1; Total time: 0.026551
5.05/5.10	Failed at location 2: 5 <= arg1
5.05/5.10	Before Improving: 
5.05/5.10	Quasi-invariant at l2: 5 <= arg1
5.05/5.10	Optimizing invariants...
5.05/5.10	
5.05/5.10	LOG: CALL solveLinear
5.05/5.10	
5.05/5.10	LOG: RETURN solveLinear - Elapsed time: 0.001526s
5.05/5.10	Remaining time after improvement: 0.999249
5.05/5.10	Non-termination implied by a set of quasi-invariant(s):
5.05/5.10	Quasi-invariant at l2: 5 <= arg1
5.05/5.10	
5.05/5.10	Strengthening and disabling EXIT transitions...
5.05/5.10	Closed exits from l2: 1
5.05/5.10	
5.05/5.10	Strengthening and disabling transitions...
5.05/5.10	
5.05/5.10	LOG: CALL solverLinear in Graph for feasibility
5.05/5.10	
5.05/5.10	LOG: RETURN solveLinear in Graph for feasibility
5.05/5.10	Strengthening transition (result): 
5.05/5.10	<l2, l2, 5 <= arg1, {all remain the same}>
5.05/5.10	
5.05/5.10	LOG: CALL solverLinear in Graph for feasibility
5.05/5.10	
5.05/5.10	LOG: RETURN solveLinear in Graph for feasibility
5.05/5.10	It's unfeasible. Removing transition: 
5.05/5.10	<l2, l2, 1 <= arg1 /\ arg1 <= 4, {arg1 -> -1 + arg1, rest remain the same}>
5.05/5.10	
5.05/5.10	Calling reachability with...
5.05/5.10	Transition: <l2, end, true, {all remain the same}>
5.05/5.10	Conditions: 5 <= arg1, 
5.05/5.10	OPEN EXITS: 
5.05/5.10	<l2, end, 5 <= arg1, {all remain the same}>
5.05/5.10	
5.05/5.10	--- Reachability graph ---
5.05/5.10	> Graph without transitions.
5.05/5.10	
5.05/5.10	Calling reachability with...
5.05/5.10	Transition: <l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ arg1 = undef8, {all remain the same}>
5.05/5.10	Conditions: 5 <= arg1, 
5.05/5.10	OPEN EXITS: 
5.05/5.10	<l0, l2, 0 <= undef8 /\ 1 <= undef7 /\ 5 <= arg1 /\ arg1 = undef8, {all remain the same}>
5.05/5.10	
5.05/5.10	> Conditions are reachable!
5.05/5.10	
5.05/5.10	Program does NOT terminate
5.05/5.10	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.05/5.10	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.05/5.10	EOF