Diffusion Additive Manufacturing Work (master) Browse

time_optimization_36.log
371a6348faaamaster

time_optimization_36.log
View Options

			* STARTING JOB *
			10
			Process 0: Computed global bounding box tree with 47 boxes.
			Process 4: Computed global bounding box tree with 47 boxes.
			Process 7: Computed global bounding box tree with 47 boxes.
			Process 19: Computed global bounding box tree with 47 boxes.
			Process 1: Computed global bounding box tree with 47 boxes.
			Process 2: Computed global bounding box tree with 47 boxes.
			Process 3: Computed global bounding box tree with 47 boxes.
			Process 5: Computed global bounding box tree with 47 boxes.
			Process 6: Computed global bounding box tree with 47 boxes.
			Process 8: Computed global bounding box tree with 47 boxes.
			Process 9: Computed global bounding box tree with 47 boxes.
			Process 10: Computed global bounding box tree with 47 boxes.
			Process 11: Computed global bounding box tree with 47 boxes.
			Process 12: Computed global bounding box tree with 47 boxes.
			Process 13: Computed global bounding box tree with 47 boxes.
			Process 16: Computed global bounding box tree with 47 boxes.
			Process 17: Computed global bounding box tree with 47 boxes.
			Process 21: Computed global bounding box tree with 47 boxes.
			Process 22: Computed global bounding box tree with 47 boxes.
			Process 23: Computed global bounding box tree with 47 boxes.
			Process 14: Computed global bounding box tree with 47 boxes.
			Process 15: Computed global bounding box tree with 47 boxes.
			Process 20: Computed global bounding box tree with 47 boxes.
			Process 18: Computed global bounding box tree with 47 boxes.
			Process 15: Building point search tree to accelerate distance queries.
			Process 6: Building point search tree to accelerate distance queries.
			Process 12: Building point search tree to accelerate distance queries.
			Process 21: Building point search tree to accelerate distance queries.
			Process 5: Building point search tree to accelerate distance queries.
			Process 17: Building point search tree to accelerate distance queries.
			Process 8: Building point search tree to accelerate distance queries.
			Process 9: Building point search tree to accelerate distance queries.
			Process 4: Building point search tree to accelerate distance queries.
			Process 14: Building point search tree to accelerate distance queries.
			Process 15: Computed bounding box tree with 69985 nodes for 34993 points.
			Process 19: Building point search tree to accelerate distance queries.
			Process 10: Building point search tree to accelerate distance queries.
			Process 20: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 67465 nodes for 33733 points.
			Process 6: Computed bounding box tree with 68957 nodes for 34479 points.
			Process 12: Computed bounding box tree with 69267 nodes for 34634 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 7: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 67383 nodes for 33692 points.
			Process 9: Computed bounding box tree with 67317 nodes for 33659 points.
			Process 17: Computed bounding box tree with 68243 nodes for 34122 points.
			Process 21: Computed bounding box tree with 69103 nodes for 34552 points.
			Process 22: Building point search tree to accelerate distance queries.
			Process 23: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 68013 nodes for 34007 points.
			Process 14: Computed bounding box tree with 66479 nodes for 33240 points.
			Process 19: Computed bounding box tree with 68345 nodes for 34173 points.
			Process 10: Computed bounding box tree with 69545 nodes for 34773 points.
			Process 20: Computed bounding box tree with 67417 nodes for 33709 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 68399 nodes for 34200 points.
			Process 0: Computed bounding box tree with 69001 nodes for 34501 points.
			Process 16: Building point search tree to accelerate distance queries.
			Process 23: Computed bounding box tree with 68931 nodes for 34466 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 22: Computed bounding box tree with 66225 nodes for 33113 points.
			Process 18: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 67745 nodes for 33873 points.
			Process 16: Computed bounding box tree with 66801 nodes for 33401 points.
			Process 3: Computed bounding box tree with 69185 nodes for 34593 points.
			Process 11: Building point search tree to accelerate distance queries.
			Process 18: Computed bounding box tree with 69401 nodes for 34701 points.
			Process 1: Computed bounding box tree with 70045 nodes for 35023 points.
			Process 11: Computed bounding box tree with 68165 nodes for 34083 points.
			Process 13: Building point search tree to accelerate distance queries.
			Process 13: Computed bounding box tree with 69095 nodes for 34548 points.
			Total number of muSpectre tasks: 12 Total number of fenics tasks: 24
			Total FENICS time: 189.5702610015869
			Total run time for 100 steps: 193.76506161689758
			Total MUSPECTRE time: 193.74921989440918
			10
			Process 0: Computed global bounding box tree with 39 boxes.
			Process 3: Computed global bounding box tree with 39 boxes.
			Process 5: Computed global bounding box tree with 39 boxes.
			Process 12: Computed global bounding box tree with 39 boxes.
			Process 14: Computed global bounding box tree with 39 boxes.
			Process 16: Computed global bounding box tree with 39 boxes.
			Process 17: Computed global bounding box tree with 39 boxes.
			Process 1: Computed global bounding box tree with 39 boxes.
			Process 2: Computed global bounding box tree with 39 boxes.
			Process 4: Computed global bounding box tree with 39 boxes.
			Process 6: Computed global bounding box tree with 39 boxes.
			Process 7: Computed global bounding box tree with 39 boxes.
			Process 8: Computed global bounding box tree with 39 boxes.
			Process 9: Computed global bounding box tree with 39 boxes.
			Process 10: Computed global bounding box tree with 39 boxes.
			Process 11: Computed global bounding box tree with 39 boxes.
			Process 13: Computed global bounding box tree with 39 boxes.
			Process 18: Computed global bounding box tree with 39 boxes.
			Process 19: Computed global bounding box tree with 39 boxes.
			Process 15: Computed global bounding box tree with 39 boxes.
			Process 14: Building point search tree to accelerate distance queries.
			Process 11: Building point search tree to accelerate distance queries.
			Process 13: Building point search tree to accelerate distance queries.
			Process 6: Building point search tree to accelerate distance queries.
			Process 15: Building point search tree to accelerate distance queries.
			Process 14: Computed bounding box tree with 83521 nodes for 41761 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 5: Building point search tree to accelerate distance queries.
			Process 7: Building point search tree to accelerate distance queries.
			Process 8: Building point search tree to accelerate distance queries.
			Process 10: Building point search tree to accelerate distance queries.
			Process 11: Computed bounding box tree with 82783 nodes for 41392 points.
			Process 12: Building point search tree to accelerate distance queries.
			Process 17: Building point search tree to accelerate distance queries.
			Process 16: Building point search tree to accelerate distance queries.
			Process 4: Building point search tree to accelerate distance queries.
			Process 3: Building point search tree to accelerate distance queries.
			Process 15: Computed bounding box tree with 79887 nodes for 39944 points.
			Process 6: Computed bounding box tree with 79981 nodes for 39991 points.
			Process 13: Computed bounding box tree with 80245 nodes for 40123 points.
			Process 12: Computed bounding box tree with 80111 nodes for 40056 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 80955 nodes for 40478 points.
			Process 2: Computed bounding box tree with 82283 nodes for 41142 points.
			Process 10: Computed bounding box tree with 81977 nodes for 40989 points.
			Process 17: Computed bounding box tree with 81445 nodes for 40723 points.
			Process 5: Computed bounding box tree with 83877 nodes for 41939 points.
			Process 8: Computed bounding box tree with 83517 nodes for 41759 points.
			Process 9: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 83533 nodes for 41767 points.
			Process 16: Computed bounding box tree with 83149 nodes for 41575 points.
			Process 3: Computed bounding box tree with 79325 nodes for 39663 points.
			Process 18: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 83193 nodes for 41597 points.
			Process 9: Computed bounding box tree with 82087 nodes for 41044 points.
			Process 19: Building point search tree to accelerate distance queries.
			Process 18: Computed bounding box tree with 81567 nodes for 40784 points.
			Process 19: Computed bounding box tree with 84871 nodes for 42436 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 82209 nodes for 41105 points.
			Total number of muSpectre tasks: 16 Total number of fenics tasks: 20
			Total FENICS time: 181.4203760623932
			Total run time for 100 steps: 185.53823709487915
			Total MUSPECTRE time: 185.5342080593109
			10
			Process 2: Computed global bounding box tree with 35 boxes.
			Process 3: Computed global bounding box tree with 35 boxes.
			Process 8: Computed global bounding box tree with 35 boxes.
			Process 10: Computed global bounding box tree with 35 boxes.
			Process 14: Computed global bounding box tree with 35 boxes.
			Process 16: Computed global bounding box tree with 35 boxes.
			Process 0: Computed global bounding box tree with 35 boxes.
			Process 1: Computed global bounding box tree with 35 boxes.
			Process 4: Computed global bounding box tree with 35 boxes.
			Process 5: Computed global bounding box tree with 35 boxes.
			Process 6: Computed global bounding box tree with 35 boxes.
			Process 7: Computed global bounding box tree with 35 boxes.
			Process 9: Computed global bounding box tree with 35 boxes.
			Process 11: Computed global bounding box tree with 35 boxes.
			Process 12: Computed global bounding box tree with 35 boxes.
			Process 13: Computed global bounding box tree with 35 boxes.
			Process 17: Computed global bounding box tree with 35 boxes.
			Process 15: Computed global bounding box tree with 35 boxes.
			Process 12: Building point search tree to accelerate distance queries.
			Process 0: Building point search tree to accelerate distance queries.
			Process 14: Building point search tree to accelerate distance queries.
			Process 15: Building point search tree to accelerate distance queries.
			Process 9: Building point search tree to accelerate distance queries.
			Process 4: Building point search tree to accelerate distance queries.
			Process 3: Building point search tree to accelerate distance queries.
			Process 11: Building point search tree to accelerate distance queries.
			Process 17: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 6: Building point search tree to accelerate distance queries.
			Process 10: Building point search tree to accelerate distance queries.
			Process 12: Computed bounding box tree with 91891 nodes for 45946 points.
			Process 0: Computed bounding box tree with 91335 nodes for 45668 points.
			Process 14: Computed bounding box tree with 92681 nodes for 46341 points.
			Process 16: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 92159 nodes for 46080 points.
			Process 9: Computed bounding box tree with 90937 nodes for 45469 points.
			Process 15: Computed bounding box tree with 92721 nodes for 46361 points.
			Process 8: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 90309 nodes for 45155 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 89985 nodes for 44993 points.
			Process 7: Building point search tree to accelerate distance queries.
			Process 10: Computed bounding box tree with 90267 nodes for 45134 points.
			Process 11: Computed bounding box tree with 89769 nodes for 44885 points.
			Process 17: Computed bounding box tree with 88879 nodes for 44440 points.
			Process 13: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 91761 nodes for 45881 points.
			Process 16: Computed bounding box tree with 92483 nodes for 46242 points.
			Process 8: Computed bounding box tree with 93283 nodes for 46642 points.
			Process 2: Computed bounding box tree with 91415 nodes for 45708 points.
			Process 7: Computed bounding box tree with 90695 nodes for 45348 points.
			Process 13: Computed bounding box tree with 90043 nodes for 45022 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 89905 nodes for 44953 points.
			Total number of muSpectre tasks: 18 Total number of fenics tasks: 18
			Total FENICS time: 184.7035858631134
			Total run time for 100 steps: 188.96394157409668
			Total MUSPECTRE time: 188.94888997077942
			10
			Process 1: Computed global bounding box tree with 31 boxes.
			Process 2: Computed global bounding box tree with 31 boxes.
			Process 6: Computed global bounding box tree with 31 boxes.
			Process 8: Computed global bounding box tree with 31 boxes.
			Process 9: Computed global bounding box tree with 31 boxes.
			Process 13: Computed global bounding box tree with 31 boxes.
			Process 0: Computed global bounding box tree with 31 boxes.
			Process 3: Computed global bounding box tree with 31 boxes.
			Process 4: Computed global bounding box tree with 31 boxes.
			Process 5: Computed global bounding box tree with 31 boxes.
			Process 7: Computed global bounding box tree with 31 boxes.
			Process 10: Computed global bounding box tree with 31 boxes.
			Process 12: Computed global bounding box tree with 31 boxes.
			Process 14: Computed global bounding box tree with 31 boxes.
			Process 15: Computed global bounding box tree with 31 boxes.
			Process 11: Computed global bounding box tree with 31 boxes.
			Process 8: Building point search tree to accelerate distance queries.
			Process 2: Building point search tree to accelerate distance queries.
			Process 3: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 102957 nodes for 51479 points.
			Process 12: Building point search tree to accelerate distance queries.
			Process 9: Building point search tree to accelerate distance queries.
			Process 7: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 101153 nodes for 50577 points.
			Process 14: Building point search tree to accelerate distance queries.
			Process 13: Building point search tree to accelerate distance queries.
			Process 6: Building point search tree to accelerate distance queries.
			Process 0: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 104261 nodes for 52131 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 10: Building point search tree to accelerate distance queries.
			Process 4: Building point search tree to accelerate distance queries.
			Process 11: Building point search tree to accelerate distance queries.
			Process 12: Computed bounding box tree with 100207 nodes for 50104 points.
			Process 9: Computed bounding box tree with 101975 nodes for 50988 points.
			Process 14: Computed bounding box tree with 101449 nodes for 50725 points.
			Process 13: Computed bounding box tree with 102893 nodes for 51447 points.
			Process 1: Computed bounding box tree with 103847 nodes for 51924 points.
			Process 7: Computed bounding box tree with 101837 nodes for 50919 points.
			Process 15: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 100885 nodes for 50443 points.
			Process 4: Computed bounding box tree with 102177 nodes for 51089 points.
			Process 5: Computed bounding box tree with 101017 nodes for 50509 points.
			Process 6: Computed bounding box tree with 105453 nodes for 52727 points.
			Process 10: Computed bounding box tree with 103353 nodes for 51677 points.
			Process 11: Computed bounding box tree with 101583 nodes for 50792 points.
			Process 15: Computed bounding box tree with 105473 nodes for 52737 points.
			Total number of muSpectre tasks: 20 Total number of fenics tasks: 16
			Total FENICS time: 179.9967601299286
			Total run time for 100 steps: 184.10135221481323
			Total MUSPECTRE time: 184.09681487083435
			10
			Process 0: Computed global bounding box tree with 23 boxes.
			Process 1: Computed global bounding box tree with 23 boxes.
			Process 3: Computed global bounding box tree with 23 boxes.
			Process 4: Computed global bounding box tree with 23 boxes.
			Process 5: Computed global bounding box tree with 23 boxes.
			Process 9: Computed global bounding box tree with 23 boxes.
			Process 11: Computed global bounding box tree with 23 boxes.
			Process 2: Computed global bounding box tree with 23 boxes.
			Process 6: Computed global bounding box tree with 23 boxes.
			Process 8: Computed global bounding box tree with 23 boxes.
			Process 10: Computed global bounding box tree with 23 boxes.
			Process 7: Computed global bounding box tree with 23 boxes.
			Process 6: Building point search tree to accelerate distance queries.
			Process 7: Building point search tree to accelerate distance queries.
			Process 0: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 3: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 136569 nodes for 68285 points.
			Process 8: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 137849 nodes for 68925 points.
			Process 0: Computed bounding box tree with 138911 nodes for 69456 points.
			Process 1: Computed bounding box tree with 135907 nodes for 67954 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 9: Building point search tree to accelerate distance queries.
			Process 4: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 138889 nodes for 69445 points.
			Process 10: Building point search tree to accelerate distance queries.
			Process 5: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 133635 nodes for 66818 points.
			Process 11: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 135753 nodes for 67877 points.
			Process 4: Computed bounding box tree with 133149 nodes for 66575 points.
			Process 9: Computed bounding box tree with 135645 nodes for 67823 points.
			Process 10: Computed bounding box tree with 138925 nodes for 69463 points.
			Process 5: Computed bounding box tree with 138523 nodes for 69262 points.
			Process 11: Computed bounding box tree with 136769 nodes for 68385 points.
			Total number of muSpectre tasks: 24 Total number of fenics tasks: 12
			Total FENICS time: 179.295893907547
			Total run time for 100 steps: 183.40446972846985
			Total MUSPECTRE time: 183.4007740020752
			10
			Process 0: Computed global bounding box tree with 19 boxes.
			Process 1: Computed global bounding box tree with 19 boxes.
			Process 2: Computed global bounding box tree with 19 boxes.
			Process 3: Computed global bounding box tree with 19 boxes.
			Process 4: Computed global bounding box tree with 19 boxes.
			Process 8: Computed global bounding box tree with 19 boxes.
			Process 9: Computed global bounding box tree with 19 boxes.
			Process 5: Computed global bounding box tree with 19 boxes.
			Process 7: Computed global bounding box tree with 19 boxes.
			Process 6: Computed global bounding box tree with 19 boxes.
			Process 3: Building point search tree to accelerate distance queries.
			Process 2: Building point search tree to accelerate distance queries.
			Process 4: Building point search tree to accelerate distance queries.
			Process 9: Building point search tree to accelerate distance queries.
			Process 5: Building point search tree to accelerate distance queries.
			Process 6: Building point search tree to accelerate distance queries.
			Process 0: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 161563 nodes for 80782 points.
			Process 8: Building point search tree to accelerate distance queries.
			Process 7: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 165703 nodes for 82852 points.
			Process 5: Computed bounding box tree with 163649 nodes for 81825 points.
			Process 4: Computed bounding box tree with 167987 nodes for 83994 points.
			Process 6: Computed bounding box tree with 160885 nodes for 80443 points.
			Process 9: Computed bounding box tree with 164593 nodes for 82297 points.
			Process 0: Computed bounding box tree with 165737 nodes for 82869 points.
			Process 1: Computed bounding box tree with 161727 nodes for 80864 points.
			Process 8: Computed bounding box tree with 165679 nodes for 82840 points.
			Process 7: Computed bounding box tree with 163003 nodes for 81502 points.
			Total number of muSpectre tasks: 26 Total number of fenics tasks: 10
			Total FENICS time: 175.8758828639984
			Total run time for 100 steps: 179.91274905204773
			Total MUSPECTRE time: 179.9075689315796
			10
			Process 0: Computed global bounding box tree with 15 boxes.
			Process 1: Computed global bounding box tree with 15 boxes.
			Process 2: Computed global bounding box tree with 15 boxes.
			Process 3: Computed global bounding box tree with 15 boxes.
			Process 4: Computed global bounding box tree with 15 boxes.
			Process 5: Computed global bounding box tree with 15 boxes.
			Process 6: Computed global bounding box tree with 15 boxes.
			Process 7: Computed global bounding box tree with 15 boxes.
			Process 5: Building point search tree to accelerate distance queries.
			Process 2: Building point search tree to accelerate distance queries.
			Process 3: Building point search tree to accelerate distance queries.
			Process 4: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 6: Building point search tree to accelerate distance queries.
			Process 7: Building point search tree to accelerate distance queries.
			Process 0: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 204369 nodes for 102185 points.
			Process 5: Computed bounding box tree with 204023 nodes for 102012 points.
			Process 1: Computed bounding box tree with 209489 nodes for 104745 points.
			Process 4: Computed bounding box tree with 202881 nodes for 101441 points.
			Process 3: Computed bounding box tree with 205745 nodes for 102873 points.
			Process 6: Computed bounding box tree with 209915 nodes for 104958 points.
			Process 7: Computed bounding box tree with 201995 nodes for 100998 points.
			Process 0: Computed bounding box tree with 202111 nodes for 101056 points.
			Total number of muSpectre tasks: 28 Total number of fenics tasks: 8
			Total FENICS time: 177.13556003570557
			Total run time for 100 steps: 181.15575170516968
			Total MUSPECTRE time: 181.15120005607605
			10
			Process 0: Computed global bounding box tree with 11 boxes.
			Process 1: Computed global bounding box tree with 11 boxes.
			Process 2: Computed global bounding box tree with 11 boxes.
			Process 3: Computed global bounding box tree with 11 boxes.
			Process 4: Computed global bounding box tree with 11 boxes.
			Process 5: Computed global bounding box tree with 11 boxes.
			Process 0: Building point search tree to accelerate distance queries.
			Process 5: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 2: Building point search tree to accelerate distance queries.
			Process 4: Building point search tree to accelerate distance queries.
			Process 3: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 271405 nodes for 135703 points.
			Process 1: Computed bounding box tree with 269069 nodes for 134535 points.
			Process 5: Computed bounding box tree with 273499 nodes for 136750 points.
			Process 2: Computed bounding box tree with 278093 nodes for 139047 points.
			Process 4: Computed bounding box tree with 274151 nodes for 137076 points.
			Process 3: Computed bounding box tree with 274313 nodes for 137157 points.
			Total number of muSpectre tasks: 30 Total number of fenics tasks: 6
			Total FENICS time: 178.60045385360718
			Total run time for 100 steps: 182.7090549468994
			Total MUSPECTRE time: 182.70343899726868
			10
			Process 0: Computed global bounding box tree with 7 boxes.
			Process 1: Computed global bounding box tree with 7 boxes.
			Process 2: Computed global bounding box tree with 7 boxes.
			Process 3: Computed global bounding box tree with 7 boxes.
			Process 0: Building point search tree to accelerate distance queries.
			Process 2: Building point search tree to accelerate distance queries.
			Process 3: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 418705 nodes for 209353 points.
			Process 2: Computed bounding box tree with 406519 nodes for 203260 points.
			Process 3: Computed bounding box tree with 411921 nodes for 205961 points.
			Process 1: Computed bounding box tree with 403387 nodes for 201694 points.
			Total number of muSpectre tasks: 32 Total number of fenics tasks: 4
			Total FENICS time: 175.91912984848022
			Total run time for 100 steps: 179.9059178829193
			Total MUSPECTRE time: 179.90148901939392
			10
			Process 0: Computed global bounding box tree with 3 boxes.
			Process 1: Computed global bounding box tree with 3 boxes.
			Process 1: Building point search tree to accelerate distance queries.
			Process 0: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 818181 nodes for 409091 points.
			Process 0: Computed bounding box tree with 822353 nodes for 411177 points.
			Total number of muSpectre tasks: 34 Total number of fenics tasks: 2
			Total FENICS time: 192.19739198684692
			Total run time for 100 steps: 194.6917839050293
			Total MUSPECTRE time: 194.67666602134705
			10
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 1640535 nodes for 820268 points.
			Total number of muSpectre tasks: 35 Total number of fenics tasks: 1
			Total FENICS time: 352.5147490501404
			Total run time for 100 steps: 355.5962333679199
			Total MUSPECTRE time: 355.5785801410675
			50
			Process 0: Computed global bounding box tree with 47 boxes.
			Process 7: Computed global bounding box tree with 47 boxes.
			Process 13: Computed global bounding box tree with 47 boxes.
			Process 15: Computed global bounding box tree with 47 boxes.
			Process 16: Computed global bounding box tree with 47 boxes.
			Process 18: Computed global bounding box tree with 47 boxes.
			Process 1: Computed global bounding box tree with 47 boxes.
			Process 2: Computed global bounding box tree with 47 boxes.
			Process 3: Computed global bounding box tree with 47 boxes.
			Process 4: Computed global bounding box tree with 47 boxes.
			Process 5: Computed global bounding box tree with 47 boxes.
			Process 6: Computed global bounding box tree with 47 boxes.
			Process 8: Computed global bounding box tree with 47 boxes.
			Process 9: Computed global bounding box tree with 47 boxes.
			Process 10: Computed global bounding box tree with 47 boxes.
			Process 11: Computed global bounding box tree with 47 boxes.
			Process 12: Computed global bounding box tree with 47 boxes.
			Process 14: Computed global bounding box tree with 47 boxes.
			Process 17: Computed global bounding box tree with 47 boxes.
			Process 19: Computed global bounding box tree with 47 boxes.
			Process 20: Computed global bounding box tree with 47 boxes.
			Process 21: Computed global bounding box tree with 47 boxes.
			Process 23: Computed global bounding box tree with 47 boxes.
			Process 22: Computed global bounding box tree with 47 boxes.
			Process 2: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 67867 nodes for 33934 points.
			Process 9: Building point search tree to accelerate distance queries.
			Process 18: Building point search tree to accelerate distance queries.
			Process 11: Building point search tree to accelerate distance queries.
			Process 8: Building point search tree to accelerate distance queries.
			Process 9: Computed bounding box tree with 67441 nodes for 33721 points.
			Process 11: Computed bounding box tree with 71827 nodes for 35914 points.
			Process 18: Computed bounding box tree with 68563 nodes for 34282 points.
			Process 23: Building point search tree to accelerate distance queries.
			Process 3: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 70989 nodes for 35495 points.
			Process 21: Building point search tree to accelerate distance queries.
			Process 4: Building point search tree to accelerate distance queries.
			Process 0: Building point search tree to accelerate distance queries.
			Process 7: Building point search tree to accelerate distance queries.
			Process 23: Computed bounding box tree with 68929 nodes for 34465 points.
			Process 3: Computed bounding box tree with 67359 nodes for 33680 points.
			Process 21: Computed bounding box tree with 68559 nodes for 34280 points.
			Process 4: Computed bounding box tree with 70695 nodes for 35348 points.
			Process 0: Computed bounding box tree with 68421 nodes for 34211 points.
			Process 7: Computed bounding box tree with 68285 nodes for 34143 points.
			Process 15: Building point search tree to accelerate distance queries.
			Process 22: Building point search tree to accelerate distance queries.
			Process 5: Building point search tree to accelerate distance queries.
			Process 10: Building point search tree to accelerate distance queries.
			Process 15: Computed bounding box tree with 70593 nodes for 35297 points.
			Process 22: Computed bounding box tree with 71315 nodes for 35658 points.
			Process 5: Computed bounding box tree with 70497 nodes for 35249 points.
			Process 19: Building point search tree to accelerate distance queries.
			Process 10: Computed bounding box tree with 69017 nodes for 34509 points.
			Process 6: Building point search tree to accelerate distance queries.
			Process 14: Building point search tree to accelerate distance queries.
			Process 19: Computed bounding box tree with 71127 nodes for 35564 points.
			Process 17: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 68115 nodes for 34058 points.
			Process 14: Computed bounding box tree with 69143 nodes for 34572 points.
			Process 17: Computed bounding box tree with 70439 nodes for 35220 points.
			Process 13: Building point search tree to accelerate distance queries.
			Process 16: Building point search tree to accelerate distance queries.
			Process 13: Computed bounding box tree with 68041 nodes for 34021 points.
			Process 16: Computed bounding box tree with 67683 nodes for 33842 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 70597 nodes for 35299 points.
			Process 12: Building point search tree to accelerate distance queries.
			Process 12: Computed bounding box tree with 70149 nodes for 35075 points.
			Process 20: Building point search tree to accelerate distance queries.
			Process 20: Computed bounding box tree with 69113 nodes for 34557 points.
			Total number of muSpectre tasks: 12 Total number of fenics tasks: 24
			Total FENICS time: 703.7041430473328
			Total run time for 100 steps: 717.7035591602325
			Total MUSPECTRE time: 717.7005939483643
			50
			Process 4: Computed global bounding box tree with 39 boxes.
			Process 5: Computed global bounding box tree with 39 boxes.
			Process 8: Computed global bounding box tree with 39 boxes.
			Process 12: Computed global bounding box tree with 39 boxes.
			Process 13: Computed global bounding box tree with 39 boxes.
			Process 16: Computed global bounding box tree with 39 boxes.
			Process 19: Computed global bounding box tree with 39 boxes.
			Process 0: Computed global bounding box tree with 39 boxes.
			Process 1: Computed global bounding box tree with 39 boxes.
			Process 2: Computed global bounding box tree with 39 boxes.
			Process 3: Computed global bounding box tree with 39 boxes.
			Process 6: Computed global bounding box tree with 39 boxes.
			Process 7: Computed global bounding box tree with 39 boxes.
			Process 9: Computed global bounding box tree with 39 boxes.
			Process 10: Computed global bounding box tree with 39 boxes.
			Process 14: Computed global bounding box tree with 39 boxes.
			Process 15: Computed global bounding box tree with 39 boxes.
			Process 17: Computed global bounding box tree with 39 boxes.
			Process 18: Computed global bounding box tree with 39 boxes.
			Process 11: Computed global bounding box tree with 39 boxes.
			Process 18: Building point search tree to accelerate distance queries.
			Process 18: Computed bounding box tree with 86313 nodes for 43157 points.
			Process 13: Building point search tree to accelerate distance queries.
			Process 13: Computed bounding box tree with 81901 nodes for 40951 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 83169 nodes for 41585 points.
			Process 7: Building point search tree to accelerate distance queries.
			Process 11: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 81627 nodes for 40814 points.
			Process 11: Computed bounding box tree with 81231 nodes for 40616 points.
			Process 19: Building point search tree to accelerate distance queries.
			Process 15: Building point search tree to accelerate distance queries.
			Process 12: Building point search tree to accelerate distance queries.
			Process 15: Computed bounding box tree with 81199 nodes for 40600 points.
			Process 19: Computed bounding box tree with 82929 nodes for 41465 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 12: Computed bounding box tree with 81755 nodes for 40878 points.
			Process 3: Computed bounding box tree with 81197 nodes for 40599 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 8: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 82043 nodes for 41022 points.
			Process 6: Building point search tree to accelerate distance queries.
			Process 17: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 84575 nodes for 42288 points.
			Process 6: Computed bounding box tree with 85123 nodes for 42562 points.
			Process 17: Computed bounding box tree with 82749 nodes for 41375 points.
			Process 9: Building point search tree to accelerate distance queries.
			Process 10: Building point search tree to accelerate distance queries.
			Process 2: Building point search tree to accelerate distance queries.
			Process 9: Computed bounding box tree with 82397 nodes for 41199 points.
			Process 10: Computed bounding box tree with 85681 nodes for 42841 points.
			Process 2: Computed bounding box tree with 81731 nodes for 40866 points.
			Process 16: Building point search tree to accelerate distance queries.
			Process 4: Building point search tree to accelerate distance queries.
			Process 16: Computed bounding box tree with 84503 nodes for 42252 points.
			Process 4: Computed bounding box tree with 85781 nodes for 42891 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 83629 nodes for 41815 points.
			Process 14: Building point search tree to accelerate distance queries.
			Process 14: Computed bounding box tree with 85235 nodes for 42618 points.
			Total number of muSpectre tasks: 16 Total number of fenics tasks: 20
			Total FENICS time: 572.700933933258
			Total run time for 100 steps: 584.4148907661438
			Total MUSPECTRE time: 584.3762621879578
			50
			Process 0: Computed global bounding box tree with 35 boxes.
			Process 1: Computed global bounding box tree with 35 boxes.
			Process 2: Computed global bounding box tree with 35 boxes.
			Process 4: Computed global bounding box tree with 35 boxes.
			Process 6: Computed global bounding box tree with 35 boxes.
			Process 7: Computed global bounding box tree with 35 boxes.
			Process 8: Computed global bounding box tree with 35 boxes.
			Process 10: Computed global bounding box tree with 35 boxes.
			Process 13: Computed global bounding box tree with 35 boxes.
			Process 16: Computed global bounding box tree with 35 boxes.
			Process 3: Computed global bounding box tree with 35 boxes.
			Process 5: Computed global bounding box tree with 35 boxes.
			Process 9: Computed global bounding box tree with 35 boxes.
			Process 11: Computed global bounding box tree with 35 boxes.
			Process 12: Computed global bounding box tree with 35 boxes.
			Process 14: Computed global bounding box tree with 35 boxes.
			Process 15: Computed global bounding box tree with 35 boxes.
			Process 17: Computed global bounding box tree with 35 boxes.
			Process 3: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 92115 nodes for 46058 points.
			Process 7: Building point search tree to accelerate distance queries.
			Process 6: Building point search tree to accelerate distance queries.
			Process 11: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 90125 nodes for 45063 points.
			Process 6: Computed bounding box tree with 92613 nodes for 46307 points.
			Process 8: Building point search tree to accelerate distance queries.
			Process 15: Building point search tree to accelerate distance queries.
			Process 11: Computed bounding box tree with 91421 nodes for 45711 points.
			Process 14: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 93799 nodes for 46900 points.
			Process 15: Computed bounding box tree with 94595 nodes for 47298 points.
			Process 9: Building point search tree to accelerate distance queries.
			Process 14: Computed bounding box tree with 91255 nodes for 45628 points.
			Process 10: Building point search tree to accelerate distance queries.
			Process 9: Computed bounding box tree with 93495 nodes for 46748 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 16: Building point search tree to accelerate distance queries.
			Process 10: Computed bounding box tree with 90921 nodes for 45461 points.
			Process 4: Computed bounding box tree with 92561 nodes for 46281 points.
			Process 16: Computed bounding box tree with 91053 nodes for 45527 points.
			Process 17: Building point search tree to accelerate distance queries.
			Process 17: Computed bounding box tree with 94039 nodes for 47020 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 93489 nodes for 46745 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 91279 nodes for 45640 points.
			Process 12: Building point search tree to accelerate distance queries.
			Process 12: Computed bounding box tree with 94571 nodes for 47286 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 92633 nodes for 46317 points.
			Process 13: Building point search tree to accelerate distance queries.
			Process 13: Computed bounding box tree with 92855 nodes for 46428 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 91951 nodes for 45976 points.
			Total number of muSpectre tasks: 18 Total number of fenics tasks: 18
			Total FENICS time: 469.8112940788269
			Total run time for 100 steps: 481.12003660202026
			Total MUSPECTRE time: 481.089035987854
			50
			Process 0: Computed global bounding box tree with 31 boxes.
			Process 2: Computed global bounding box tree with 31 boxes.
			Process 8: Computed global bounding box tree with 31 boxes.
			Process 10: Computed global bounding box tree with 31 boxes.
			Process 12: Computed global bounding box tree with 31 boxes.
			Process 1: Computed global bounding box tree with 31 boxes.
			Process 3: Computed global bounding box tree with 31 boxes.
			Process 4: Computed global bounding box tree with 31 boxes.
			Process 5: Computed global bounding box tree with 31 boxes.
			Process 6: Computed global bounding box tree with 31 boxes.
			Process 7: Computed global bounding box tree with 31 boxes.
			Process 9: Computed global bounding box tree with 31 boxes.
			Process 11: Computed global bounding box tree with 31 boxes.
			Process 14: Computed global bounding box tree with 31 boxes.
			Process 15: Computed global bounding box tree with 31 boxes.
			Process 13: Computed global bounding box tree with 31 boxes.
			Process 0: Building point search tree to accelerate distance queries.
			Process 9: Building point search tree to accelerate distance queries.
			Process 5: Building point search tree to accelerate distance queries.
			Process 9: Computed bounding box tree with 102095 nodes for 51048 points.
			Process 0: Computed bounding box tree with 105995 nodes for 52998 points.
			Process 5: Computed bounding box tree with 104433 nodes for 52217 points.
			Process 15: Building point search tree to accelerate distance queries.
			Process 15: Computed bounding box tree with 102047 nodes for 51024 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 4: Building point search tree to accelerate distance queries.
			Process 7: Building point search tree to accelerate distance queries.
			Process 3: Building point search tree to accelerate distance queries.
			Process 6: Building point search tree to accelerate distance queries.
			Process 11: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 101939 nodes for 50970 points.
			Process 4: Computed bounding box tree with 102631 nodes for 51316 points.
			Process 7: Computed bounding box tree with 103639 nodes for 51820 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 8: Building point search tree to accelerate distance queries.
			Process 11: Computed bounding box tree with 105633 nodes for 52817 points.
			Process 13: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 104997 nodes for 52499 points.
			Process 3: Computed bounding box tree with 104611 nodes for 52306 points.
			Process 1: Computed bounding box tree with 103003 nodes for 51502 points.
			Process 14: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 104489 nodes for 52245 points.
			Process 12: Building point search tree to accelerate distance queries.
			Process 13: Computed bounding box tree with 105529 nodes for 52765 points.
			Process 14: Computed bounding box tree with 106203 nodes for 53102 points.
			Process 12: Computed bounding box tree with 104933 nodes for 52467 points.
			Process 10: Building point search tree to accelerate distance queries.
			Process 10: Computed bounding box tree with 102595 nodes for 51298 points.
			Total number of muSpectre tasks: 20 Total number of fenics tasks: 16
			Total FENICS time: 471.11204719543457
			Total run time for 100 steps: 481.9912292957306
			Total MUSPECTRE time: 481.9771249294281
			50
			Process 0: Computed global bounding box tree with 23 boxes.
			Process 2: Computed global bounding box tree with 23 boxes.
			Process 3: Computed global bounding box tree with 23 boxes.
			Process 6: Computed global bounding box tree with 23 boxes.
			Process 7: Computed global bounding box tree with 23 boxes.
			Process 1: Computed global bounding box tree with 23 boxes.
			Process 5: Computed global bounding box tree with 23 boxes.
			Process 8: Computed global bounding box tree with 23 boxes.
			Process 9: Computed global bounding box tree with 23 boxes.
			Process 10: Computed global bounding box tree with 23 boxes.
			Process 11: Computed global bounding box tree with 23 boxes.
			Process 4: Computed global bounding box tree with 23 boxes.
			Process 0: Building point search tree to accelerate distance queries.
			Process 6: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 139847 nodes for 69924 points.
			Process 6: Computed bounding box tree with 140215 nodes for 70108 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 135847 nodes for 67924 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 139825 nodes for 69913 points.
			Process 9: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 9: Computed bounding box tree with 137953 nodes for 68977 points.
			Process 1: Computed bounding box tree with 139231 nodes for 69616 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 5: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 139475 nodes for 69738 points.
			Process 8: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 135841 nodes for 67921 points.
			Process 8: Computed bounding box tree with 137359 nodes for 68680 points.
			Process 7: Building point search tree to accelerate distance queries.
			Process 11: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 137063 nodes for 68532 points.
			Process 11: Computed bounding box tree with 138327 nodes for 69164 points.
			Process 10: Building point search tree to accelerate distance queries.
			Process 10: Computed bounding box tree with 143793 nodes for 71897 points.
			Total number of muSpectre tasks: 24 Total number of fenics tasks: 12
			Total FENICS time: 475.47869205474854
			Total run time for 100 steps: 486.34966015815735
			Total MUSPECTRE time: 486.33114194869995
			50
			Process 0: Computed global bounding box tree with 19 boxes.
			Process 1: Computed global bounding box tree with 19 boxes.
			Process 2: Computed global bounding box tree with 19 boxes.
			Process 3: Computed global bounding box tree with 19 boxes.
			Process 4: Computed global bounding box tree with 19 boxes.
			Process 6: Computed global bounding box tree with 19 boxes.
			Process 7: Computed global bounding box tree with 19 boxes.
			Process 8: Computed global bounding box tree with 19 boxes.
			Process 9: Computed global bounding box tree with 19 boxes.
			Process 5: Computed global bounding box tree with 19 boxes.
			Process 2: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 165561 nodes for 82781 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 7: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 168723 nodes for 84362 points.
			Process 7: Computed bounding box tree with 164565 nodes for 82283 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 9: Building point search tree to accelerate distance queries.
			Process 0: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 168699 nodes for 84350 points.
			Process 9: Computed bounding box tree with 171157 nodes for 85579 points.
			Process 0: Computed bounding box tree with 166161 nodes for 83081 points.
			Process 8: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 165051 nodes for 82526 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 6: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 166501 nodes for 83251 points.
			Process 4: Computed bounding box tree with 162907 nodes for 81454 points.
			Process 6: Computed bounding box tree with 165453 nodes for 82727 points.
			Total number of muSpectre tasks: 26 Total number of fenics tasks: 10
			Total FENICS time: 370.4193880558014
			Total run time for 100 steps: 379.8102283477783
			Total MUSPECTRE time: 379.8063690662384
			50
			Process 0: Computed global bounding box tree with 15 boxes.
			Process 1: Computed global bounding box tree with 15 boxes.
			Process 2: Computed global bounding box tree with 15 boxes.
			Process 3: Computed global bounding box tree with 15 boxes.
			Process 4: Computed global bounding box tree with 15 boxes.
			Process 5: Computed global bounding box tree with 15 boxes.
			Process 6: Computed global bounding box tree with 15 boxes.
			Process 7: Computed global bounding box tree with 15 boxes.
			Process 4: Building point search tree to accelerate distance queries.
			Process 2: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 6: Building point search tree to accelerate distance queries.
			Process 7: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 203265 nodes for 101633 points.
			Process 2: Computed bounding box tree with 208261 nodes for 104131 points.
			Process 1: Computed bounding box tree with 206703 nodes for 103352 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 3: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 210537 nodes for 105269 points.
			Process 7: Computed bounding box tree with 210801 nodes for 105401 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 206925 nodes for 103463 points.
			Process 5: Computed bounding box tree with 209905 nodes for 104953 points.
			Process 0: Computed bounding box tree with 208383 nodes for 104192 points.
			Total number of muSpectre tasks: 28 Total number of fenics tasks: 8
			Total FENICS time: 366.60701298713684
			Total run time for 100 steps: 376.07435846328735
			Total MUSPECTRE time: 376.0711419582367
			50
			Process 0: Computed global bounding box tree with 11 boxes.
			Process 1: Computed global bounding box tree with 11 boxes.
			Process 2: Computed global bounding box tree with 11 boxes.
			Process 3: Computed global bounding box tree with 11 boxes.
			Process 4: Computed global bounding box tree with 11 boxes.
			Process 5: Computed global bounding box tree with 11 boxes.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 283891 nodes for 141946 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 2: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 272887 nodes for 136444 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 274127 nodes for 137064 points.
			Process 1: Computed bounding box tree with 279275 nodes for 139638 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 278353 nodes for 139177 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 276249 nodes for 138125 points.
			Total number of muSpectre tasks: 30 Total number of fenics tasks: 6
			Total FENICS time: 388.1720631122589
			Total run time for 100 steps: 395.7123417854309
			Total MUSPECTRE time: 395.6988139152527
			50
			Process 0: Computed global bounding box tree with 7 boxes.
			Process 1: Computed global bounding box tree with 7 boxes.
			Process 2: Computed global bounding box tree with 7 boxes.
			Process 3: Computed global bounding box tree with 7 boxes.
			Process 1: Building point search tree to accelerate distance queries.
			Process 0: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 415351 nodes for 207676 points.
			Process 0: Computed bounding box tree with 415249 nodes for 207625 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 2: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 425129 nodes for 212565 points.
			Process 2: Computed bounding box tree with 409055 nodes for 204528 points.
			Total MUSPECTRE time: 479.8547501564026
			Total number of muSpectre tasks: 32 Total number of fenics tasks: 4
			Total FENICS time: 473.0080900192261
			Total run time for 100 steps: 479.87987208366394
			50
			Process 0: Computed global bounding box tree with 3 boxes.
			Process 1: Computed global bounding box tree with 3 boxes.
			Process 0: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 829573 nodes for 414787 points.
			Process 1: Computed bounding box tree with 835213 nodes for 417607 points.
			Total number of muSpectre tasks: 34 Total number of fenics tasks: 2
			Total FENICS time: 827.7526030540466
			Total run time for 100 steps: 832.1630938053131
			Total MUSPECTRE time: 832.1589059829712
			50
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 1664787 nodes for 832394 points.
			Total number of muSpectre tasks: 35 Total number of fenics tasks: 1
			Total FENICS time: 1532.8054549694061
			Total run time for 100 steps: 1539.989672422409
			Total MUSPECTRE time: 1539.97510099411
			90
			Process 12: Computed global bounding box tree with 47 boxes.
			Process 14: Computed global bounding box tree with 47 boxes.
			Process 16: Computed global bounding box tree with 47 boxes.
			Process 19: Computed global bounding box tree with 47 boxes.
			Process 0: Computed global bounding box tree with 47 boxes.
			Process 1: Computed global bounding box tree with 47 boxes.
			Process 2: Computed global bounding box tree with 47 boxes.
			Process 3: Computed global bounding box tree with 47 boxes.
			Process 4: Computed global bounding box tree with 47 boxes.
			Process 5: Computed global bounding box tree with 47 boxes.
			Process 6: Computed global bounding box tree with 47 boxes.
			Process 7: Computed global bounding box tree with 47 boxes.
			Process 8: Computed global bounding box tree with 47 boxes.
			Process 9: Computed global bounding box tree with 47 boxes.
			Process 10: Computed global bounding box tree with 47 boxes.
			Process 11: Computed global bounding box tree with 47 boxes.
			Process 15: Computed global bounding box tree with 47 boxes.
			Process 17: Computed global bounding box tree with 47 boxes.
			Process 18: Computed global bounding box tree with 47 boxes.
			Process 20: Computed global bounding box tree with 47 boxes.
			Process 21: Computed global bounding box tree with 47 boxes.
			Process 22: Computed global bounding box tree with 47 boxes.
			Process 23: Computed global bounding box tree with 47 boxes.
			Process 13: Computed global bounding box tree with 47 boxes.
			Process 17: Building point search tree to accelerate distance queries.
			Process 17: Computed bounding box tree with 68961 nodes for 34481 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 65057 nodes for 32529 points.
			Process 6: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 67151 nodes for 33576 points.
			Process 22: Building point search tree to accelerate distance queries.
			Process 22: Computed bounding box tree with 66427 nodes for 33214 points.
			Process 15: Building point search tree to accelerate distance queries.
			Process 15: Computed bounding box tree with 66381 nodes for 33191 points.
			Process 20: Building point search tree to accelerate distance queries.
			Process 11: Building point search tree to accelerate distance queries.
			Process 16: Building point search tree to accelerate distance queries.
			Process 11: Computed bounding box tree with 66483 nodes for 33242 points.
			Process 20: Computed bounding box tree with 68107 nodes for 34054 points.
			Process 16: Computed bounding box tree with 66809 nodes for 33405 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 18: Building point search tree to accelerate distance queries.
			Process 21: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 69817 nodes for 34909 points.
			Process 18: Computed bounding box tree with 66797 nodes for 33399 points.
			Process 21: Computed bounding box tree with 66265 nodes for 33133 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 66689 nodes for 33345 points.
			Process 9: Building point search tree to accelerate distance queries.
			Process 10: Building point search tree to accelerate distance queries.
			Process 9: Computed bounding box tree with 68253 nodes for 34127 points.
			Process 10: Computed bounding box tree with 67029 nodes for 33515 points.
			Process 13: Building point search tree to accelerate distance queries.
			Process 13: Computed bounding box tree with 67709 nodes for 33855 points.
			Process 19: Building point search tree to accelerate distance queries.
			Process 19: Computed bounding box tree with 68497 nodes for 34249 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 8: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 68253 nodes for 34127 points.
			Process 8: Computed bounding box tree with 67823 nodes for 33912 points.
			Process 7: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 69499 nodes for 34750 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 68239 nodes for 34120 points.
			Process 12: Building point search tree to accelerate distance queries.
			Process 12: Computed bounding box tree with 67871 nodes for 33936 points.
			Process 23: Building point search tree to accelerate distance queries.
			Process 23: Computed bounding box tree with 69107 nodes for 34554 points.
			Process 14: Building point search tree to accelerate distance queries.
			Process 14: Computed bounding box tree with 65081 nodes for 32541 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 65541 nodes for 32771 points.
			Total number of muSpectre tasks: 12 Total number of fenics tasks: 24
			Total FENICS time: 1149.5405189990997
			Total run time for 100 steps: 1170.0034272670746
			Total MUSPECTRE time: 1169.9888157844543
			90
			Process 0: Computed global bounding box tree with 39 boxes.
			Process 8: Computed global bounding box tree with 39 boxes.
			Process 12: Computed global bounding box tree with 39 boxes.
			Process 17: Computed global bounding box tree with 39 boxes.
			Process 18: Computed global bounding box tree with 39 boxes.
			Process 1: Computed global bounding box tree with 39 boxes.
			Process 2: Computed global bounding box tree with 39 boxes.
			Process 3: Computed global bounding box tree with 39 boxes.
			Process 4: Computed global bounding box tree with 39 boxes.
			Process 5: Computed global bounding box tree with 39 boxes.
			Process 6: Computed global bounding box tree with 39 boxes.
			Process 7: Computed global bounding box tree with 39 boxes.
			Process 9: Computed global bounding box tree with 39 boxes.
			Process 10: Computed global bounding box tree with 39 boxes.
			Process 11: Computed global bounding box tree with 39 boxes.
			Process 14: Computed global bounding box tree with 39 boxes.
			Process 15: Computed global bounding box tree with 39 boxes.
			Process 16: Computed global bounding box tree with 39 boxes.
			Process 19: Computed global bounding box tree with 39 boxes.
			Process 13: Computed global bounding box tree with 39 boxes.
			Process 8: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 80569 nodes for 40285 points.
			Process 11: Building point search tree to accelerate distance queries.
			Process 11: Computed bounding box tree with 78145 nodes for 39073 points.
			Process 12: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 12: Computed bounding box tree with 79595 nodes for 39798 points.
			Process 1: Computed bounding box tree with 83633 nodes for 41817 points.
			Process 17: Building point search tree to accelerate distance queries.
			Process 3: Building point search tree to accelerate distance queries.
			Process 15: Building point search tree to accelerate distance queries.
			Process 17: Computed bounding box tree with 81941 nodes for 40971 points.
			Process 3: Computed bounding box tree with 80027 nodes for 40014 points.
			Process 15: Computed bounding box tree with 79153 nodes for 39577 points.
			Process 18: Building point search tree to accelerate distance queries.
			Process 7: Building point search tree to accelerate distance queries.
			Process 18: Computed bounding box tree with 79057 nodes for 39529 points.
			Process 7: Computed bounding box tree with 81747 nodes for 40874 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 2: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 78995 nodes for 39498 points.
			Process 9: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 80683 nodes for 40342 points.
			Process 6: Building point search tree to accelerate distance queries.
			Process 9: Computed bounding box tree with 80611 nodes for 40306 points.
			Process 6: Computed bounding box tree with 81203 nodes for 40602 points.
			Process 16: Building point search tree to accelerate distance queries.
			Process 16: Computed bounding box tree with 82387 nodes for 41194 points.
			Process 10: Building point search tree to accelerate distance queries.
			Process 10: Computed bounding box tree with 83867 nodes for 41934 points.
			Process 14: Building point search tree to accelerate distance queries.
			Process 14: Computed bounding box tree with 82907 nodes for 41454 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 80747 nodes for 40374 points.
			Process 13: Building point search tree to accelerate distance queries.
			Process 13: Computed bounding box tree with 79653 nodes for 39827 points.
			Process 19: Building point search tree to accelerate distance queries.
			Process 19: Computed bounding box tree with 82237 nodes for 41119 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 80693 nodes for 40347 points.
			Total number of muSpectre tasks: 16 Total number of fenics tasks: 20
			Total FENICS time: 863.7812099456787
			Total run time for 100 steps: 880.267350435257
			Total MUSPECTRE time: 880.2246689796448
			90
			Process 3: Computed global bounding box tree with 35 boxes.
			Process 5: Computed global bounding box tree with 35 boxes.
			Process 6: Computed global bounding box tree with 35 boxes.
			Process 7: Computed global bounding box tree with 35 boxes.
			Process 9: Computed global bounding box tree with 35 boxes.
			Process 12: Computed global bounding box tree with 35 boxes.
			Process 13: Computed global bounding box tree with 35 boxes.
			Process 16: Computed global bounding box tree with 35 boxes.
			Process 0: Computed global bounding box tree with 35 boxes.
			Process 1: Computed global bounding box tree with 35 boxes.
			Process 2: Computed global bounding box tree with 35 boxes.
			Process 4: Computed global bounding box tree with 35 boxes.
			Process 8: Computed global bounding box tree with 35 boxes.
			Process 11: Computed global bounding box tree with 35 boxes.
			Process 14: Computed global bounding box tree with 35 boxes.
			Process 15: Computed global bounding box tree with 35 boxes.
			Process 17: Computed global bounding box tree with 35 boxes.
			Process 10: Computed global bounding box tree with 35 boxes.
			Process 9: Building point search tree to accelerate distance queries.
			Process 9: Computed bounding box tree with 90447 nodes for 45224 points.
			Process 10: Building point search tree to accelerate distance queries.
			Process 5: Building point search tree to accelerate distance queries.
			Process 15: Building point search tree to accelerate distance queries.
			Process 8: Building point search tree to accelerate distance queries.
			Process 3: Building point search tree to accelerate distance queries.
			Process 10: Computed bounding box tree with 88751 nodes for 44376 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 90327 nodes for 45164 points.
			Process 15: Computed bounding box tree with 88771 nodes for 44386 points.
			Process 3: Computed bounding box tree with 91083 nodes for 45542 points.
			Process 8: Computed bounding box tree with 90681 nodes for 45341 points.
			Process 4: Computed bounding box tree with 89729 nodes for 44865 points.
			Process 6: Building point search tree to accelerate distance queries.
			Process 11: Building point search tree to accelerate distance queries.
			Process 16: Building point search tree to accelerate distance queries.
			Process 11: Computed bounding box tree with 88555 nodes for 44278 points.
			Process 6: Computed bounding box tree with 89409 nodes for 44705 points.
			Process 16: Computed bounding box tree with 89321 nodes for 44661 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 14: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 90465 nodes for 45233 points.
			Process 14: Computed bounding box tree with 91081 nodes for 45541 points.
			Process 13: Building point search tree to accelerate distance queries.
			Process 2: Building point search tree to accelerate distance queries.
			Process 17: Building point search tree to accelerate distance queries.
			Process 13: Computed bounding box tree with 87533 nodes for 43767 points.
			Process 2: Computed bounding box tree with 90879 nodes for 45440 points.
			Process 17: Computed bounding box tree with 92157 nodes for 46079 points.
			Process 7: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 88723 nodes for 44362 points.
			Process 12: Building point search tree to accelerate distance queries.
			Process 12: Computed bounding box tree with 92083 nodes for 46042 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 87857 nodes for 43929 points.
			Total number of muSpectre tasks: 18 Total number of fenics tasks: 18
			Total FENICS time: 871.5066239833832
			Total run time for 100 steps: 888.1264140605927
			Total MUSPECTRE time: 888.1010138988495
			90
			Process 7: Computed global bounding box tree with 31 boxes.
			Process 10: Computed global bounding box tree with 31 boxes.
			Process 11: Computed global bounding box tree with 31 boxes.
			Process 12: Computed global bounding box tree with 31 boxes.
			Process 15: Computed global bounding box tree with 31 boxes.
			Process 0: Computed global bounding box tree with 31 boxes.
			Process 1: Computed global bounding box tree with 31 boxes.
			Process 2: Computed global bounding box tree with 31 boxes.
			Process 3: Computed global bounding box tree with 31 boxes.
			Process 4: Computed global bounding box tree with 31 boxes.
			Process 5: Computed global bounding box tree with 31 boxes.
			Process 6: Computed global bounding box tree with 31 boxes.
			Process 8: Computed global bounding box tree with 31 boxes.
			Process 9: Computed global bounding box tree with 31 boxes.
			Process 13: Computed global bounding box tree with 31 boxes.
			Process 14: Computed global bounding box tree with 31 boxes.
			Process 11: Building point search tree to accelerate distance queries.
			Process 14: Building point search tree to accelerate distance queries.
			Process 2: Building point search tree to accelerate distance queries.
			Process 0: Building point search tree to accelerate distance queries.
			Process 11: Computed bounding box tree with 100423 nodes for 50212 points.
			Process 2: Computed bounding box tree with 99235 nodes for 49618 points.
			Process 14: Computed bounding box tree with 99747 nodes for 49874 points.
			Process 0: Computed bounding box tree with 99071 nodes for 49536 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 6: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 102355 nodes for 51178 points.
			Process 10: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 99219 nodes for 49610 points.
			Process 10: Computed bounding box tree with 102453 nodes for 51227 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 8: Building point search tree to accelerate distance queries.
			Process 13: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 102995 nodes for 51498 points.
			Process 8: Computed bounding box tree with 99517 nodes for 49759 points.
			Process 15: Building point search tree to accelerate distance queries.
			Process 13: Computed bounding box tree with 103759 nodes for 51880 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 15: Computed bounding box tree with 103059 nodes for 51530 points.
			Process 7: Building point search tree to accelerate distance queries.
			Process 9: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 102093 nodes for 51047 points.
			Process 7: Computed bounding box tree with 102075 nodes for 51038 points.
			Process 9: Computed bounding box tree with 100087 nodes for 50044 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 101889 nodes for 50945 points.
			Process 12: Building point search tree to accelerate distance queries.
			Process 12: Computed bounding box tree with 99877 nodes for 49939 points.
			Total number of muSpectre tasks: 20 Total number of fenics tasks: 16
			Total FENICS time: 777.8107891082764
			Total run time for 100 steps: 793.1376850605011
			Total MUSPECTRE time: 793.1241989135742
			90
			Process 0: Computed global bounding box tree with 23 boxes.
			Process 1: Computed global bounding box tree with 23 boxes.
			Process 2: Computed global bounding box tree with 23 boxes.
			Process 3: Computed global bounding box tree with 23 boxes.
			Process 4: Computed global bounding box tree with 23 boxes.
			Process 7: Computed global bounding box tree with 23 boxes.
			Process 9: Computed global bounding box tree with 23 boxes.
			Process 11: Computed global bounding box tree with 23 boxes.
			Process 5: Computed global bounding box tree with 23 boxes.
			Process 6: Computed global bounding box tree with 23 boxes.
			Process 10: Computed global bounding box tree with 23 boxes.
			Process 8: Computed global bounding box tree with 23 boxes.
			Process 6: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 135083 nodes for 67542 points.
			Process 8: Building point search tree to accelerate distance queries.
			Process 10: Building point search tree to accelerate distance queries.
			Process 9: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 134209 nodes for 67105 points.
			Process 10: Computed bounding box tree with 134807 nodes for 67404 points.
			Process 9: Computed bounding box tree with 133715 nodes for 66858 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 136475 nodes for 68238 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 0: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 135031 nodes for 67516 points.
			Process 0: Computed bounding box tree with 133027 nodes for 66514 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 7: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 132875 nodes for 66438 points.
			Process 7: Computed bounding box tree with 132571 nodes for 66286 points.
			Process 11: Building point search tree to accelerate distance queries.
			Process 3: Building point search tree to accelerate distance queries.
			Process 11: Computed bounding box tree with 137593 nodes for 68797 points.
			Process 3: Computed bounding box tree with 136937 nodes for 68469 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 135535 nodes for 67768 points.
			Total number of muSpectre tasks: 24 Total number of fenics tasks: 12
			Total FENICS time: 667.018648147583
			Total run time for 100 steps: 680.957849740982
			Total MUSPECTRE time: 680.9069509506226
			90
			Process 0: Computed global bounding box tree with 19 boxes.
			Process 2: Computed global bounding box tree with 19 boxes.
			Process 3: Computed global bounding box tree with 19 boxes.
			Process 4: Computed global bounding box tree with 19 boxes.
			Process 5: Computed global bounding box tree with 19 boxes.
			Process 6: Computed global bounding box tree with 19 boxes.
			Process 7: Computed global bounding box tree with 19 boxes.
			Process 8: Computed global bounding box tree with 19 boxes.
			Process 9: Computed global bounding box tree with 19 boxes.
			Process 1: Computed global bounding box tree with 19 boxes.
			Process 7: Building point search tree to accelerate distance queries.
			Process 3: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 160935 nodes for 80468 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 165103 nodes for 82552 points.
			Process 9: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 159795 nodes for 79898 points.
			Process 9: Computed bounding box tree with 164069 nodes for 82035 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 158979 nodes for 79490 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 161197 nodes for 80599 points.
			Process 1: Computed bounding box tree with 161475 nodes for 80738 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 163087 nodes for 81544 points.
			Process 6: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 165415 nodes for 82708 points.
			Process 8: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 157805 nodes for 78903 points.
			Total number of muSpectre tasks: 26 Total number of fenics tasks: 10
			Total FENICS time: 623.599573135376
			Total run time for 100 steps: 637.4268810749054
			Total MUSPECTRE time: 637.4114580154419
			90
			Process 0: Computed global bounding box tree with 15 boxes.
			Process 1: Computed global bounding box tree with 15 boxes.
			Process 2: Computed global bounding box tree with 15 boxes.
			Process 3: Computed global bounding box tree with 15 boxes.
			Process 4: Computed global bounding box tree with 15 boxes.
			Process 5: Computed global bounding box tree with 15 boxes.
			Process 6: Computed global bounding box tree with 15 boxes.
			Process 7: Computed global bounding box tree with 15 boxes.
			Process 7: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 200581 nodes for 100291 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 3: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 200699 nodes for 100350 points.
			Process 3: Computed bounding box tree with 202177 nodes for 101089 points.
			Process 6: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 207373 nodes for 103687 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 196327 nodes for 98164 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 202559 nodes for 101280 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 204033 nodes for 102017 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 204113 nodes for 102057 points.
			Total number of muSpectre tasks: 28 Total number of fenics tasks: 8
			Total FENICS time: 624.4772160053253
			Total run time for 100 steps: 637.564656496048
			Total MUSPECTRE time: 637.547327041626
			90
			Process 0: Computed global bounding box tree with 11 boxes.
			Process 1: Computed global bounding box tree with 11 boxes.
			Process 2: Computed global bounding box tree with 11 boxes.
			Process 3: Computed global bounding box tree with 11 boxes.
			Process 4: Computed global bounding box tree with 11 boxes.
			Process 5: Computed global bounding box tree with 11 boxes.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 265247 nodes for 132624 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 269647 nodes for 134824 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 265717 nodes for 132859 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 273613 nodes for 136807 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 270251 nodes for 135126 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 273389 nodes for 136695 points.
			Total number of muSpectre tasks: 30 Total number of fenics tasks: 6
			Total FENICS time: 628.1165871620178
			Total run time for 100 steps: 640.1842849254608
			Total MUSPECTRE time: 640.1790130138397
			90
			Process 0: Computed global bounding box tree with 7 boxes.
			Process 1: Computed global bounding box tree with 7 boxes.
			Process 2: Computed global bounding box tree with 7 boxes.
			Process 3: Computed global bounding box tree with 7 boxes.
			Process 2: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 399751 nodes for 199876 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 416053 nodes for 208027 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 401135 nodes for 200568 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 400927 nodes for 200464 points.
			Total number of muSpectre tasks: 32 Total number of fenics tasks: 4
			Total FENICS time: 828.8338389396667
			Total run time for 100 steps: 838.3289070129395
			Total MUSPECTRE time: 838.3124749660492
			90
			Process 0: Computed global bounding box tree with 3 boxes.
			Process 1: Computed global bounding box tree with 3 boxes.
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 808773 nodes for 404387 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 809095 nodes for 404548 points.
			Total number of muSpectre tasks: 34 Total number of fenics tasks: 2
			Total FENICS time: 1415.09823513031
			Total run time for 100 steps: 1420.725035905838
			Total MUSPECTRE time: 1420.7059080600739
			90
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 1617869 nodes for 808935 points.
			Total number of muSpectre tasks: 35 Total number of fenics tasks: 1
			Total FENICS time: 2507.35174202919
			Total run time for 100 steps: 2517.170387029648
			Total MUSPECTRE time: 2517.165906906128
			130
			Process 7: Computed global bounding box tree with 47 boxes.
			Process 8: Computed global bounding box tree with 47 boxes.
			Process 10: Computed global bounding box tree with 47 boxes.
			Process 14: Computed global bounding box tree with 47 boxes.
			Process 16: Computed global bounding box tree with 47 boxes.
			Process 17: Computed global bounding box tree with 47 boxes.
			Process 18: Computed global bounding box tree with 47 boxes.
			Process 22: Computed global bounding box tree with 47 boxes.
			Process 0: Computed global bounding box tree with 47 boxes.
			Process 1: Computed global bounding box tree with 47 boxes.
			Process 2: Computed global bounding box tree with 47 boxes.
			Process 3: Computed global bounding box tree with 47 boxes.
			Process 4: Computed global bounding box tree with 47 boxes.
			Process 5: Computed global bounding box tree with 47 boxes.
			Process 6: Computed global bounding box tree with 47 boxes.
			Process 9: Computed global bounding box tree with 47 boxes.
			Process 12: Computed global bounding box tree with 47 boxes.
			Process 13: Computed global bounding box tree with 47 boxes.
			Process 15: Computed global bounding box tree with 47 boxes.
			Process 19: Computed global bounding box tree with 47 boxes.
			Process 20: Computed global bounding box tree with 47 boxes.
			Process 21: Computed global bounding box tree with 47 boxes.
			Process 23: Computed global bounding box tree with 47 boxes.
			Process 11: Computed global bounding box tree with 47 boxes.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 62903 nodes for 31452 points.
			Process 6: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 66327 nodes for 33164 points.
			Process 11: Building point search tree to accelerate distance queries.
			Process 2: Building point search tree to accelerate distance queries.
			Process 11: Computed bounding box tree with 63597 nodes for 31799 points.
			Process 2: Computed bounding box tree with 63723 nodes for 31862 points.
			Process 18: Building point search tree to accelerate distance queries.
			Process 16: Building point search tree to accelerate distance queries.
			Process 18: Computed bounding box tree with 64963 nodes for 32482 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 16: Computed bounding box tree with 65055 nodes for 32528 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 66181 nodes for 33091 points.
			Process 3: Computed bounding box tree with 66701 nodes for 33351 points.
			Process 17: Building point search tree to accelerate distance queries.
			Process 17: Computed bounding box tree with 67427 nodes for 33714 points.
			Process 13: Building point search tree to accelerate distance queries.
			Process 13: Computed bounding box tree with 65663 nodes for 32832 points.
			Process 14: Building point search tree to accelerate distance queries.
			Process 14: Computed bounding box tree with 64359 nodes for 32180 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 65709 nodes for 32855 points.
			Process 8: Building point search tree to accelerate distance queries.
			Process 4: Building point search tree to accelerate distance queries.
			Process 9: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 66931 nodes for 33466 points.
			Process 4: Computed bounding box tree with 65471 nodes for 32736 points.
			Process 9: Computed bounding box tree with 66301 nodes for 33151 points.
			Process 7: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 63933 nodes for 31967 points.
			Process 10: Building point search tree to accelerate distance queries.
			Process 22: Building point search tree to accelerate distance queries.
			Process 10: Computed bounding box tree with 66175 nodes for 33088 points.
			Process 22: Computed bounding box tree with 66885 nodes for 33443 points.
			Process 21: Building point search tree to accelerate distance queries.
			Process 21: Computed bounding box tree with 64145 nodes for 32073 points.
			Process 15: Building point search tree to accelerate distance queries.
			Process 15: Computed bounding box tree with 65447 nodes for 32724 points.
			Process 20: Building point search tree to accelerate distance queries.
			Process 20: Computed bounding box tree with 65063 nodes for 32532 points.
			Process 19: Building point search tree to accelerate distance queries.
			Process 19: Computed bounding box tree with 67719 nodes for 33860 points.
			Process 12: Building point search tree to accelerate distance queries.
			Process 12: Computed bounding box tree with 65345 nodes for 32673 points.
			Process 23: Building point search tree to accelerate distance queries.
			Process 23: Computed bounding box tree with 64281 nodes for 32141 points.
			Total number of muSpectre tasks: 12 Total number of fenics tasks: 24
			Total FENICS time: 1554.8996379375458
			Total run time for 100 steps: 1582.7411000728607
			Total MUSPECTRE time: 1582.7262160778046
			130
			Process 1: Computed global bounding box tree with 39 boxes.
			Process 3: Computed global bounding box tree with 39 boxes.
			Process 11: Computed global bounding box tree with 39 boxes.
			Process 15: Computed global bounding box tree with 39 boxes.
			Process 17: Computed global bounding box tree with 39 boxes.
			Process 19: Computed global bounding box tree with 39 boxes.
			Process 0: Computed global bounding box tree with 39 boxes.
			Process 2: Computed global bounding box tree with 39 boxes.
			Process 4: Computed global bounding box tree with 39 boxes.
			Process 5: Computed global bounding box tree with 39 boxes.
			Process 6: Computed global bounding box tree with 39 boxes.
			Process 7: Computed global bounding box tree with 39 boxes.
			Process 8: Computed global bounding box tree with 39 boxes.
			Process 9: Computed global bounding box tree with 39 boxes.
			Process 10: Computed global bounding box tree with 39 boxes.
			Process 12: Computed global bounding box tree with 39 boxes.
			Process 13: Computed global bounding box tree with 39 boxes.
			Process 14: Computed global bounding box tree with 39 boxes.
			Process 16: Computed global bounding box tree with 39 boxes.
			Process 18: Computed global bounding box tree with 39 boxes.
			Process 7: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 79115 nodes for 39558 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 76735 nodes for 38368 points.
			Process 14: Building point search tree to accelerate distance queries.
			Process 9: Building point search tree to accelerate distance queries.
			Process 14: Computed bounding box tree with 80199 nodes for 40100 points.
			Process 9: Computed bounding box tree with 77051 nodes for 38526 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 78547 nodes for 39274 points.
			Process 6: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 77349 nodes for 38675 points.
			Process 18: Building point search tree to accelerate distance queries.
			Process 18: Computed bounding box tree with 76633 nodes for 38317 points.
			Process 15: Building point search tree to accelerate distance queries.
			Process 15: Computed bounding box tree with 78147 nodes for 39074 points.
			Process 17: Building point search tree to accelerate distance queries.
			Process 5: Building point search tree to accelerate distance queries.
			Process 13: Building point search tree to accelerate distance queries.
			Process 17: Computed bounding box tree with 79941 nodes for 39971 points.
			Process 5: Computed bounding box tree with 80277 nodes for 40139 points.
			Process 13: Computed bounding box tree with 77313 nodes for 38657 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 80029 nodes for 40015 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 76975 nodes for 38488 points.
			Process 8: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 79345 nodes for 39673 points.
			Process 16: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 79737 nodes for 39869 points.
			Process 11: Building point search tree to accelerate distance queries.
			Process 16: Computed bounding box tree with 79027 nodes for 39514 points.
			Process 11: Computed bounding box tree with 77093 nodes for 38547 points.
			Process 19: Building point search tree to accelerate distance queries.
			Process 19: Computed bounding box tree with 79717 nodes for 39859 points.
			Process 10: Building point search tree to accelerate distance queries.
			Process 10: Computed bounding box tree with 79963 nodes for 39982 points.
			Process 12: Building point search tree to accelerate distance queries.
			Process 12: Computed bounding box tree with 77115 nodes for 38558 points.
			Total number of muSpectre tasks: 16 Total number of fenics tasks: 20
			Total FENICS time: 1297.2127668857574
			Total run time for 100 steps: 1320.8543915748596
			Total MUSPECTRE time: 1320.8394768238068
			130
			Process 1: Computed global bounding box tree with 35 boxes.
			Process 4: Computed global bounding box tree with 35 boxes.
			Process 10: Computed global bounding box tree with 35 boxes.
			Process 14: Computed global bounding box tree with 35 boxes.
			Process 16: Computed global bounding box tree with 35 boxes.
			Process 0: Computed global bounding box tree with 35 boxes.
			Process 3: Computed global bounding box tree with 35 boxes.
			Process 5: Computed global bounding box tree with 35 boxes.
			Process 6: Computed global bounding box tree with 35 boxes.
			Process 7: Computed global bounding box tree with 35 boxes.
			Process 8: Computed global bounding box tree with 35 boxes.
			Process 9: Computed global bounding box tree with 35 boxes.
			Process 11: Computed global bounding box tree with 35 boxes.
			Process 12: Computed global bounding box tree with 35 boxes.
			Process 13: Computed global bounding box tree with 35 boxes.
			Process 15: Computed global bounding box tree with 35 boxes.
			Process 17: Computed global bounding box tree with 35 boxes.
			Process 2: Computed global bounding box tree with 35 boxes.
			Process 8: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 88851 nodes for 44426 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 0: Building point search tree to accelerate distance queries.
			Process 6: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 89241 nodes for 44621 points.
			Process 9: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 87567 nodes for 43784 points.
			Process 6: Computed bounding box tree with 88719 nodes for 44360 points.
			Process 9: Computed bounding box tree with 87633 nodes for 43817 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 11: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 86231 nodes for 43116 points.
			Process 11: Computed bounding box tree with 86325 nodes for 43163 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 85759 nodes for 42880 points.
			Process 7: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 85373 nodes for 42687 points.
			Process 10: Building point search tree to accelerate distance queries.
			Process 16: Building point search tree to accelerate distance queries.
			Process 10: Computed bounding box tree with 85049 nodes for 42525 points.
			Process 16: Computed bounding box tree with 86579 nodes for 43290 points.
			Process 17: Building point search tree to accelerate distance queries.
			Process 17: Computed bounding box tree with 90045 nodes for 45023 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 87439 nodes for 43720 points.
			Process 14: Building point search tree to accelerate distance queries.
			Process 14: Computed bounding box tree with 87933 nodes for 43967 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 86183 nodes for 43092 points.
			Process 12: Building point search tree to accelerate distance queries.
			Process 12: Computed bounding box tree with 89819 nodes for 44910 points.
			Process 15: Building point search tree to accelerate distance queries.
			Process 15: Computed bounding box tree with 86473 nodes for 43237 points.
			Process 13: Building point search tree to accelerate distance queries.
			Process 13: Computed bounding box tree with 85091 nodes for 42546 points.
			Total number of muSpectre tasks: 18 Total number of fenics tasks: 18
			Total FENICS time: 1169.9077899456024
			Total run time for 100 steps: 1192.838167667389
			Total MUSPECTRE time: 1192.8342349529266
			130
			Process 5: Computed global bounding box tree with 31 boxes.
			Process 8: Computed global bounding box tree with 31 boxes.
			Process 12: Computed global bounding box tree with 31 boxes.
			Process 1: Computed global bounding box tree with 31 boxes.
			Process 2: Computed global bounding box tree with 31 boxes.
			Process 3: Computed global bounding box tree with 31 boxes.
			Process 4: Computed global bounding box tree with 31 boxes.
			Process 6: Computed global bounding box tree with 31 boxes.
			Process 7: Computed global bounding box tree with 31 boxes.
			Process 9: Computed global bounding box tree with 31 boxes.
			Process 10: Computed global bounding box tree with 31 boxes.
			Process 11: Computed global bounding box tree with 31 boxes.
			Process 13: Computed global bounding box tree with 31 boxes.
			Process 14: Computed global bounding box tree with 31 boxes.
			Process 15: Computed global bounding box tree with 31 boxes.
			Process 0: Computed global bounding box tree with 31 boxes.
			Process 14: Building point search tree to accelerate distance queries.
			Process 0: Building point search tree to accelerate distance queries.
			Process 14: Computed bounding box tree with 99891 nodes for 49946 points.
			Process 0: Computed bounding box tree with 98257 nodes for 49129 points.
			Process 7: Building point search tree to accelerate distance queries.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 98827 nodes for 49414 points.
			Process 7: Computed bounding box tree with 98463 nodes for 49232 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 95973 nodes for 47987 points.
			Process 12: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 98555 nodes for 49278 points.
			Process 12: Computed bounding box tree with 96367 nodes for 48184 points.
			Process 6: Building point search tree to accelerate distance queries.
			Process 4: Building point search tree to accelerate distance queries.
			Process 3: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 97331 nodes for 48666 points.
			Process 4: Computed bounding box tree with 97837 nodes for 48919 points.
			Process 3: Computed bounding box tree with 99887 nodes for 49944 points.
			Process 9: Building point search tree to accelerate distance queries.
			Process 13: Building point search tree to accelerate distance queries.
			Process 8: Building point search tree to accelerate distance queries.
			Process 9: Computed bounding box tree with 95527 nodes for 47764 points.
			Process 13: Computed bounding box tree with 100265 nodes for 50133 points.
			Process 8: Computed bounding box tree with 99387 nodes for 49694 points.
			Process 15: Building point search tree to accelerate distance queries.
			Process 15: Computed bounding box tree with 96097 nodes for 48049 points.
			Process 11: Building point search tree to accelerate distance queries.
			Process 11: Computed bounding box tree with 100799 nodes for 50400 points.
			Process 10: Building point search tree to accelerate distance queries.
			Process 10: Computed bounding box tree with 96849 nodes for 48425 points.
			Total number of muSpectre tasks: 20 Total number of fenics tasks: 16
			Total FENICS time: 1076.881667137146
			Total run time for 100 steps: 1096.6420974731445
			Total MUSPECTRE time: 1096.6274769306183
			130
			Process 0: Computed global bounding box tree with 23 boxes.
			Process 1: Computed global bounding box tree with 23 boxes.
			Process 2: Computed global bounding box tree with 23 boxes.
			Process 3: Computed global bounding box tree with 23 boxes.
			Process 4: Computed global bounding box tree with 23 boxes.
			Process 5: Computed global bounding box tree with 23 boxes.
			Process 6: Computed global bounding box tree with 23 boxes.
			Process 7: Computed global bounding box tree with 23 boxes.
			Process 9: Computed global bounding box tree with 23 boxes.
			Process 10: Computed global bounding box tree with 23 boxes.
			Process 11: Computed global bounding box tree with 23 boxes.
			Process 8: Computed global bounding box tree with 23 boxes.
			Process 11: Building point search tree to accelerate distance queries.
			Process 11: Computed bounding box tree with 132157 nodes for 66079 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 130371 nodes for 65186 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 132763 nodes for 66382 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 130467 nodes for 65234 points.
			Process 7: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 130687 nodes for 65344 points.
			Process 6: Building point search tree to accelerate distance queries.
			Process 4: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 133261 nodes for 66631 points.
			Process 4: Computed bounding box tree with 130271 nodes for 65136 points.
			Process 10: Building point search tree to accelerate distance queries.
			Process 10: Computed bounding box tree with 131651 nodes for 65826 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 131299 nodes for 65650 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 128373 nodes for 64187 points.
			Process 9: Building point search tree to accelerate distance queries.
			Process 9: Computed bounding box tree with 129079 nodes for 64540 points.
			Process 8: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 129937 nodes for 64969 points.
			Total number of muSpectre tasks: 24 Total number of fenics tasks: 12
			Total FENICS time: 938.1328060626984
			Total run time for 100 steps: 956.6911845207214
			Total MUSPECTRE time: 956.6871180534363
			130
			Process 6: Computed global bounding box tree with 19 boxes.
			Process 8: Computed global bounding box tree with 19 boxes.
			Process 0: Computed global bounding box tree with 19 boxes.
			Process 1: Computed global bounding box tree with 19 boxes.
			Process 3: Computed global bounding box tree with 19 boxes.
			Process 4: Computed global bounding box tree with 19 boxes.
			Process 5: Computed global bounding box tree with 19 boxes.
			Process 7: Computed global bounding box tree with 19 boxes.
			Process 9: Computed global bounding box tree with 19 boxes.
			Process 2: Computed global bounding box tree with 19 boxes.
			Process 0: Building point search tree to accelerate distance queries.
			Process 9: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 158151 nodes for 79076 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 9: Computed bounding box tree with 158927 nodes for 79464 points.
			Process 4: Computed bounding box tree with 157487 nodes for 78744 points.
			Process 6: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 153903 nodes for 76952 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 8: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 156887 nodes for 78444 points.
			Process 8: Computed bounding box tree with 158231 nodes for 79116 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 7: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 156059 nodes for 78030 points.
			Process 7: Computed bounding box tree with 155071 nodes for 77536 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 160037 nodes for 80019 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 155565 nodes for 77783 points.
			Total number of muSpectre tasks: 26 Total number of fenics tasks: 10
			Total FENICS time: 885.5882759094238
			Total run time for 100 steps: 902.9706966876984
			Total MUSPECTRE time: 902.9636268615723
			130
			Process 1: Computed global bounding box tree with 15 boxes.
			Process 3: Computed global bounding box tree with 15 boxes.
			Process 4: Computed global bounding box tree with 15 boxes.
			Process 7: Computed global bounding box tree with 15 boxes.
			Process 0: Computed global bounding box tree with 15 boxes.
			Process 2: Computed global bounding box tree with 15 boxes.
			Process 5: Computed global bounding box tree with 15 boxes.
			Process 6: Computed global bounding box tree with 15 boxes.
			Process 3: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 196185 nodes for 98093 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 196369 nodes for 98185 points.
			Process 7: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 192721 nodes for 96361 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 196857 nodes for 98429 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 192819 nodes for 96410 points.
			Process 1: Computed bounding box tree with 195873 nodes for 97937 points.
			Process 6: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 199483 nodes for 99742 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 200013 nodes for 100007 points.
			Total number of muSpectre tasks: 28 Total number of fenics tasks: 8
			Total FENICS time: 834.350744009018
			Total run time for 100 steps: 846.4892976284027
			Total MUSPECTRE time: 846.4733970165253
			130
			Process 0: Computed global bounding box tree with 11 boxes.
			Process 1: Computed global bounding box tree with 11 boxes.
			Process 2: Computed global bounding box tree with 11 boxes.
			Process 3: Computed global bounding box tree with 11 boxes.
			Process 4: Computed global bounding box tree with 11 boxes.
			Process 5: Computed global bounding box tree with 11 boxes.
			Process 0: Building point search tree to accelerate distance queries.
			Process 2: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 261921 nodes for 130961 points.
			Process 2: Computed bounding box tree with 261601 nodes for 130801 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 259817 nodes for 129909 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 261601 nodes for 130801 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 262599 nodes for 131300 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 262783 nodes for 131392 points.
			Total number of muSpectre tasks: 30 Total number of fenics tasks: 6
			Total FENICS time: 947.5355591773987
			Total run time for 100 steps: 959.316782951355
			Total MUSPECTRE time: 959.288223028183
			130
			Process 0: Computed global bounding box tree with 7 boxes.
			Process 1: Computed global bounding box tree with 7 boxes.
			Process 2: Computed global bounding box tree with 7 boxes.
			Process 3: Computed global bounding box tree with 7 boxes.
			Process 3: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 391377 nodes for 195689 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 391613 nodes for 195807 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 393593 nodes for 196797 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 393741 nodes for 196871 points.
			Total number of muSpectre tasks: 32 Total number of fenics tasks: 4
			Total FENICS time: 1165.8697447776794
			Total run time for 100 steps: 1177.6404502391815
			Total MUSPECTRE time: 1177.620043039322
			130
			Process 0: Computed global bounding box tree with 3 boxes.
			Process 1: Computed global bounding box tree with 3 boxes.
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 785643 nodes for 392822 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 784683 nodes for 392342 points.
			Total number of muSpectre tasks: 34 Total number of fenics tasks: 2
			Total FENICS time: 1999.5567598342896
			Total run time for 100 steps: 2005.737736940384
			Total MUSPECTRE time: 2005.7255170345306
			130
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 1570327 nodes for 785164 points.
			Total number of muSpectre tasks: 35 Total number of fenics tasks: 1
			Total FENICS time: 3543.121898174286
			Total run time for 100 steps: 3555.030203104019
			Total MUSPECTRE time: 3555.0217769145966
			170
			Process 3: Computed global bounding box tree with 47 boxes.
			Process 7: Computed global bounding box tree with 47 boxes.
			Process 10: Computed global bounding box tree with 47 boxes.
			Process 12: Computed global bounding box tree with 47 boxes.
			Process 19: Computed global bounding box tree with 47 boxes.
			Process 22: Computed global bounding box tree with 47 boxes.
			Process 0: Computed global bounding box tree with 47 boxes.
			Process 1: Computed global bounding box tree with 47 boxes.
			Process 2: Computed global bounding box tree with 47 boxes.
			Process 4: Computed global bounding box tree with 47 boxes.
			Process 5: Computed global bounding box tree with 47 boxes.
			Process 6: Computed global bounding box tree with 47 boxes.
			Process 8: Computed global bounding box tree with 47 boxes.
			Process 11: Computed global bounding box tree with 47 boxes.
			Process 13: Computed global bounding box tree with 47 boxes.
			Process 14: Computed global bounding box tree with 47 boxes.
			Process 15: Computed global bounding box tree with 47 boxes.
			Process 16: Computed global bounding box tree with 47 boxes.
			Process 17: Computed global bounding box tree with 47 boxes.
			Process 18: Computed global bounding box tree with 47 boxes.
			Process 20: Computed global bounding box tree with 47 boxes.
			Process 21: Computed global bounding box tree with 47 boxes.
			Process 23: Computed global bounding box tree with 47 boxes.
			Process 9: Computed global bounding box tree with 47 boxes.
			Process 15: Building point search tree to accelerate distance queries.
			Process 15: Computed bounding box tree with 62831 nodes for 31416 points.
			Process 17: Building point search tree to accelerate distance queries.
			Process 17: Computed bounding box tree with 61885 nodes for 30943 points.
			Process 20: Building point search tree to accelerate distance queries.
			Process 20: Computed bounding box tree with 65573 nodes for 32787 points.
			Process 14: Building point search tree to accelerate distance queries.
			Process 14: Computed bounding box tree with 64477 nodes for 32239 points.
			Process 22: Building point search tree to accelerate distance queries.
			Process 7: Building point search tree to accelerate distance queries.
			Process 22: Computed bounding box tree with 62503 nodes for 31252 points.
			Process 7: Computed bounding box tree with 61843 nodes for 30922 points.
			Process 23: Building point search tree to accelerate distance queries.
			Process 12: Building point search tree to accelerate distance queries.
			Process 23: Computed bounding box tree with 64387 nodes for 32194 points.
			Process 12: Computed bounding box tree with 64249 nodes for 32125 points.
			Process 10: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 62449 nodes for 31225 points.
			Process 10: Computed bounding box tree with 65509 nodes for 32755 points.
			Process 19: Building point search tree to accelerate distance queries.
			Process 19: Computed bounding box tree with 63001 nodes for 31501 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 63761 nodes for 31881 points.
			Process 11: Building point search tree to accelerate distance queries.
			Process 11: Computed bounding box tree with 62939 nodes for 31470 points.
			Process 13: Building point search tree to accelerate distance queries.
			Process 13: Computed bounding box tree with 61623 nodes for 30812 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 64845 nodes for 32423 points.
			Process 9: Building point search tree to accelerate distance queries.
			Process 18: Building point search tree to accelerate distance queries.
			Process 9: Computed bounding box tree with 62807 nodes for 31404 points.
			Process 18: Computed bounding box tree with 62729 nodes for 31365 points.
			Process 8: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 63323 nodes for 31662 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 63009 nodes for 31505 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 62903 nodes for 31452 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 21: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 63799 nodes for 31900 points.
			Process 21: Computed bounding box tree with 62033 nodes for 31017 points.
			Process 16: Building point search tree to accelerate distance queries.
			Process 16: Computed bounding box tree with 63761 nodes for 31881 points.
			Process 6: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 64347 nodes for 32174 points.
			Total number of muSpectre tasks: 12 Total number of fenics tasks: 24
			Total FENICS time: 2138.87162399292
			Total run time for 100 steps: 2177.3759462833405
			Total MUSPECTRE time: 2177.3505070209503
			170
			Process 3: Computed global bounding box tree with 39 boxes.
			Process 11: Computed global bounding box tree with 39 boxes.
			Process 13: Computed global bounding box tree with 39 boxes.
			Process 18: Computed global bounding box tree with 39 boxes.
			Process 19: Computed global bounding box tree with 39 boxes.
			Process 0: Computed global bounding box tree with 39 boxes.
			Process 1: Computed global bounding box tree with 39 boxes.
			Process 2: Computed global bounding box tree with 39 boxes.
			Process 4: Computed global bounding box tree with 39 boxes.
			Process 5: Computed global bounding box tree with 39 boxes.
			Process 6: Computed global bounding box tree with 39 boxes.
			Process 7: Computed global bounding box tree with 39 boxes.
			Process 8: Computed global bounding box tree with 39 boxes.
			Process 9: Computed global bounding box tree with 39 boxes.
			Process 10: Computed global bounding box tree with 39 boxes.
			Process 12: Computed global bounding box tree with 39 boxes.
			Process 14: Computed global bounding box tree with 39 boxes.
			Process 15: Computed global bounding box tree with 39 boxes.
			Process 16: Computed global bounding box tree with 39 boxes.
			Process 17: Computed global bounding box tree with 39 boxes.
			Process 4: Building point search tree to accelerate distance queries.
			Process 12: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 76301 nodes for 38151 points.
			Process 12: Computed bounding box tree with 75005 nodes for 37503 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 76565 nodes for 38283 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 76865 nodes for 38433 points.
			Process 11: Building point search tree to accelerate distance queries.
			Process 13: Building point search tree to accelerate distance queries.
			Process 11: Computed bounding box tree with 73627 nodes for 36814 points.
			Process 7: Building point search tree to accelerate distance queries.
			Process 13: Computed bounding box tree with 78229 nodes for 39115 points.
			Process 10: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 76597 nodes for 38299 points.
			Process 10: Computed bounding box tree with 76621 nodes for 38311 points.
			Process 18: Building point search tree to accelerate distance queries.
			Process 18: Computed bounding box tree with 74907 nodes for 37454 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 76467 nodes for 38234 points.
			Process 15: Building point search tree to accelerate distance queries.
			Process 15: Computed bounding box tree with 76725 nodes for 38363 points.
			Process 19: Building point search tree to accelerate distance queries.
			Process 19: Computed bounding box tree with 77945 nodes for 38973 points.
			Process 14: Building point search tree to accelerate distance queries.
			Process 14: Computed bounding box tree with 75187 nodes for 37594 points.
			Process 8: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 75127 nodes for 37564 points.
			Process 6: Building point search tree to accelerate distance queries.
			Process 0: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 76565 nodes for 38283 points.
			Process 0: Computed bounding box tree with 74737 nodes for 37369 points.
			Process 17: Building point search tree to accelerate distance queries.
			Process 17: Computed bounding box tree with 74849 nodes for 37425 points.
			Process 16: Building point search tree to accelerate distance queries.
			Process 16: Computed bounding box tree with 77199 nodes for 38600 points.
			Process 9: Building point search tree to accelerate distance queries.
			Process 9: Computed bounding box tree with 74689 nodes for 37345 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 76383 nodes for 38192 points.
			Total number of muSpectre tasks: 16 Total number of fenics tasks: 20
			Total FENICS time: 1573.6433310508728
			Total run time for 100 steps: 1602.188354730606
			Total MUSPECTRE time: 1602.169996023178
			170
			Process 5: Computed global bounding box tree with 35 boxes.
			Process 6: Computed global bounding box tree with 35 boxes.
			Process 10: Computed global bounding box tree with 35 boxes.
			Process 11: Computed global bounding box tree with 35 boxes.
			Process 13: Computed global bounding box tree with 35 boxes.
			Process 17: Computed global bounding box tree with 35 boxes.
			Process 0: Computed global bounding box tree with 35 boxes.
			Process 1: Computed global bounding box tree with 35 boxes.
			Process 2: Computed global bounding box tree with 35 boxes.
			Process 3: Computed global bounding box tree with 35 boxes.
			Process 4: Computed global bounding box tree with 35 boxes.
			Process 7: Computed global bounding box tree with 35 boxes.
			Process 8: Computed global bounding box tree with 35 boxes.
			Process 9: Computed global bounding box tree with 35 boxes.
			Process 12: Computed global bounding box tree with 35 boxes.
			Process 14: Computed global bounding box tree with 35 boxes.
			Process 15: Computed global bounding box tree with 35 boxes.
			Process 16: Computed global bounding box tree with 35 boxes.
			Process 6: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 83159 nodes for 41580 points.
			Process 1: Building point search tree to accelerate distance queries.
			Process 1: Computed bounding box tree with 84005 nodes for 42003 points.
			Process 16: Building point search tree to accelerate distance queries.
			Process 16: Computed bounding box tree with 83957 nodes for 41979 points.
			Process 13: Building point search tree to accelerate distance queries.
			Process 13: Computed bounding box tree with 82369 nodes for 41185 points.
			Process 9: Building point search tree to accelerate distance queries.
			Process 5: Building point search tree to accelerate distance queries.
			Process 9: Computed bounding box tree with 83009 nodes for 41505 points.
			Process 5: Computed bounding box tree with 85493 nodes for 42747 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 15: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 82401 nodes for 41201 points.
			Process 15: Computed bounding box tree with 83807 nodes for 41904 points.
			Process 10: Building point search tree to accelerate distance queries.
			Process 10: Computed bounding box tree with 84119 nodes for 42060 points.
			Process 7: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 84245 nodes for 42123 points.
			Process 12: Building point search tree to accelerate distance queries.
			Process 12: Computed bounding box tree with 84095 nodes for 42048 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 86547 nodes for 43274 points.
			Process 11: Building point search tree to accelerate distance queries.
			Process 11: Computed bounding box tree with 85679 nodes for 42840 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 84821 nodes for 42411 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 83919 nodes for 41960 points.
			Process 8: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 85881 nodes for 42941 points.
			Process 14: Building point search tree to accelerate distance queries.
			Process 14: Computed bounding box tree with 85707 nodes for 42854 points.
			Process 17: Building point search tree to accelerate distance queries.
			Process 17: Computed bounding box tree with 87379 nodes for 43690 points.
			Total number of muSpectre tasks: 18 Total number of fenics tasks: 18
			Total FENICS time: 1483.4741969108582
			Total run time for 100 steps: 1510.1517124176025
			Total MUSPECTRE time: 1510.1408681869507
			170
			Process 4: Computed global bounding box tree with 31 boxes.
			Process 7: Computed global bounding box tree with 31 boxes.
			Process 12: Computed global bounding box tree with 31 boxes.
			Process 15: Computed global bounding box tree with 31 boxes.
			Process 0: Computed global bounding box tree with 31 boxes.
			Process 1: Computed global bounding box tree with 31 boxes.
			Process 2: Computed global bounding box tree with 31 boxes.
			Process 3: Computed global bounding box tree with 31 boxes.
			Process 6: Computed global bounding box tree with 31 boxes.
			Process 8: Computed global bounding box tree with 31 boxes.
			Process 9: Computed global bounding box tree with 31 boxes.
			Process 10: Computed global bounding box tree with 31 boxes.
			Process 11: Computed global bounding box tree with 31 boxes.
			Process 13: Computed global bounding box tree with 31 boxes.
			Process 14: Computed global bounding box tree with 31 boxes.
			Process 5: Computed global bounding box tree with 31 boxes.
			Process 13: Building point search tree to accelerate distance queries.
			Process 13: Computed bounding box tree with 96763 nodes for 48382 points.
			Process 4: Building point search tree to accelerate distance queries.
			Process 4: Computed bounding box tree with 94579 nodes for 47290 points.
			Process 0: Building point search tree to accelerate distance queries.
			Process 0: Computed bounding box tree with 92821 nodes for 46411 points.
			Process 7: Building point search tree to accelerate distance queries.
			Process 7: Computed bounding box tree with 95119 nodes for 47560 points.
			Process 9: Building point search tree to accelerate distance queries.
			Process 9: Computed bounding box tree with 96069 nodes for 48035 points.
			Process 5: Building point search tree to accelerate distance queries.
			Process 5: Computed bounding box tree with 96541 nodes for 48271 points.
			Process 12: Building point search tree to accelerate distance queries.
			Process 12: Computed bounding box tree with 93687 nodes for 46844 points.
			Process 2: Building point search tree to accelerate distance queries.
			Process 2: Computed bounding box tree with 94787 nodes for 47394 points.
			Process 14: Building point search tree to accelerate distance queries.
			Process 14: Computed bounding box tree with 96191 nodes for 48096 points.
			Process 15: Building point search tree to accelerate distance queries.
			Process 15: Computed bounding box tree with 92491 nodes for 46246 points.
			Process 10: Building point search tree to accelerate distance queries.
			Process 10: Computed bounding box tree with 93355 nodes for 46678 points.
			Process 8: Building point search tree to accelerate distance queries.
			Process 8: Computed bounding box tree with 93809 nodes for 46905 points.
			Process 11: Building point search tree to accelerate distance queries.
			Process 1: Building point search tree to accelerate distance queries.
			Process 11: Computed bounding box tree with 97131 nodes for 48566 points.
			Process 1: Computed bounding box tree with 96601 nodes for 48301 points.
			Process 6: Building point search tree to accelerate distance queries.
			Process 6: Computed bounding box tree with 96081 nodes for 48041 points.
			Process 3: Building point search tree to accelerate distance queries.
			Process 3: Computed bounding box tree with 94569 nodes for 47285 points.
			Total number of muSpectre tasks: 20 Total number of fenics tasks: 16
			Total FENICS time: 1456.7730741500854
			Total run time for 100 steps: 1489.1768727302551
			Total MUSPECTRE time: 1489.1512670516968

R11910/mechanical_model/time_optimization_36.log371a6348faaamaster

time_optimization_36.logView Options

R11910/mechanical_model/time_optimization_36.log
371a6348faaamaster

time_optimization_36.log
View Options