Generate random SAT instances, both SAT and UNSAT.
void*page_alloc(unsigned long long bytes) {
，详情可参考safew官方下载
// Receives chunks or null (flush signal)，详情可参考51吃瓜
To find these crucial border points, we employed a clever technique based on the Ford-Fulkerson algorithm. By simulating "flooding" roads with traffic from random start/end points, we could identify the natural bottlenecks – the "minimum cut" in graph theory terms. These bottlenecks became our border points.