R Under development (unstable) (2025-08-27 r88717) -- "Unsuffered Consequences"
Copyright (C) 2025 The R Foundation for Statistical Computing
Platform: x86_64-pc-linux-gnu

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.

  Natural language support but running in an English locale

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.

> pkgname <- "designmatch"
> source(file.path(R.home("share"), "R", "examples-header.R"))
> options(warn = 1)
> library('designmatch')
Loading required package: lattice
Loading required package: MASS
Loading required package: slam
Loading required package: highs

Thank you for using our package! To acknowledge our work, please cite the package as: 

 Zubizarreta, Jose R., Kilcioglu, Cinar, Vielma, Juan P., and Cohn, Eric R. (2023). designmatch: Matched Samples that are Balanced and Representative by Design.
 R package version 0.5.2. https://cran.r-project.org/web/packages/designmatch/ 

> 
> base::assign(".oldSearch", base::search(), pos = 'CheckExEnv')
> base::assign(".old_wd", base::getwd(), pos = 'CheckExEnv')
> cleanEx()
> nameEx("absstddif")
> ### * absstddif
> 
> flush(stderr()); flush(stdout())
> 
> ### Name: absstddif
> ### Title: Absolute standardized differences in means.
> ### Aliases: absstddif
> 
> ### ** Examples
> 
> # Load and attach data
> data(lalonde)
> attach(lalonde)
> 
> # Treatment indicator
> t_ind = treatment
> 
> # Constrain differences in means to be at most .05 standard deviations apart
> mom_covs = cbind(age, education, black, hispanic, married, nodegree, re74, re75)
> mom_tols = absstddif(mom_covs, t_ind, .05)
> 
> 
> 
> cleanEx()

detaching ‘lalonde’

> nameEx("bmatch")
> ### * bmatch
> 
> flush(stderr()); flush(stdout())
> 
> ### Name: bmatch
> ### Title: Optimal bipartite matching in observational studies
> ### Aliases: bmatch
> ### Keywords: Causal inference Instrumental variable Matching Regression
> ###   discontinuity Observational study
> 
> ### ** Examples
> 
> 
> ## Uncomment the following examples
> ## Load, sort, and attach data
> #data(lalonde)
> #lalonde = lalonde[order(lalonde$treatment, decreasing = TRUE), ]
> #attach(lalonde)
> 
> ################################# 
> ## Example 1: cardinality matching
> ################################# 
> 
> ## Cardinality matching finds the largest matched sample of pairs that meets balance 
> ## requirements.  Here the balance requirements are mean balance, fine balance and 
> ## exact matching for different covariates. The solver used is glpk with the 
> ## approximate option.
> 
> ## Treatment indicator; note that the data needs to be sorted in decreasing order
> ## according to this treatment indicator
> #t_ind = treatment
> #t_ind 
> 
> ## Distance matrix
> #dist_mat = NULL 
> 
> ## Subset matching weight
> #subset_weight = 1
> 
> ## Moment balance: constrain differences in means to be at most .05 standard deviations apart
> #mom_covs = cbind(age, education, black, hispanic, married, nodegree, re74, re75)
> #mom_tols = round(absstddif(mom_covs, t_ind, .05), 2)
> #mom = list(covs = mom_covs, tols = mom_tols)
> 
> ## Fine balance
> #fine_covs = cbind(black, hispanic, married, nodegree)
> #fine = list(covs = fine_covs)
> 
> ## Exact matching
> #exact_covs = cbind(black)
> #exact = list(covs = exact_covs)
> 
> ## Solver options
> #t_max = 60*5
> #solver = "glpk"
> #approximate = 1
> #solver = list(name = solver, t_max = t_max, approximate = approximate,
> #round_cplex = 0, trace = 0)
> 
> ## Match                   
> #out = bmatch(t_ind = t_ind, dist_mat = dist_mat, subset_weight = subset_weight, 
> #mom = mom, fine = fine, exact = exact, solver = solver)              
>               
> ## Indices of the treated units and matched controls
> #t_id = out$t_id  
> #c_id = out$c_id	
> 
> ## Time
> #out$time/60
> 
> ## Matched group identifier (who is matched to whom)
> #out$group_id
> 
> ## Assess mean balance
> #meantab(mom_covs, t_ind, t_id, c_id)
> 
> ## Assess fine balance (note here we are getting an approximate solution)
> #for (i in 1:ncol(fine_covs)) {		
> #  print(finetab(fine_covs[, i], t_id, c_id))
> #}
> 
> ## Assess exact matching balance
> #table(exact_covs[t_id]==exact_covs[c_id])
> 
> ################################## 
> ## Example 2: minimum distance matching
> ################################## 
> 
> ## The goal here is to minimize the total of distances between matched pairs.  In 
> ## this example there are no covariate balance requirements.  Again, the solver 
> ## used is glpk with the approximate option
> 
> ## Treatment indicator
> #t_ind = treatment
> 
> ## Matrix of covariates
> #X_mat = cbind(age, education, black, hispanic, married, nodegree, re74, re75)
> 
> ## Distance matrix
> #dist_mat = distmat(t_ind, X_mat)
> 
> ## Subset matching weight
> #subset_weight = NULL
> 
> ## Total pairs to be matched
> #total_groups = sum(t_ind)
> 
> ## Solver options
> #t_max = 60*5
> #solver = "glpk"
> #approximate = 1
> #solver = list(name = solver, t_max = t_max, approximate = approximate, 
> #round_cplex = 0, trace_cplex = 0)
> 
> ## Match                   
> #out = bmatch(t_ind = t_ind, dist_mat = dist_mat, total_groups = total_groups, 
> #solver = solver)              
>               
> ## Indices of the treated units and matched controls
> #t_id = out$t_id  
> #c_id = out$c_id	
> 
> ## Total of distances between matched pairs
> #out$obj_total
> 
> ## Assess mean balance
> #meantab(X_mat, t_ind, t_id, c_id)
> 
> ################################## 
> ## Example 3: optimal subset matching
> ################################## 
> 
> ## Optimal subset matching pursues two competing goals at 
> ## the same time: to minimize the total sum of covariate distances  
> ## while matching as many observations as possible.  The trade-off 
> ## between these two goals is regulated by the parameter subset_weight 
> ## (see Rosenbaum 2012 and Zubizarreta et al. 2013 for a discussion).
> ## Here the balance requirements are mean balance, near-fine balance 
> ## and near-exact matching for different covariates.
> ## Again, the solver used is glpk with the approximate option.
> 
> ## Treatment indicator
> #t_ind = treatment
> 
> ## Matrix of covariates
> #X_mat = cbind(age, education, black, hispanic, married, nodegree, re74, re75)
> 
> ## Distance matrix
> #dist_mat = distmat(t_ind, X_mat)
> 
> ## Subset matching weight
> #subset_weight = median(dist_mat)
> 
> ## Moment balance: constrain differences in means to be at most .05 standard deviations apart
> #mom_covs = cbind(age, education, black, hispanic, married, nodegree, re74, re75)
> #mom_tols = round(absstddif(mom_covs, t_ind, .05), 2)
> #mom = list(covs = mom_covs, tols = mom_tols)
> 
> ## Near-fine balance
> #near_fine_covs = cbind(married, nodegree)
> #near_fine_devs = rep(5, 2)
> #near_fine = list(covs = near_fine_covs, devs = near_fine_devs)
> 
> ## Near-exact matching
> #near_exact_covs = cbind(black, hispanic)
> #near_exact_devs = rep(5, 2)
> #near_exact = list(covs = near_exact_covs, devs = near_exact_devs)
> 
> ## Solver options
> #t_max = 60*5
> #solver = "glpk"
> #approximate = 1
> #solver = list(name = solver, t_max = t_max, approximate = approximate, 
> #round_cplex = 0, trace_cplex = 0)
> 
> ## Match                   
> #out = bmatch(t_ind = t_ind, dist_mat = dist_mat, subset_weight = subset_weight, 
> #mom = mom, near_fine = near_fine, near_exact = near_exact, solver = solver)              
>               
> ## Indices of the treated units and matched controls
> #t_id = out$t_id  
> #c_id = out$c_id	
> 
> ## Time
> #out$time/60
> 
> ## Matched group identifier (who is matched to whom)
> #out$group_id
> 
> ## Assess mean balance (note here we are getting an approximate solution)
> #meantab(X_mat, t_ind, t_id, c_id)
> 
> ## Assess fine balance
> #for (i in 1:ncol(near_fine_covs)) {		
> #	print(finetab(near_fine_covs[, i], t_id, c_id))
> #}
> 
> ## Assess exact matching balance
> #for (i in 1:ncol(near_exact_covs)) {	
> #	print(table(near_exact_covs[t_id, i]==near_exact_covs[c_id, i]))
> #}
> 	
> 
> 
> 
> cleanEx()
> nameEx("cardmatch")
> ### * cardmatch
> 
> flush(stderr()); flush(stdout())
> 
> ### Name: cardmatch
> ### Title: Optimal cardinality matching in observational studies
> ### Aliases: cardmatch
> ### Keywords: Causal inference Instrumental variable Matching Regression
> ###   discontinuity Observational study
> 
> ### ** Examples
> 
> 	
> # Load, sort, and attach data
> data(lalonde)
> lalonde = lalonde[order(lalonde$treatment, decreasing = TRUE), ]
> attach(lalonde)
> 
> ################################# 
> # Step 1: use cardinality matching to find the largest sample of matched pairs for which 
> # all the covariates are finely balanced.
> #################################
> 
> # Discretize covariates
> quantiles = function(covar, n_q) {
+ 	p_q = seq(0, 1, 1/n_q)
+ 	val_q = quantile(covar, probs = p_q, na.rm = TRUE)
+ 	covar_out = rep(NA, length(covar))
+ 	for (i in 1:n_q) {
+ 		if (i==1) {covar_out[covar<val_q[i+1]] = i}
+ 		if (i>1 & i<n_q) {covar_out[covar>=val_q[i] & covar<val_q[i+1]] = i}
+ 		if (i==n_q) {covar_out[covar>=val_q[i] & covar<=val_q[i+1]] = i}}
+ 	covar_out
+ }
> age_5 = quantiles(age, 5)
> education_5 = quantiles(education, 5)
> re74_5 = quantiles(re74, 5)
> re75_5 = quantiles(re75, 5)
> 
> # Treatment indicator; note that the data needs to be sorted in decreasing order
> # according to this treatment indicator
> t_ind = treatment
> t_ind 
  [1] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
 [38] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
 [75] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
[112] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
[149] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
[186] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[223] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[260] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[297] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[334] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[371] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[408] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[445] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[482] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[519] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[556] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[593] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
> 
> # Fine balance
> fine_covs = cbind(black, hispanic, married, nodegree, age_5, education_5, re74_5, re75_5)
> fine = list(covs = fine_covs)
> 
> # Solver options
> t_max = 60*5
> solver = "highs"
> approximate = 0
> solver = list(name = solver, t_max = t_max, approximate = approximate,
+ round_cplex = 0, trace = 0)
> 
> # Match                   
> out_1 = cardmatch(t_ind, fine = fine, solver = solver)
  Building the matching problem... 
  HiGHS optimizer is open... 
  Finding the optimal matches... 
  Optimal matches found 
