Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?