It is quite likely that this happens. Numerical difficulties (large and small numbers or a large range of numbers in the problem) can cause this, they can lead to the simplex algorithm failing to identify the feasibility of a node (often even the root node) correctly. If it is the root node before adding cuts that is infeasible, it can help to run IIS (I am not sure that is available for CBC/CLP).
Sometimes presolve or cuts can lead to a problem being marked infeasible although it is not. If turning off presolver or cuts results in any solution being found this is typically a good indicator that the problem is indeed feasible and the default result is wrong (due to a bug somewhere or numerical issues).
All that said, feasibility in a MILP solver is always "within tolerance". Sometimes a problem can only be made feasible by slightly violating integrality, bounds or constraints. Then things get tricky. Feasible or infeasible is not always an easy decision.