> 
> # Indices of the treated units and matched controls
> t_id_1 = out_1$t_id  
> c_id_1 = out_1$c_id	
> 
> # Mean balance
> covs = cbind(age, education, black, hispanic, married, nodegree, re74, re75)
> meantab(covs, t_ind, t_id_1, c_id_1)
          Mis Min      Max  Mean T  Mean C Std Dif P-val
age         0  16    55.00   25.30   25.43   -0.01  0.92
education   0   2    18.00   10.26   10.46   -0.08  0.56
black       0   0     1.00    0.72    0.72    0.00  1.00
hispanic    0   0     1.00    0.11    0.11    0.00  1.00
married     0   0     1.00    0.25    0.25    0.00  1.00
nodegree    0   0     1.00    0.67    0.67    0.00  1.00
re74        0   0 35040.07 2922.08 2936.71    0.00  0.98
re75        0   0 25142.24 2168.03 1862.63    0.09  0.54
> 
> # Fine balance (note here we are getting an approximate solution)
> for (i in 1:ncol(fine_covs)) {		
+ 	print(finetab(fine_covs[, i], t_id_1, c_id_1))
+ }
   Units
Cat  T  C
  0 29 29
  1 74 74
   Units
Cat  T  C
  0 92 92
  1 11 11
   Units
Cat  T  C
  0 77 77
  1 26 26
   Units
Cat  T  C
  0 34 34
  1 69 69
   Units
Cat  T  C
  1 25 25
  2 22 22
  3 22 22
  4 19 19
  5 15 15
   Units
Cat  T  C
  1  7  7
  2 26 26
  3 18 18
  4 18 18
  5 34 34
   Units
Cat  T  C
  2 57 57
  3 17 17
  4 17 17
  5 12 12
   Units
Cat  T  C
  2 50 50
  3 16 16
  4 19 19
  5 18 18
> 
> ################################# 
> # Step 2: use optimal matching (minimum distance matching) to find the (re)pairing of
> # treated and control that minimizes the total sum of covariate distances between matched 
> # pairs.  For this, use the function 'distmatch' which is a wrapper for 'bmatch'.  
> #################################
> 
> # New treatment indicator
> t_ind_2 = t_ind[c(t_id_1, c_id_1)]
> table(t_ind_2)
t_ind_2
  0   1 
103 103 
> 
> # To build the distance matrix, the idea is to use strong predictors of the outcome
> dist_mat_2 = abs(outer(re74[t_id_1], re74[c_id_1], "-"))
> dim(dist_mat_2)
[1] 103 103
> 
> # Match
> out_2 = distmatch(t_ind_2, dist_mat_2, solver)
  Building the matching problem... 
  HiGHS optimizer is open... 
  Finding the optimal matches... 
/tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:855:32: runtime error: index 1 out of bounds for type 'NodePtr [1]'
    #0 0x7bbf287fc060 in HighsHashTree<int, int>::insert_recurse(HighsHashTree<int, int>::NodePtr*, unsigned long, int, HighsHashTableEntry<int, int>&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:855
    #1 0x7bbf286fa84d in bool HighsHashTree<int, int>::insert<int&, int&>(int&, int&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1371
    #2 0x7bbf286fa84d in HighsCliqueTable::doAddClique(HighsCliqueTable::CliqueVar const*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:375
    #3 0x7bbf28713529 in HighsCliqueTable::addClique(HighsMipSolver const&, HighsCliqueTable::CliqueVar*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:811
    #4 0x7bbf287447a7 in HighsCliqueTable::extractObjCliques(HighsMipSolver&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:1509
    #5 0x7bbf27594249 in HighsMipSolverData::addIncumbent(std::vector<double, std::allocator<double> > const&, double, int, bool, bool) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1374
    #6 0x7bbf275c11f4 in HighsMipSolverData::evaluateRootLp() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1701
    #7 0x7bbf275d4363 in HighsMipSolverData::evaluateRootNode() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1860
    #8 0x7bbf274b0fee in HighsMipSolver::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolver.cpp:157
    #9 0x7bbf2716ca84 in Highs::callSolveMip() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:3949
    #10 0x7bbf271040c5 in Highs::solve() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:1183
    #11 0x7bbf271132cc in Highs::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:939
    #12 0x7bbf26fa2c76 in solver_run(SEXPREC*) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/highs_interface.cpp:574
    #13 0x7bbf26f32b9d in _highs_solver_run /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/RcppExports.cpp:568
    #14 0x000000744328 in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:754
    #15 0x0000008da65a in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8668
    #16 0x0000008b0e9b in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7501
    #17 0x0000008517e2 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167
    #18 0x0000008691fa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2393
    #19 0x00000086d40a in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2306
    #20 0x000000851e83 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2328
    #21 0x000000851e83 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1280
    #22 0x00000088211e in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3567
    #23 0x0000008522a6 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1232
    #24 0x0000009f7048 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264
    #25 0x0000009f7048 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317
    #26 0x0000009fc47a in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235
    #27 0x000000a06692 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242
    #28 0x0000004132bf in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29
    #29 0x7fbf428115f4 in __libc_start_call_main (/lib64/libc.so.6+0x35f4) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #30 0x7fbf428116a7 in __libc_start_main@@GLIBC_2.34 (/lib64/libc.so.6+0x36a7) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #31 0x000000413c44 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413c44) (BuildId: 092cc2e60f523f7cc0bd9086923e9c95f81d6f24)

/tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:877:36: runtime error: index 2 out of bounds for type 'NodePtr [1]'
    #0 0x7bbf287fb8ae in HighsHashTree<int, int>::insert_recurse(HighsHashTree<int, int>::NodePtr*, unsigned long, int, HighsHashTableEntry<int, int>&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:877
    #1 0x7bbf286fa84d in bool HighsHashTree<int, int>::insert<int&, int&>(int&, int&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1371
    #2 0x7bbf286fa84d in HighsCliqueTable::doAddClique(HighsCliqueTable::CliqueVar const*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:375
    #3 0x7bbf28713529 in HighsCliqueTable::addClique(HighsMipSolver const&, HighsCliqueTable::CliqueVar*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:811
    #4 0x7bbf287447a7 in HighsCliqueTable::extractObjCliques(HighsMipSolver&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:1509
    #5 0x7bbf27594249 in HighsMipSolverData::addIncumbent(std::vector<double, std::allocator<double> > const&, double, int, bool, bool) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1374
    #6 0x7bbf275c11f4 in HighsMipSolverData::evaluateRootLp() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1701
    #7 0x7bbf275d4363 in HighsMipSolverData::evaluateRootNode() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1860
    #8 0x7bbf274b0fee in HighsMipSolver::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolver.cpp:157
    #9 0x7bbf2716ca84 in Highs::callSolveMip() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:3949
    #10 0x7bbf271040c5 in Highs::solve() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:1183
    #11 0x7bbf271132cc in Highs::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:939
    #12 0x7bbf26fa2c76 in solver_run(SEXPREC*) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/highs_interface.cpp:574
    #13 0x7bbf26f32b9d in _highs_solver_run /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/RcppExports.cpp:568
    #14 0x000000744328 in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:754
    #15 0x0000008da65a in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8668
    #16 0x0000008b0e9b in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7501
    #17 0x0000008517e2 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167
    #18 0x0000008691fa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2393
    #19 0x00000086d40a in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2306
    #20 0x000000851e83 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2328
    #21 0x000000851e83 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1280
    #22 0x00000088211e in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3567
    #23 0x0000008522a6 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1232
    #24 0x0000009f7048 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264
    #25 0x0000009f7048 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317
    #26 0x0000009fc47a in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235
    #27 0x000000a06692 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242
    #28 0x0000004132bf in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29
    #29 0x7fbf428115f4 in __libc_start_call_main (/lib64/libc.so.6+0x35f4) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #30 0x7fbf428116a7 in __libc_start_main@@GLIBC_2.34 (/lib64/libc.so.6+0x36a7) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #31 0x000000413c44 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413c44) (BuildId: 092cc2e60f523f7cc0bd9086923e9c95f81d6f24)

/tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:879:32: runtime error: index 2 out of bounds for type 'NodePtr [1]'
    #0 0x7bbf287fbcf4 in HighsHashTree<int, int>::insert_recurse(HighsHashTree<int, int>::NodePtr*, unsigned long, int, HighsHashTableEntry<int, int>&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:879
    #1 0x7bbf286fa84d in bool HighsHashTree<int, int>::insert<int&, int&>(int&, int&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1371
    #2 0x7bbf286fa84d in HighsCliqueTable::doAddClique(HighsCliqueTable::CliqueVar const*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:375
    #3 0x7bbf28713529 in HighsCliqueTable::addClique(HighsMipSolver const&, HighsCliqueTable::CliqueVar*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:811
    #4 0x7bbf287447a7 in HighsCliqueTable::extractObjCliques(HighsMipSolver&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:1509
    #5 0x7bbf27594249 in HighsMipSolverData::addIncumbent(std::vector<double, std::allocator<double> > const&, double, int, bool, bool) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1374
    #6 0x7bbf275c11f4 in HighsMipSolverData::evaluateRootLp() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1701
    #7 0x7bbf275d4363 in HighsMipSolverData::evaluateRootNode() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1860
    #8 0x7bbf274b0fee in HighsMipSolver::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolver.cpp:157
    #9 0x7bbf2716ca84 in Highs::callSolveMip() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:3949
    #10 0x7bbf271040c5 in Highs::solve() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:1183
    #11 0x7bbf271132cc in Highs::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:939
    #12 0x7bbf26fa2c76 in solver_run(SEXPREC*) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/highs_interface.cpp:574
    #13 0x7bbf26f32b9d in _highs_solver_run /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/RcppExports.cpp:568
    #14 0x000000744328 in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:754
    #15 0x0000008da65a in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8668
    #16 0x0000008b0e9b in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7501
    #17 0x0000008517e2 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167
    #18 0x0000008691fa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2393
    #19 0x00000086d40a in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2306
    #20 0x000000851e83 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2328
    #21 0x000000851e83 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1280
    #22 0x00000088211e in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3567
    #23 0x0000008522a6 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1232
    #24 0x0000009f7048 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264
    #25 0x0000009f7048 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317
    #26 0x0000009fc47a in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235
    #27 0x000000a06692 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242
    #28 0x0000004132bf in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29
    #29 0x7fbf428115f4 in __libc_start_call_main (/lib64/libc.so.6+0x35f4) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #30 0x7fbf428116a7 in __libc_start_main@@GLIBC_2.34 (/lib64/libc.so.6+0x36a7) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #31 0x000000413c44 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413c44) (BuildId: 092cc2e60f523f7cc0bd9086923e9c95f81d6f24)

/tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:907:38: runtime error: index 32 out of bounds for type 'NodePtr [1]'
    #0 0x7bbf287f7549 in HighsHashTree<int, int>::insert_recurse(HighsHashTree<int, int>::NodePtr*, unsigned long, int, HighsHashTableEntry<int, int>&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:907
    #1 0x7bbf286fa84d in bool HighsHashTree<int, int>::insert<int&, int&>(int&, int&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1371
    #2 0x7bbf286fa84d in HighsCliqueTable::doAddClique(HighsCliqueTable::CliqueVar const*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:375
    #3 0x7bbf28713529 in HighsCliqueTable::addClique(HighsMipSolver const&, HighsCliqueTable::CliqueVar*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:811
    #4 0x7bbf287447a7 in HighsCliqueTable::extractObjCliques(HighsMipSolver&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:1509
    #5 0x7bbf27594249 in HighsMipSolverData::addIncumbent(std::vector<double, std::allocator<double> > const&, double, int, bool, bool) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1374
    #6 0x7bbf275c11f4 in HighsMipSolverData::evaluateRootLp() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1701
    #7 0x7bbf275d4363 in HighsMipSolverData::evaluateRootNode() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1860
    #8 0x7bbf274b0fee in HighsMipSolver::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolver.cpp:157
    #9 0x7bbf2716ca84 in Highs::callSolveMip() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:3949
    #10 0x7bbf271040c5 in Highs::solve() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:1183
    #11 0x7bbf271132cc in Highs::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:939
    #12 0x7bbf26fa2c76 in solver_run(SEXPREC*) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/highs_interface.cpp:574
    #13 0x7bbf26f32b9d in _highs_solver_run /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/RcppExports.cpp:568
    #14 0x000000744328 in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:754
    #15 0x0000008da65a in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8668
    #16 0x0000008b0e9b in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7501
    #17 0x0000008517e2 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167
    #18 0x0000008691fa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2393
    #19 0x00000086d40a in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2306
    #20 0x000000851e83 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2328
    #21 0x000000851e83 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1280
    #22 0x00000088211e in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3567
    #23 0x0000008522a6 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1232
    #24 0x0000009f7048 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264
    #25 0x0000009f7048 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317
    #26 0x0000009fc47a in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235
    #27 0x000000a06692 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242
    #28 0x0000004132bf in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29
    #29 0x7fbf428115f4 in __libc_start_call_main (/lib64/libc.so.6+0x35f4) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #30 0x7fbf428116a7 in __libc_start_main@@GLIBC_2.34 (/lib64/libc.so.6+0x36a7) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #31 0x000000413c44 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413c44) (BuildId: 092cc2e60f523f7cc0bd9086923e9c95f81d6f24)

/tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1151:49: runtime error: index 1 out of bounds for type 'NodePtr [1]'
    #0 0x7bbf28822208 in HighsHashTree<int, int>::find_common_recurse(HighsHashTree<int, int>::NodePtr, HighsHashTree<int, int>::NodePtr, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1151
    #1 0x7bbf286bd20b in HighsHashTree<int, int>::find_common(HighsHashTree<int, int> const&) const /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1406
    #2 0x7bbf286bd20b in HighsCliqueTable::findCommonCliqueId(long&, HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) const /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:71
    #3 0x7bbf28713a5a in HighsCliqueTable::findCommonCliqueId(HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.h:107
    #4 0x7bbf28713a5a in HighsCliqueTable::haveCommonClique(HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.h:257
    #5 0x7bbf28713a5a in HighsCliqueTable::addClique(HighsMipSolver const&, HighsCliqueTable::CliqueVar*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:716
    #6 0x7bbf287447a7 in HighsCliqueTable::extractObjCliques(HighsMipSolver&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:1509
    #7 0x7bbf27594249 in HighsMipSolverData::addIncumbent(std::vector<double, std::allocator<double> > const&, double, int, bool, bool) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1374
    #8 0x7bbf275c11f4 in HighsMipSolverData::evaluateRootLp() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1701
    #9 0x7bbf275d4363 in HighsMipSolverData::evaluateRootNode() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1860
    #10 0x7bbf274b0fee in HighsMipSolver::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolver.cpp:157
    #11 0x7bbf2716ca84 in Highs::callSolveMip() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:3949
    #12 0x7bbf271040c5 in Highs::solve() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:1183
    #13 0x7bbf271132cc in Highs::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:939
    #14 0x7bbf26fa2c76 in solver_run(SEXPREC*) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/highs_interface.cpp:574
    #15 0x7bbf26f32b9d in _highs_solver_run /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/RcppExports.cpp:568
    #16 0x000000744328 in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:754
    #17 0x0000008da65a in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8668
    #18 0x0000008b0e9b in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7501
    #19 0x0000008517e2 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167
    #20 0x0000008691fa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2393
    #21 0x00000086d40a in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2306
    #22 0x000000851e83 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2328
    #23 0x000000851e83 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1280
    #24 0x00000088211e in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3567
    #25 0x0000008522a6 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1232
    #26 0x0000009f7048 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264
    #27 0x0000009f7048 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317
    #28 0x0000009fc47a in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235
    #29 0x000000a06692 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242
    #30 0x0000004132bf in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29
    #31 0x7fbf428115f4 in __libc_start_call_main (/lib64/libc.so.6+0x35f4) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #32 0x7fbf428116a7 in __libc_start_main@@GLIBC_2.34 (/lib64/libc.so.6+0x36a7) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #33 0x000000413c44 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413c44) (BuildId: 092cc2e60f523f7cc0bd9086923e9c95f81d6f24)

/tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:576:43: runtime error: index 43 out of bounds for type 'NodePtr [1]'
    #0 0x7bbf288ffa12 in HighsHashTableEntry<int, int>* HighsHashTree<int, int>::findCommonInLeaf<1>(HighsHashTree<int, int>::InnerLeaf<1>*, HighsHashTree<int, int>::NodePtr, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:576
    #1 0x7bbf2880c247 in HighsHashTree<int, int>::find_common_recurse(HighsHashTree<int, int>::NodePtr, HighsHashTree<int, int>::NodePtr, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1121
    #2 0x7bbf286bd20b in HighsHashTree<int, int>::find_common(HighsHashTree<int, int> const&) const /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1406
    #3 0x7bbf286bd20b in HighsCliqueTable::findCommonCliqueId(long&, HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) const /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:71
    #4 0x7bbf28713a5a in HighsCliqueTable::findCommonCliqueId(HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.h:107
    #5 0x7bbf28713a5a in HighsCliqueTable::haveCommonClique(HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.h:257
    #6 0x7bbf28713a5a in HighsCliqueTable::addClique(HighsMipSolver const&, HighsCliqueTable::CliqueVar*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:716
    #7 0x7bbf287447a7 in HighsCliqueTable::extractObjCliques(HighsMipSolver&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:1509
    #8 0x7bbf27594249 in HighsMipSolverData::addIncumbent(std::vector<double, std::allocator<double> > const&, double, int, bool, bool) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1374
    #9 0x7bbf275c11f4 in HighsMipSolverData::evaluateRootLp() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1701
    #10 0x7bbf275d4363 in HighsMipSolverData::evaluateRootNode() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1860
    #11 0x7bbf274b0fee in HighsMipSolver::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolver.cpp:157
    #12 0x7bbf2716ca84 in Highs::callSolveMip() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:3949
    #13 0x7bbf271040c5 in Highs::solve() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:1183
    #14 0x7bbf271132cc in Highs::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:939
    #15 0x7bbf26fa2c76 in solver_run(SEXPREC*) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/highs_interface.cpp:574
    #16 0x7bbf26f32b9d in _highs_solver_run /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/RcppExports.cpp:568
    #17 0x000000744328 in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:754
    #18 0x0000008da65a in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8668
    #19 0x0000008b0e9b in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7501
    #20 0x0000008517e2 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167
    #21 0x0000008691fa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2393
    #22 0x00000086d40a in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2306
    #23 0x000000851e83 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2328
    #24 0x000000851e83 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1280
    #25 0x00000088211e in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3567
    #26 0x0000008522a6 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1232
    #27 0x0000009f7048 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264
    #28 0x0000009f7048 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317
    #29 0x0000009fc47a in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235
    #30 0x000000a06692 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242
    #31 0x0000004132bf in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29
    #32 0x7fbf428115f4 in __libc_start_call_main (/lib64/libc.so.6+0x35f4) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #33 0x7fbf428116a7 in __libc_start_main@@GLIBC_2.34 (/lib64/libc.so.6+0x36a7) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #34 0x000000413c44 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413c44) (BuildId: 092cc2e60f523f7cc0bd9086923e9c95f81d6f24)

/tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1150:49: runtime error: index 1 out of bounds for type 'NodePtr [1]'
    #0 0x7bbf288221bc in HighsHashTree<int, int>::find_common_recurse(HighsHashTree<int, int>::NodePtr, HighsHashTree<int, int>::NodePtr, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1150
    #1 0x7bbf286bd20b in HighsHashTree<int, int>::find_common(HighsHashTree<int, int> const&) const /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1406
    #2 0x7bbf286bd20b in HighsCliqueTable::findCommonCliqueId(long&, HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) const /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:71
    #3 0x7bbf28713a5a in HighsCliqueTable::findCommonCliqueId(HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.h:107
    #4 0x7bbf28713a5a in HighsCliqueTable::haveCommonClique(HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.h:257
    #5 0x7bbf28713a5a in HighsCliqueTable::addClique(HighsMipSolver const&, HighsCliqueTable::CliqueVar*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:716
    #6 0x7bbf287447a7 in HighsCliqueTable::extractObjCliques(HighsMipSolver&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:1509
    #7 0x7bbf27594249 in HighsMipSolverData::addIncumbent(std::vector<double, std::allocator<double> > const&, double, int, bool, bool) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1374
    #8 0x7bbf275c11f4 in HighsMipSolverData::evaluateRootLp() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1701
    #9 0x7bbf275d4363 in HighsMipSolverData::evaluateRootNode() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1860
    #10 0x7bbf274b0fee in HighsMipSolver::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolver.cpp:157
    #11 0x7bbf2716ca84 in Highs::callSolveMip() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:3949
    #12 0x7bbf271040c5 in Highs::solve() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:1183
    #13 0x7bbf271132cc in Highs::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:939
    #14 0x7bbf26fa2c76 in solver_run(SEXPREC*) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/highs_interface.cpp:574
    #15 0x7bbf26f32b9d in _highs_solver_run /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/RcppExports.cpp:568
    #16 0x000000744328 in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:754
    #17 0x0000008da65a in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8668
    #18 0x0000008b0e9b in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7501
    #19 0x0000008517e2 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167
    #20 0x0000008691fa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2393
    #21 0x00000086d40a in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2306
    #22 0x000000851e83 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2328
    #23 0x000000851e83 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1280
    #24 0x00000088211e in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3567
    #25 0x0000008522a6 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1232
    #26 0x0000009f7048 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264
    #27 0x0000009f7048 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317
    #28 0x0000009fc47a in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235
    #29 0x000000a06692 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242
    #30 0x0000004132bf in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29
    #31 0x7fbf428115f4 in __libc_start_call_main (/lib64/libc.so.6+0x35f4) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #32 0x7fbf428116a7 in __libc_start_main@@GLIBC_2.34 (/lib64/libc.so.6+0x36a7) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #33 0x000000413c44 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413c44) (BuildId: 092cc2e60f523f7cc0bd9086923e9c95f81d6f24)

/tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:576:43: runtime error: index 1 out of bounds for type 'NodePtr [1]'
    #0 0x7bbf2882356b in HighsHashTableEntry<int, int>* HighsHashTree<int, int>::findCommonInLeaf<4>(HighsHashTree<int, int>::InnerLeaf<4>*, HighsHashTree<int, int>::NodePtr, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:576
    #1 0x7bbf2882356b in HighsHashTree<int, int>::find_common_recurse(HighsHashTree<int, int>::NodePtr, HighsHashTree<int, int>::NodePtr, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1127
    #2 0x7bbf286bd20b in HighsHashTree<int, int>::find_common(HighsHashTree<int, int> const&) const /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1406
    #3 0x7bbf286bd20b in HighsCliqueTable::findCommonCliqueId(long&, HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) const /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:71
    #4 0x7bbf28713a5a in HighsCliqueTable::findCommonCliqueId(HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.h:107
    #5 0x7bbf28713a5a in HighsCliqueTable::haveCommonClique(HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.h:257
    #6 0x7bbf28713a5a in HighsCliqueTable::addClique(HighsMipSolver const&, HighsCliqueTable::CliqueVar*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:716
    #7 0x7bbf287447a7 in HighsCliqueTable::extractObjCliques(HighsMipSolver&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:1509
    #8 0x7bbf27594249 in HighsMipSolverData::addIncumbent(std::vector<double, std::allocator<double> > const&, double, int, bool, bool) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1374
    #9 0x7bbf275c11f4 in HighsMipSolverData::evaluateRootLp() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1701
    #10 0x7bbf275d4363 in HighsMipSolverData::evaluateRootNode() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1860
    #11 0x7bbf274b0fee in HighsMipSolver::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolver.cpp:157
    #12 0x7bbf2716ca84 in Highs::callSolveMip() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:3949
    #13 0x7bbf271040c5 in Highs::solve() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:1183
    #14 0x7bbf271132cc in Highs::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:939
    #15 0x7bbf26fa2c76 in solver_run(SEXPREC*) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/highs_interface.cpp:574
    #16 0x7bbf26f32b9d in _highs_solver_run /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/RcppExports.cpp:568
    #17 0x000000744328 in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:754
    #18 0x0000008da65a in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8668
    #19 0x0000008b0e9b in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7501
    #20 0x0000008517e2 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167
    #21 0x0000008691fa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2393
    #22 0x00000086d40a in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2306
    #23 0x000000851e83 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2328
    #24 0x000000851e83 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1280
    #25 0x00000088211e in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3567
    #26 0x0000008522a6 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1232
    #27 0x0000009f7048 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264
    #28 0x0000009f7048 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317
    #29 0x0000009fc47a in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235
    #30 0x000000a06692 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242
    #31 0x0000004132bf in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29
    #32 0x7fbf428115f4 in __libc_start_call_main (/lib64/libc.so.6+0x35f4) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #33 0x7fbf428116a7 in __libc_start_main@@GLIBC_2.34 (/lib64/libc.so.6+0x36a7) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #34 0x000000413c44 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413c44) (BuildId: 092cc2e60f523f7cc0bd9086923e9c95f81d6f24)

/tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:437:59: runtime error: index 8 out of bounds for type 'NodePtr [1]'
    #0 0x7bbf287fb6fb in HighsHashTree<int, int>::addChildToBranchNode(HighsHashTree<int, int>::BranchNode*, unsigned char, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:437
    #1 0x7bbf287fb6fb in HighsHashTree<int, int>::insert_recurse(HighsHashTree<int, int>::NodePtr*, unsigned long, int, HighsHashTableEntry<int, int>&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:930
    #2 0x7bbf286fa84d in bool HighsHashTree<int, int>::insert<int&, int&>(int&, int&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1371
    #3 0x7bbf286fa84d in HighsCliqueTable::doAddClique(HighsCliqueTable::CliqueVar const*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:375
    #4 0x7bbf28713529 in HighsCliqueTable::addClique(HighsMipSolver const&, HighsCliqueTable::CliqueVar*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:811
    #5 0x7bbf287447a7 in HighsCliqueTable::extractObjCliques(HighsMipSolver&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:1509
    #6 0x7bbf27594249 in HighsMipSolverData::addIncumbent(std::vector<double, std::allocator<double> > const&, double, int, bool, bool) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1374
    #7 0x7bbf275c11f4 in HighsMipSolverData::evaluateRootLp() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1701
    #8 0x7bbf275d4363 in HighsMipSolverData::evaluateRootNode() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1860
    #9 0x7bbf274b0fee in HighsMipSolver::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolver.cpp:157
    #10 0x7bbf2716ca84 in Highs::callSolveMip() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:3949
    #11 0x7bbf271040c5 in Highs::solve() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:1183
    #12 0x7bbf271132cc in Highs::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:939
    #13 0x7bbf26fa2c76 in solver_run(SEXPREC*) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/highs_interface.cpp:574
    #14 0x7bbf26f32b9d in _highs_solver_run /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/RcppExports.cpp:568
    #15 0x000000744328 in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:754
    #16 0x0000008da65a in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8668
    #17 0x0000008b0e9b in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7501
    #18 0x0000008517e2 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167
    #19 0x0000008691fa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2393
    #20 0x00000086d40a in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2306
    #21 0x000000851e83 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2328
    #22 0x000000851e83 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1280
    #23 0x00000088211e in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3567
    #24 0x0000008522a6 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1232
    #25 0x0000009f7048 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264
    #26 0x0000009f7048 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317
    #27 0x0000009fc47a in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235
    #28 0x000000a06692 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242
    #29 0x0000004132bf in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29
    #30 0x7fbf428115f4 in __libc_start_call_main (/lib64/libc.so.6+0x35f4) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #31 0x7fbf428116a7 in __libc_start_main@@GLIBC_2.34 (/lib64/libc.so.6+0x36a7) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #32 0x000000413c44 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413c44) (BuildId: 092cc2e60f523f7cc0bd9086923e9c95f81d6f24)

/tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:437:29: runtime error: index 9 out of bounds for type 'NodePtr [1]'
    #0 0x7bbf287fb611 in HighsHashTree<int, int>::addChildToBranchNode(HighsHashTree<int, int>::BranchNode*, unsigned char, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:437
    #1 0x7bbf287fb611 in HighsHashTree<int, int>::insert_recurse(HighsHashTree<int, int>::NodePtr*, unsigned long, int, HighsHashTableEntry<int, int>&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:930
    #2 0x7bbf286fa84d in bool HighsHashTree<int, int>::insert<int&, int&>(int&, int&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1371
    #3 0x7bbf286fa84d in HighsCliqueTable::doAddClique(HighsCliqueTable::CliqueVar const*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:375
    #4 0x7bbf28713529 in HighsCliqueTable::addClique(HighsMipSolver const&, HighsCliqueTable::CliqueVar*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:811
    #5 0x7bbf287447a7 in HighsCliqueTable::extractObjCliques(HighsMipSolver&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:1509
    #6 0x7bbf27594249 in HighsMipSolverData::addIncumbent(std::vector<double, std::allocator<double> > const&, double, int, bool, bool) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1374
    #7 0x7bbf275c11f4 in HighsMipSolverData::evaluateRootLp() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1701
    #8 0x7bbf275d4363 in HighsMipSolverData::evaluateRootNode() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1860
    #9 0x7bbf274b0fee in HighsMipSolver::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolver.cpp:157
    #10 0x7bbf2716ca84 in Highs::callSolveMip() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:3949
    #11 0x7bbf271040c5 in Highs::solve() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:1183
    #12 0x7bbf271132cc in Highs::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:939
    #13 0x7bbf26fa2c76 in solver_run(SEXPREC*) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/highs_interface.cpp:574
    #14 0x7bbf26f32b9d in _highs_solver_run /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/RcppExports.cpp:568
    #15 0x000000744328 in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:754
    #16 0x0000008da65a in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8668
    #17 0x0000008b0e9b in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7501
    #18 0x0000008517e2 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167
    #19 0x0000008691fa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2393
    #20 0x00000086d40a in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2306
    #21 0x000000851e83 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2328
    #22 0x000000851e83 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1280
    #23 0x00000088211e in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3567
    #24 0x0000008522a6 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1232
    #25 0x0000009f7048 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264
    #26 0x0000009f7048 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317
    #27 0x0000009fc47a in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235
    #28 0x000000a06692 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242
    #29 0x0000004132bf in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29
    #30 0x7fbf428115f4 in __libc_start_call_main (/lib64/libc.so.6+0x35f4) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #31 0x7fbf428116a7 in __libc_start_main@@GLIBC_2.34 (/lib64/libc.so.6+0x36a7) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #32 0x000000413c44 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413c44) (BuildId: 092cc2e60f523f7cc0bd9086923e9c95f81d6f24)

/tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:933:24: runtime error: index 8 out of bounds for type 'NodePtr [1]'
    #0 0x7bbf287fb509 in HighsHashTree<int, int>::insert_recurse(HighsHashTree<int, int>::NodePtr*, unsigned long, int, HighsHashTableEntry<int, int>&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:933
    #1 0x7bbf286fa84d in bool HighsHashTree<int, int>::insert<int&, int&>(int&, int&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1371
    #2 0x7bbf286fa84d in HighsCliqueTable::doAddClique(HighsCliqueTable::CliqueVar const*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:375
    #3 0x7bbf28713529 in HighsCliqueTable::addClique(HighsMipSolver const&, HighsCliqueTable::CliqueVar*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:811
    #4 0x7bbf287447a7 in HighsCliqueTable::extractObjCliques(HighsMipSolver&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:1509
    #5 0x7bbf27594249 in HighsMipSolverData::addIncumbent(std::vector<double, std::allocator<double> > const&, double, int, bool, bool) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1374
    #6 0x7bbf275c11f4 in HighsMipSolverData::evaluateRootLp() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1701
    #7 0x7bbf275d4363 in HighsMipSolverData::evaluateRootNode() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1860
    #8 0x7bbf274b0fee in HighsMipSolver::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolver.cpp:157
    #9 0x7bbf2716ca84 in Highs::callSolveMip() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:3949
    #10 0x7bbf271040c5 in Highs::solve() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:1183
    #11 0x7bbf271132cc in Highs::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:939
    #12 0x7bbf26fa2c76 in solver_run(SEXPREC*) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/highs_interface.cpp:574
    #13 0x7bbf26f32b9d in _highs_solver_run /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/RcppExports.cpp:568
    #14 0x000000744328 in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:754
    #15 0x0000008da65a in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8668
    #16 0x0000008b0e9b in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7501
    #17 0x0000008517e2 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167
    #18 0x0000008691fa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2393
    #19 0x00000086d40a in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2306
    #20 0x000000851e83 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2328
    #21 0x000000851e83 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1280
    #22 0x00000088211e in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3567
    #23 0x0000008522a6 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1232
    #24 0x0000009f7048 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264
    #25 0x0000009f7048 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317
    #26 0x0000009fc47a in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235
    #27 0x000000a06692 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242
    #28 0x0000004132bf in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29
    #29 0x7fbf428115f4 in __libc_start_call_main (/lib64/libc.so.6+0x35f4) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #30 0x7fbf428116a7 in __libc_start_main@@GLIBC_2.34 (/lib64/libc.so.6+0x36a7) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #31 0x000000413c44 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413c44) (BuildId: 092cc2e60f523f7cc0bd9086923e9c95f81d6f24)

/tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:938:36: runtime error: index 8 out of bounds for type 'NodePtr [1]'
    #0 0x7bbf287f47ac in HighsHashTree<int, int>::insert_recurse(HighsHashTree<int, int>::NodePtr*, unsigned long, int, HighsHashTableEntry<int, int>&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:938
    #1 0x7bbf286fa84d in bool HighsHashTree<int, int>::insert<int&, int&>(int&, int&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1371
    #2 0x7bbf286fa84d in HighsCliqueTable::doAddClique(HighsCliqueTable::CliqueVar const*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:375
    #3 0x7bbf28713529 in HighsCliqueTable::addClique(HighsMipSolver const&, HighsCliqueTable::CliqueVar*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:811
    #4 0x7bbf287447a7 in HighsCliqueTable::extractObjCliques(HighsMipSolver&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:1509
    #5 0x7bbf27594249 in HighsMipSolverData::addIncumbent(std::vector<double, std::allocator<double> > const&, double, int, bool, bool) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1374
    #6 0x7bbf275c11f4 in HighsMipSolverData::evaluateRootLp() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1701
    #7 0x7bbf275d4363 in HighsMipSolverData::evaluateRootNode() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1860
    #8 0x7bbf274b0fee in HighsMipSolver::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolver.cpp:157
    #9 0x7bbf2716ca84 in Highs::callSolveMip() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:3949
    #10 0x7bbf271040c5 in Highs::solve() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:1183
    #11 0x7bbf271132cc in Highs::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:939
    #12 0x7bbf26fa2c76 in solver_run(SEXPREC*) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/highs_interface.cpp:574
    #13 0x7bbf26f32b9d in _highs_solver_run /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/RcppExports.cpp:568
    #14 0x000000744328 in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:754
    #15 0x0000008da65a in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8668
    #16 0x0000008b0e9b in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7501
    #17 0x0000008517e2 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167
    #18 0x0000008691fa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2393
    #19 0x00000086d40a in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2306
    #20 0x000000851e83 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2328
    #21 0x000000851e83 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1280
    #22 0x00000088211e in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3567
    #23 0x0000008522a6 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1232
    #24 0x0000009f7048 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264
    #25 0x0000009f7048 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317
    #26 0x0000009fc47a in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235
    #27 0x000000a06692 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242
    #28 0x0000004132bf in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29
    #29 0x7fbf428115f4 in __libc_start_call_main (/lib64/libc.so.6+0x35f4) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #30 0x7fbf428116a7 in __libc_start_main@@GLIBC_2.34 (/lib64/libc.so.6+0x36a7) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #31 0x000000413c44 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413c44) (BuildId: 092cc2e60f523f7cc0bd9086923e9c95f81d6f24)

/tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:424:59: runtime error: index 8 out of bounds for type 'NodePtr [1]'
    #0 0x7bbf287fa7a3 in HighsHashTree<int, int>::addChildToBranchNode(HighsHashTree<int, int>::BranchNode*, unsigned char, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:424
    #1 0x7bbf287fa7a3 in HighsHashTree<int, int>::insert_recurse(HighsHashTree<int, int>::NodePtr*, unsigned long, int, HighsHashTableEntry<int, int>&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:930
    #2 0x7bbf286fa84d in bool HighsHashTree<int, int>::insert<int&, int&>(int&, int&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1371
    #3 0x7bbf286fa84d in HighsCliqueTable::doAddClique(HighsCliqueTable::CliqueVar const*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:375
    #4 0x7bbf28713529 in HighsCliqueTable::addClique(HighsMipSolver const&, HighsCliqueTable::CliqueVar*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:811
    #5 0x7bbf287447a7 in HighsCliqueTable::extractObjCliques(HighsMipSolver&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:1509
    #6 0x7bbf27594249 in HighsMipSolverData::addIncumbent(std::vector<double, std::allocator<double> > const&, double, int, bool, bool) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1374
    #7 0x7bbf275c11f4 in HighsMipSolverData::evaluateRootLp() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1701
    #8 0x7bbf275d4363 in HighsMipSolverData::evaluateRootNode() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1860
    #9 0x7bbf274b0fee in HighsMipSolver::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolver.cpp:157
    #10 0x7bbf2716ca84 in Highs::callSolveMip() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:3949
    #11 0x7bbf271040c5 in Highs::solve() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:1183
    #12 0x7bbf271132cc in Highs::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:939
    #13 0x7bbf26fa2c76 in solver_run(SEXPREC*) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/highs_interface.cpp:574
    #14 0x7bbf26f32b9d in _highs_solver_run /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/RcppExports.cpp:568
    #15 0x000000744328 in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:754
    #16 0x0000008da65a in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8668
    #17 0x0000008b0e9b in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7501
    #18 0x0000008517e2 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167
    #19 0x0000008691fa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2393
    #20 0x00000086d40a in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2306
    #21 0x000000851e83 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2328
    #22 0x000000851e83 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1280
    #23 0x00000088211e in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3567
    #24 0x0000008522a6 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1232
    #25 0x0000009f7048 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264
    #26 0x0000009f7048 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317
    #27 0x0000009fc47a in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235
    #28 0x000000a06692 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242
    #29 0x0000004132bf in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29
    #30 0x7fbf428115f4 in __libc_start_call_main (/lib64/libc.so.6+0x35f4) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #31 0x7fbf428116a7 in __libc_start_main@@GLIBC_2.34 (/lib64/libc.so.6+0x36a7) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #32 0x000000413c44 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413c44) (BuildId: 092cc2e60f523f7cc0bd9086923e9c95f81d6f24)

/tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:424:29: runtime error: index 9 out of bounds for type 'NodePtr [1]'
    #0 0x7bbf287fa6b9 in HighsHashTree<int, int>::addChildToBranchNode(HighsHashTree<int, int>::BranchNode*, unsigned char, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:424
    #1 0x7bbf287fa6b9 in HighsHashTree<int, int>::insert_recurse(HighsHashTree<int, int>::NodePtr*, unsigned long, int, HighsHashTableEntry<int, int>&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:930
    #2 0x7bbf286fa84d in bool HighsHashTree<int, int>::insert<int&, int&>(int&, int&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1371
    #3 0x7bbf286fa84d in HighsCliqueTable::doAddClique(HighsCliqueTable::CliqueVar const*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:375
    #4 0x7bbf28713529 in HighsCliqueTable::addClique(HighsMipSolver const&, HighsCliqueTable::CliqueVar*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:811
    #5 0x7bbf287447a7 in HighsCliqueTable::extractObjCliques(HighsMipSolver&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:1509
    #6 0x7bbf27594249 in HighsMipSolverData::addIncumbent(std::vector<double, std::allocator<double> > const&, double, int, bool, bool) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1374
    #7 0x7bbf275c11f4 in HighsMipSolverData::evaluateRootLp() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1701
    #8 0x7bbf275d4363 in HighsMipSolverData::evaluateRootNode() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1860
    #9 0x7bbf274b0fee in HighsMipSolver::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolver.cpp:157
    #10 0x7bbf2716ca84 in Highs::callSolveMip() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:3949
    #11 0x7bbf271040c5 in Highs::solve() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:1183
    #12 0x7bbf271132cc in Highs::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:939
    #13 0x7bbf26fa2c76 in solver_run(SEXPREC*) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/highs_interface.cpp:574
    #14 0x7bbf26f32b9d in _highs_solver_run /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/RcppExports.cpp:568
    #15 0x000000744328 in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:754
    #16 0x0000008da65a in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8668
    #17 0x0000008b0e9b in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7501
    #18 0x0000008517e2 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167
    #19 0x0000008691fa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2393
    #20 0x00000086d40a in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2306
    #21 0x000000851e83 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2328
    #22 0x000000851e83 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1280
    #23 0x00000088211e in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3567
    #24 0x0000008522a6 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1232
    #25 0x0000009f7048 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264
    #26 0x0000009f7048 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317
    #27 0x0000009fc47a in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235
    #28 0x000000a06692 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242
    #29 0x0000004132bf in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29
    #30 0x7fbf428115f4 in __libc_start_call_main (/lib64/libc.so.6+0x35f4) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #31 0x7fbf428116a7 in __libc_start_main@@GLIBC_2.34 (/lib64/libc.so.6+0x36a7) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #32 0x000000413c44 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413c44) (BuildId: 092cc2e60f523f7cc0bd9086923e9c95f81d6f24)

/tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:576:43: runtime error: index 22 out of bounds for type 'NodePtr [1]'
    #0 0x7bbf2881faad in HighsHashTableEntry<int, int>* HighsHashTree<int, int>::findCommonInLeaf<2>(HighsHashTree<int, int>::InnerLeaf<2>*, HighsHashTree<int, int>::NodePtr, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:576
    #1 0x7bbf2881faad in HighsHashTree<int, int>::find_common_recurse(HighsHashTree<int, int>::NodePtr, HighsHashTree<int, int>::NodePtr, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1123
    #2 0x7bbf286bd20b in HighsHashTree<int, int>::find_common(HighsHashTree<int, int> const&) const /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1406
    #3 0x7bbf286bd20b in HighsCliqueTable::findCommonCliqueId(long&, HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) const /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:71
    #4 0x7bbf28713a5a in HighsCliqueTable::findCommonCliqueId(HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.h:107
    #5 0x7bbf28713a5a in HighsCliqueTable::haveCommonClique(HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.h:257
    #6 0x7bbf28713a5a in HighsCliqueTable::addClique(HighsMipSolver const&, HighsCliqueTable::CliqueVar*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:716
    #7 0x7bbf287447a7 in HighsCliqueTable::extractObjCliques(HighsMipSolver&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:1509
    #8 0x7bbf27594249 in HighsMipSolverData::addIncumbent(std::vector<double, std::allocator<double> > const&, double, int, bool, bool) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1374
    #9 0x7bbf275c11f4 in HighsMipSolverData::evaluateRootLp() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1701
    #10 0x7bbf275d4363 in HighsMipSolverData::evaluateRootNode() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1860
    #11 0x7bbf274b0fee in HighsMipSolver::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolver.cpp:157
    #12 0x7bbf2716ca84 in Highs::callSolveMip() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:3949
    #13 0x7bbf271040c5 in Highs::solve() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:1183
    #14 0x7bbf271132cc in Highs::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:939
    #15 0x7bbf26fa2c76 in solver_run(SEXPREC*) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/highs_interface.cpp:574
    #16 0x7bbf26f32b9d in _highs_solver_run /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/RcppExports.cpp:568
    #17 0x000000744328 in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:754
    #18 0x0000008da65a in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8668
    #19 0x0000008b0e9b in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7501
    #20 0x0000008517e2 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167
    #21 0x0000008691fa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2393
    #22 0x00000086d40a in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2306
    #23 0x000000851e83 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2328
    #24 0x000000851e83 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1280
    #25 0x00000088211e in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3567
    #26 0x0000008522a6 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1232
    #27 0x0000009f7048 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264
    #28 0x0000009f7048 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317
    #29 0x0000009fc47a in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235
    #30 0x000000a06692 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242
    #31 0x0000004132bf in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29
    #32 0x7fbf428115f4 in __libc_start_call_main (/lib64/libc.so.6+0x35f4) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #33 0x7fbf428116a7 in __libc_start_main@@GLIBC_2.34 (/lib64/libc.so.6+0x36a7) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #34 0x000000413c44 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413c44) (BuildId: 092cc2e60f523f7cc0bd9086923e9c95f81d6f24)

/tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:576:43: runtime error: index 2 out of bounds for type 'NodePtr [1]'
    #0 0x7bbf2881f8c1 in HighsHashTableEntry<int, int>* HighsHashTree<int, int>::findCommonInLeaf<3>(HighsHashTree<int, int>::InnerLeaf<3>*, HighsHashTree<int, int>::NodePtr, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:576
    #1 0x7bbf2881f8c1 in HighsHashTree<int, int>::find_common_recurse(HighsHashTree<int, int>::NodePtr, HighsHashTree<int, int>::NodePtr, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1125
    #2 0x7bbf286bd20b in HighsHashTree<int, int>::find_common(HighsHashTree<int, int> const&) const /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1406
    #3 0x7bbf286bd20b in HighsCliqueTable::findCommonCliqueId(long&, HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) const /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:71
    #4 0x7bbf28713a5a in HighsCliqueTable::findCommonCliqueId(HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.h:107
    #5 0x7bbf28713a5a in HighsCliqueTable::haveCommonClique(HighsCliqueTable::CliqueVar, HighsCliqueTable::CliqueVar) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.h:257
    #6 0x7bbf28713a5a in HighsCliqueTable::addClique(HighsMipSolver const&, HighsCliqueTable::CliqueVar*, int, bool, int) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:716
    #7 0x7bbf287447a7 in HighsCliqueTable::extractObjCliques(HighsMipSolver&) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.cpp:1509
    #8 0x7bbf27594249 in HighsMipSolverData::addIncumbent(std::vector<double, std::allocator<double> > const&, double, int, bool, bool) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1374
    #9 0x7bbf275c11f4 in HighsMipSolverData::evaluateRootLp() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1701
    #10 0x7bbf275d4363 in HighsMipSolverData::evaluateRootNode() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.cpp:1860
    #11 0x7bbf274b0fee in HighsMipSolver::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolver.cpp:157
    #12 0x7bbf2716ca84 in Highs::callSolveMip() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:3949
    #13 0x7bbf271040c5 in Highs::solve() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:1183
    #14 0x7bbf271132cc in Highs::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:939
    #15 0x7bbf26fa2c76 in solver_run(SEXPREC*) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/highs_interface.cpp:574
    #16 0x7bbf26f32b9d in _highs_solver_run /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/RcppExports.cpp:568
    #17 0x000000744328 in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:754
    #18 0x0000008da65a in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8668
    #19 0x0000008b0e9b in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7501
    #20 0x0000008517e2 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167
    #21 0x0000008691fa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2393
    #22 0x00000086d40a in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2306
    #23 0x000000851e83 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2328
    #24 0x000000851e83 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1280
    #25 0x00000088211e in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3567
    #26 0x0000008522a6 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1232
    #27 0x0000009f7048 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264
    #28 0x0000009f7048 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317
    #29 0x0000009fc47a in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235
    #30 0x000000a06692 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242
    #31 0x0000004132bf in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29
    #32 0x7fbf428115f4 in __libc_start_call_main (/lib64/libc.so.6+0x35f4) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #33 0x7fbf428116a7 in __libc_start_main@@GLIBC_2.34 (/lib64/libc.so.6+0x36a7) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #34 0x000000413c44 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413c44) (BuildId: 092cc2e60f523f7cc0bd9086923e9c95f81d6f24)

/tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1194:69: runtime error: index 1 out of bounds for type 'NodePtr [1]'
    #0 0x7bbf274995fa in HighsHashTree<int, int>::destroy_recurse(HighsHashTree<int, int>::NodePtr) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1194
    #1 0x7bbf274995fa in HighsHashTree<int, int>::~HighsHashTree() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/util/HighsHashTree.h:1444
    #2 0x7bbf274995fa in void std::_Destroy<HighsHashTree<int, int> >(HighsHashTree<int, int>*) /usr/include/c++/15/bits/stl_construct.h:166
    #3 0x7bbf274995fa in void std::_Destroy<HighsHashTree<int, int>*>(HighsHashTree<int, int>*, HighsHashTree<int, int>*) /usr/include/c++/15/bits/stl_construct.h:212
    #4 0x7bbf274995fa in void std::_Destroy<HighsHashTree<int, int>*, HighsHashTree<int, int> >(HighsHashTree<int, int>*, HighsHashTree<int, int>*, std::allocator<HighsHashTree<int, int> >&) /usr/include/c++/15/bits/alloc_traits.h:1045
    #5 0x7bbf274995fa in std::vector<HighsHashTree<int, int>, std::allocator<HighsHashTree<int, int> > >::~vector() /usr/include/c++/15/bits/stl_vector.h:802
    #6 0x7bbf274995fa in HighsCliqueTable::~HighsCliqueTable() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsCliqueTable.h:29
    #7 0x7bbf27505f9f in HighsMipSolverData::~HighsMipSolverData() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolverData.h:67
    #8 0x7bbf274aa08f in std::default_delete<HighsMipSolverData>::operator()(HighsMipSolverData*) const /usr/include/c++/15/bits/unique_ptr.h:93
    #9 0x7bbf274aa08f in std::unique_ptr<HighsMipSolverData, std::default_delete<HighsMipSolverData> >::~unique_ptr() /usr/include/c++/15/bits/unique_ptr.h:399
    #10 0x7bbf274aa08f in HighsMipSolver::~HighsMipSolver() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/mip/HighsMipSolver.cpp:68
    #11 0x7bbf2716d82f in Highs::callSolveMip() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:4034
    #12 0x7bbf271040c5 in Highs::solve() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:1183
    #13 0x7bbf271132cc in Highs::run() /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/inst/HiGHS/highs/lp_data/Highs.cpp:939
    #14 0x7bbf26fa2c76 in solver_run(SEXPREC*) /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/highs_interface.cpp:574
    #15 0x7bbf26f32b9d in _highs_solver_run /tmp/RtmpM5KjEe/R.INSTALL1a51177f9d571a/highs/src/RcppExports.cpp:568
    #16 0x000000744328 in R_doDotCall /data/gannet/ripley/R/svn/R-devel/src/main/dotcode.c:754
    #17 0x0000008da65a in bcEval_loop /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:8668
    #18 0x0000008b0e9b in bcEval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:7501
    #19 0x0000008517e2 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1167
    #20 0x0000008691fa in R_execClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2393
    #21 0x00000086d40a in applyClosure_core /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2306
    #22 0x000000851e83 in Rf_applyClosure /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:2328
    #23 0x000000851e83 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1280
    #24 0x00000088211e in do_set /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:3567
    #25 0x0000008522a6 in Rf_eval /data/gannet/ripley/R/svn/R-devel/src/main/eval.c:1232
    #26 0x0000009f7048 in Rf_ReplIteration /data/gannet/ripley/R/svn/R-devel/src/main/main.c:264
    #27 0x0000009f7048 in R_ReplConsole /data/gannet/ripley/R/svn/R-devel/src/main/main.c:317
    #28 0x0000009fc47a in run_Rmainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1235
    #29 0x000000a06692 in Rf_mainloop /data/gannet/ripley/R/svn/R-devel/src/main/main.c:1242
    #30 0x0000004132bf in main /data/gannet/ripley/R/svn/R-devel/src/main/Rmain.c:29
    #31 0x7fbf428115f4 in __libc_start_call_main (/lib64/libc.so.6+0x35f4) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #32 0x7fbf428116a7 in __libc_start_main@@GLIBC_2.34 (/lib64/libc.so.6+0x36a7) (BuildId: a1dda014206b55b07f58fe8db80121b752dc3d03)
    #33 0x000000413c44 in _start (/data/gannet/ripley/R/gcc-SAN3/bin/exec/R+0x413c44) (BuildId: 092cc2e60f523f7cc0bd9086923e9c95f81d6f24)

  Optimal matches found 
> 
> # Indices of the treated units and matched controls
> t_id_2 = t_id_1[out_2$t_id]  
> c_id_2 = c_id_1[out_2$c_id-length(out_2$c_id)]	
> 
> # Covariate balance is preserved...
> meantab(covs, t_ind, t_id_2, c_id_2)
          Mis Min      Max  Mean T  Mean C Std Dif P-val
age         0  16    55.00   25.30   25.43   -0.01  0.92
education   0   2    18.00   10.26   10.46   -0.08  0.56
black       0   0     1.00    0.72    0.72    0.00  1.00
hispanic    0   0     1.00    0.11    0.11    0.00  1.00
married     0   0     1.00    0.25    0.25    0.00  1.00
nodegree    0   0     1.00    0.67    0.67    0.00  1.00
re74        0   0 35040.07 2922.08 2936.71    0.00  0.98
re75        0   0 25142.24 2168.03 1862.63    0.09  0.54
> for (i in 1:ncol(fine_covs)) {		
+ 	print(finetab(fine_covs[, i], t_id_2, c_id_2))
+ }
   Units
Cat  T  C
  0 29 29
  1 74 74
   Units
Cat  T  C
  0 92 92
  1 11 11
   Units
Cat  T  C
  0 77 77
  1 26 26
   Units
Cat  T  C
  0 34 34
  1 69 69
   Units
Cat  T  C
  1 25 25
  2 22 22
  3 22 22
  4 19 19
  5 15 15
   Units
Cat  T  C
  1  7  7
  2 26 26
  3 18 18
  4 18 18
  5 34 34
   Units
Cat  T  C
  2 57 57
  3 17 17
  4 17 17
  5 12 12
   Units
Cat  T  C
  2 50 50
  3 16 16
  4 19 19
  5 18 18
> 
> # ... but covariate distances are reduced
> distances_step_1 = sum(diag(dist_mat_2)) 
> distances_step_2 = sum(diag(dist_mat_2[out_2$t_id, out_2$c_id-length(out_2$c_id)])) 
> distances_step_1
[1] 564011.3
> distances_step_2
[1] 48539.59
> 
> # The mean difference in outcomes is the same...
> mean(re78[t_id_1]-re78[c_id_1])
[1] 747.3938
> mean(re78[t_id_2]-re78[c_id_2])
[1] 747.3938
> 
> # ... but their standard deviation is reduced
> sd(re78[t_id_1]-re78[c_id_1])
[1] 8656.79
> sd(re78[t_id_2]-re78[c_id_2])
[1] 7572.873
> 	
> 
> 
> 
> cleanEx()

detaching ‘lalonde’

> nameEx("distmat")
> ### * distmat
> 
> flush(stderr()); flush(stdout())
> 
> ### Name: distmat
> ### Title: Build a rank-based Mahalanobis distance matrix
> ### Aliases: distmat
> 
> ### ** Examples
> 
> 	# Load data
> 	data(germancities)
> 	attach(germancities)
> 
> 	# Treatment indicator
> 	t_ind = treat
> 
> 	# Matrix of covariates
> 	X_mat = cbind(log2pop, popgrowth1939, popgrowth3339, emprate, indrate, rubble, 
+ 	rubblemiss, flats, flatsmiss, refugees)
> 
> 	# Distance matrix
> 	dist_mat = distmat(t_ind, X_mat)
> 
> 
> 
> cleanEx()

