Solution uniqueness of feasibility problem

I have implemented a feasibility problem in cvx. since the objective function is set to zero and only constraints are included, I imagine every time the code is executed, different values for variables would be gained from the feasible set. But no matter how many times the code in executed, the answer does not change.
here is an example to the problem:

clear all
variable x nonnegative
variable y nonnegative
subject to
x <= 4;
y <= 5;
2x + 3y >= 6;

the answer always is:

Status: Solved
Optimal value (cvx_optval): -1.15014e-08
x = 2.5831
y = 3.4889

Appreciate your kind replys

The behavior of CVX and its solvers is deterministic. So you will get the same answer every time.

If you want to get different solutions, consider adding an objective function to distinguish among them.

See also How to know the solutions are non-unique, and get at least two different solutions .