Induced subgraphs and tree decompositions VIII. Excluding a forest in (theta, prism)-free graphs

Given a graph $H$, we prove that every (theta, prism)-free graph of sufficiently large treewidth contains either a large clique or an induced subgraph isomorphic to $H$, if and only if $H$ is a forest.