detaching ‘germancities’

> nameEx("distmatch")
> ### * distmatch
> 
> flush(stderr()); flush(stdout())
> 
> ### Name: distmatch
> ### Title: Optimal distance matching in observational studies
> ### Aliases: distmatch
> ### Keywords: Causal inference Instrumental variable Matching Regression
> ###   discontinuity Observational study
> 
> ### ** Examples
> 
> 	
> # Load, sort, and attach data
> data(lalonde)
> lalonde = lalonde[order(lalonde$treatment, decreasing = TRUE), ]
> attach(lalonde)
> 
> ################################# 
> # Step 1: use cardinality matching to find the largest sample of matched pairs for which 
> # all the covariates are finely balanced.
> #################################
> 
> # Discretize covariates
> quantiles = function(covar, n_q) {
+ 	p_q = seq(0, 1, 1/n_q)
+ 	val_q = quantile(covar, probs = p_q, na.rm = TRUE)
+ 	covar_out = rep(NA, length(covar))
+ 	for (i in 1:n_q) {
+ 		if (i==1) {covar_out[covar<val_q[i+1]] = i}
+ 		if (i>1 & i<n_q) {covar_out[covar>=val_q[i] & covar<val_q[i+1]] = i}
+ 		if (i==n_q) {covar_out[covar>=val_q[i] & covar<=val_q[i+1]] = i}}
+ 	covar_out
+ }
> age_5 = quantiles(age, 5)
> education_5 = quantiles(education, 5)
> re74_5 = quantiles(re74, 5)
> re75_5 = quantiles(re75, 5)
> 
> # Treatment indicator; note that the data needs to be sorted in decreasing order
> # according to this treatment indicator
> t_ind = treatment
> t_ind 
  [1] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
 [38] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
 [75] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
[112] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
[149] 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
[186] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[223] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[260] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[297] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[334] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[371] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[408] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[445] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[482] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[519] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[556] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
[593] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
> 
> # Fine balance
> fine_covs = cbind(black, hispanic, married, nodegree, age_5, education_5, re74_5, re75_5)
> fine = list(covs = fine_covs)
> 
> # Solver options
> t_max = 60*5
> solver = "highs"
> approximate = 0
> solver = list(name = solver, t_max = t_max, approximate = approximate,
+ round_cplex = 0, trace = 0)
> 
> # Match                   
> out_1 = cardmatch(t_ind, fine = fine, solver = solver)
  Building the matching problem... 
  HiGHS optimizer is open... 
  Finding the optimal matches... 
  Optimal matches found 
> 
> # Indices of the treated units and matched controls
> t_id_1 = out_1$t_id  
> c_id_1 = out_1$c_id	
> 
> # Mean balance
> covs = cbind(age, education, black, hispanic, married, nodegree, re74, re75)
> meantab(covs, t_ind, t_id_1, c_id_1)
          Mis Min      Max  Mean T  Mean C Std Dif P-val
age         0  16    55.00   25.30   25.43   -0.01  0.92
education   0   2    18.00   10.26   10.46   -0.08  0.56
black       0   0     1.00    0.72    0.72    0.00  1.00
hispanic    0   0     1.00    0.11    0.11    0.00  1.00
married     0   0     1.00    0.25    0.25    0.00  1.00
nodegree    0   0     1.00    0.67    0.67    0.00  1.00
re74        0   0 35040.07 2922.08 2936.71    0.00  0.98
re75        0   0 25142.24 2168.03 1862.63    0.09  0.54
> 
> # Fine balance (note here we are getting an approximate solution)
> for (i in 1:ncol(fine_covs)) {		
+ 	print(finetab(fine_covs[, i], t_id_1, c_id_1))
+ }
   Units
Cat  T  C
  0 29 29
  1 74 74
   Units
Cat  T  C
  0 92 92
  1 11 11
   Units
Cat  T  C
  0 77 77
  1 26 26
   Units
Cat  T  C
  0 34 34
  1 69 69
   Units
Cat  T  C
  1 25 25
  2 22 22
  3 22 22
  4 19 19
  5 15 15
   Units
Cat  T  C
  1  7  7
  2 26 26
  3 18 18
  4 18 18
  5 34 34
   Units
Cat  T  C
  2 57 57
  3 17 17
  4 17 17
  5 12 12
   Units
Cat  T  C
  2 50 50
  3 16 16
  4 19 19
  5 18 18
> 
> ################################# 
> # Step 2: use optimal matching (minimum distance matching) to find the (re)pairing of
> # treated and control that minimizes the total sum of covariate distances between matched 
> # pairs.  For this, use the function 'distmatch' which is a wrapper for 'bmatch'.  
> #################################
> 
> # New treatment indicator
> t_ind_2 = t_ind[c(t_id_1, c_id_1)]
> table(t_ind_2)
t_ind_2
  0   1 
103 103 
> 
> # To build the distance matrix, the idea is to use strong predictors of the outcome
> dist_mat_2 = abs(outer(re74[t_id_1], re74[c_id_1], "-"))
> dim(dist_mat_2)
[1] 103 103
> 
> # Match
> out_2 = distmatch(t_ind_2, dist_mat_2, solver)
  Building the matching problem... 
  HiGHS optimizer is open... 
  Finding the optimal matches... 
  Optimal matches found 
> 
> # Indices of the treated units and matched controls
> t_id_2 = t_id_1[out_2$t_id]  
> c_id_2 = c_id_1[out_2$c_id-length(out_2$c_id)]	
> 
> # Covariate balance is preserved...
> meantab(covs, t_ind, t_id_2, c_id_2)
          Mis Min      Max  Mean T  Mean C Std Dif P-val
age         0  16    55.00   25.30   25.43   -0.01  0.92
education   0   2    18.00   10.26   10.46   -0.08  0.56
black       0   0     1.00    0.72    0.72    0.00  1.00
hispanic    0   0     1.00    0.11    0.11    0.00  1.00
married     0   0     1.00    0.25    0.25    0.00  1.00
nodegree    0   0     1.00    0.67    0.67    0.00  1.00
re74        0   0 35040.07 2922.08 2936.71    0.00  0.98
re75        0   0 25142.24 2168.03 1862.63    0.09  0.54
> for (i in 1:ncol(fine_covs)) {		
+ 	print(finetab(fine_covs[, i], t_id_2, c_id_2))
+ }
   Units
Cat  T  C
  0 29 29
  1 74 74
   Units
Cat  T  C
  0 92 92
  1 11 11
   Units
Cat  T  C
  0 77 77
  1 26 26
   Units
Cat  T  C
  0 34 34
  1 69 69
   Units
Cat  T  C
  1 25 25
  2 22 22
  3 22 22
  4 19 19
  5 15 15
   Units
Cat  T  C
  1  7  7
  2 26 26
  3 18 18
  4 18 18
  5 34 34
   Units
Cat  T  C
  2 57 57
  3 17 17
  4 17 17
  5 12 12
   Units
Cat  T  C
  2 50 50
  3 16 16
  4 19 19
  5 18 18
> 
> # ... but covariate distances are reduced
> distances_step_1 = sum(diag(dist_mat_2)) 
> distances_step_2 = sum(diag(dist_mat_2[out_2$t_id, out_2$c_id-length(out_2$c_id)])) 
> distances_step_1
[1] 564011.3
> distances_step_2
[1] 48539.59
> 
> # The mean difference in outcomes is the same...
> mean(re78[t_id_1]-re78[c_id_1])
[1] 747.3938
> mean(re78[t_id_2]-re78[c_id_2])
[1] 747.3938
> 
> # ... but their standard deviation is reduced
> sd(re78[t_id_1]-re78[c_id_1])
[1] 8656.79
> sd(re78[t_id_2]-re78[c_id_2])
[1] 7572.873
> 	
> 
> 
> 
> cleanEx()

detaching ‘lalonde’

> nameEx("ecdfplot")
> ### * ecdfplot
> 
> flush(stderr()); flush(stdout())
> 
> ### Name: ecdfplot
> ### Title: Empirical cumulative distribution function plot for assessing
> ###   covariate balance
> ### Aliases: ecdfplot
> 
> ### ** Examples
> 
> 	# Load data
> 	data(germancities)
> 
> 	# Sort and attach data
> 	germancities = germancities[order(germancities$treat, decreasing = TRUE), ]
> 	attach(germancities)
> 
> 	# Treatment indicator
> 	t_ind = treat
> 	
> 	# Indexes of the treated units
> 	t_id = which(t_ind == 1)
> 		
> 	# Indexes of the controls before matching
> 	c_id_before = which(t_ind == 0)
> 	
> 	# Indixes of the matched controls (obtained using bmatch in designmatch)
> 	c_id_after = c(80, 82, 35, 59, 69, 68, 34, 62, 104, 61, 106, 120, 56, 119, 28, 
+ 	113, 76, 118, 75, 71)
> 	
> 	# ecdfplot
> 	par(mfrow = c(2, 1))
> 	ecdfplot(rubble, t_id, c_id_before, "Before matching")
> 	ecdfplot(rubble, t_id, c_id_after, "After matching")
> 
> 
> 
> graphics::par(get("par.postscript", pos = 'CheckExEnv'))
> cleanEx()

detaching ‘germancities’

> nameEx("finetab")
> ### * finetab
> 
> flush(stderr()); flush(stdout())
> 
> ### Name: finetab
> ### Title: Tabulate the marginal distribution of a nominal covariate after
> ###   matching
> ### Aliases: finetab
> 
> ### ** Examples
> 	
> 	# Load data
> 	data(germancities)
> 
> 	# Sort and attach data
> 	germancities = germancities[order(germancities$treat, decreasing = TRUE), ]
> 	attach(germancities)
> 
> 	# Treatment indicator
> 	t_ind = treat
> 	
> 	# Indexes of the treated units
> 	t_id = which(t_ind == 1)
> 
> 	# Indixes of the matched controls (obtained using bmatch in designmatch)
> 	c_id = c(80, 82, 35, 59, 69, 68, 34, 62, 104, 61, 106, 120, 56, 119, 28, 
+ 	113, 76, 118, 75, 71)
>  
>  	# finetab
> 	finetab(publicat, t_id, c_id)
   Units
Cat T C
  1 0 0
  2 2 2
  3 9 9
  4 7 7
  5 1 1
  6 1 1
> 	finetab(busiservcat, t_id, c_id)
   Units
Cat  T  C
  1  0  0
  2  0  0
  3  2  2
  4 14 14
  5  4  4
  6  0  0
> 
> 
> 
> cleanEx()

detaching ‘germancities’

