The paper entitled “Lower Bounds for Possibly Divergent Probabilistic Programs” by Shenghua Feng (ISCAS, China), Mingshuai Chen (Zhejiang University, China), Han Su (ISCAS, China), Benjamin Kaminski, Joost-Pieter Katoen (RWTH Aachen), and Naijun Zhan (ISCAS, China) has been accepted for presentation at the OOPSLA issue of the Proceedings of the ACM on Programming Languages 2023. The paper presents a new proof rule for verifying lower bounds on quantities of probabilistic programs. In contrast to existing work, the proof rule is not confined to almost-surely terminating programs.