Actually, I’m not sure if this is expected or not, but this is what I see now when I run the following (lots of "All paths have probability 0”):
bali-phy 25.fasta --iter=150
Created directory "25-1" for output files.
T:topology ~ uniform on tree topologies
T:lengths ~ iidMap(branches(tree), gamma(0.5, 2/num_branches(tree)))
Partition P1:
file = 25.fasta
alphabet = RNA
subst = tn93 (S1)
indel = rs07 (I1)
scale ~ gamma(0.5, 2) (Scale1)
Substitution model S1 priors:
tn93:kappaPur ~ log_normal(log(2), 0.25)
tn93:kappaPyr ~ log_normal(log(2), 0.25)
tn93:pi ~ symmetric_dirichlet_on(letters(@a), 1)
Insertion/deletion model I1 priors:
rs07:rate ~ log_laplace(-4, 0.707)
rs07:mean_length ~ shifted_exponential(10, 1)
Run info written to "25-1/C1.run.json"
Beginning MCMC computations.
- Sampled numerical parameters logged to "25-1/C1.log" as TSV
- Sampled trees logged to "25-1/C1.trees"
- Sampled alignments logged to "25-1/C1.P<partition>.fastas"
BAli-Phy does NOT detect how many iterations is sufficient:
You need to monitor convergence and kill it when done.
Maximum number of iterations set to 150.
You can examine 'C1.log' using BAli-Phy tool statreport (command-line) or the BEAST program Tracer (graphical).
See the manual at
http://www.bali-phy.org/README.xhtml for further information.
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 1 j=0
sample_two_nodes_base( ): All paths have probability 0!
Pr = 0 i = 2 j=0
Work:
start: Fri Sep 22 10:10:49 2023
end: Fri Sep 22 10:11:34 2023
total (elapsed) time: 44s (44.934s)
total (CPU) time: 41s (41.400s)