R version 4.5.0 RC (2025-04-04 r88118 ucrt) -- "How About a Twenty-Six" Copyright (C) 2025 The R Foundation for Statistical Computing Platform: x86_64-w64-mingw32/x64 R is free software and comes with ABSOLUTELY NO WARRANTY. You are welcome to redistribute it under certain conditions. Type 'license()' or 'licence()' for distribution details. R is a collaborative project with many contributors. Type 'contributors()' for more information and 'citation()' on how to cite R or R packages in publications. Type 'demo()' for some demos, 'help()' for on-line help, or 'help.start()' for an HTML browser interface to help. Type 'q()' to quit R. > # This file is part of the standard setup for testthat. > # It is recommended that you do not modify it. > # > # Where should you do additional test configuration? > # Learn more about the roles of various files in: > # * https://r-pkgs.org/tests.html > # * https://testthat.r-lib.org/reference/test_package.html#special-files > > library(testthat) > library(serosv) > > test_check("serosv") SAMPLING FOR MODEL 'fra_2' NOW (CHAIN 1). Chain 1: Chain 1: Gradient evaluation took 5.5e-05 seconds Chain 1: 1000 transitions using 10 leapfrog steps per transition would take 0.55 seconds. Chain 1: Adjust your expectations accordingly! Chain 1: Chain 1: Chain 1: Iteration: 1 / 5000 [ 0%] (Warmup) Chain 1: Iteration: 500 / 5000 [ 10%] (Warmup) Chain 1: Iteration: 1000 / 5000 [ 20%] (Warmup) Chain 1: Iteration: 1500 / 5000 [ 30%] (Warmup) Chain 1: Iteration: 1501 / 5000 [ 30%] (Sampling) Chain 1: Iteration: 2000 / 5000 [ 40%] (Sampling) Chain 1: Iteration: 2500 / 5000 [ 50%] (Sampling) Chain 1: Iteration: 3000 / 5000 [ 60%] (Sampling) Chain 1: Iteration: 3500 / 5000 [ 70%] (Sampling) Chain 1: Iteration: 4000 / 5000 [ 80%] (Sampling) Chain 1: Iteration: 4500 / 5000 [ 90%] (Sampling) Chain 1: Iteration: 5000 / 5000 [100%] (Sampling) Chain 1: Chain 1: Elapsed Time: 2.129 seconds (Warm-up) Chain 1: 1.065 seconds (Sampling) Chain 1: 3.194 seconds (Total) Chain 1: SAMPLING FOR MODEL 'fra_3' NOW (CHAIN 1). Chain 1: Rejecting initial value: Chain 1: Log probability evaluates to log(0), i.e. negative infinity. Chain 1: Stan can't start sampling from this initial value. Chain 1: Rejecting initial value: Chain 1: Log probability evaluates to log(0), i.e. negative infinity. Chain 1: Stan can't start sampling from this initial value. Chain 1: Rejecting initial value: Chain 1: Log probability evaluates to log(0), i.e. negative infinity. Chain 1: Stan can't start sampling from this initial value. Chain 1: Rejecting initial value: Chain 1: Log probability evaluates to log(0), i.e. negative infinity. Chain 1: Stan can't start sampling from this initial value. Chain 1: Rejecting initial value: Chain 1: Log probability evaluates to log(0), i.e. negative infinity. Chain 1: Stan can't start sampling from this initial value. Chain 1: Rejecting initial value: Chain 1: Log probability evaluates to log(0), i.e. negative infinity. Chain 1: Stan can't start sampling from this initial value. Chain 1: Chain 1: Gradient evaluation took 8.8e-05 seconds Chain 1: 1000 transitions using 10 leapfrog steps per transition would take 0.88 seconds. Chain 1: Adjust your expectations accordingly! Chain 1: Chain 1: Chain 1: Iteration: 1 / 5000 [ 0%] (Warmup) Chain 1: Iteration: 500 / 5000 [ 10%] (Warmup) Chain 1: Iteration: 1000 / 5000 [ 20%] (Warmup) Chain 1: Iteration: 1500 / 5000 [ 30%] (Warmup) Chain 1: Iteration: 1501 / 5000 [ 30%] (Sampling) Chain 1: Iteration: 2000 / 5000 [ 40%] (Sampling) Chain 1: Iteration: 2500 / 5000 [ 50%] (Sampling) Chain 1: Iteration: 3000 / 5000 [ 60%] (Sampling) Chain 1: Iteration: 3500 / 5000 [ 70%] (Sampling) Chain 1: Iteration: 4000 / 5000 [ 80%] (Sampling) Chain 1: Iteration: 4500 / 5000 [ 90%] (Sampling) Chain 1: Iteration: 5000 / 5000 [100%] (Sampling) Chain 1: Chain 1: Elapsed Time: 5.648 seconds (Warm-up) Chain 1: 3.925 seconds (Sampling) Chain 1: 9.573 seconds (Total) Chain 1: SAMPLING FOR MODEL 'log_logistic' NOW (CHAIN 1). Chain 1: Chain 1: Gradient evaluation took 2.6e-05 seconds Chain 1: 1000 transitions using 10 leapfrog steps per transition would take 0.26 seconds. Chain 1: Adjust your expectations accordingly! Chain 1: Chain 1: Chain 1: Iteration: 1 / 5000 [ 0%] (Warmup) Chain 1: Iteration: 500 / 5000 [ 10%] (Warmup) Chain 1: Iteration: 1000 / 5000 [ 20%] (Warmup) Chain 1: Iteration: 1500 / 5000 [ 30%] (Warmup) Chain 1: Iteration: 1501 / 5000 [ 30%] (Sampling) Chain 1: Iteration: 2000 / 5000 [ 40%] (Sampling) Chain 1: Iteration: 2500 / 5000 [ 50%] (Sampling) Chain 1: Iteration: 3000 / 5000 [ 60%] (Sampling) Chain 1: Iteration: 3500 / 5000 [ 70%] (Sampling) Chain 1: Iteration: 4000 / 5000 [ 80%] (Sampling) Chain 1: Iteration: 4500 / 5000 [ 90%] (Sampling) Chain 1: Iteration: 5000 / 5000 [100%] (Sampling) Chain 1: Chain 1: Elapsed Time: 0.985 seconds (Warm-up) Chain 1: 1.949 seconds (Sampling) Chain 1: 2.934 seconds (Total) Chain 1: locfit 1.5-9.12 2025-03-05 Maximum number of PQL iterations: 20 iteration 1 iteration 2 iteration 3 iteration 4 Maximum number of PQL iterations: 20 iteration 1 iteration 2 iteration 3 iteration 4 [ FAIL 0 | WARN 2 | SKIP 0 | PASS 58 ] [ FAIL 0 | WARN 2 | SKIP 0 | PASS 58 ] > > proc.time() user system elapsed 49.85 4.67 54.51