Nov 28 00:48:40.771 INFO checking megesdal/bedtree-rs against try#db42d4dad33013eba11ef37342ad9f614e5652b8 for pr-56074
Nov 28 00:48:40.771 INFO running `"docker" "create" "-v" "/mnt/big/crater/work/local/target-dirs/pr-56074/worker-1/try#db42d4dad33013eba11ef37342ad9f614e5652b8:/target:rw,Z" "-v" "/mnt/big/crater/work/local/test-source/worker-1/pr-56074/try#db42d4dad33013eba11ef37342ad9f614e5652b8:/source:ro,Z" "-v" "/mnt/big/crater/work/local/cargo-home:/cargo-home:ro,Z" "-v" "/mnt/big/crater/work/local/rustup-home:/rustup-home:ro,Z" "-e" "USER_ID=1000" "-e" "SOURCE_DIR=/source" "-e" "USER_ID=1000" "-e" "CMD=cargo +db42d4dad33013eba11ef37342ad9f614e5652b8-alt check --frozen --all --all-targets" "-e" "CARGO_TARGET_DIR=/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/cargo-home" "-e" "RUSTUP_HOME=/rustup-home" "-m" "1536M" "--network" "none" "crater"`
Nov 28 00:48:40.981 INFO [stdout] 34ea0eae5da2221387aec900b4cd059358329f9b99c57eb79d1df143a4eaf569
Nov 28 00:48:40.982 INFO running `"docker" "start" "-a" "34ea0eae5da2221387aec900b4cd059358329f9b99c57eb79d1df143a4eaf569"`
Nov 28 00:48:41.381 INFO [stderr] usermod: no changes
Nov 28 00:48:41.412 INFO [stderr]     Checking hello_world v0.0.1 (/source)
Nov 28 00:48:41.711 INFO [stderr] warning: unused import: `max`
Nov 28 00:48:41.711 INFO [stderr]  --> src/main.rs:2:16
Nov 28 00:48:41.711 INFO [stderr]   |
Nov 28 00:48:41.711 INFO [stderr] 2 | use std::cmp::{max, min, Ordering};
Nov 28 00:48:41.711 INFO [stderr]   |                ^^^
Nov 28 00:48:41.712 INFO [stderr]   |
Nov 28 00:48:41.712 INFO [stderr]   = note: #[warn(unused_imports)] on by default
Nov 28 00:48:41.712 INFO [stderr] 
Nov 28 00:48:41.740 INFO [stderr] warning: unused import: `max`
Nov 28 00:48:41.740 INFO [stderr]  --> src/main.rs:2:16
Nov 28 00:48:41.740 INFO [stderr]   |
Nov 28 00:48:41.740 INFO [stderr] 2 | use std::cmp::{max, min, Ordering};
Nov 28 00:48:41.740 INFO [stderr]   |                ^^^
Nov 28 00:48:41.740 INFO [stderr]   |
Nov 28 00:48:41.740 INFO [stderr]   = note: #[warn(unused_imports)] on by default
Nov 28 00:48:41.740 INFO [stderr] 
Nov 28 00:48:41.776 INFO [stderr] warning: unused variable: `node_to_insert`
Nov 28 00:48:41.776 INFO [stderr]    --> src/main.rs:114:14
Nov 28 00:48:41.776 INFO [stderr]     |
Nov 28 00:48:41.776 INFO [stderr] 114 |         let (node_to_insert, insert_idx) = match split_result {
Nov 28 00:48:41.776 INFO [stderr]     |              ^^^^^^^^^^^^^^ help: consider using `_node_to_insert` instead
Nov 28 00:48:41.776 INFO [stderr]     |
Nov 28 00:48:41.776 INFO [stderr]     = note: #[warn(unused_variables)] on by default
Nov 28 00:48:41.776 INFO [stderr] 
Nov 28 00:48:41.776 INFO [stderr] warning: unused variable: `insert_idx`
Nov 28 00:48:41.776 INFO [stderr]    --> src/main.rs:114:30
Nov 28 00:48:41.776 INFO [stderr]     |
Nov 28 00:48:41.776 INFO [stderr] 114 |         let (node_to_insert, insert_idx) = match split_result {
Nov 28 00:48:41.776 INFO [stderr]     |                              ^^^^^^^^^^ help: consider using `_insert_idx` instead
Nov 28 00:48:41.776 INFO [stderr] 
Nov 28 00:48:41.776 INFO [stderr] warning: unused variable: `q`
Nov 28 00:48:41.776 INFO [stderr]    --> src/main.rs:125:68
Nov 28 00:48:41.776 INFO [stderr]     |
Nov 28 00:48:41.776 INFO [stderr] 125 |     fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str)
Nov 28 00:48:41.776 INFO [stderr]     |                                                                    ^ help: consider using `_q` instead
Nov 28 00:48:41.776 INFO [stderr] 
Nov 28 00:48:41.791 INFO [stderr] warning: struct is never constructed: `BPlusTree`
Nov 28 00:48:41.791 INFO [stderr]   --> src/main.rs:42:1
Nov 28 00:48:41.791 INFO [stderr]    |
Nov 28 00:48:41.791 INFO [stderr] 42 | struct BPlusTree<'a> {
Nov 28 00:48:41.791 INFO [stderr]    | ^^^^^^^^^^^^^^^^^^^^
Nov 28 00:48:41.791 INFO [stderr]    |
Nov 28 00:48:41.791 INFO [stderr]    = note: #[warn(dead_code)] on by default
Nov 28 00:48:41.791 INFO [stderr] 
Nov 28 00:48:41.791 INFO [stderr] warning: struct is never constructed: `BPlusTreeNode`
Nov 28 00:48:41.791 INFO [stderr]   --> src/main.rs:48:1
Nov 28 00:48:41.791 INFO [stderr]    |
Nov 28 00:48:41.791 INFO [stderr] 48 | struct BPlusTreeNode<'a> {
Nov 28 00:48:41.791 INFO [stderr]    | ^^^^^^^^^^^^^^^^^^^^^^^^
Nov 28 00:48:41.791 INFO [stderr] 
Nov 28 00:48:41.791 INFO [stderr] warning: method is never used: `is_leaf_node`
Nov 28 00:48:41.791 INFO [stderr]   --> src/main.rs:57:5
Nov 28 00:48:41.791 INFO [stderr]    |
Nov 28 00:48:41.791 INFO [stderr] 57 |     fn is_leaf_node(&self) -> bool {
Nov 28 00:48:41.791 INFO [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Nov 28 00:48:41.791 INFO [stderr] 
Nov 28 00:48:41.791 INFO [stderr] warning: method is never used: `insert`
Nov 28 00:48:41.791 INFO [stderr]   --> src/main.rs:64:5
Nov 28 00:48:41.791 INFO [stderr]    |
Nov 28 00:48:41.791 INFO [stderr] 64 |     fn insert(&'a self, q: &str) -> &'a BPlusTreeNode<'a> {
Nov 28 00:48:41.791 INFO [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Nov 28 00:48:41.791 INFO [stderr] 
Nov 28 00:48:41.791 INFO [stderr] warning: method is never used: `find_node`
Nov 28 00:48:41.792 INFO [stderr]   --> src/main.rs:70:5
Nov 28 00:48:41.792 INFO [stderr]    |
Nov 28 00:48:41.792 INFO [stderr] 70 |     fn find_node(&'a self, q: &str, node: &'a BPlusTreeNode<'a>) -> &'a BPlusTreeNode<'a> {
Nov 28 00:48:41.792 INFO [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Nov 28 00:48:41.792 INFO [stderr] 
Nov 28 00:48:41.792 INFO [stderr] warning: function is never used: `check_split`
Nov 28 00:48:41.792 INFO [stderr]   --> src/main.rs:75:13
Nov 28 00:48:41.792 INFO [stderr]    |
Nov 28 00:48:41.792 INFO [stderr] 75 | /             fn check_split<'a>(tree: &'a BPlusTree<'a>, q: &str, node: &'a BPlusTreeNode<'a>,
Nov 28 00:48:41.792 INFO [stderr] 76 | |                                child_idx: usize) -> &'a BPlusTreeNode<'a> {
Nov 28 00:48:41.792 INFO [stderr] 77 | |                 if child_idx == node.splits.len() {
Nov 28 00:48:41.792 INFO [stderr] 78 | |                     tree.find_node(q, &node.children[node.splits.len()])
Nov 28 00:48:41.792 INFO [stderr] ...  |
Nov 28 00:48:41.792 INFO [stderr] 83 | |                 }
Nov 28 00:48:41.792 INFO [stderr] 84 | |             };
Nov 28 00:48:41.792 INFO [stderr]    | |_____________^
Nov 28 00:48:41.792 INFO [stderr] 
Nov 28 00:48:41.792 INFO [stderr] warning: method is never used: `rec_insert`
Nov 28 00:48:41.792 INFO [stderr]    --> src/main.rs:89:5
Nov 28 00:48:41.792 INFO [stderr]     |
Nov 28 00:48:41.792 INFO [stderr] 89  | /     fn rec_insert(&'a self, q: &str, parent: &'a BPlusTreeNode<'a>,
Nov 28 00:48:41.792 INFO [stderr] 90  | |                   child: Option<&'a BPlusTreeNode>) -> &'a BPlusTreeNode<'a> {
Nov 28 00:48:41.792 INFO [stderr] 91  | |
Nov 28 00:48:41.792 INFO [stderr] 92  | |         // TODO: recursive closure via struct?
Nov 28 00:48:41.792 INFO [stderr] ...   |
Nov 28 00:48:41.792 INFO [stderr] 122 | |         parent
Nov 28 00:48:41.792 INFO [stderr] 123 | |     }
Nov 28 00:48:41.792 INFO [stderr]     | |_____^
Nov 28 00:48:41.792 INFO [stderr] 
Nov 28 00:48:41.792 INFO [stderr] warning: function is never used: `find_insert_loc`
Nov 28 00:48:41.792 INFO [stderr]    --> src/main.rs:93:9
Nov 28 00:48:41.792 INFO [stderr]     |
Nov 28 00:48:41.792 INFO [stderr] 93  | /         fn find_insert_loc<'a>(compare: fn(&str,&str)->Ordering, splits: &Vec<&str>, idx: usize,
Nov 28 00:48:41.792 INFO [stderr] 94  | |                                q: &str, child: Option<&'a BPlusTreeNode>) -> (usize, bool) {
Nov 28 00:48:41.792 INFO [stderr] 95  | |             if idx == splits.len() {
Nov 28 00:48:41.792 INFO [stderr] 96  | |                 (splits.len(), true)
Nov 28 00:48:41.792 INFO [stderr] ...   |
Nov 28 00:48:41.792 INFO [stderr] 103 | |             }
Nov 28 00:48:41.792 INFO [stderr] 104 | |         }
Nov 28 00:48:41.792 INFO [stderr]     | |_________^
Nov 28 00:48:41.792 INFO [stderr] 
Nov 28 00:48:41.792 INFO [stderr] warning: method is never used: `split_if_necessary`
Nov 28 00:48:41.792 INFO [stderr]    --> src/main.rs:125:5
Nov 28 00:48:41.792 INFO [stderr]     |
Nov 28 00:48:41.792 INFO [stderr] 125 | /     fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str)
Nov 28 00:48:41.792 INFO [stderr] 126 | |                           -> (Option<&'a BPlusTreeNode<'a>>, bool) {
Nov 28 00:48:41.792 INFO [stderr] 127 | |         let should_split = parent.splits.len() == self.branch_factor - 1;
Nov 28 00:48:41.792 INFO [stderr] 128 | |         if !should_split {
Nov 28 00:48:41.792 INFO [stderr] ...   |
Nov 28 00:48:41.792 INFO [stderr] 133 | |         }
Nov 28 00:48:41.792 INFO [stderr] 134 | |     }
Nov 28 00:48:41.792 INFO [stderr]     | |_____^
Nov 28 00:48:41.792 INFO [stderr] 
Nov 28 00:48:41.792 INFO [stderr] warning: function is never used: `verify_edit_distance`
Nov 28 00:48:41.792 INFO [stderr]    --> src/main.rs:137:1
Nov 28 00:48:41.792 INFO [stderr]     |
Nov 28 00:48:41.792 INFO [stderr] 137 | fn verify_edit_distance(x: &str, y: &str, distance_threshold: usize) -> Option<usize> {
Nov 28 00:48:41.792 INFO [stderr]     | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Nov 28 00:48:41.792 INFO [stderr] 
Nov 28 00:48:41.792 INFO [stderr] warning: function is never used: `create_verification_table`
Nov 28 00:48:41.792 INFO [stderr]    --> src/main.rs:171:1
Nov 28 00:48:41.792 INFO [stderr]     |
Nov 28 00:48:41.792 INFO [stderr] 171 | / fn create_verification_table<F>(
Nov 28 00:48:41.792 INFO [stderr] 172 | |     nrows: usize,
Nov 28 00:48:41.792 INFO [stderr] 173 | |     ncols: usize,
Nov 28 00:48:41.792 INFO [stderr] 174 | |     distance_threshold: usize,
Nov 28 00:48:41.792 INFO [stderr] ...   |
Nov 28 00:48:41.792 INFO [stderr] 225 | |     (row0, Some(m))
Nov 28 00:48:41.792 INFO [stderr] 226 | | }
Nov 28 00:48:41.792 INFO [stderr]     | |_^
Nov 28 00:48:41.792 INFO [stderr] 
Nov 28 00:48:41.828 INFO [stderr] warning: unused variable: `node_to_insert`
Nov 28 00:48:41.828 INFO [stderr]    --> src/main.rs:114:14
Nov 28 00:48:41.828 INFO [stderr]     |
Nov 28 00:48:41.828 INFO [stderr] 114 |         let (node_to_insert, insert_idx) = match split_result {
Nov 28 00:48:41.828 INFO [stderr]     |              ^^^^^^^^^^^^^^ help: consider using `_node_to_insert` instead
Nov 28 00:48:41.828 INFO [stderr]     |
Nov 28 00:48:41.828 INFO [stderr]     = note: #[warn(unused_variables)] on by default
Nov 28 00:48:41.828 INFO [stderr] 
Nov 28 00:48:41.828 INFO [stderr] warning: unused variable: `insert_idx`
Nov 28 00:48:41.828 INFO [stderr]    --> src/main.rs:114:30
Nov 28 00:48:41.828 INFO [stderr]     |
Nov 28 00:48:41.828 INFO [stderr] 114 |         let (node_to_insert, insert_idx) = match split_result {
Nov 28 00:48:41.828 INFO [stderr]     |                              ^^^^^^^^^^ help: consider using `_insert_idx` instead
Nov 28 00:48:41.828 INFO [stderr] 
Nov 28 00:48:41.828 INFO [stderr] warning: unused variable: `q`
Nov 28 00:48:41.828 INFO [stderr]    --> src/main.rs:125:68
Nov 28 00:48:41.828 INFO [stderr]     |
Nov 28 00:48:41.828 INFO [stderr] 125 |     fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str)
Nov 28 00:48:41.828 INFO [stderr]     |                                                                    ^ help: consider using `_q` instead
Nov 28 00:48:41.828 INFO [stderr] 
Nov 28 00:48:41.848 INFO [stderr] warning: struct is never constructed: `BPlusTree`
Nov 28 00:48:41.848 INFO [stderr]   --> src/main.rs:42:1
Nov 28 00:48:41.848 INFO [stderr]    |
Nov 28 00:48:41.848 INFO [stderr] 42 | struct BPlusTree<'a> {
Nov 28 00:48:41.848 INFO [stderr]    | ^^^^^^^^^^^^^^^^^^^^
Nov 28 00:48:41.848 INFO [stderr]    |
Nov 28 00:48:41.848 INFO [stderr]    = note: #[warn(dead_code)] on by default
Nov 28 00:48:41.848 INFO [stderr] 
Nov 28 00:48:41.848 INFO [stderr] warning: struct is never constructed: `BPlusTreeNode`
Nov 28 00:48:41.848 INFO [stderr]   --> src/main.rs:48:1
Nov 28 00:48:41.848 INFO [stderr]    |
Nov 28 00:48:41.848 INFO [stderr] 48 | struct BPlusTreeNode<'a> {
Nov 28 00:48:41.848 INFO [stderr]    | ^^^^^^^^^^^^^^^^^^^^^^^^
Nov 28 00:48:41.848 INFO [stderr] 
Nov 28 00:48:41.848 INFO [stderr] warning: method is never used: `is_leaf_node`
Nov 28 00:48:41.848 INFO [stderr]   --> src/main.rs:57:5
Nov 28 00:48:41.848 INFO [stderr]    |
Nov 28 00:48:41.848 INFO [stderr] 57 |     fn is_leaf_node(&self) -> bool {
Nov 28 00:48:41.848 INFO [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Nov 28 00:48:41.848 INFO [stderr] 
Nov 28 00:48:41.848 INFO [stderr] warning: method is never used: `insert`
Nov 28 00:48:41.848 INFO [stderr]   --> src/main.rs:64:5
Nov 28 00:48:41.848 INFO [stderr]    |
Nov 28 00:48:41.848 INFO [stderr] 64 |     fn insert(&'a self, q: &str) -> &'a BPlusTreeNode<'a> {
Nov 28 00:48:41.848 INFO [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Nov 28 00:48:41.848 INFO [stderr] 
Nov 28 00:48:41.848 INFO [stderr] warning: method is never used: `find_node`
Nov 28 00:48:41.848 INFO [stderr]   --> src/main.rs:70:5
Nov 28 00:48:41.848 INFO [stderr]    |
Nov 28 00:48:41.848 INFO [stderr] 70 |     fn find_node(&'a self, q: &str, node: &'a BPlusTreeNode<'a>) -> &'a BPlusTreeNode<'a> {
Nov 28 00:48:41.848 INFO [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Nov 28 00:48:41.848 INFO [stderr] 
Nov 28 00:48:41.848 INFO [stderr] warning: function is never used: `check_split`
Nov 28 00:48:41.848 INFO [stderr]   --> src/main.rs:75:13
Nov 28 00:48:41.848 INFO [stderr]    |
Nov 28 00:48:41.848 INFO [stderr] 75 | /             fn check_split<'a>(tree: &'a BPlusTree<'a>, q: &str, node: &'a BPlusTreeNode<'a>,
Nov 28 00:48:41.848 INFO [stderr] 76 | |                                child_idx: usize) -> &'a BPlusTreeNode<'a> {
Nov 28 00:48:41.848 INFO [stderr] 77 | |                 if child_idx == node.splits.len() {
Nov 28 00:48:41.848 INFO [stderr] 78 | |                     tree.find_node(q, &node.children[node.splits.len()])
Nov 28 00:48:41.848 INFO [stderr] ...  |
Nov 28 00:48:41.848 INFO [stderr] 83 | |                 }
Nov 28 00:48:41.848 INFO [stderr] 84 | |             };
Nov 28 00:48:41.848 INFO [stderr]    | |_____________^
Nov 28 00:48:41.848 INFO [stderr] 
Nov 28 00:48:41.850 INFO [stderr] warning: method is never used: `rec_insert`
Nov 28 00:48:41.852 INFO [stderr]    --> src/main.rs:89:5
Nov 28 00:48:41.852 INFO [stderr]     |
Nov 28 00:48:41.852 INFO [stderr] 89  | /     fn rec_insert(&'a self, q: &str, parent: &'a BPlusTreeNode<'a>,
Nov 28 00:48:41.852 INFO [stderr] 90  | |                   child: Option<&'a BPlusTreeNode>) -> &'a BPlusTreeNode<'a> {
Nov 28 00:48:41.852 INFO [stderr] 91  | |
Nov 28 00:48:41.852 INFO [stderr] 92  | |         // TODO: recursive closure via struct?
Nov 28 00:48:41.852 INFO [stderr] ...   |
Nov 28 00:48:41.852 INFO [stderr] 122 | |         parent
Nov 28 00:48:41.852 INFO [stderr] 123 | |     }
Nov 28 00:48:41.852 INFO [stderr]     | |_____^
Nov 28 00:48:41.852 INFO [stderr] 
Nov 28 00:48:41.852 INFO [stderr] warning: function is never used: `find_insert_loc`
Nov 28 00:48:41.852 INFO [stderr]    --> src/main.rs:93:9
Nov 28 00:48:41.852 INFO [stderr]     |
Nov 28 00:48:41.852 INFO [stderr] 93  | /         fn find_insert_loc<'a>(compare: fn(&str,&str)->Ordering, splits: &Vec<&str>, idx: usize,
Nov 28 00:48:41.852 INFO [stderr] 94  | |                                q: &str, child: Option<&'a BPlusTreeNode>) -> (usize, bool) {
Nov 28 00:48:41.852 INFO [stderr] 95  | |             if idx == splits.len() {
Nov 28 00:48:41.852 INFO [stderr] 96  | |                 (splits.len(), true)
Nov 28 00:48:41.852 INFO [stderr] ...   |
Nov 28 00:48:41.852 INFO [stderr] 103 | |             }
Nov 28 00:48:41.852 INFO [stderr] 104 | |         }
Nov 28 00:48:41.852 INFO [stderr]     | |_________^
Nov 28 00:48:41.852 INFO [stderr] 
Nov 28 00:48:41.852 INFO [stderr] warning: method is never used: `split_if_necessary`
Nov 28 00:48:41.852 INFO [stderr]    --> src/main.rs:125:5
Nov 28 00:48:41.852 INFO [stderr]     |
Nov 28 00:48:41.852 INFO [stderr] 125 | /     fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str)
Nov 28 00:48:41.852 INFO [stderr] 126 | |                           -> (Option<&'a BPlusTreeNode<'a>>, bool) {
Nov 28 00:48:41.852 INFO [stderr] 127 | |         let should_split = parent.splits.len() == self.branch_factor - 1;
Nov 28 00:48:41.852 INFO [stderr] 128 | |         if !should_split {
Nov 28 00:48:41.852 INFO [stderr] ...   |
Nov 28 00:48:41.852 INFO [stderr] 133 | |         }
Nov 28 00:48:41.852 INFO [stderr] 134 | |     }
Nov 28 00:48:41.852 INFO [stderr]     | |_____^
Nov 28 00:48:41.852 INFO [stderr] 
Nov 28 00:48:41.861 INFO [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 0.46s
Nov 28 00:48:41.862 INFO [stderr] su: No module specific data is present
Nov 28 00:48:42.094 INFO running `"docker" "inspect" "34ea0eae5da2221387aec900b4cd059358329f9b99c57eb79d1df143a4eaf569"`
Nov 28 00:48:42.148 INFO running `"docker" "rm" "-f" "34ea0eae5da2221387aec900b4cd059358329f9b99c57eb79d1df143a4eaf569"`
Nov 28 00:48:42.263 INFO [stdout] 34ea0eae5da2221387aec900b4cd059358329f9b99c57eb79d1df143a4eaf569