Settings: Output files: "./tsu_0.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: ./tsu_0.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: 1320 Using parameters --bmax 990 --dcv 1024 Doing ahead-of-time memory usage test Passed! Constructing with these parameters: --bmax 990 --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 12 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: 753.429 (target: 989) Converting suffix-array elements to index image Allocating ftab, absorbFtab Entering Ebwt loop Getting block 1 of 7 Reserving size (990) 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 291 (Using difference cover) Sorting block time: 00:00:00 Returning block of 292 Getting block 2 of 7 Reserving size (990) 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 915 (Using difference cover) Sorting block time: 00:00:00 Returning block of 916 Getting block 3 of 7 Reserving size (990) 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 676 (Using difference cover) Sorting block time: 00:00:00 Returning block of 677 Getting block 4 of 7 Reserving size (990) 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 742 (Using difference cover) Sorting block time: 00:00:00 Returning block of 743 Getting block 5 of 7 Reserving size (990) 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 951 (Using difference cover) Sorting block time: 00:00:00 Returning block of 952 Getting block 6 of 7 Reserving size (990) 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 964 (Using difference cover) Sorting block time: 00:00:00 Returning block of 965 Getting block 7 of 7 Reserving size (990) 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 735 (Using difference cover) Sorting block time: 00:00:00 Returning block of 736 Exited Ebwt loop fchr[A]: 0 fchr[C]: 1596 fchr[G]: 2670 fchr[T]: 3764 fchr[$]: 5280 Exiting Ebwt::buildToDisk() Returning from initFromVector Wrote 4204584 bytes to primary EBWT file: ./tsu_0.TOnovel/tmp/segment_juncs.1.ebwt Wrote 668 bytes to secondary EBWT file: ./tsu_0.TOnovel/tmp/segment_juncs.2.ebwt Re-opening _in1 and _in2 as input streams Returning from Ebwt constructor Headers: len: 5280 bwtLen: 5281 sz: 1320 bwtSz: 1321 lineRate: 6 linesPerSide: 1 offRate: 5 offMask: 0xffffffe0 isaRate: -1 isaMask: 0xffffffff ftabChars: 10 eftabLen: 20 eftabSz: 80 ftabLen: 1048577 ftabSz: 4194308 offsLen: 166 offsSz: 664 isaLen: 0 isaSz: 0 lineSz: 64 sideSz: 64 sideBwtSz: 56 sideBwtLen: 224 numSidePairs: 12 numSides: 24 numLines: 24 ebwtTotLen: 1536 ebwtTotSz: 1536 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: 1320 Using parameters --bmax 990 --dcv 1024 Doing ahead-of-time memory usage test Passed! Constructing with these parameters: --bmax 990 --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 12 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 1, 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 Avg bucket size: 753.429 (target: 989) Converting suffix-array elements to index image Allocating ftab, absorbFtab Entering Ebwt loop Getting block 1 of 7 Reserving size (990) 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 931 (Using difference cover) Sorting block time: 00:00:00 Returning block of 932 Getting block 2 of 7 Reserving size (990) 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 809 (Using difference cover) Sorting block time: 00:00:00 Returning block of 810 Getting block 3 of 7 Reserving size (990) 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 342 (Using difference cover) Sorting block time: 00:00:00 Returning block of 343 Getting block 4 of 7 Reserving size (990) 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 802 (Using difference cover) Sorting block time: 00:00:00 Returning block of 803 Getting block 5 of 7 Reserving size (990) 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 821 (Using difference cover) Sorting block time: 00:00:00 Returning block of 822 Getting block 6 of 7 Reserving size (990) 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 684 (Using difference cover) Sorting block time: 00:00:00 Returning block of 685 Getting block 7 of 7 Reserving size (990) 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 885 (Using difference cover) Sorting block time: 00:00:00 Returning block of 886 Exited Ebwt loop fchr[A]: 0 fchr[C]: 1596 fchr[G]: 2670 fchr[T]: 3764 fchr[$]: 5280 Exiting Ebwt::buildToDisk() Returning from initFromVector Wrote 4204584 bytes to primary EBWT file: ./tsu_0.TOnovel/tmp/segment_juncs.rev.1.ebwt Wrote 668 bytes to secondary EBWT file: ./tsu_0.TOnovel/tmp/segment_juncs.rev.2.ebwt Re-opening _in1 and _in2 as input streams Returning from Ebwt constructor Headers: len: 5280 bwtLen: 5281 sz: 1320 bwtSz: 1321 lineRate: 6 linesPerSide: 1 offRate: 5 offMask: 0xffffffe0 isaRate: -1 isaMask: 0xffffffff ftabChars: 10 eftabLen: 20 eftabSz: 80 ftabLen: 1048577 ftabSz: 4194308 offsLen: 166 offsSz: 664 isaLen: 0 isaSz: 0 lineSz: 64 sideSz: 64 sideBwtSz: 56 sideBwtLen: 224 numSidePairs: 12 numSides: 24 numLines: 24 ebwtTotLen: 1536 ebwtTotSz: 1536 reverse: 0 Total time for backward call to driver() for mirror index: 00:00:00