diff --git a/Detectors/Align/src/AlignableDetectorITS.cxx b/Detectors/Align/src/AlignableDetectorITS.cxx
index 67a68fe50dc26..7387ae4620bf3 100644
--- a/Detectors/Align/src/AlignableDetectorITS.cxx
+++ b/Detectors/Align/src/AlignableDetectorITS.cxx
@@ -156,8 +156,19 @@ int AlignableDetectorITS::processPoints(GIndex gid, int npntCut, bool inv)
     const auto& clusIdx = recoData->getITSTracksClusterRefs();
     // do we want to apply some cuts?
     int clEntry = track.getFirstClusterEntry();
+    int preevSensID = -1;
+    bool errReported = false;
     for (int icl = track.getNumberOfClusters(); icl--;) { // clusters refs are stored from outer to inner layers, we loop in inner -> outer direction
       const auto& clus = mITSClustersArray[(clusIDs[npoints] = clusIdx[clEntry + icl])];
+      if (clus.getSensorID() < preevSensID && !errReported) { // clusters are ordered from outer to inner layer, hence decreasing sensorID
+        std::string errstr{};
+        for (int ie = track.getNumberOfClusters(); ie--;) {
+          errstr += fmt::format(" {}", mITSClustersArray[clusIdx[clEntry + ie]].getSensorID());
+        }
+        LOGP(error, "wrong ITS clusters order? : chips {}", errstr);
+        errReported = true;
+      }
+      preevSensID = clus.getSensorID();
       if (clus.getBits()) { // overlapping clusters will have bit set
         if (clus.isBitSet(EdgeFlags::Biased)) {
           continue;
diff --git a/Detectors/Align/src/AlignableDetectorTPC.cxx b/Detectors/Align/src/AlignableDetectorTPC.cxx
index 86bad838f8273..ca4cbbaaffcdd 100644
--- a/Detectors/Align/src/AlignableDetectorTPC.cxx
+++ b/Detectors/Align/src/AlignableDetectorTPC.cxx
@@ -134,7 +134,7 @@ int AlignableDetectorTPC::processPoints(GIndex gid, int npntCut, bool inv)
             break;
           }
         }
-        mController->getTPCCorrMaps()->Transform(sector, row, cl->getPad(), cl->getTime(), xTmp, yTmp, zTmp, tOffset);
+        mController->getTPCCorrMaps()->Transform(sector, row, clTmp->getPad(), clTmp->getTime(), xTmp, yTmp, zTmp, tOffset);
         if (algConf.discardSectorEdgeDepth > 0) {
           if (std::abs(yTmp) + algConf.discardSectorEdgeDepth > xTmp * TAN10) {
             if (i + direction != stop) {
diff --git a/Framework/Utils/include/DPLUtils/RootTreeReader.h b/Framework/Utils/include/DPLUtils/RootTreeReader.h
index 109d79f9fad78..bc743d713b520 100644
--- a/Framework/Utils/include/DPLUtils/RootTreeReader.h
+++ b/Framework/Utils/include/DPLUtils/RootTreeReader.h
@@ -321,7 +321,7 @@ class GenericRootTreeReader
           mSizeBranch->GetEntry(entry);
           auto* buffer = reinterpret_cast<BinaryDataStoreType*>(data);
           if (buffer->size() == datasize) {
-            LOG(info) << "branch " << mName << ": publishing binary chunk of " << datasize << " bytes(s)";
+            LOG(debug) << "branch " << mName << ": publishing binary chunk of " << datasize << " bytes(s)";
             snapshot(mKey, std::move(*buffer));
           } else {
             LOG(error) << "branch " << mName << ": inconsitent size of binary chunk "