OverviewCakeML:b4ecf332bf00bd322db04077a28ce3b05745e85e
Fix incorrect ag32 paths in build-sequence
#554 (tiny)
Merging into:9b491cb24bd22174a6c514574e4bb6c057eafe2f
Rename "backend_correct" to "encoder_correct"
HOL:57ef4df497757f622a7fe2bfeda16116585da6d4
Update experimental kernel for world free of Globals.priming
Machine:oven2 4.13.0-37-generic x86_64 GNU/Linux
Claimed job
Reusing HOL
Starting developers/bin
Finished developers/bin 33s 140MB
Starting semantics/ffi
Finished semantics/ffi 10s 269MB
Starting semantics
Finished semantics 1m19s 895MB
Starting semantics/proofs
Finished semantics/proofs 3m09s 1GB
Starting basis/pure
Finished basis/pure 55s 640MB
Starting translator
Finished translator 3m13s 1GB
Starting compiler/parsing
Finished compiler/parsing 1m26s 1GB
Starting characteristic
Finished characteristic 2m37s 1GB
Starting translator/monadic
Finished translator/monadic 1m29s 1GB
Starting basis
Finished basis 18m45s 2GB
Starting compiler/inference
Finished compiler/inference 1m31s 1GB
Starting compiler/backend/reg_alloc
Finished compiler/backend/reg_alloc 52s 1GB
Starting compiler/backend/gc
Finished compiler/backend/gc 7m32s 1GB
Starting compiler/backend
Finished compiler/backend 2s 16MB
Starting compiler/encoders/asm
Finished compiler/encoders/asm 0s 12MB
Starting compiler/encoders/x64
Finished compiler/encoders/x64 17s 370MB
Starting compiler/encoders/arm6
Finished compiler/encoders/arm6 49s 440MB
Starting compiler/encoders/arm8
Finished compiler/encoders/arm8 7s 418MB
Starting compiler/encoders/mips
Finished compiler/encoders/mips 9s 527MB
Starting compiler/encoders/riscv
Finished compiler/encoders/riscv 8s 412MB
Starting compiler/encoders/ag32
Finished compiler/encoders/ag32 17s 667MB
Starting compiler/backend/x64
Finished compiler/backend/x64 19s 895MB
Starting compiler/backend/arm6
Finished compiler/backend/arm6 21s 1GB
Starting compiler/backend/arm8
Finished compiler/backend/arm8 20s 977MB
Starting compiler/backend/mips
Finished compiler/backend/mips 19s 1GB
Starting compiler/backend/riscv
Finished compiler/backend/riscv 19s 1GB
Starting compiler/backend/ag32
Finished compiler/backend/ag32 1m20s 1GB
Starting compiler/parsing/proofs
Finished compiler/parsing/proofs 6m31s 1GB
Starting compiler/inference/proofs
Finished compiler/inference/proofs 3m19s 1GB
Starting compiler/backend/semantics
Finished compiler/backend/semantics 11m04s 1GB
Starting compiler/backend/reg_alloc/proofs
Finished compiler/backend/reg_alloc/proofs 2m53s 577MB
Starting compiler/backend/proofs
Finished compiler/backend/proofs 58m18s 3GB
Starting compiler/encoders/x64/proofs
Finished compiler/encoders/x64/proofs 9m53s 889MB
Starting compiler/encoders/arm6/proofs
Finished compiler/encoders/arm6/proofs 15m49s 767MB
Starting compiler/encoders/arm8/proofs
Finished compiler/encoders/arm8/proofs 7m00s 694MB
Starting compiler/encoders/mips/proofs
Finished compiler/encoders/mips/proofs 11m02s 2GB
Starting compiler/encoders/riscv/proofs
Finished compiler/encoders/riscv/proofs 9m01s 798MB
Starting compiler/encoders/ag32/proofs
Finished compiler/encoders/ag32/proofs 3m09s 629MB
Starting compiler/backend/x64/proofs
Finished compiler/backend/x64/proofs 20s 784MB
Starting compiler/backend/arm6/proofs
Finished compiler/backend/arm6/proofs 24s 1GB
Starting compiler/backend/arm8/proofs
Finished compiler/backend/arm8/proofs 21s 1GB
Starting compiler/backend/mips/proofs
Finished compiler/backend/mips/proofs 22s 1GB
Starting compiler/backend/riscv/proofs
Finished compiler/backend/riscv/proofs 21s 1GB
Starting compiler/backend/ag32/proofs
Finished compiler/backend/ag32/proofs 11m21s 2GB
Starting compiler/proofs
Finished compiler/proofs 1m32s 1GB
Starting candle/set-theory
Finished candle/set-theory 28s 592MB
Starting candle/syntax-lib
Finished candle/syntax-lib 10s 640MB
Starting candle/standard/syntax
Finished candle/standard/syntax 1m43s 694MB
Starting candle/standard/semantics
Finished candle/standard/semantics 1m31s 908MB
Starting candle/standard/monadic
Finished candle/standard/monadic 1m49s 1GB
Starting candle/standard/ml_kernel
Finished candle/standard/ml_kernel 19m39s 3GB
Starting candle/standard/opentheory
Finished candle/standard/opentheory 8m56s 3GB
Starting candle/standard/opentheory/compilation
Finished candle/standard/opentheory/compilation 32m35s 13GB
Starting candle/standard/opentheory/compilation/proofs
Finished candle/standard/opentheory/compilation/proofs 37s 4GB
Starting characteristic/examples
Finished characteristic/examples 1m30s 1GB
Starting tutorial/solutions
Finished tutorial/solutions 13m35s 7GB
Starting translator/monadic/examples
Finished translator/monadic/examples 1m46s 2GB
Starting examples
Finished examples 5m55s 2GB
Starting examples/compilation/x64
Finished examples/compilation/x64 1h54m57s 8GB
Starting examples/compilation/x64/proofs
Finished examples/compilation/x64/proofs 1m52s 3GB
Starting examples/compilation/ag32
Finished examples/compilation/ag32 26m29s 4GB
Starting examples/compilation/ag32/proofs
Finished examples/compilation/ag32/proofs 25s 2GB
Starting compiler/benchmarks
Finished compiler/benchmarks 0s 4MB
Starting translator/okasaki-examples
FAILED: translator/okasaki-examples
]0;Holmake: ~/regression/HOL-57ef4df497757f622a7fe2bfeda16116585da6d4/examples/formal-languages/regular]0;Holmake: ~/regression/HOL-57ef4df497757f622a7fe2bfeda16116585da6d4/examples/formal-languages]0;Holmake: ~/regression/HOL-57ef4df497757f622a7fe2bfeda16116585da6d4/examples/formal-languages[1mWorking in $(HOLDIR)/examples/formal-languages[0m
]0;Holmake: ~/regression/HOL-57ef4df497757f622a7fe2bfeda16116585da6d4/examples/formal-languages/regular]0;Holmake: ~/regression/HOL-57ef4df497757f622a7fe2bfeda16116585da6d4/examples/formal-languages/context-free]0;Holmake: ~/regression/HOL-57ef4df497757f622a7fe2bfeda16116585da6d4/examples/formal-languages/context-free[1mWorking in $(HOLDIR)/examples/formal-languages/context-free[0m
]0;Holmake: ~/regression/HOL-57ef4df497757f622a7fe2bfeda16116585da6d4/examples/formal-languages/regular]0;Holmake: ~/regression/HOL-57ef4df497757f622a7fe2bfeda16116585da6d4/examples/formal-languages/regular[1mWorking in $(HOLDIR)/examples/formal-languages/regular[0m
]0;Holmake: ../../basis/pure]0;Holmake: ../../misc]0;Holmake: ~/regression/HOL-57ef4df497757f622a7fe2bfeda16116585da6d4/examples/fun-op-sem/lprefix_lub]0;Holmake: ~/regression/HOL-57ef4df497757f622a7fe2bfeda16116585da6d4/examples/fun-op-sem/lprefix_lub[1mWorking in $(HOLDIR)/examples/fun-op-sem/lprefix_lub[0m
]0;Holmake: ../../misc]0;Holmake: ~/regression/HOL-57ef4df497757f622a7fe2bfeda16116585da6d4/examples/machine-code/hoare-triple]0;Holmake: ~/regression/HOL-57ef4df497757f622a7fe2bfeda16116585da6d4/examples/machine-code/hoare-triple[1mWorking in $(HOLDIR)/examples/machine-code/hoare-triple[0m
]0;Holmake: ../../misc]0;Holmake: ../../developers]0;Holmake: ../../developers[1mWorking in ../../developers[0m
]0;Holmake: ../../misc]0;Holmake: ../../misc/lem_lib_stub]0;Holmake: ../../misc/lem_lib_stub[1mWorking in $(CAKEMLDIR)/misc/lem_lib_stub[0m
]0;Holmake: ../../misc]0;Holmake: ../../misc[1mWorking in $(CAKEMLDIR)/misc[0m
]0;Holmake: ../../basis/pure]0;Holmake: ../../basis/pure[1mWorking in $(CAKEMLDIR)/basis/pure[0m
]0;Holmake: ../../basis]0;Holmake: ../../characteristic]0;Holmake: ../../compiler/parsing]0;Holmake: ../../semantics]0;Holmake: ../../semantics/ffi]0;Holmake: ../../semantics/ffi[1mWorking in $(CAKEMLDIR)/semantics/ffi[0m
]0;Holmake: ../../semantics]0;Holmake: ../../semantics[1mWorking in $(CAKEMLDIR)/semantics[0m
]0;Holmake: ../../compiler/parsing]0;Holmake: ../../compiler/parsing[1mWorking in $(CAKEMLDIR)/compiler/parsing[0m
]0;Holmake: ../../characteristic]0;Holmake: ../../semantics/proofs]0;Holmake: ../../semantics/proofs[1mWorking in $(CAKEMLDIR)/semantics/proofs[0m
]0;Holmake: ../../characteristic]0;Holmake: ../../translator]0;Holmake: ../../semantics/alt_semantics/proofs]0;Holmake: ../../semantics/alt_semantics]0;Holmake: ../../semantics/alt_semantics[1mWorking in $(CAKEMLDIR)/semantics/alt_semantics[0m
]0;Holmake: ../../semantics/alt_semantics/proofs]0;Holmake: ../../semantics/alt_semantics/proofs[1mWorking in $(CAKEMLDIR)/semantics/alt_semantics/proofs[0m
]0;Holmake: ../../translator]0;Holmake: ../../translator[1mWorking in $(CAKEMLDIR)/translator[0m
]0;Holmake: ../../characteristic]0;Holmake: ../../characteristic[1mWorking in $(CAKEMLDIR)/characteristic[0m
]0;Holmake: ../../basis]0;Holmake: ../../translator/monadic]0;Holmake: ../../translator/monadic[1mWorking in $(CAKEMLDIR)/translator/monadic[0m
]0;Holmake: ../../basis]0;Holmake: ../../basis[1mWorking in $(CAKEMLDIR)/basis[0m
]0;Holmake: .]0;Holmake: .[1mWorking in $(CAKEMLDIR)/translator/okasaki-examples[0m
Starting work on heap
heap OK
Starting work on BankersQueueTheory
Starting work on BatchedQueueTheory
Starting work on okasaki_miscTheory
Starting work on HoodMelvilleQueueTheory
okasaki_miscTheory OK
Starting work on BinaryRandomAccessListsTheory
BatchedQueueTheory OK
Starting work on BinomialHeapTheory
BankersQueueTheory OK
Starting work on BottomUpMergeSortTheory
HoodMelvilleQueueTheory OK
Starting work on ImplicitQueueTheory
BinaryRandomAccessListsTheory OK
Starting work on LazyPairingHeapTheory
BottomUpMergeSortTheory FAILED! <1>
Proof of
leq size segs n seg.
WeakLinearOrder leq n 0 sortable_inv leq (size,segs) n
SORTED leq seg LENGTH seg = n
sortable_inv leq (size + 1,add_seg leq seg segs size) n
failed.
error in load BottomUpMergeSortScript : HOL_ERR {message = "on line 156, characters 14-16:\n\nType inference failure: unable to infer a type for the application of\n\n(LENGTH :\206\177 list -> num) :\206\177 list -> num\n\non line 156, characters 7-12\n\nto\n\n(seg :num -> num -> (\206\177, \206\178) path -> (\206\177, \206\178) path) :num -> num -> (\206\177, \206\178) path -> (\206\177, \206\178) path\n\non line 156, characters 14-16\n\nunification failure message: Attempt to unify different type operators: list$list and min$fun\n (THEN1 on line 163)", origin_function = "type-analysis", origin_structure = "Preterm"}
Uncaught exception: HOL_ERR {message = "on line 156, characters 14-16:\n\nType inference failure: unable to infer a type for the application of\n\n(LENGTH :\206\177 list -> num) :\206\177 list -> num\n\non line 156, characters 7-12\n\nto\n\n(seg :num -> num -> (\206\177, \206\178) path -> (\206\177, \206\178) path) :num -> num -> (\206\177, \206\178) path -> (\206\177, \206\178) path\n\non line 156, characters 14-16\n\nunification failure message: Attempt to unify different type operators: list$list and min$fun\n (THEN1 on line 163)", origin_function = "type-analysis", origin_structure = "Preterm"}
BinomialHeapTheory M-KILLED
ImplicitQueueTheory M-KILLED
LazyPairingHeapTheory M-KILLED