diff --git a/poincare/include/poincare/tree_pool.h b/poincare/include/poincare/tree_pool.h
index 26f287a4d..a01fb9cf5 100644
--- a/poincare/include/poincare/tree_pool.h
+++ b/poincare/include/poincare/tree_pool.h
@@ -118,7 +118,7 @@ public:
   }
 
 private:
-  constexpr static int BufferSize = 8192;
+  constexpr static int BufferSize = 16384;
   constexpr static int MaxNumberOfNodes = BufferSize/sizeof(TreeNode);
   constexpr static int MaxNumberOfStaticNodes = 200; // TODO: count how may are needed
 
diff --git a/poincare/test/addition.cpp b/poincare/test/addition.cpp
index 18c06502d..81693ca03 100644
--- a/poincare/test/addition.cpp
+++ b/poincare/test/addition.cpp
@@ -55,16 +55,15 @@ QUIZ_CASE(poincare_addition_simplify) {
   assert_parsed_expression_simplify_to("2+A", "2+A");
   assert_parsed_expression_simplify_to("1+2+3+4+5+A+6+7", "28+A");
   assert_parsed_expression_simplify_to("1+A+2+B+3", "6+A+B");
-#if 0
   assert_parsed_expression_simplify_to("-2+6", "4");
   assert_parsed_expression_simplify_to("-2-6", "-8");
   assert_parsed_expression_simplify_to("-A", "-A");
   assert_parsed_expression_simplify_to("A-A", "0");
-  assert_parsed_expression_simplify_to("-5P+3P", "-2*P");
+//  assert_parsed_expression_simplify_to("-5P+3P", "-2*P");
   assert_parsed_expression_simplify_to("1-3+A-5+2A-4A", "(-7)-A");
   assert_parsed_expression_simplify_to("A+B-A-B", "0");
   assert_parsed_expression_simplify_to("A+B+(-1)*A+(-1)*B", "0");
-
+#if 0
   assert_parsed_expression_simplify_to("2+13cos(2)-23cos(2)", "2-10*cos(2)");
   assert_parsed_expression_simplify_to("1+1+ln(2)+(5+3*2)/9-4/7+1/98", "(2347+882*ln(2))/882");
   assert_parsed_expression_simplify_to("1+2+0+cos(2)", "3+cos(2)");
diff --git a/poincare/test/tree/tree_by_reference.cpp b/poincare/test/tree/tree_by_reference.cpp
index 9e1cb38f0..a29803b9e 100644
--- a/poincare/test/tree/tree_by_reference.cpp
+++ b/poincare/test/tree/tree_by_reference.cpp
@@ -46,9 +46,9 @@ QUIZ_CASE(tree_by_reference_allocation_failures) {
   BlobByReference b(1);
   assert_pool_size(initialPoolSize+1);
   {
-    BlobByReference array[500];
+    BlobByReference array[10000];
     assert(pool_size() > initialPoolSize+1);
-    assert(pool_size() < 500);
+    assert(pool_size() < 10000);
   }
   assert_pool_size(initialPoolSize+1);
 }
diff --git a/poincare/test/tree/tree_by_value.cpp b/poincare/test/tree/tree_by_value.cpp
index 5e93d9e72..0b124fb8e 100644
--- a/poincare/test/tree/tree_by_value.cpp
+++ b/poincare/test/tree/tree_by_value.cpp
@@ -46,9 +46,9 @@ QUIZ_CASE(tree_by_value_allocation_failures) {
   BlobByValue b(1);
   assert_pool_size(initialPoolSize+1);
   {
-    BlobByValue array[500];
+    BlobByValue array[10000];
     assert(pool_size() > 1);
-    assert(pool_size() < 500);
+    assert(pool_size() < 10000);
   }
   assert_pool_size(initialPoolSize+1);
 }