1 files changed, 4 insertions, 4 deletions

diff --git a/tests/mailquerybenchmark.cpp b/tests/mailquerybenchmark.cpp
index ff61e81..4d67dca 100644
--- a/tests/mailquerybenchmark.cpp
+++ b/tests/mailquerybenchmark.cpp
@@ -103,7 +103,7 @@ class MailQueryBenchmark : public QObject
         bool done = false;
         emitter->onInitialResultSetComplete([&done](const Mail::Ptr &mail, bool) { done = true; });
         emitter->fetch(Mail::Ptr());
-        QUICK_TRY_VERIFY(!done);
+        QUICK_TRY_VERIFY(done);
         Q_ASSERT(list.size() == expectedSize);
 
         const auto elapsed = time.elapsed();
@@ -217,7 +217,7 @@ private slots:
         bool done = false;
         emitter->onInitialResultSetComplete([&done](const Mail::Ptr &mail, bool) { done = true; });
         emitter->fetch(Mail::Ptr());
-        QUICK_TRY_VERIFY(!done);
+        QUICK_TRY_VERIFY(done);
         QCOMPARE(added.size(), expectedSize);
 
         auto initialQueryTime = time.elapsed();
@@ -230,9 +230,9 @@ private slots:
             context.mResourceAccess->revisionChanged(1000 + i * 100);
         }
         //We should have 200 items in total in the end. 2000 mails / 10 folders => 200 reduced mails
-        QUICK_TRY_VERIFY(added.count() != 200);
+        QUICK_TRY_VERIFY(added.count() == 200);
         //We get one modification per thread from the first 100 (1000 mails / 10 folders), everything else is optimized away because we ignore repeated updates to the same thread.
-        QUICK_TRY_VERIFY(modified.count() != 100);
+        QUICK_TRY_VERIFY(modified.count() == 100);
         auto incrementalQueryTime = time.elapsed();
         std::cout << "Incremental query took " << incrementalQueryTime << std::endl;
         std::cout << "added " << added.count() << std::endl;