When you suspect greedy might fail:
Start with or items.
Try inputs where greedy's first choice is different from intuition.
Compute greedy's answer and brute-force the optimal.
If they differ, you found a counterexample. For / knapsack, I tried several examples before finding one where greedy fails. Small examples make verification easy since you can try all possibilities. Systematically testing small cases catches errors early.