The challenges of unbounded treewidth in parameterised subgraph counting problems