6.98/7.00	NO
6.98/7.00	
6.98/7.00	Solver Timeout: 4
6.98/7.00	Global Timeout: 300
6.98/7.00	No parsing errors!
6.98/7.00	Init Location: 0
6.98/7.00	Transitions:
6.98/7.00	<l0, l3, true>
6.98/7.00	<l1, l2, true, par{arg1 -> 0}>
6.98/7.00	<l2, l2, (arg1 < 50) /\ (arg1 < 100), par{arg1 -> (arg1 + 1)}>
6.98/7.00	<l2, l2, (arg1 > 49) /\ (arg1 < 100), par{arg1 -> (arg1 - 1)}>
6.98/7.00	<l3, l1, true, par{arg1 -> undef4}>
6.98/7.00	
6.98/7.00	Fresh variables:
6.98/7.00	undef4, 
6.98/7.00	
6.98/7.00	Undef variables:
6.98/7.00	undef4, 
6.98/7.00	
6.98/7.00	Abstraction variables:
6.98/7.00	
6.98/7.00	Exit nodes:
6.98/7.00	
6.98/7.00	Accepting locations:
6.98/7.00	
6.98/7.00	Asserts:
6.98/7.00	
6.98/7.00	Preprocessed LLVMGraph
6.98/7.00	Init Location: 0
6.98/7.00	Transitions:
6.98/7.00	<l0, l2, (arg1 = 0)>
6.98/7.00	<l2, l2, (arg1 < 50) /\ (arg1 < 100), par{arg1 -> (arg1 + 1)}>
6.98/7.00	<l2, l2, (arg1 > 49) /\ (arg1 < 100), par{arg1 -> (arg1 - 1)}>
6.98/7.00	
6.98/7.00	Fresh variables:
6.98/7.00	undef4, 
6.98/7.00	
6.98/7.00	Undef variables:
6.98/7.00	undef4, 
6.98/7.00	
6.98/7.00	Abstraction variables:
6.98/7.00	
6.98/7.00	Exit nodes:
6.98/7.00	
6.98/7.00	Accepting locations:
6.98/7.00	
6.98/7.00	Asserts:
6.98/7.00	
6.98/7.00	*************************************************************
6.98/7.00	*******************************************************************************************
6.98/7.00	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
6.98/7.00	*******************************************************************************************
6.98/7.00	
6.98/7.00	Init Location: 0
6.98/7.00	Graph 0:
6.98/7.00	Transitions:
6.98/7.00	Variables:
6.98/7.00	
6.98/7.00	Graph 1:
6.98/7.00	Transitions:
6.98/7.00	<l2, l2, arg1 <= 49, {arg1 -> 1 + arg1, rest remain the same}>
6.98/7.00	<l2, l2, 50 <= arg1 /\ arg1 <= 99, {arg1 -> -1 + arg1, rest remain the same}>
6.98/7.00	Variables:
6.98/7.00	arg1
6.98/7.00	
6.98/7.00	Precedence: 
6.98/7.00	Graph 0
6.98/7.00	
6.98/7.00	Graph 1
6.98/7.00	<l0, l2, arg1 = 0, {all remain the same}>
6.98/7.00	
6.98/7.00	Map Locations to Subgraph:
6.98/7.00	( 0 , 0 )
6.98/7.00	( 2 , 1 )
6.98/7.00	
6.98/7.00	*******************************************************************************************
6.98/7.00	********************************    CHECKING ASSERTIONS    ********************************
6.98/7.00	*******************************************************************************************
6.98/7.00	
6.98/7.00	Proving termination of subgraph 0
6.98/7.00	Proving termination of subgraph 1
6.98/7.00	Checking unfeasibility...
6.98/7.00	Time used: 0.038923
6.98/7.00	
6.98/7.00	Checking conditional termination of SCC {l2}...
6.98/7.00	
6.98/7.00	LOG: CALL solveLinear
6.98/7.00	
6.98/7.00	LOG: RETURN solveLinear - Elapsed time: 0.001603s
6.98/7.00	
6.98/7.00	LOG: CALL solveLinear
6.98/7.00	
6.98/7.00	LOG: RETURN solveLinear - Elapsed time: 0.008835s
6.98/7.00	Trying to remove transition: <l2, l2, 50 <= arg1 /\ arg1 <= 99, {arg1 -> -1 + arg1, rest remain the same}>
6.98/7.00	Solving with 1 template(s).
6.98/7.00	
6.98/7.00	LOG: CALL solveNonLinearGetFirstSolution
6.98/7.00	
6.98/7.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.095377s
6.98/7.00	Time used: 2.09505
6.98/7.00	Trying to remove transition: <l2, l2, arg1 <= 49, {arg1 -> 1 + arg1, rest remain the same}>
6.98/7.00	Solving with 1 template(s).
6.98/7.00	
6.98/7.00	LOG: CALL solveNonLinearGetFirstSolution
6.98/7.00	
6.98/7.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.114347s
6.98/7.00	Time used: 0.100675
6.98/7.00	Solving with 1 template(s).
6.98/7.00	
6.98/7.00	LOG: CALL solveNonLinearGetFirstSolution
6.98/7.00	
6.98/7.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.377748s
6.98/7.00	Time used: 0.366865
6.98/7.00	Solving with 2 template(s).
6.98/7.00	
6.98/7.00	LOG: CALL solveNonLinearGetFirstSolution
6.98/7.00	
6.98/7.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.941843s
6.98/7.00	Time used: 2.92388
6.98/7.00	Solving with 3 template(s).
6.98/7.00	
6.98/7.00	LOG: CALL solveNonLinearGetFirstSolution
6.98/7.00	
6.98/7.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006696s
6.98/7.00	Time used: 1.00129
6.98/7.00	Solving with 1 template(s).
6.98/7.00	
6.98/7.00	LOG: CALL solveNonLinearGetFirstSolution
6.98/7.00	
6.98/7.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.276847s
6.98/7.00	Time used: 0.272223
6.98/7.00	Termination failed. Trying to show unreachability...
6.98/7.00	Proving unreachability of entry: <l0, l2, arg1 = 0, {all remain the same}>
6.98/7.00	
6.98/7.00	LOG: CALL check - Post:1 <= 0 - Process 1
6.98/7.00	* Exit transition: <l0, l2, arg1 = 0, {all remain the same}>
6.98/7.00	* Postcondition  : 1 <= 0
6.98/7.00	
6.98/7.00	LOG: CALL solveLinear
6.98/7.00	
6.98/7.00	LOG: RETURN solveLinear - Elapsed time: 0.018963s
6.98/7.00	> Postcondition is not implied!
6.98/7.00	
6.98/7.00	LOG: RETURN check - Elapsed time: 0.019081s
6.98/7.00	Cannot prove unreachability
6.98/7.00	
6.98/7.00	Proving non-termination of subgraph 1
6.98/7.00	Transitions:
6.98/7.00	<l2, l2, arg1 <= 49, {arg1 -> 1 + arg1, rest remain the same}>
6.98/7.00	<l2, l2, 50 <= arg1 /\ arg1 <= 99, {arg1 -> -1 + arg1, rest remain the same}>
6.98/7.00	Variables:
6.98/7.00	arg1
6.98/7.00	
6.98/7.00	Checking conditional non-termination of SCC {l2}...
6.98/7.00	EXIT TRANSITIONS:
6.98/7.00	<l2, end, 100 <= arg1, {all remain the same}>
6.98/7.00	
6.98/7.00	Solving with 1 template(s).
6.98/7.00	
6.98/7.00	LOG: CALL solveNonLinearGetFirstSolution
6.98/7.00	
6.98/7.00	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.050102s
6.98/7.00	Time used: 0.049999
6.98/7.00	
6.98/7.00	LOG: SAT solveNonLinear - Elapsed time: 0.050102s
6.98/7.00	Cost: 0; Total time: 0.049999
6.98/7.00	Non-termination implied by a set of quasi-invariant(s):
6.98/7.00	Quasi-invariant at l2: arg1 <= 51
6.98/7.00	
6.98/7.00	Strengthening and disabling EXIT transitions...
6.98/7.00	Closed exits from l2: 1
6.98/7.00	
6.98/7.00	Strengthening and disabling transitions...
6.98/7.00	
6.98/7.00	LOG: CALL solverLinear in Graph for feasibility
6.98/7.00	
6.98/7.00	LOG: RETURN solveLinear in Graph for feasibility
6.98/7.00	Strengthening transition (result): 
6.98/7.00	<l2, l2, arg1 <= 49, {arg1 -> 1 + arg1, rest remain the same}>
6.98/7.00	
6.98/7.00	LOG: CALL solverLinear in Graph for feasibility
6.98/7.00	
6.98/7.00	LOG: RETURN solveLinear in Graph for feasibility
6.98/7.00	Strengthening transition (result): 
6.98/7.00	<l2, l2, 50 <= arg1 /\ arg1 <= 51, {arg1 -> -1 + arg1, rest remain the same}>
6.98/7.00	
6.98/7.00	Calling reachability with...
6.98/7.00	Transition: <l2, end, true, {all remain the same}>
6.98/7.00	Conditions: arg1 <= 51, 
6.98/7.00	OPEN EXITS: 
6.98/7.00	<l2, end, arg1 <= 51, {all remain the same}>
6.98/7.00	
6.98/7.00	--- Reachability graph ---
6.98/7.00	> Graph without transitions.
6.98/7.00	
6.98/7.00	Calling reachability with...
6.98/7.00	Transition: <l0, l2, arg1 = 0, {all remain the same}>
6.98/7.00	Conditions: arg1 <= 51, 
6.98/7.00	OPEN EXITS: 
6.98/7.00	<l0, l2, arg1 = 0, {all remain the same}>
6.98/7.00	
6.98/7.00	> Conditions are reachable!
6.98/7.00	
6.98/7.00	Program does NOT terminate
6.98/7.00	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
6.98/7.00	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
6.98/7.00	EOF