> nameEx("loveplot")
> ### * loveplot
> 
> flush(stderr()); flush(stdout())
> 
> ### Name: loveplot
> ### Title: Love plot for assessing covariate balance
> ### Aliases: loveplot
> 
> ### ** Examples
> 
> 	# Load data
> 	data(germancities)
> 
> 	# Sort and attach data
> 	germancities = germancities[order(germancities$treat, decreasing = TRUE), ]
> 	attach(germancities)
> 
> 	# Treatment indicator
> 	t_ind = treat
> 	
> 	# Indexes of the treated units
> 	t_id = which(t_ind == 1)
> 
> 	# Matrix of covariates
> 	X_mat = cbind(log2pop, popgrowth1939, popgrowth3339, emprate, indrate, 
+ 	rubble, rubblemiss, flats, flatsmiss, refugees)
> 
> 	# Indices of the matched controls (obtained using bmatch in designmatch)
> 	c_id = c(67, 75, 39, 104, 38, 93, 79, 59, 64, 55, 106, 99, 97, 61, 82, 57, 76, 47, 46, 49)
>  
> 	# Vertical line for satisfactory balance
> 	vline = 0.15
> 	
>  	# loveplot
> 	loveplot(X_mat, t_id, c_id, vline) 
> 
> 
> 
> cleanEx()

detaching ‘germancities’

> nameEx("meantab")
> ### * meantab
> 
> flush(stderr()); flush(stdout())
> 
> ### Name: meantab
> ### Title: Tabulate means of covariates after matching
> ### Aliases: meantab
> 
> ### ** Examples
> 
> 	# Load data
> 	data(germancities)
> 
> 	# Sort and attach data
> 	germancities = germancities[order(germancities$treat, decreasing = TRUE), ]
> 	attach(germancities)
> 
> 	# Treatment indicator
> 	t_ind = treat
> 	
> 	# Indexes of the treated units
> 	t_id = which(t_ind == 1)
> 
> 	# Matrix of covariates
> 	X_mat = cbind(log2pop, popgrowth1939, popgrowth3339, emprate, indrate, rubble, 
+ 	rubblemiss, flats, flatsmiss, refugees)
> 
> 	# Indices of the matched controls (obtained using bmatch in designmatch)
> 	c_id = c(67, 75, 39, 104, 38, 93, 79, 59, 64, 55, 106, 99, 97, 61, 82, 57, 
+ 	76, 47, 46, 49)
>  
>  	# meantab
> 	meantab(X_mat, t_ind, t_id, c_id)
              Mis   Min   Max Mean T Mean C Std Dif P-val
log2pop         0 14.66 19.60  16.17  16.04    0.10  0.74
popgrowth1939   0  1.08  1.75   1.36   1.33    0.12  0.62
popgrowth3339   0  0.97  1.36   1.13   1.11    0.15  0.61
emprate         0  0.36  0.51   0.44   0.45   -0.02  0.95
indrate         0  0.26  0.73   0.49   0.50   -0.03  0.93
rubble          0  0.10 30.30   7.55   7.55    0.00  1.00
rubblemiss      0  0.00  0.00   0.00   0.00      NA    NA
flats           0  1.30 95.60  31.50  31.50    0.00  1.00
flatsmiss       0  0.00  0.00   0.00   0.00      NA    NA
refugees        0  9.30 38.80  26.16  26.17    0.00  1.00
> 	
> 	# meantab
> 	meantab(X_mat, t_ind, t_id, c_id, exact = c(rep("w", 6), "f", "w", "f", "w"), digits = 3)
Warning in wilcox.test.default(yes, no) :
  cannot compute exact p-value with ties
Warning in wilcox.test.default(yes, no) :
  cannot compute exact p-value with ties
Warning in wilcox.test.default(yes, no) :
  cannot compute exact p-value with ties
              Mis    Min    Max Mean T Mean C Std Dif P-val
log2pop         0 14.664 19.605 16.174 16.042   0.098 0.758
popgrowth1939   0  1.083  1.755  1.357  1.333   0.122 0.883
popgrowth3339   0  0.967  1.365  1.130  1.113   0.149 0.883
emprate         0  0.358  0.508  0.445  0.446  -0.019 0.678
indrate         0  0.263  0.728  0.492  0.495  -0.025 0.841
rubble          0  0.100 30.297  7.551  7.550   0.000 0.871
rubblemiss      0  0.000  0.000  0.000  0.000      NA    NA
flats           0  1.300 95.600 31.497 31.503   0.000 0.839
flatsmiss       0  0.000  0.000  0.000  0.000      NA    NA
refugees        0  9.300 38.800 26.160 26.165  -0.001 0.607
> 
> 
> 
> cleanEx()

detaching ‘germancities’

> nameEx("nmatch")
> ### * nmatch
> 
> flush(stderr()); flush(stdout())
> 
> ### Name: nmatch
> ### Title: Optimal nonbipartite matching in randomized experiments and
> ###   observational studies
> ### Aliases: nmatch
> ### Keywords: Causal inference Matching Randomized experiment
> 
> ### ** Examples
>     
> 
> ## Uncomment the following example
> ## Load and attach data
> #data(lalonde)
> #attach(lalonde)
> 
> ################################# 
> ## Example: optimal subset matching
> ################################# 
> 
> ## Optimal subset matching pursues two competing goals at 
> ## the same time: to minimize the total of distances while 
> ## matching as many observations as possible.  The trade-off 
> ## between these two is regulated by the parameter subset_weight 
> ## (see Rosenbaum 2012 and Zubizarreta et al. 2013 for a discussion).
> ## Here the balance requirements are mean and fine balance for 
> ## different covariates.  We require 50 pairs to be matched.
> ## Again, the solver used is HiGHS with the approximate option.
> 
> ## Matrix of covariates
> #X_mat = cbind(age, education, black, hispanic, married, nodegree, re74, re75)
> 
> ## Distance matrix
> #dist_mat_covs = round(dist(X_mat, diag = TRUE, upper = TRUE), 1)
> #dist_mat = as.matrix(dist_mat_covs)
> 
> ## Subset matching weight
> #subset_weight = 1
> 
> ## Total pairs to be matched
> #total_pairs = 50
> 
> ## Moment balance: constrain differences in means to be at most .1 standard deviations apart
> #mom_covs = cbind(age, education)
> #mom_tols = apply(mom_covs, 2, sd)*.1
> #mom = list(covs = mom_covs, tols = mom_tols)
> 
> ## Solver options
> #t_max = 60*5
> #solver = "highs"
> #approximate = 1
> #solver = list(name = solver, t_max = t_max, approximate = approximate, round_cplex = 0, 
> #trace_cplex = 0)
> 
> ## Match                  
> #out = nmatch(dist_mat = dist_mat, subset_weight = subset_weight, total_pairs = total_pairs, 
> #mom = mom, solver = solver)              
>               
> ## Indices of the treated units and matched controls
> #id_1 = out$id_1  
> #id_2 = out$id_2	
> 
> ## Assess mean balance
> #a = apply(mom_covs[id_1, ], 2, mean)
> #b = apply(mom_covs[id_2, ], 2, mean)
> #tab = round(cbind(a, b, a-b, mom_tols), 2)
> #colnames(tab) = c("Mean 1", "Mean 2", "Diffs", "Tols")
> #tab
> 
> ## Assess fine balance (note here we are getting an approximate solution)
> #for (i in 1:ncol(fine_covs)) {		
> #	print(finetab(fine_covs[, i], id_1, id_2))
> #}
> 
> 
> 
> cleanEx()
> nameEx("pairsplot")
> ### * pairsplot
> 
> flush(stderr()); flush(stdout())
> 
> ### Name: pairsplot
> ### Title: Pairs plot for visualizing matched pairs
> ### Aliases: pairsplot
> 
> ### ** Examples
> 
> 	# Load data
> 	data(germancities)
> 
> 	# Sort and attach data
> 	germancities = germancities[order(germancities$treat, decreasing = TRUE), ]
> 	attach(germancities)
> 
> 	# Treatment indicator
> 	t_ind = treat
> 	
> 	# Indexes of the treated units
> 	t_id = which(t_ind == 1)
> 	
> 	# Indices of the matched controls (obtained using bmatch in designmatch)
> 	c_id = c(67, 75, 39, 104, 38, 93, 79, 59, 64, 55, 106, 99, 97, 61, 82, 
+ 	57, 76, 47, 46, 49)
>  
> 	# pairsplot	
> 	pairsplot(rubble, flats, t_id, c_id, "Rubble", "Flats", "")
> 
> 
> 
> cleanEx()

detaching ‘germancities’

> nameEx("profmatch")
> ### * profmatch
> 
> flush(stderr()); flush(stdout())
> 
> ### Name: profmatch
> ### Title: Optimal profile matching
> ### Aliases: profmatch
> ### Keywords: Causal inference Instrumental variable Matching Regression
> ###   discontinuity Observational study
> 
> ### ** Examples
> 
> 	
> ### Load, sort, and attach data
> #data(lalonde)
> #lalonde = lalonde[order(lalonde$treatment, decreasing = TRUE), ]
> #attach(lalonde)
> 
> ### Specify covariates
> #covs = c("age", "education", "black", "hispanic", "married", "nodegree", "re74", "re75")
> 
> ### Vector of treatment group indicators
> #t_ind = lalonde$treatment
> 
> ### Covariate matrix
> #mom_covs = as.matrix(lalonde[, covs])
> 
> ### Tolerances will be 0.05 * each covariate's standard deviation
> #mom_sds = apply(lalonde[, covs], 2, sd)
> #mom_tols = 0.05 * mom_sds
> 
> ### Target moments will be the overall means in the sample
> #mom_targets = colMeans(lalonde[, covs])
> 
> ### Solver options
> #t_max = 60*30
> #solver = "gurobi"
> #approximate = 0
> #solver = list(name = solver, t_max = t_max, approximate = approximate, round_cplex = 0, trace = 0)
> 
> #mom = list(covs = mom_covs, tols = mom_tols, targets = mom_targets)
> #pmatch_out = profmatch(t_ind, mom, solver)
> 
> ### Selecting the matched units
> #lalonde.matched = lalonde[pmatch_out$id,]
> 
> ### Comparing TASMDs before and after matching
> #TASMD.0.2 = abs(colMeans(lalonde.matched[which(lalonde.matched$treatment == 0), covs]) 
> #                    - mom_targets) / mom_sds
> #TASMD.1.2 = abs(colMeans(lalonde.matched[which(lalonde.matched$treatment == 1), covs]) 
> #                    - mom_targets) / mom_sds
> 
> #TASMD.0.1 = abs(colMeans(lalonde[which(lalonde$treatment == 0), covs]) - mom_targets) / mom_sds
> #TASMD.1.1 = abs(colMeans(lalonde[which(lalonde$treatment == 1), covs]) - mom_targets) / mom_sds
> 
> ### For each treatment group, ASAMDs are reduced after matching (i.e., balance is achieved)
> #cbind(TASMD.0.1, TASMD.0.2)
> #cbind(TASMD.1.1, TASMD.1.2)
> 
> 
> 
> 
> ### * <FOOTER>
> ###
> cleanEx()
> options(digits = 7L)
> base::cat("Time elapsed: ", proc.time() - base::get("ptime", pos = 'CheckExEnv'),"\n")
Time elapsed:  28.131 0.949 86.571 0 0 
> grDevices::dev.off()
null device 
          1 
> ###
> ### Local variables: ***
> ### mode: outline-minor ***
> ### outline-regexp: "\\(> \\)?### [*]+" ***
> ### End: ***
> quit('no')