From 79aa46f26a80ce9b37917a43367bf09ad034727a Mon Sep 17 00:00:00 2001
From: Christian Decker <decker.christian@gmail.com>
Date: Mon, 12 Feb 2024 18:12:37 +0100
Subject: [PATCH] repro: Reproduce a crash due to a fee-disagreement

---
 tests/test_pay.py | 33 +++++++++++++++++++--------------
 1 file changed, 19 insertions(+), 14 deletions(-)

diff --git a/tests/test_pay.py b/tests/test_pay.py
index 24bb1f88aa4b..6340451722f3 100644
--- a/tests/test_pay.py
+++ b/tests/test_pay.py
@@ -764,22 +764,27 @@ def test_sendpay_cant_afford(node_factory, anchors):
     with pytest.raises(RpcError):
         l1.pay(l2, 10**9 + 1)
 
+    from pprint import pprint
+    pprint(l1.rpc.listpeerchannels())
+
     # Reserve is 1%.
     reserve = 10**7
-
-    # # This is how we recalc constants (v. v. slow!)
-    # minimum = 1
-    # maximum = 10**9
-    # while maximum - minimum > 1:
-    #     l1, l2 = node_factory.line_graph(2, fundamount=10**6,
-    #                                      opts={'feerates': (15000, 15000, 15000, 15000)})
-    #     try:
-    #         l1.pay(l2, (minimum + maximum) // 2)
-    #         minimum = (minimum + maximum) // 2
-    #     except RpcError:
-    #         maximum = (minimum + maximum) // 2
-    #     print("{} - {}".format(minimum, maximum))
-    # assert False
+    # This is how we recalc constants (v. v. slow!)
+    minimum = 1
+    maximum = 10**9
+
+    while maximum - minimum > 1:
+        l1, l2 = node_factory.line_graph(2, fundamount=10**6,
+                                         opts={'feerates': (15000, 15000, 15000, 15000)})
+        try:
+            print(f"XXX Trying {(minimum + maximum) // 2}")
+            l1.pay(l2, (minimum + maximum) // 2 * 1000)
+            minimum = (minimum + maximum) // 2
+        except RpcError:
+            maximum = (minimum + maximum) // 2
+        print("NEW BEST")
+        print("{} - {}".format(minimum, maximum))
+    assert False
 
     # This is the fee, which needs to be taken into account for l1.
     if anchors: