Settings: Output files: "./Sf_2_R2.TOnovel/tmp/segment_juncs.*.ebwt" Line rate: 6 (line is 64 bytes) Lines per side: 1 (side is 64 bytes) Offset rate: 5 (one in 32) FTable chars: 10 Strings: unpacked Max bucket size: default Max bucket size, sqrt multiplier: default Max bucket size, len divisor: 4 Difference-cover sample period: 1024 Endianness: little Actual local endianness: little Sanity checking: disabled Assertions: disabled Random seed: 0 Sizeofs: void*:8, int:4, long:8, size_t:8 Input files DNA, FASTA: ./Sf_2_R2.TOnovel/tmp/segment_juncs.fa Reading reference sizes Time reading reference sizes: 00:00:00 Calculating joined length Writing header Reserving space for joined string Joining reference sequences Time to join reference sequences: 00:00:00 bmax according to bmaxDivN setting: 407 Using parameters --bmax 306 --dcv 1024 Doing ahead-of-time memory usage test Passed! Constructing with these parameters: --bmax 306 --dcv 1024 Constructing suffix-array element generator Building DifferenceCoverSample Building sPrime Building sPrimeOrder V-Sorting samples V-Sorting samples time: 00:00:00 Allocating rank array Ranking v-sort output Ranking v-sort output time: 00:00:00 Invoking Larsson-Sadakane on ranks Invoking Larsson-Sadakane on ranks time: 00:00:00 Sanity-checking and returning Building samples Reserving space for 12 sample suffixes Generating random suffixes QSorting 12 sample offsets, eliminating duplicates QSorting sample offsets, eliminating duplicates time: 00:00:00 Multikey QSorting 10 samples (Using difference cover) Multikey QSorting samples time: 00:00:00 Calculating bucket sizes Binary sorting into buckets 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Binary sorting into buckets time: 00:00:00 Splitting and merging Splitting and merging time: 00:00:00 Avg bucket size: 231.714 (target: 305) Converting suffix-array elements to index image Allocating ftab, absorbFtab Entering Ebwt loop Getting block 1 of 7 Reserving size (306) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 286 (Using difference cover) Sorting block time: 00:00:00 Returning block of 287 Getting block 2 of 7 Reserving size (306) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 177 (Using difference cover) Sorting block time: 00:00:00 Returning block of 178 Getting block 3 of 7 Reserving size (306) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 263 (Using difference cover) Sorting block time: 00:00:00 Returning block of 264 Getting block 4 of 7 Reserving size (306) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 212 (Using difference cover) Sorting block time: 00:00:00 Returning block of 213 Getting block 5 of 7 Reserving size (306) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 299 (Using difference cover) Sorting block time: 00:00:00 Returning block of 300 Getting block 6 of 7 Reserving size (306) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 200 (Using difference cover) Sorting block time: 00:00:00 Returning block of 201 Getting block 7 of 7 Reserving size (306) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 185 (Using difference cover) Sorting block time: 00:00:00 Returning block of 186 Exited Ebwt loop fchr[A]: 0 fchr[C]: 576 fchr[G]: 931 fchr[T]: 1214 fchr[$]: 1628 Exiting Ebwt::buildToDisk() Returning from initFromVector Wrote 4197589 bytes to primary EBWT file: ./Sf_2_R2.TOnovel/tmp/segment_juncs.1.ebwt Wrote 208 bytes to secondary EBWT file: ./Sf_2_R2.TOnovel/tmp/segment_juncs.2.ebwt Re-opening _in1 and _in2 as input streams Returning from Ebwt constructor Headers: len: 1628 bwtLen: 1629 sz: 407 bwtSz: 408 lineRate: 6 linesPerSide: 1 offRate: 5 offMask: 0xffffffe0 isaRate: -1 isaMask: 0xffffffff ftabChars: 10 eftabLen: 20 eftabSz: 80 ftabLen: 1048577 ftabSz: 4194308 offsLen: 51 offsSz: 204 isaLen: 0 isaSz: 0 lineSz: 64 sideSz: 64 sideBwtSz: 56 sideBwtLen: 224 numSidePairs: 4 numSides: 8 numLines: 8 ebwtTotLen: 512 ebwtTotSz: 512 reverse: 0 Total time for call to driver() for forward index: 00:00:00 Reading reference sizes Time reading reference sizes: 00:00:00 Calculating joined length Writing header Reserving space for joined string Joining reference sequences Time to join reference sequences: 00:00:00 bmax according to bmaxDivN setting: 407 Using parameters --bmax 306 --dcv 1024 Doing ahead-of-time memory usage test Passed! Constructing with these parameters: --bmax 306 --dcv 1024 Constructing suffix-array element generator Building DifferenceCoverSample Building sPrime Building sPrimeOrder V-Sorting samples V-Sorting samples time: 00:00:00 Allocating rank array Ranking v-sort output Ranking v-sort output time: 00:00:00 Invoking Larsson-Sadakane on ranks Invoking Larsson-Sadakane on ranks time: 00:00:00 Sanity-checking and returning Building samples Reserving space for 12 sample suffixes Generating random suffixes QSorting 12 sample offsets, eliminating duplicates QSorting sample offsets, eliminating duplicates time: 00:00:00 Multikey QSorting 10 samples (Using difference cover) Multikey QSorting samples time: 00:00:00 Calculating bucket sizes Binary sorting into buckets 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Binary sorting into buckets time: 00:00:00 Splitting and merging Splitting and merging time: 00:00:00 Split 2, merged 6; iterating... Binary sorting into buckets 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Binary sorting into buckets time: 00:00:00 Splitting and merging Splitting and merging time: 00:00:00 Split 1, merged 1; iterating... Binary sorting into buckets 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Binary sorting into buckets time: 00:00:00 Splitting and merging Splitting and merging time: 00:00:00 Split 1, merged 1; iterating... Binary sorting into buckets 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Binary sorting into buckets time: 00:00:00 Splitting and merging Splitting and merging time: 00:00:00 Avg bucket size: 231.714 (target: 305) Converting suffix-array elements to index image Allocating ftab, absorbFtab Entering Ebwt loop Getting block 1 of 7 Reserving size (306) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 300 (Using difference cover) Sorting block time: 00:00:00 Returning block of 301 Getting block 2 of 7 Reserving size (306) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 274 (Using difference cover) Sorting block time: 00:00:00 Returning block of 275 Getting block 3 of 7 Reserving size (306) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 233 (Using difference cover) Sorting block time: 00:00:00 Returning block of 234 Getting block 4 of 7 Reserving size (306) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 197 (Using difference cover) Sorting block time: 00:00:00 Returning block of 198 Getting block 5 of 7 Reserving size (306) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 258 (Using difference cover) Sorting block time: 00:00:00 Returning block of 259 Getting block 6 of 7 Reserving size (306) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 231 (Using difference cover) Sorting block time: 00:00:00 Returning block of 232 Getting block 7 of 7 Reserving size (306) for bucket Calculating Z arrays Calculating Z arrays time: 00:00:00 Entering block accumulator loop: 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Block accumulator loop time: 00:00:00 Sorting block of length 129 (Using difference cover) Sorting block time: 00:00:00 Returning block of 130 Exited Ebwt loop fchr[A]: 0 fchr[C]: 576 fchr[G]: 931 fchr[T]: 1214 fchr[$]: 1628 Exiting Ebwt::buildToDisk() Returning from initFromVector Wrote 4197589 bytes to primary EBWT file: ./Sf_2_R2.TOnovel/tmp/segment_juncs.rev.1.ebwt Wrote 208 bytes to secondary EBWT file: ./Sf_2_R2.TOnovel/tmp/segment_juncs.rev.2.ebwt Re-opening _in1 and _in2 as input streams Returning from Ebwt constructor Headers: len: 1628 bwtLen: 1629 sz: 407 bwtSz: 408 lineRate: 6 linesPerSide: 1 offRate: 5 offMask: 0xffffffe0 isaRate: -1 isaMask: 0xffffffff ftabChars: 10 eftabLen: 20 eftabSz: 80 ftabLen: 1048577 ftabSz: 4194308 offsLen: 51 offsSz: 204 isaLen: 0 isaSz: 0 lineSz: 64 sideSz: 64 sideBwtSz: 56 sideBwtLen: 224 numSidePairs: 4 numSides: 8 numLines: 8 ebwtTotLen: 512 ebwtTotSz: 512 reverse: 0 Total time for backward call to driver() for mirror index: 00:00:00