Grünbaum and Szilassi "Geometric realizations of special toroidal complexes", Contributions to Discrete Mathematics, 2009, https://cdm.ucalgary.ca/article/view/61986/46681, fig.20, shows a toroidal polyhedron with eight hexagonal faces, all of which are non-convex. They credit it to a 1988 German diploma thesis of Schwörbel.
It appears to be possible to collapse one face and get something with seven non-convex faces. I think if you try to collapse two faces it will become degenerate (certain edges forced to coincide).
Update in response to comments:
Tom Lowe posted this image (https://mathstodon.xyz/@TomL/115177969024433153), better than I can draw:

It is what you get if you inscribe a tetrahedron T in a cube, and then remove the intersections of T with the two tetrahedra T+ and T- vertically offset from it by a small amount up and down. Now suppose that, in this construction you replace T+ by a tetrahedron T* where you vertically offset only the lower left vertex of T, upwards, leaving the other three vertices (coinciding with cube vertices) in place. Again, remove from T the intersections with the two tetrahedra T* and T-.
The resulting shape will have the same two short collinear edges, along the bottom edge of T. The top two short collinear edges will collapse to sharp pointed vertices. The V-shaped hexagonal face on the right side of the image will collapse to a V-shaped pair of edges. The two square-cross-section beams of the torus, behind this face, will collapse to have a triangular cross-section. And the two collinear lower middle edges, along the bottom edge of T+, stay collinear along the bottom edge of T* but now along a tilted line through the lower right cube corner and the slightly-raised lower left corner of T*.
If you count Schwörbel's shape as a polyhedron (some people might not because of the pairs of faces that meet in two edges rather than a single edge or vertex), I think this modified shape also counts as a polyhedron, with seven non-convex faces.