Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882200295.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DatabaseWithMutex-PT-20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882200295
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.4M
-rw-r--r-- 1 mcc users 205K Mar 31 05:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 583K Mar 31 05:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 178K Mar 29 21:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 628K Mar 29 21:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 215K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 655K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 136K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 485K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 125K Mar 28 13:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 357K Mar 28 13:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 157K Mar 27 06:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 542K Mar 27 06:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 40K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 90K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 4.0M Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-00
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-01
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-02
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-03
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-04
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-05
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-06
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-07
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-08
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-09
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-10
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-11
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-12
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-13
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-14
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591215184886

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 20:13:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 20:13:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 20:13:06] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2020-06-03 20:13:06] [INFO ] Transformed 3260 places.
[2020-06-03 20:13:06] [INFO ] Transformed 3200 transitions.
[2020-06-03 20:13:06] [INFO ] Parsed PT model containing 3260 places and 3200 transitions in 250 ms.
[2020-06-03 20:13:06] [INFO ] Reduced 380 identical enabling conditions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 121 ms.
Working with output stream class java.io.PrintStream
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 194 ms. (steps per millisecond=51 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0]
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0]
// Phase 1: matrix 3200 rows 3260 cols
[2020-06-03 20:13:07] [INFO ] Computed 460 place invariants in 305 ms
[2020-06-03 20:13:07] [INFO ] [Real]Absence check using 78 positive place invariants in 140 ms returned sat
[2020-06-03 20:13:08] [INFO ] [Real]Absence check using 78 positive and 382 generalized place invariants in 760 ms returned sat
[2020-06-03 20:13:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:13:12] [INFO ] [Real]Absence check using state equation in 3814 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 20:13:13] [INFO ] [Real]Absence check using 78 positive place invariants in 196 ms returned sat
[2020-06-03 20:13:13] [INFO ] [Real]Absence check using 78 positive and 382 generalized place invariants in 799 ms returned sat
[2020-06-03 20:13:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:13:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 20:13:17] [INFO ] [Real]Absence check using state equation in 3653 ms returned (error "Failed to check-sat")
[2020-06-03 20:13:18] [INFO ] [Real]Absence check using 78 positive place invariants in 168 ms returned sat
[2020-06-03 20:13:18] [INFO ] [Real]Absence check using 78 positive and 382 generalized place invariants in 870 ms returned sat
[2020-06-03 20:13:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:13:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 20:13:22] [INFO ] [Real]Absence check using state equation in 3634 ms returned (error "Failed to check-sat")
Support contains 49 out of 3260 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Performed 692 Post agglomeration using F-continuation condition.Transition count delta: 692
Iterating post reduction 0 with 692 rules applied. Total rules applied 692 place count 3260 transition count 2508
Reduce places removed 704 places and 0 transitions.
Performed 468 Post agglomeration using F-continuation condition.Transition count delta: 468
Iterating post reduction 1 with 1172 rules applied. Total rules applied 1864 place count 2556 transition count 2040
Reduce places removed 468 places and 0 transitions.
Iterating post reduction 2 with 468 rules applied. Total rules applied 2332 place count 2088 transition count 2040
Performed 544 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 544 Pre rules applied. Total rules applied 2332 place count 2088 transition count 1496
Deduced a syphon composed of 544 places in 1 ms
Reduce places removed 544 places and 0 transitions.
Iterating global reduction 3 with 1088 rules applied. Total rules applied 3420 place count 1544 transition count 1496
Free-agglomeration rule applied 299 times.
Iterating global reduction 3 with 299 rules applied. Total rules applied 3719 place count 1544 transition count 1197
Reduce places removed 299 places and 0 transitions.
Iterating post reduction 3 with 299 rules applied. Total rules applied 4018 place count 1245 transition count 1197
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 4021 place count 1245 transition count 1194
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 4026 place count 1240 transition count 1194
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 38 Pre rules applied. Total rules applied 4026 place count 1240 transition count 1156
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 4102 place count 1202 transition count 1156
Applied a total of 4102 rules in 1204 ms. Remains 1202 /3260 variables (removed 2058) and now considering 1156/3200 (removed 2044) transitions.
Finished structural reductions, in 1 iterations. Remains : 1202/3260 places, 1156/3200 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 10196 ms. (steps per millisecond=98 ) properties seen :[1, 1, 0]
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 895557 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=179 ) properties seen :[0]
// Phase 1: matrix 1156 rows 1202 cols
[2020-06-03 20:13:38] [INFO ] Computed 446 place invariants in 40 ms
[2020-06-03 20:13:39] [INFO ] [Real]Absence check using 64 positive place invariants in 59 ms returned sat
[2020-06-03 20:13:39] [INFO ] [Real]Absence check using 64 positive and 382 generalized place invariants in 457 ms returned sat
[2020-06-03 20:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:13:43] [INFO ] [Real]Absence check using state equation in 4079 ms returned sat
[2020-06-03 20:13:44] [INFO ] Computed and/alt/rep : 756/101416/756 causal constraints in 215 ms.
[2020-06-03 20:13:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:13:44] [INFO ] [Nat]Absence check using 64 positive place invariants in 56 ms returned sat
[2020-06-03 20:13:45] [INFO ] [Nat]Absence check using 64 positive and 382 generalized place invariants in 355 ms returned sat
[2020-06-03 20:13:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:13:49] [INFO ] [Nat]Absence check using state equation in 4114 ms returned sat
[2020-06-03 20:13:49] [INFO ] Computed and/alt/rep : 756/101416/756 causal constraints in 368 ms.
[2020-06-03 20:14:05] [INFO ] Added : 561 causal constraints over 113 iterations in 16756 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 106 ms.
Incomplete Parikh walk after 397200 steps, including 818 resets, run finished after 6565 ms. (steps per millisecond=60 ) properties seen :[0] could not realise parikh vector
Support contains 36 out of 1202 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1202/1202 places, 1156/1156 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 1202 transition count 1114
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 87 place count 1158 transition count 1113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 1157 transition count 1113
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 88 place count 1157 transition count 1071
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 172 place count 1115 transition count 1071
Free-agglomeration rule applied 80 times.
Iterating global reduction 3 with 80 rules applied. Total rules applied 252 place count 1115 transition count 991
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 3 with 80 rules applied. Total rules applied 332 place count 1035 transition count 991
Applied a total of 332 rules in 233 ms. Remains 1035 /1202 variables (removed 167) and now considering 991/1156 (removed 165) transitions.
Finished structural reductions, in 1 iterations. Remains : 1035/1202 places, 991/1156 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 12110 ms. (steps per millisecond=82 ) properties seen :[0]
Interrupted Best-First random walk after 842061 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=168 ) properties seen :[0]
Interrupted probabilistic random walk after 1407381 steps, run timeout after 30001 ms. (steps per millisecond=46 ) properties seen :[0]
Probabilistic random walk after 1407381 steps, saw 161558 distinct states, run finished after 30001 ms. (steps per millisecond=46 ) properties seen :[0]
// Phase 1: matrix 991 rows 1035 cols
[2020-06-03 20:15:00] [INFO ] Computed 444 place invariants in 24 ms
[2020-06-03 20:15:00] [INFO ] [Real]Absence check using 62 positive place invariants in 58 ms returned sat
[2020-06-03 20:15:00] [INFO ] [Real]Absence check using 62 positive and 382 generalized place invariants in 402 ms returned sat
[2020-06-03 20:15:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:15:03] [INFO ] [Real]Absence check using state equation in 3155 ms returned sat
[2020-06-03 20:15:04] [INFO ] Computed and/alt/rep : 591/113887/591 causal constraints in 207 ms.
[2020-06-03 20:15:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:15:04] [INFO ] [Nat]Absence check using 62 positive place invariants in 60 ms returned sat
[2020-06-03 20:15:05] [INFO ] [Nat]Absence check using 62 positive and 382 generalized place invariants in 541 ms returned sat
[2020-06-03 20:15:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:15:08] [INFO ] [Nat]Absence check using state equation in 3061 ms returned sat
[2020-06-03 20:15:08] [INFO ] Computed and/alt/rep : 591/113887/591 causal constraints in 127 ms.
[2020-06-03 20:15:17] [INFO ] Added : 349 causal constraints over 70 iterations in 9389 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 79 ms.
Incomplete Parikh walk after 249700 steps, including 921 resets, run finished after 3410 ms. (steps per millisecond=73 ) properties seen :[0] could not realise parikh vector
Support contains 36 out of 1035 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1035/1035 places, 991/991 transitions.
Applied a total of 0 rules in 44 ms. Remains 1035 /1035 variables (removed 0) and now considering 991/991 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1035/1035 places, 991/991 transitions.
Starting structural reductions, iteration 0 : 1035/1035 places, 991/991 transitions.
Applied a total of 0 rules in 43 ms. Remains 1035 /1035 variables (removed 0) and now considering 991/991 (removed 0) transitions.
// Phase 1: matrix 991 rows 1035 cols
[2020-06-03 20:15:21] [INFO ] Computed 444 place invariants in 23 ms
[2020-06-03 20:15:25] [INFO ] Implicit Places using invariants in 4256 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 19, 23, 24, 25, 26, 28, 29, 31, 33, 34, 35, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 50, 51, 53, 55, 56, 57, 58, 60, 61, 62, 63, 64, 65, 69, 72, 75, 77, 79, 81, 82, 83, 84, 85, 88, 89, 90, 93, 95, 96, 97, 98, 99, 100, 101, 102, 103, 108, 110, 111, 112, 117, 118, 119, 120, 122, 124, 126, 129, 130, 131, 133, 134, 135, 136, 137, 138, 140, 142, 143, 144, 146, 148, 151, 153, 154, 156, 157, 158, 161, 163, 164, 165, 166, 167, 168, 169, 170, 171, 174, 176, 178, 180, 181, 182, 184, 185, 187, 188, 189, 190, 191, 192, 193, 194, 196, 197, 198, 199, 200, 202, 203, 204, 205, 207, 209, 210, 211, 212, 214, 215, 216, 217, 218, 220, 221, 223, 224, 225, 226, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 243, 245, 246, 247, 249, 250, 251, 253, 254, 255, 257, 259, 260, 261, 262, 263, 264, 267, 268, 269, 270, 271, 273, 275, 276, 278, 280, 282, 284, 288, 289, 290, 292, 293, 294, 295, 296, 297, 298, 300, 301, 304, 305, 306, 307, 309, 311, 313, 314, 315, 317, 318, 320, 321, 322, 324, 327, 329, 331, 332, 335, 336, 337, 341, 343, 344, 345, 346, 347, 349, 350, 351, 352, 355, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 371, 372, 373, 375, 376, 377, 380, 381, 382, 384, 386, 388, 389, 390, 392, 395, 396, 401, 402, 403, 404, 405, 406, 407, 408, 411, 412, 413, 414, 415, 416, 418, 419, 420, 421, 423, 424, 425, 426, 427, 428, 430, 431, 432, 433, 434, 437, 438, 439, 442, 443, 444, 445, 446, 448, 449, 450, 451, 452, 453, 454, 455, 456, 458, 459, 461, 463, 464, 467, 468, 469, 473, 474, 475, 477, 479, 480, 481, 484, 486, 489, 491, 492, 493, 494, 495, 497, 498, 499, 500, 501, 502, 503, 505, 507, 508, 510, 511, 513, 514, 515, 517, 518, 519, 522, 523, 527, 528, 529, 530, 532, 533, 534, 535, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, 553, 554, 556, 561, 563, 564, 565, 566, 567, 569, 570, 572, 574, 575, 576, 577, 578, 579, 580, 583, 584, 585, 586, 587, 589, 590, 591, 594, 595, 596, 597, 598, 599, 601, 603, 604, 605, 606, 607, 609, 611, 612, 613, 616, 617, 618, 621, 623, 624, 625, 626, 627, 631, 633, 634, 635, 636, 637, 638, 639, 643, 644, 645, 646, 647, 648, 649, 650, 655, 656, 657, 658, 659, 660, 661, 662, 663, 665, 666, 667, 670, 671, 673, 674, 675, 676, 679, 680, 681, 682, 683, 684, 685, 686, 689, 691, 692, 693, 695, 696, 697, 698, 699, 700, 701, 702, 703, 706, 707, 709, 710, 711, 714, 715, 716, 718, 719, 720, 722, 723, 725, 727, 728, 729, 730, 731, 733, 734, 735, 736, 739, 741, 742, 743, 749, 750, 751, 752, 755, 756, 757, 758, 763, 764, 765, 766, 767, 768, 769, 770, 772, 776, 777, 778, 779, 781, 782, 783, 786, 788, 789, 790, 791, 792, 793, 794, 796, 798, 799, 802, 803, 805, 809, 811, 812, 813, 815, 816, 819, 821, 822, 824, 825, 826, 827, 828, 829, 831, 832, 833, 834, 836, 837, 838, 839, 844, 846, 847, 848, 849, 850, 851, 852, 854, 855, 856, 857, 859, 864, 865, 867, 869, 870, 871, 872, 875, 876, 877, 878, 879, 880, 882, 883, 884, 885, 886, 887, 888, 889, 892, 894, 895, 896, 897, 899, 900, 901, 903, 904, 905, 906, 910, 911, 912, 913, 915, 916, 918, 919, 920, 921, 922, 925, 927, 930, 931, 932, 933, 934, 937, 938, 939, 940, 942, 943, 944, 945, 946, 948, 949, 950, 951, 952, 953, 954, 956, 959, 960, 961, 963, 964, 966, 969, 970, 971, 973, 976, 977, 979, 980, 981, 982, 983, 987, 989, 992, 993, 994, 996, 997, 999, 1001, 1005, 1006, 1007, 1008, 1009, 1010, 1011, 1012, 1013, 1015, 1018, 1019, 1021, 1022, 1024, 1027, 1028, 1029, 1031, 1032, 1034]
Discarding 703 places :
Implicit Place search using SMT only with invariants took 4284 ms to find 703 implicit places.
[2020-06-03 20:15:25] [INFO ] Redundant transitions in 84 ms returned []
// Phase 1: matrix 991 rows 332 cols
[2020-06-03 20:15:25] [INFO ] Computed 10 place invariants in 9 ms
[2020-06-03 20:15:26] [INFO ] Dead Transitions using invariants and state equation in 1168 ms returned []
Starting structural reductions, iteration 1 : 332/1035 places, 991/991 transitions.
Applied a total of 0 rules in 16 ms. Remains 332 /332 variables (removed 0) and now considering 991/991 (removed 0) transitions.
[2020-06-03 20:15:27] [INFO ] Redundant transitions in 133 ms returned []
// Phase 1: matrix 991 rows 332 cols
[2020-06-03 20:15:27] [INFO ] Computed 10 place invariants in 7 ms
[2020-06-03 20:15:28] [INFO ] Dead Transitions using invariants and state equation in 1070 ms returned []
Finished structural reductions, in 2 iterations. Remains : 332/1035 places, 991/991 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3958 ms. (steps per millisecond=252 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2614 ms. (steps per millisecond=382 ) properties seen :[0]
Interrupted probabilistic random walk after 4336049 steps, run timeout after 30001 ms. (steps per millisecond=144 ) properties seen :[0]
Probabilistic random walk after 4336049 steps, saw 422789 distinct states, run finished after 30001 ms. (steps per millisecond=144 ) properties seen :[0]
// Phase 1: matrix 991 rows 332 cols
[2020-06-03 20:16:04] [INFO ] Computed 10 place invariants in 19 ms
[2020-06-03 20:16:04] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned sat
[2020-06-03 20:16:04] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 10 ms returned sat
[2020-06-03 20:16:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:16:05] [INFO ] [Real]Absence check using state equation in 759 ms returned sat
[2020-06-03 20:16:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:16:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 20 ms returned sat
[2020-06-03 20:16:05] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 10 ms returned sat
[2020-06-03 20:16:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:16:06] [INFO ] [Nat]Absence check using state equation in 716 ms returned sat
[2020-06-03 20:16:06] [INFO ] Deduced a trap composed of 6 places in 60 ms
[2020-06-03 20:16:06] [INFO ] Deduced a trap composed of 6 places in 31 ms
[2020-06-03 20:16:06] [INFO ] Deduced a trap composed of 6 places in 27 ms
[2020-06-03 20:16:06] [INFO ] Deduced a trap composed of 6 places in 35 ms
[2020-06-03 20:16:06] [INFO ] Deduced a trap composed of 6 places in 31 ms
[2020-06-03 20:16:06] [INFO ] Deduced a trap composed of 6 places in 24 ms
[2020-06-03 20:16:06] [INFO ] Deduced a trap composed of 6 places in 19 ms
[2020-06-03 20:16:06] [INFO ] Deduced a trap composed of 7 places in 22 ms
[2020-06-03 20:16:06] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 461 ms
[2020-06-03 20:16:06] [INFO ] Computed and/alt/rep : 591/3744/591 causal constraints in 54 ms.
[2020-06-03 20:16:08] [INFO ] Added : 179 causal constraints over 36 iterations in 1285 ms. Result :sat
[2020-06-03 20:16:08] [INFO ] Deduced a trap composed of 6 places in 72 ms
[2020-06-03 20:16:08] [INFO ] Deduced a trap composed of 7 places in 88 ms
[2020-06-03 20:16:08] [INFO ] Deduced a trap composed of 6 places in 87 ms
[2020-06-03 20:16:08] [INFO ] Deduced a trap composed of 7 places in 84 ms
[2020-06-03 20:16:08] [INFO ] Deduced a trap composed of 7 places in 68 ms
[2020-06-03 20:16:08] [INFO ] Deduced a trap composed of 6 places in 76 ms
[2020-06-03 20:16:09] [INFO ] Deduced a trap composed of 7 places in 73 ms
[2020-06-03 20:16:09] [INFO ] Deduced a trap composed of 7 places in 73 ms
[2020-06-03 20:16:09] [INFO ] Deduced a trap composed of 6 places in 79 ms
[2020-06-03 20:16:09] [INFO ] Deduced a trap composed of 6 places in 66 ms
[2020-06-03 20:16:09] [INFO ] Deduced a trap composed of 7 places in 65 ms
[2020-06-03 20:16:09] [INFO ] Deduced a trap composed of 7 places in 69 ms
[2020-06-03 20:16:09] [INFO ] Deduced a trap composed of 7 places in 67 ms
[2020-06-03 20:16:10] [INFO ] Deduced a trap composed of 7 places in 58 ms
[2020-06-03 20:16:10] [INFO ] Deduced a trap composed of 6 places in 47 ms
[2020-06-03 20:16:10] [INFO ] Deduced a trap composed of 6 places in 40 ms
[2020-06-03 20:16:10] [INFO ] Deduced a trap composed of 6 places in 24 ms
[2020-06-03 20:16:10] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2385 ms
Attempting to minimize the solution found.
Minimization took 35 ms.
Incomplete Parikh walk after 239000 steps, including 657 resets, run finished after 1673 ms. (steps per millisecond=142 ) properties seen :[0] could not realise parikh vector
Support contains 36 out of 332 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 332/332 places, 991/991 transitions.
Applied a total of 0 rules in 16 ms. Remains 332 /332 variables (removed 0) and now considering 991/991 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 332/332 places, 991/991 transitions.
Starting structural reductions, iteration 0 : 332/332 places, 991/991 transitions.
Applied a total of 0 rules in 15 ms. Remains 332 /332 variables (removed 0) and now considering 991/991 (removed 0) transitions.
// Phase 1: matrix 991 rows 332 cols
[2020-06-03 20:16:12] [INFO ] Computed 10 place invariants in 6 ms
[2020-06-03 20:16:12] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 991 rows 332 cols
[2020-06-03 20:16:12] [INFO ] Computed 10 place invariants in 6 ms
[2020-06-03 20:16:14] [INFO ] Implicit Places using invariants and state equation in 1899 ms returned []
Implicit Place search using SMT with State Equation took 2270 ms to find 0 implicit places.
[2020-06-03 20:16:14] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 991 rows 332 cols
[2020-06-03 20:16:14] [INFO ] Computed 10 place invariants in 22 ms
[2020-06-03 20:16:15] [INFO ] Dead Transitions using invariants and state equation in 920 ms returned []
Finished structural reductions, in 1 iterations. Remains : 332/332 places, 991/991 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 451 ms. (steps per millisecond=221 ) properties seen :[0]
// Phase 1: matrix 991 rows 332 cols
[2020-06-03 20:16:15] [INFO ] Computed 10 place invariants in 6 ms
[2020-06-03 20:16:16] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned sat
[2020-06-03 20:16:16] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 10 ms returned sat
[2020-06-03 20:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:16:16] [INFO ] [Real]Absence check using state equation in 746 ms returned sat
[2020-06-03 20:16:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:16:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 21 ms returned sat
[2020-06-03 20:16:16] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 11 ms returned sat
[2020-06-03 20:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:16:17] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2020-06-03 20:16:17] [INFO ] Deduced a trap composed of 6 places in 38 ms
[2020-06-03 20:16:17] [INFO ] Deduced a trap composed of 6 places in 28 ms
[2020-06-03 20:16:17] [INFO ] Deduced a trap composed of 6 places in 24 ms
[2020-06-03 20:16:17] [INFO ] Deduced a trap composed of 6 places in 34 ms
[2020-06-03 20:16:17] [INFO ] Deduced a trap composed of 6 places in 32 ms
[2020-06-03 20:16:17] [INFO ] Deduced a trap composed of 6 places in 35 ms
[2020-06-03 20:16:17] [INFO ] Deduced a trap composed of 6 places in 19 ms
[2020-06-03 20:16:17] [INFO ] Deduced a trap composed of 7 places in 19 ms
[2020-06-03 20:16:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 446 ms
[2020-06-03 20:16:17] [INFO ] Computed and/alt/rep : 591/3744/591 causal constraints in 72 ms.
[2020-06-03 20:16:19] [INFO ] Added : 179 causal constraints over 36 iterations in 1415 ms. Result :sat
[2020-06-03 20:16:19] [INFO ] Deduced a trap composed of 6 places in 60 ms
[2020-06-03 20:16:19] [INFO ] Deduced a trap composed of 7 places in 60 ms
[2020-06-03 20:16:19] [INFO ] Deduced a trap composed of 6 places in 52 ms
[2020-06-03 20:16:19] [INFO ] Deduced a trap composed of 7 places in 62 ms
[2020-06-03 20:16:19] [INFO ] Deduced a trap composed of 7 places in 50 ms
[2020-06-03 20:16:19] [INFO ] Deduced a trap composed of 6 places in 79 ms
[2020-06-03 20:16:20] [INFO ] Deduced a trap composed of 7 places in 81 ms
[2020-06-03 20:16:20] [INFO ] Deduced a trap composed of 7 places in 71 ms
[2020-06-03 20:16:20] [INFO ] Deduced a trap composed of 6 places in 71 ms
[2020-06-03 20:16:20] [INFO ] Deduced a trap composed of 6 places in 62 ms
[2020-06-03 20:16:20] [INFO ] Deduced a trap composed of 7 places in 63 ms
[2020-06-03 20:16:20] [INFO ] Deduced a trap composed of 7 places in 57 ms
[2020-06-03 20:16:20] [INFO ] Deduced a trap composed of 7 places in 61 ms
[2020-06-03 20:16:20] [INFO ] Deduced a trap composed of 7 places in 49 ms
[2020-06-03 20:16:21] [INFO ] Deduced a trap composed of 6 places in 38 ms
[2020-06-03 20:16:21] [INFO ] Deduced a trap composed of 6 places in 28 ms
[2020-06-03 20:16:21] [INFO ] Deduced a trap composed of 6 places in 26 ms
[2020-06-03 20:16:21] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1963 ms
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 332 transition count 972
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 313 transition count 972
Applied a total of 38 rules in 29 ms. Remains 313 /332 variables (removed 19) and now considering 972/991 (removed 19) transitions.
// Phase 1: matrix 972 rows 313 cols
[2020-06-03 20:16:21] [INFO ] Computed 10 place invariants in 8 ms
[2020-06-03 20:16:21] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2020-06-03 20:16:21] [INFO ] [Real]Absence check using 8 positive and 2 generalized place invariants in 3 ms returned sat
[2020-06-03 20:16:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 20:16:22] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2020-06-03 20:16:22] [INFO ] Deduced a trap composed of 5 places in 22 ms
[2020-06-03 20:16:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2020-06-03 20:16:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 20:16:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 23 ms returned sat
[2020-06-03 20:16:22] [INFO ] [Nat]Absence check using 8 positive and 2 generalized place invariants in 3 ms returned sat
[2020-06-03 20:16:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 20:16:22] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2020-06-03 20:16:22] [INFO ] Computed and/alt/rep : 572/9557/572 causal constraints in 85 ms.
[2020-06-03 20:16:24] [INFO ] Added : 203 causal constraints over 41 iterations in 1911 ms. Result :sat
[2020-06-03 20:16:24] [INFO ] Deduced a trap composed of 5 places in 130 ms
[2020-06-03 20:16:25] [INFO ] Deduced a trap composed of 7 places in 104 ms
[2020-06-03 20:16:25] [INFO ] Deduced a trap composed of 5 places in 115 ms
[2020-06-03 20:16:25] [INFO ] Deduced a trap composed of 7 places in 102 ms
[2020-06-03 20:16:25] [INFO ] Deduced a trap composed of 5 places in 89 ms
[2020-06-03 20:16:25] [INFO ] Deduced a trap composed of 5 places in 106 ms
[2020-06-03 20:16:26] [INFO ] Deduced a trap composed of 5 places in 109 ms
[2020-06-03 20:16:26] [INFO ] Deduced a trap composed of 5 places in 106 ms
[2020-06-03 20:16:26] [INFO ] Deduced a trap composed of 5 places in 110 ms
[2020-06-03 20:16:26] [INFO ] Deduced a trap composed of 5 places in 87 ms
[2020-06-03 20:16:26] [INFO ] Deduced a trap composed of 7 places in 77 ms
[2020-06-03 20:16:26] [INFO ] Deduced a trap composed of 5 places in 68 ms
[2020-06-03 20:16:26] [INFO ] Deduced a trap composed of 5 places in 73 ms
[2020-06-03 20:16:27] [INFO ] Deduced a trap composed of 7 places in 95 ms
[2020-06-03 20:16:27] [INFO ] Deduced a trap composed of 5 places in 94 ms
[2020-06-03 20:16:27] [INFO ] Deduced a trap composed of 5 places in 94 ms
[2020-06-03 20:16:27] [INFO ] Deduced a trap composed of 7 places in 81 ms
[2020-06-03 20:16:27] [INFO ] Deduced a trap composed of 7 places in 80 ms
[2020-06-03 20:16:27] [INFO ] Deduced a trap composed of 7 places in 74 ms
[2020-06-03 20:16:28] [INFO ] Deduced a trap composed of 7 places in 64 ms
[2020-06-03 20:16:28] [INFO ] Deduced a trap composed of 7 places in 60 ms
[2020-06-03 20:16:28] [INFO ] Deduced a trap composed of 5 places in 50 ms
[2020-06-03 20:16:28] [INFO ] Deduced a trap composed of 7 places in 48 ms
[2020-06-03 20:16:28] [INFO ] Deduced a trap composed of 7 places in 46 ms
[2020-06-03 20:16:28] [INFO ] Deduced a trap composed of 7 places in 35 ms
[2020-06-03 20:16:28] [INFO ] Deduced a trap composed of 5 places in 31 ms
[2020-06-03 20:16:28] [INFO ] Deduced a trap composed of 5 places in 18 ms
[2020-06-03 20:16:28] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4157 ms
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-06-03 20:16:29] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2020-06-03 20:16:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 15 ms.
[2020-06-03 20:16:29] [INFO ] Flatten gal took : 164 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DatabaseWithMutex-PT-20 @ 3570 seconds
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityFireability @ DatabaseWithMutex-PT-20

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 20:16:29 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 39040,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 3,
"aneg": 0,
"comp": 37,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 37,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p44) AND (1 <= p52) AND (1 <= p297) AND (1 <= p101) AND (1 <= p286) AND (1 <= p327) AND (1 <= p225) AND (((p213 <= 0) AND (((1 <= p98) AND (1 <= p240)) OR ((1 <= p124) AND (1 <= p238)))) OR ((1 <= p69) AND (1 <= p127) AND (1 <= p272) AND (((1 <= p8) AND (1 <= p124)) OR ((1 <= p25) AND (1 <= p28) AND (1 <= p29) AND (1 <= p71) AND (1 <= p72) AND (1 <= p78) AND (1 <= p87) AND (1 <= p170) AND (1 <= p176) AND (1 <= p185) AND (1 <= p191) AND (1 <= p202) AND (1 <= p207) AND (1 <= p243) AND (1 <= p247) AND (1 <= p258) AND (1 <= p275) AND (1 <= p277) AND (1 <= p310) AND (1 <= p311))))))))",
"processed_size": 602,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 5792,
"conflict_clusters": 116,
"places": 332,
"places_significant": 322,
"singleton_clusters": 0,
"transitions": 991
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 62,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1323/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 10624
lola: finding significant places
lola: 332 places, 991 transitions, 322 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: E (F (((1 <= p44) AND (1 <= p52) AND (1 <= p297) AND (1 <= p101) AND (1 <= p286) AND (1 <= p327) AND (1 <= p225) AND (((p213 <= 0) AND (((1 <= p98) AND (1 <= p240)) OR ((1 <= p124) AND (1 <= p238)))) OR ((1 <= p69) AND (1 <= p127) AND (1 <= p272) AND (((1 <= p8) AND (1 <= p124)) OR ((1 <= p25) AND (1 <= p28) AND (1 <= p29) AND (1 <= p71) AND (1 <= p72) AND (1 <= p78) AND (1 <= p87) AND (1 <= p170) AND (1 <= p176) AND (1 <= p185) AND (1 <= p191) AND (1 <= p202) AND (1 <= p207) AND (1 <= p243) AND (1 <= p247) AND (1 <= p258) AND (1 <= p275) AND (1 <= p277) AND (1 <= p310) AND (1 <= p311))))))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p44) AND (1 <= p52) AND (1 <= p297) AND (1 <= p101) AND (1 <= p286) AND (1 <= p327) AND (1 <= p225) AND (((p213 <= 0) AND (((1 <= p98) AND (1 <= p240)) OR ((1 <= p124) AND (1 <= p238)))) OR ((1 <= p69) AND (1 <= p127) AND (1 <= p272) AND (((1 <= p8) AND (1 <= p124)) OR ((1 <= p25) AND (1 <= p28) AND (1 <= p29) AND (1 <= p71) AND (1 <= p72) AND (1 <= p78) AND (1 <= p87) AND (1 <= p1... (shortened)
lola: processed formula length: 602
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p44) AND (1 <= p52) AND (1 <= p297) AND (1 <= p101) AND (1 <= p286) AND (1 <= p327) AND (1 <= p225) AND (((p213 <= 0) AND (((1 <= p98) AND (1 <= p240)) OR ((1 <= p124) AND (1 <= p238)))) OR ((1 <= p69) AND (1 <= p127) AND (1 <= p272) AND (((1 <= p8) AND (1 <= p124)) OR ((1 <= p25) AND (1 <= p28) AND (1 <= p29) AND (1 <= p71) AND (1 <= p72) AND (1 <= p78) AND (1 <= p87) AND (1 <= p170) AND (1 <= p176) AND (1 <= p185) AND (1 <= p191) AND (1 <= p202) AND (1 <= p207) AND (1 <= p243) AND (1 <= p247) AND (1 <= p258) AND (1 <= p275) AND (1 <= p277) AND (1 <= p310) AND (1 <= p311))))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 62 literals and 4 conjunctive subformulas
lola: memory consumption: 39040 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DatabaseWithMutex-PT-20"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DatabaseWithMutex-PT-20, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882200295"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-PT-20.tgz
mv DatabaseWithMutex-PT-20 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;