Package evaluation of BellScenario on Julia 1.13.0-DEV.971 (04e26c5eae*) started at 2025-08-10T20:51:22.633 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 9.98s ################################################################################ # Installation # Installing BellScenario... Resolving package versions... Updating `~/.julia/environments/v1.13/Project.toml` [4e58fcc1] + BellScenario v0.1.3 Updating `~/.julia/environments/v1.13/Manifest.toml` [14f7f29c] + AMD v0.5.3 [1520ce14] + AbstractTrees v0.4.5 [66dad0bd] + AliasTables v1.1.3 [4e58fcc1] + BellScenario v0.1.3 [6e4b80f9] + BenchmarkTools v1.6.0 [523fee87] + CodecBzip2 v0.8.5 [944b1d66] + CodecZlib v0.7.8 [861a8166] + Combinatorics v1.0.3 [bbf7d656] + CommonSubexpressions v0.3.1 [34da2185] + Compat v4.18.0 [187b0558] + ConstructionBase v1.6.0 ⌅ [f65535da] + Convex v0.15.4 [9a962f9c] + DataAPI v1.16.0 ⌅ [864edb3b] + DataStructures v0.18.22 [e2d170a0] + DataValueInterfaces v1.0.0 [163ba53b] + DiffResults v1.1.0 [b552c78f] + DiffRules v1.15.1 [31c24e10] + Distributions v0.25.120 [ffbed154] + DocStringExtensions v0.9.5 [411431e0] + Extents v0.1.6 [442a2c76] + FastGaussQuadrature v1.0.2 [1a297f60] + FillArrays v1.13.0 [f6369f11] + ForwardDiff v1.0.1 [92c85e6c] + GSL v1.0.1 [14197337] + GenericLinearAlgebra v0.3.18 [68eda718] + GeoFormatTypes v0.4.4 ⌃ [cf35fbd7] + GeoInterface v1.4.1 ⌅ [5c1252a2] + GeometryBasics v0.4.11 [87dc4568] + HiGHS v1.19.0 [34004b35] + HypergeometricFunctions v0.3.28 [92d709cd] + IrrationalConstants v0.2.4 [c8e1da08] + IterTools v1.10.0 [82899510] + IteratorInterfaceExtensions v1.0.0 [692b3bcd] + JLLWrappers v1.7.1 [682c06a0] + JSON v0.21.4 [0f8b85d8] + JSON3 v1.14.3 [4076af6c] + JuMP v1.28.0 [40e66cde] + LDLFactorizations v0.10.1 [2ab3a3ac] + LogExpFunctions v0.3.29 [1914dd2f] + MacroTools v0.5.16 [8c4f8055] + MathOptIIS v0.1.1 [b8f27783] + MathOptInterface v1.42.1 [e1d29d7a] + Missings v1.2.0 [d8a4904e] + MutableArithmetics v1.6.4 [77ba4419] + NaNMath v1.1.3 [bac558e1] + OrderedCollections v1.8.1 [90014a1f] + PDMats v0.11.35 [69de0a69] + Parsers v2.8.3 ⌅ [67491407] + Polyhedra v0.7.8 [aea7be01] + PrecompileTools v1.3.2 [21216c6a] + Preferences v1.4.3 [43287f4e] + PtrArrays v1.3.0 [e52e8ede] + QBase v0.2.2 [1fd47b50] + QuadGK v2.11.2 [2576dda1] + RandomMatrices v0.5.5 [3cdcf5f2] + RecipesBase v1.3.4 [189a3867] + Reexport v1.2.2 [79098fc4] + Rmath v0.8.0 [c946c3f1] + SCS v2.1.0 [a2af1166] + SortingAlgorithms v1.2.2 [276daf66] + SpecialFunctions v2.5.1 [90137ffa] + StaticArrays v1.9.14 [1e83bf80] + StaticArraysCore v1.4.3 [10745b16] + Statistics v1.11.1 [82ae8749] + StatsAPI v1.7.1 [2913bbd2] + StatsBase v0.34.6 [4c63d2b9] + StatsFuns v1.5.0 ⌅ [09ab397b] + StructArrays v0.6.21 [856f2bd8] + StructTypes v1.11.0 [fd094767] + Suppressor v0.2.8 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.12.1 [3bb67fe8] + TranscodingStreams v0.11.3 [8c143463] + XPORTA v0.1.3 [6e34b625] + Bzip2_jll v1.0.9+0 [5ae413db] + EarCut_jll v2.2.4+0 [1b77fbbe] + GSL_jll v2.8.1+0 [8fd58aa0] + HiGHS_jll v1.11.0+1 [1d63c593] + LLVMOpenMP_jll v18.1.8+0 [656ef2d0] + OpenBLAS32_jll v0.3.29+0 [efe28fd5] + OpenSpecFun_jll v0.5.6+0 [c3fa2e09] + PORTA_jll v1.4.2+0 [f50d1b31] + Rmath_jll v0.5.1+0 [f4f2fc5b] + SCS_jll v3.2.7+0 [0dad84c5] + ArgTools v1.1.2 [56f22d72] + Artifacts v1.11.0 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [f43a241f] + Downloads v1.7.0 [7b1f6079] + FileWatching v1.11.0 [b77e0a4c] + InteractiveUtils v1.11.0 [ac6e5ff7] + JuliaSyntaxHighlighting v1.12.0 [b27032c2] + LibCURL v0.6.4 [76f85450] + LibGit2 v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [d6f4376e] + Markdown v1.11.0 [a63ad114] + Mmap v1.11.0 [ca575930] + NetworkOptions v1.3.0 [44cfe95a] + Pkg v1.13.0 [de0858da] + Printf v1.11.0 [9abbd945] + Profile v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [2f01184e] + SparseArrays v1.13.0 [f489334b] + StyledStrings v1.11.0 [4607b0f0] + SuiteSparse [fa267f1f] + TOML v1.0.3 [a4e569a6] + Tar v1.10.0 [8dfed614] + Test v1.11.0 [cf7118a7] + UUIDs v1.11.0 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] + LibCURL_jll v8.15.0+1 [e37daf67] + LibGit2_jll v1.9.1+0 [29816b5a] + LibSSH2_jll v1.11.3+1 [14a3606d] + MozillaCACerts_jll v2025.7.15 [4536629a] + OpenBLAS_jll v0.3.29+0 [05823500] + OpenLibm_jll v0.8.5+0 [458c3c95] + OpenSSL_jll v3.5.1+0 [efcefdf7] + PCRE2_jll v10.45.0+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [83775a58] + Zlib_jll v1.3.1+2 [3161d3a3] + Zstd_jll v1.5.7+1 [8e850b90] + libblastrampoline_jll v5.13.1+0 [8e850ede] + nghttp2_jll v1.65.0+0 [3f19e933] + p7zip_jll v17.5.0+2 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. To see why use `status --outdated -m` Installation completed after 4.78s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 568.06s ################################################################################ # Testing # Testing BellScenario Status `/tmp/jl_LcB2IG/Project.toml` [4e58fcc1] BellScenario v0.1.3 [861a8166] Combinatorics v1.0.3 ⌅ [f65535da] Convex v0.15.4 [87dc4568] HiGHS v1.19.0 [682c06a0] JSON v0.21.4 [4076af6c] JuMP v1.28.0 ⌅ [67491407] Polyhedra v0.7.8 [e52e8ede] QBase v0.2.2 [c946c3f1] SCS v2.1.0 [1bc83da4] SafeTestsets v0.1.0 [8c143463] XPORTA v0.1.3 [ade2ca70] Dates v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [9a3f8284] Random v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_LcB2IG/Manifest.toml` [14f7f29c] AMD v0.5.3 [1520ce14] AbstractTrees v0.4.5 [66dad0bd] AliasTables v1.1.3 [4e58fcc1] BellScenario v0.1.3 [6e4b80f9] BenchmarkTools v1.6.0 [523fee87] CodecBzip2 v0.8.5 [944b1d66] CodecZlib v0.7.8 [861a8166] Combinatorics v1.0.3 [bbf7d656] CommonSubexpressions v0.3.1 [34da2185] Compat v4.18.0 [187b0558] ConstructionBase v1.6.0 ⌅ [f65535da] Convex v0.15.4 [9a962f9c] DataAPI v1.16.0 ⌅ [864edb3b] DataStructures v0.18.22 [e2d170a0] DataValueInterfaces v1.0.0 [163ba53b] DiffResults v1.1.0 [b552c78f] DiffRules v1.15.1 [31c24e10] Distributions v0.25.120 [ffbed154] DocStringExtensions v0.9.5 [411431e0] Extents v0.1.6 [442a2c76] FastGaussQuadrature v1.0.2 [1a297f60] FillArrays v1.13.0 [f6369f11] ForwardDiff v1.0.1 [92c85e6c] GSL v1.0.1 [14197337] GenericLinearAlgebra v0.3.18 [68eda718] GeoFormatTypes v0.4.4 ⌃ [cf35fbd7] GeoInterface v1.4.1 ⌅ [5c1252a2] GeometryBasics v0.4.11 [87dc4568] HiGHS v1.19.0 [34004b35] HypergeometricFunctions v0.3.28 [92d709cd] IrrationalConstants v0.2.4 [c8e1da08] IterTools v1.10.0 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.1 [682c06a0] JSON v0.21.4 [0f8b85d8] JSON3 v1.14.3 [4076af6c] JuMP v1.28.0 [40e66cde] LDLFactorizations v0.10.1 [2ab3a3ac] LogExpFunctions v0.3.29 [1914dd2f] MacroTools v0.5.16 [8c4f8055] MathOptIIS v0.1.1 [b8f27783] MathOptInterface v1.42.1 [e1d29d7a] Missings v1.2.0 [d8a4904e] MutableArithmetics v1.6.4 [77ba4419] NaNMath v1.1.3 [bac558e1] OrderedCollections v1.8.1 [90014a1f] PDMats v0.11.35 [69de0a69] Parsers v2.8.3 ⌅ [67491407] Polyhedra v0.7.8 [aea7be01] PrecompileTools v1.3.2 [21216c6a] Preferences v1.4.3 [43287f4e] PtrArrays v1.3.0 [e52e8ede] QBase v0.2.2 [1fd47b50] QuadGK v2.11.2 [2576dda1] RandomMatrices v0.5.5 [3cdcf5f2] RecipesBase v1.3.4 [189a3867] Reexport v1.2.2 [79098fc4] Rmath v0.8.0 [c946c3f1] SCS v2.1.0 [1bc83da4] SafeTestsets v0.1.0 [a2af1166] SortingAlgorithms v1.2.2 [276daf66] SpecialFunctions v2.5.1 [90137ffa] StaticArrays v1.9.14 [1e83bf80] StaticArraysCore v1.4.3 [10745b16] Statistics v1.11.1 [82ae8749] StatsAPI v1.7.1 [2913bbd2] StatsBase v0.34.6 [4c63d2b9] StatsFuns v1.5.0 ⌅ [09ab397b] StructArrays v0.6.21 [856f2bd8] StructTypes v1.11.0 [fd094767] Suppressor v0.2.8 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [3bb67fe8] TranscodingStreams v0.11.3 [8c143463] XPORTA v0.1.3 [6e34b625] Bzip2_jll v1.0.9+0 [5ae413db] EarCut_jll v2.2.4+0 [1b77fbbe] GSL_jll v2.8.1+0 [8fd58aa0] HiGHS_jll v1.11.0+1 [1d63c593] LLVMOpenMP_jll v18.1.8+0 [656ef2d0] OpenBLAS32_jll v0.3.29+0 [efe28fd5] OpenSpecFun_jll v0.5.6+0 [c3fa2e09] PORTA_jll v1.4.2+0 [f50d1b31] Rmath_jll v0.5.1+0 [f4f2fc5b] SCS_jll v3.2.7+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [f43a241f] Downloads v1.7.0 [7b1f6079] FileWatching v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.12.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.3.0 [44cfe95a] Pkg v1.13.0 [de0858da] Printf v1.11.0 [9abbd945] Profile v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.11.0 [4607b0f0] SuiteSparse [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [deac9b47] LibCURL_jll v8.15.0+1 [e37daf67] LibGit2_jll v1.9.1+0 [29816b5a] LibSSH2_jll v1.11.3+1 [14a3606d] MozillaCACerts_jll v2025.7.15 [4536629a] OpenBLAS_jll v0.3.29+0 [05823500] OpenLibm_jll v0.8.5+0 [458c3c95] OpenSSL_jll v3.5.1+0 [efcefdf7] PCRE2_jll v10.45.0+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [83775a58] Zlib_jll v1.3.1+2 [3161d3a3] Zstd_jll v1.5.7+1 [8e850b90] libblastrampoline_jll v5.13.1+0 [8e850ede] nghttp2_jll v1.65.0+0 [3f19e933] p7zip_jll v17.5.0+2 Info Packages marked with ⌃ and ⌅ have new versions available. Those with ⌃ may be upgradable, but those with ⌅ are restricted by compatibility constraints from upgrading. Testing Running tests... importing BellScenario.jl 18.855521 seconds (6.89 M allocations: 447.844 MiB, 3.67% gc time, 8.09% compilation time: 3% of which was recompilation) running unit tests. ./unit/LocalPolytope.jl running LocalPolytope.jl unit tests: ./unit/LocalPolytope/adjacency_decomposition.jl 1.378111 seconds (843.11 k allocations: 46.714 MiB, 4.82% gc time, 98.36% compilation time) ./unit/LocalPolytope/facets.jl ┌ Warning: xporta() is deprecated, use the non-do-block form │ caller = ip:0x0 └ @ Core :-1 16.108572 seconds (8.03 M allocations: 448.259 MiB, 1.15% gc time, 94.93% compilation time: 6% of which was recompilation) ./unit/LocalPolytope/generators.jl 0.087392 seconds (47.25 k allocations: 2.657 MiB, 99.18% compilation time) 22.748852 seconds (9.72 M allocations: 544.999 MiB, 1.05% gc time, 99.04% compilation time) ./unit/LocalPolytope/linear_nonclassicality_witnesses.jl 36.132113 seconds (13.03 M allocations: 710.490 MiB, 0.55% gc time, 99.69% compilation time) ./unit/LocalPolytope/utils.jl 1.545761 seconds (1.03 M allocations: 56.697 MiB, 96.72% compilation time) ./unit/LocalPolytope/vertices.jl 4.873927 seconds (6.21 M allocations: 961.177 MiB, 18.97% gc time, 62.73% compilation time) 95.783956 seconds (46.74 M allocations: 3.140 GiB, 1.95% gc time, 96.74% compilation time: 2% of which was recompilation) ./unit/Nonlocality.jl running Nonlocality.jl unit tests: ./unit/Nonlocality/optimize_measurements.jl ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 25, constraints m: 57 cones: z: primal zero / dual free vars: 27 s: psd vars: 30, ssize: 3 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 87, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 7.87e+00 1.44e+00 1.73e+01 -8.44e+00 1.00e-01 6.61e-04 50| 2.45e-05 1.19e-05 1.78e-05 -1.00e+00 1.00e-01 1.01e-03 ------------------------------------------------------------------ status: solved timings: total: 1.01e-03s = setup: 3.29e-04s + solve: 6.86e-04s lin-sys: 8.36e-05s, cones: 4.19e-04s, accel: 8.75e-06s ------------------------------------------------------------------ objective = -0.999982 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 25, constraints m: 57 cones: z: primal zero / dual free vars: 27 s: psd vars: 30, ssize: 3 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 91, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 5.73e+00 1.10e+00 1.95e+01 -9.52e+00 1.00e-01 3.25e-04 50| 1.04e-06 2.39e-08 1.42e-08 -1.00e+00 1.00e-01 7.60e-04 ------------------------------------------------------------------ status: solved timings: total: 7.62e-04s = setup: 2.13e-04s + solve: 5.49e-04s lin-sys: 8.55e-05s, cones: 3.37e-04s, accel: 5.74e-06s ------------------------------------------------------------------ objective = -1.000000 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 33, constraints m: 73 cones: z: primal zero / dual free vars: 33 s: psd vars: 40, ssize: 4 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 123, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 5.90e+00 1.08e+00 2.58e+01 -1.27e+01 1.00e-01 3.14e-04 50| 1.52e-06 2.33e-07 5.90e-09 -1.00e+00 1.00e-01 8.12e-04 ------------------------------------------------------------------ status: solved timings: total: 8.14e-04s = setup: 2.35e-04s + solve: 5.79e-04s lin-sys: 1.04e-04s, cones: 3.80e-04s, accel: 6.22e-06s ------------------------------------------------------------------ objective = -1.000000 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 33, constraints m: 73 cones: z: primal zero / dual free vars: 33 s: psd vars: 40, ssize: 4 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 129, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 5.90e+00 1.08e+00 2.58e+01 -1.27e+01 1.00e-01 3.61e-04 50| 2.70e-07 8.82e-07 6.68e-09 -1.00e+00 1.00e-01 1.21e-03 ------------------------------------------------------------------ status: solved timings: total: 1.22e-03s = setup: 2.54e-04s + solve: 9.62e-04s lin-sys: 1.08e-04s, cones: 7.52e-04s, accel: 6.97e-06s ------------------------------------------------------------------ objective = -1.000000 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 33, constraints m: 81 cones: z: primal zero / dual free vars: 41 s: psd vars: 40, ssize: 4 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 124, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.08e+00 1.00e+00 3.88e+00 -4.31e+00 1.00e-01 3.27e-04 50| 1.36e-06 3.87e-08 2.05e-06 -2.21e+00 1.00e-01 8.45e-04 ------------------------------------------------------------------ status: solved timings: total: 8.48e-04s = setup: 2.54e-04s + solve: 5.93e-04s lin-sys: 1.07e-04s, cones: 3.73e-04s, accel: 6.35e-06s ------------------------------------------------------------------ objective = -2.207108 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 33, constraints m: 81 cones: z: primal zero / dual free vars: 41 s: psd vars: 40, ssize: 4 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 124, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.08e+00 1.00e+00 3.88e+00 -4.31e+00 1.00e-01 3.08e-04 50| 1.36e-06 3.87e-08 2.05e-06 -2.21e+00 1.00e-01 8.00e-04 ------------------------------------------------------------------ status: solved timings: total: 8.02e-04s = setup: 2.35e-04s + solve: 5.66e-04s lin-sys: 1.08e-04s, cones: 3.63e-04s, accel: 6.40e-06s ------------------------------------------------------------------ objective = -2.207108 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 33, constraints m: 81 cones: z: primal zero / dual free vars: 41 s: psd vars: 40, ssize: 4 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 124, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.08e+00 1.00e+00 3.88e+00 -4.31e+00 1.00e-01 3.22e-04 50| 1.36e-06 3.87e-08 2.05e-06 -2.21e+00 1.00e-01 8.44e-04 ------------------------------------------------------------------ status: solved timings: total: 8.46e-04s = setup: 2.45e-04s + solve: 6.01e-04s lin-sys: 1.28e-04s, cones: 3.75e-04s, accel: 6.30e-06s ------------------------------------------------------------------ objective = -2.207108 ------------------------------------------------------------------ ------------------------------------------------------------------ SCS v3.2.7 - Splitting Conic Solver (c) Brendan O'Donoghue, Stanford University, 2012 ------------------------------------------------------------------ problem: variables n: 33, constraints m: 81 cones: z: primal zero / dual free vars: 41 s: psd vars: 40, ssize: 4 settings: eps_abs: 1.0e-04, eps_rel: 1.0e-04, eps_infeas: 1.0e-07 alpha: 1.50, scale: 1.00e-01, adaptive_scale: 1 max_iters: 100000, normalize: 1, rho_x: 1.00e-06 acceleration_lookback: 10, acceleration_interval: 10 compiled with openmp parallelization enabled lin-sys: sparse-direct-amd-qdldl nnz(A): 124, nnz(P): 0 ------------------------------------------------------------------ iter | pri res | dua res | gap | obj | scale | time (s) ------------------------------------------------------------------ 0| 1.08e+00 1.00e+00 3.88e+00 -4.31e+00 1.00e-01 3.28e-04 50| 1.36e-06 3.87e-08 2.05e-06 -2.21e+00 1.00e-01 8.40e-04 ------------------------------------------------------------------ status: solved timings: total: 8.42e-04s = setup: 2.49e-04s + solve: 5.93e-04s lin-sys: 1.28e-04s, cones: 3.66e-04s, accel: 6.34e-06s ------------------------------------------------------------------ objective = -2.207108 ------------------------------------------------------------------ 167.680055 seconds (80.69 M allocations: 4.351 GiB, 1.45% gc time, 99.61% compilation time: <1% of which was recompilation) 167.972285 seconds (80.72 M allocations: 4.353 GiB, 1.45% gc time, 99.60% compilation time: <1% of which was recompilation) ./unit/combinatorics.jl 7.552719 seconds (4.23 M allocations: 224.507 MiB, 95.19% compilation time) ./unit/deterministic_strategies.jl 1.709990 seconds (2.10 M allocations: 137.864 MiB, 8.46% gc time, 89.48% compilation time) ./unit/game_conversions.jl 19.174672 seconds (6.97 M allocations: 395.609 MiB, 0.69% gc time, 88.00% compilation time) ./unit/games.jl 1.007197 seconds (686.61 k allocations: 38.377 MiB, 93.68% compilation time) ./unit/quantum_strategies.jl 13.511703 seconds (8.14 M allocations: 450.591 MiB, 0.61% gc time, 99.00% compilation time) ./unit/scenarios.jl 0.288470 seconds (53.38 k allocations: 2.057 MiB, 54.65% compilation time) ./unit/strategies.jl 5.501518 seconds (2.75 M allocations: 146.923 MiB, 1.53% gc time, 95.88% compilation time) ./unit/strategy_conversions.jl 7.706853 seconds (1.97 M allocations: 109.010 MiB, 98.13% compilation time) running integration tests. ./test/integration/file_io.jl 0.903475 seconds (781.33 k allocations: 43.830 MiB, 95.47% compilation time) ./test/integration/LocalPolytope/adjacency_decomposition.jl 31-2-13 polytope skip by max_vertices: Test Failed at /home/pkgeval/.julia/packages/BellScenario/JtYMb/test/integration/LocalPolytope/adjacency_decomposition.jl:107 Expression: collect(keys(dict)) == [[1 0 0; 1 0 0; 0 0 0], [1 0 0; 0 1 0; 0 0 1]] Evaluated: BellGame[[1 0 0; 0 1 0; 0 0 1], [1 0 0; 1 0 0; 0 0 0]] == [[1 0 0; 1 0 0; 0 0 0], [1 0 0; 0 1 0; 0 0 1]] Stacktrace: [1] top-level scope @ ~/.julia/packages/BellScenario/JtYMb/test/integration/LocalPolytope/adjacency_decomposition.jl:5 [2] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1929 [inlined] [3] macro expansion @ ~/.julia/packages/BellScenario/JtYMb/test/integration/LocalPolytope/adjacency_decomposition.jl:33 [inlined] [4] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1929 [inlined] [5] macro expansion @ ~/.julia/packages/BellScenario/JtYMb/test/integration/LocalPolytope/adjacency_decomposition.jl:98 [inlined] [6] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:1929 [inlined] [7] macro expansion @ ~/.julia/packages/BellScenario/JtYMb/test/integration/LocalPolytope/adjacency_decomposition.jl:107 [inlined] [8] macro expansion @ /opt/julia/share/julia/stdlib/v1.13/Test/src/Test.jl:745 [inlined] 26.631874 seconds (11.69 M allocations: 653.905 MiB, 1.02% gc time, 95.48% compilation time: <1% of which was recompilation) 27.535837 seconds (12.47 M allocations: 697.742 MiB, 0.99% gc time, 95.48% compilation time: <1% of which was recompilation) running regression tests. ./regression/32-1-22_fixed-direction_regression.jl 28.981728 seconds (10.28 M allocations: 564.434 MiB, 0.36% gc time, 61.90% compilation time) ./regression/32-32_no_signaling_facets.jl 1.008915 seconds (523.70 k allocations: 27.077 MiB, 76.56% compilation time) ./regression/bacon_toner_facets.jl 4.923119 seconds (2.43 M allocations: 132.206 MiB, 2.45% gc time, 98.25% compilation time) ./regression/chsh_facets.jl 0.804831 seconds (1.08 M allocations: 58.371 MiB, 94.67% compilation time) Test Summary: | Pass Fail Total Time BellScenario.jl | 16818 1 16819 6m23.5s unit tests: | 16777 16777 5m20.2s integration tests: | 17 1 18 27.5s ./test/integration/file_io.jl | 6 6 0.9s ./test/integration/LocalPolytope/adjacency_decomposition.jl | 11 1 12 26.6s ./src/LocalPolytope/adjacency_decomposition.jl | 11 1 12 26.5s adjacent_facets | 2 2 3.9s adjacency_decomposition | 9 1 10 22.6s 41-2-14 polytope skip positivity | 4 4 6.1s 41-2-14 polytope no skips | 2 2 0.8s 41-2-14 polytope filter out positivity vertices | 1 1 1.3s 31-2-13 polytope skip by max_vertices | 1 1 2 5.6s json logging | 1 1 8.8s regression tests: | 24 24 35.7s RNG of the outermost testset: Random.Xoshiro(0x70cf3ff3f05cd7a7, 0xc6f179bdd978b07c, 0x1b28da3fef07f2b5, 0x0ce75e0e0b8c6b54, 0xa7c382cf78c595f0) ERROR: LoadError: Some tests did not pass: 16818 passed, 1 failed, 0 errored, 0 broken. in expression starting at /home/pkgeval/.julia/packages/BellScenario/JtYMb/test/runtests.jl:54 Testing failed after 422.76s ERROR: LoadError: Package BellScenario errored during testing Stacktrace: [1] pkgerror(msg::String) @ Pkg.Types /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Types.jl:68 [2] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, julia_args::Cmd, test_args::Cmd, test_fn::Nothing, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool) @ Pkg.Operations /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2695 [3] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/Operations.jl:2544 [inlined] [4] test(ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}; coverage::Bool, test_fn::Nothing, julia_args::Cmd, test_args::Cmd, force_latest_compatible_version::Bool, allow_earlier_backwards_compatible_versions::Bool, allow_reresolve::Bool, kwargs::@Kwargs{io::IOContext{IO}}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:538 [5] kwcall(::@NamedTuple{julia_args::Cmd, io::IOContext{IO}}, ::typeof(Pkg.API.test), ctx::Pkg.Types.Context, pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:515 [6] test(pkgs::Vector{PackageSpec}; io::IOContext{IO}, kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:168 [7] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkgs::Vector{PackageSpec}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:157 [8] test(pkgs::Vector{String}; kwargs::@Kwargs{julia_args::Cmd}) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [9] test @ /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:156 [inlined] [10] kwcall(::@NamedTuple{julia_args::Cmd}, ::typeof(Pkg.API.test), pkg::String) @ Pkg.API /opt/julia/share/julia/stdlib/v1.13/Pkg/src/API.jl:155 [11] top-level scope @ /PkgEval.jl/scripts/evaluate.jl:219 [12] include(mod::Module, _path::String) @ Base ./Base.jl:311 [13] exec_options(opts::Base.JLOptions) @ Base ./client.jl:320 [14] _start() @ Base ./client.jl:553 in expression starting at /PkgEval.jl/scripts/evaluate.jl:210 PkgEval failed after 1029.2s: package has test failures