Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r234-tall-167856420800782.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is MultiCrashLeafsetExtension-PT-S16C06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420800782
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 13K Feb 26 03:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 03:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 03:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 26 03:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 03:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 03:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.2M Mar 5 18:22 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 MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679594722816

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 18:05:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 18:05:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 18:05:24] [INFO ] Load time of PNML (sax parser for PT used): 278 ms
[2023-03-23 18:05:24] [INFO ] Transformed 5568 places.
[2023-03-23 18:05:24] [INFO ] Transformed 7799 transitions.
[2023-03-23 18:05:24] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 381 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 160 resets, run finished after 682 ms. (steps per millisecond=14 ) properties (out of 16) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 14) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-23 18:05:27] [INFO ] Flow matrix only has 7527 transitions (discarded 272 similar events)
// Phase 1: matrix 7527 rows 5568 cols
[2023-03-23 18:05:27] [INFO ] Computed 573 place invariants in 337 ms
[2023-03-23 18:05:29] [INFO ] After 1671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-23 18:05:30] [INFO ] [Nat]Absence check using 50 positive place invariants in 31 ms returned sat
[2023-03-23 18:05:30] [INFO ] [Nat]Absence check using 50 positive and 523 generalized place invariants in 241 ms returned sat
[2023-03-23 18:05:35] [INFO ] After 4665ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :1
[2023-03-23 18:05:35] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 18:05:36] [INFO ] After 1178ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :12 sat :1
[2023-03-23 18:05:42] [INFO ] Deduced a trap composed of 1071 places in 5603 ms of which 15 ms to minimize.
[2023-03-23 18:05:49] [INFO ] Deduced a trap composed of 951 places in 5740 ms of which 8 ms to minimize.
[2023-03-23 18:05:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 12490 ms
[2023-03-23 18:05:49] [INFO ] After 13840ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :1
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-23 18:05:49] [INFO ] After 20598ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 5568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Graph (complete) has 17461 edges and 5568 vertex of which 5536 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.18 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions removed 1631 transitions
Trivial Post-agglo rules discarded 1631 transitions
Performed 1631 trivial Post agglomeration. Transition count delta: 1631
Iterating post reduction 0 with 1631 rules applied. Total rules applied 1632 place count 5536 transition count 6168
Reduce places removed 1631 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1632 rules applied. Total rules applied 3264 place count 3905 transition count 6167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3265 place count 3904 transition count 6167
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 204 Pre rules applied. Total rules applied 3265 place count 3904 transition count 5963
Deduced a syphon composed of 204 places in 6 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 3 with 408 rules applied. Total rules applied 3673 place count 3700 transition count 5963
Discarding 1427 places :
Symmetric choice reduction at 3 with 1427 rule applications. Total rules 5100 place count 2273 transition count 4536
Iterating global reduction 3 with 1427 rules applied. Total rules applied 6527 place count 2273 transition count 4536
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 6527 place count 2273 transition count 4525
Deduced a syphon composed of 11 places in 6 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 6549 place count 2262 transition count 4525
Discarding 236 places :
Symmetric choice reduction at 3 with 236 rule applications. Total rules 6785 place count 2026 transition count 3109
Iterating global reduction 3 with 236 rules applied. Total rules applied 7021 place count 2026 transition count 3109
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 7055 place count 2009 transition count 3092
Free-agglomeration rule (complex) applied 161 times.
Iterating global reduction 3 with 161 rules applied. Total rules applied 7216 place count 2009 transition count 4111
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 3 with 161 rules applied. Total rules applied 7377 place count 1848 transition count 4111
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 7394 place count 1848 transition count 4111
Applied a total of 7394 rules in 1801 ms. Remains 1848 /5568 variables (removed 3720) and now considering 4111/7799 (removed 3688) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1802 ms. Remains : 1848/5568 places, 4111/7799 transitions.
Incomplete random walk after 10000 steps, including 266 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 61390 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61390 steps, saw 27380 distinct states, run finished after 3003 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 18:05:54] [INFO ] Flow matrix only has 3713 transitions (discarded 398 similar events)
// Phase 1: matrix 3713 rows 1848 cols
[2023-03-23 18:05:54] [INFO ] Computed 541 place invariants in 52 ms
[2023-03-23 18:05:55] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 18:05:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-23 18:05:55] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 105 ms returned sat
[2023-03-23 18:05:56] [INFO ] After 1361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 18:05:56] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 18:05:57] [INFO ] After 420ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 18:05:57] [INFO ] After 600ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-23 18:05:57] [INFO ] After 2503ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 1848 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1848/1848 places, 4111/4111 transitions.
Applied a total of 0 rules in 137 ms. Remains 1848 /1848 variables (removed 0) and now considering 4111/4111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 1848/1848 places, 4111/4111 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1848/1848 places, 4111/4111 transitions.
Applied a total of 0 rules in 122 ms. Remains 1848 /1848 variables (removed 0) and now considering 4111/4111 (removed 0) transitions.
[2023-03-23 18:05:57] [INFO ] Flow matrix only has 3713 transitions (discarded 398 similar events)
[2023-03-23 18:05:57] [INFO ] Invariant cache hit.
[2023-03-23 18:06:01] [INFO ] Implicit Places using invariants in 3773 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 84, 98, 99, 100, 101, 102, 103, 104, 116, 126, 134, 140, 144, 146, 161, 167, 169, 170, 171, 172, 173, 174, 175, 177, 181, 187, 195, 205, 217, 230, 242, 243, 244, 245, 246, 247, 248, 258, 266, 272, 276, 278, 280, 295, 301, 303, 304, 305, 306, 307, 308, 309, 311, 313, 317, 323, 331, 341, 352, 362, 363, 364, 365, 366, 367, 368, 376, 382, 386, 388, 390, 392, 407, 413, 415, 416, 417, 418, 419, 420, 421, 423, 425, 427, 431, 437, 445, 454, 462, 463, 464, 465, 466, 467, 468, 474, 478, 480, 482, 484, 486, 501, 507, 509, 510, 511, 512, 513, 514, 515, 517, 519, 521, 523, 527, 533, 540, 546, 547, 548, 549, 550, 551, 552, 556, 558, 560, 562, 564, 566, 581, 587, 589, 590, 591, 592, 593, 594, 595, 597, 599, 601, 603, 605, 609, 614, 618, 619, 620, 621, 622, 623, 624, 626, 628, 630, 632, 634, 636, 651, 657, 659, 660, 661, 662, 663, 664, 665, 667, 669, 671, 673, 675, 677, 680, 682, 683, 684, 685, 686, 687, 688, 690, 692, 694, 696, 698, 700, 715, 721, 723, 724, 725, 726, 727, 728, 729, 731, 733, 735, 737, 739, 741, 743, 745, 746, 747, 748, 749, 750, 751, 753, 755, 757, 759, 761, 763, 778, 780, 783, 785, 786, 787, 788, 789, 790, 791, 793, 795, 797, 799, 801, 803, 805, 807, 808, 809, 810, 811, 812, 813, 815, 817, 819, 821, 823, 825, 840, 846, 848, 849, 850, 851, 852, 853, 854, 856, 858, 860, 862, 864, 866, 868, 870, 871, 872, 873, 874, 875, 876, 878, 880, 882, 884, 886, 888, 903, 909, 911, 912, 913, 914, 915, 916, 917, 919, 921, 923, 925, 927, 929, 931, 934, 935, 936, 937, 938, 939, 940, 942, 944, 946, 948, 950, 952, 967, 973, 975, 976, 977, 978, 979, 980, 981, 983, 985, 987, 989, 991, 993, 997, 1002, 1003, 1004, 1005, 1006, 1007, 1008, 1012, 1014, 1016, 1018, 1020, 1022, 1037, 1043, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1053, 1055, 1057, 1059, 1061, 1065, 1071, 1078, 1079, 1080, 1081, 1082, 1083, 1084, 1090, 1094, 1096, 1098, 1100, 1102, 1117, 1123, 1125, 1126, 1127, 1128, 1129, 1130, 1131, 1133, 1135, 1137, 1139, 1143, 1149, 1157, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1180, 1186, 1190, 1192, 1194, 1196, 1211, 1217, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1227, 1229, 1231, 1235, 1241, 1249, 1259, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1286, 1294, 1300, 1304, 1306, 1308, 1323, 1329, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1340, 1342, 1346, 1352, 1360, 1370, 1382, 1395, 1396, 1397, 1398, 1399, 1400, 1401, 1413, 1423, 1431, 1437, 1441, 1443, 1458, 1460, 1463, 1465, 1466, 1467, 1468, 1470, 1471, 1473, 1477, 1483, 1491, 1501, 1513, 1528, 1543, 1544, 1545, 1546, 1547, 1548, 1549, 1563, 1575, 1585, 1593, 1599, 1603, 1618]
Discarding 495 places :
Implicit Place search using SMT only with invariants took 3789 ms to find 495 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1353/1848 places, 4111/4111 transitions.
Discarding 191 places :
Symmetric choice reduction at 0 with 191 rule applications. Total rules 191 place count 1162 transition count 3920
Iterating global reduction 0 with 191 rules applied. Total rules applied 382 place count 1162 transition count 3920
Discarding 191 places :
Symmetric choice reduction at 0 with 191 rule applications. Total rules 573 place count 971 transition count 3729
Iterating global reduction 0 with 191 rules applied. Total rules applied 764 place count 971 transition count 3729
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 767 place count 971 transition count 3726
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 770 place count 968 transition count 3726
Applied a total of 770 rules in 267 ms. Remains 968 /1353 variables (removed 385) and now considering 3726/4111 (removed 385) transitions.
[2023-03-23 18:06:01] [INFO ] Flow matrix only has 3328 transitions (discarded 398 similar events)
// Phase 1: matrix 3328 rows 968 cols
[2023-03-23 18:06:02] [INFO ] Computed 46 place invariants in 33 ms
[2023-03-23 18:06:03] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2023-03-23 18:06:03] [INFO ] Flow matrix only has 3328 transitions (discarded 398 similar events)
[2023-03-23 18:06:03] [INFO ] Invariant cache hit.
[2023-03-23 18:06:03] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 18:06:19] [INFO ] Implicit Places using invariants and state equation in 16879 ms returned []
Implicit Place search using SMT with State Equation took 17996 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 968/1848 places, 3726/4111 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 22175 ms. Remains : 968/1848 places, 3726/4111 transitions.
Incomplete random walk after 10000 steps, including 282 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 73280 steps, run timeout after 3002 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73280 steps, saw 30598 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 18:06:23] [INFO ] Flow matrix only has 3328 transitions (discarded 398 similar events)
[2023-03-23 18:06:23] [INFO ] Invariant cache hit.
[2023-03-23 18:06:23] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 18:06:23] [INFO ] [Nat]Absence check using 31 positive place invariants in 12 ms returned sat
[2023-03-23 18:06:23] [INFO ] [Nat]Absence check using 31 positive and 15 generalized place invariants in 5 ms returned sat
[2023-03-23 18:06:24] [INFO ] After 847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 18:06:24] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 18:06:24] [INFO ] After 460ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 18:06:24] [INFO ] After 610ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-23 18:06:25] [INFO ] After 1785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 968 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 3726/3726 transitions.
Applied a total of 0 rules in 102 ms. Remains 968 /968 variables (removed 0) and now considering 3726/3726 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 968/968 places, 3726/3726 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 3726/3726 transitions.
Applied a total of 0 rules in 97 ms. Remains 968 /968 variables (removed 0) and now considering 3726/3726 (removed 0) transitions.
[2023-03-23 18:06:25] [INFO ] Flow matrix only has 3328 transitions (discarded 398 similar events)
[2023-03-23 18:06:25] [INFO ] Invariant cache hit.
[2023-03-23 18:06:26] [INFO ] Implicit Places using invariants in 1116 ms returned []
[2023-03-23 18:06:26] [INFO ] Flow matrix only has 3328 transitions (discarded 398 similar events)
[2023-03-23 18:06:26] [INFO ] Invariant cache hit.
[2023-03-23 18:06:27] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-23 18:06:43] [INFO ] Implicit Places using invariants and state equation in 17249 ms returned []
Implicit Place search using SMT with State Equation took 18374 ms to find 0 implicit places.
[2023-03-23 18:06:43] [INFO ] Redundant transitions in 257 ms returned []
[2023-03-23 18:06:43] [INFO ] Flow matrix only has 3328 transitions (discarded 398 similar events)
[2023-03-23 18:06:43] [INFO ] Invariant cache hit.
[2023-03-23 18:06:45] [INFO ] Dead Transitions using invariants and state equation in 1369 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20118 ms. Remains : 968/968 places, 3726/3726 transitions.
Graph (trivial) has 1050 edges and 968 vertex of which 17 / 968 are part of one of the 1 SCC in 4 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4283 edges and 952 vertex of which 938 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 921 transition count 2957
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 824 transition count 2764
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 728 transition count 2596
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 656 transition count 2454
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 586 transition count 2334
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 536 transition count 2236
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 128 rules applied. Total rules applied 1335 place count 488 transition count 2156
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1429 place count 456 transition count 2094
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1507 place count 426 transition count 2046
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1559 place count 408 transition count 2012
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1599 place count 392 transition count 1988
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1621 place count 384 transition count 1974
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1635 place count 378 transition count 1966
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 1640 place count 375 transition count 1964
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 13 Pre rules applied. Total rules applied 1640 place count 375 transition count 1951
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 14 with 26 rules applied. Total rules applied 1666 place count 362 transition count 1951
Discarding 283 places :
Symmetric choice reduction at 14 with 283 rule applications. Total rules 1949 place count 79 transition count 333
Iterating global reduction 14 with 283 rules applied. Total rules applied 2232 place count 79 transition count 333
Ensure Unique test removed 245 transitions
Reduce isomorphic transitions removed 245 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 14 with 252 rules applied. Total rules applied 2484 place count 79 transition count 81
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 2491 place count 72 transition count 81
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2491 place count 72 transition count 80
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2493 place count 71 transition count 80
Discarding 11 places :
Symmetric choice reduction at 16 with 11 rule applications. Total rules 2504 place count 60 transition count 65
Iterating global reduction 16 with 11 rules applied. Total rules applied 2515 place count 60 transition count 65
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 2519 place count 56 transition count 61
Iterating global reduction 16 with 4 rules applied. Total rules applied 2523 place count 56 transition count 61
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 16 with 6 rules applied. Total rules applied 2529 place count 53 transition count 58
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2530 place count 52 transition count 56
Iterating global reduction 16 with 1 rules applied. Total rules applied 2531 place count 52 transition count 56
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 16 with 6 rules applied. Total rules applied 2537 place count 52 transition count 50
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 2543 place count 46 transition count 50
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 17 with 16 rules applied. Total rules applied 2559 place count 46 transition count 50
Applied a total of 2559 rules in 349 ms. Remains 46 /968 variables (removed 922) and now considering 50/3726 (removed 3676) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 50 rows 46 cols
[2023-03-23 18:06:45] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-23 18:06:45] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 18:06:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 18:06:45] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-23 18:06:45] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 18:06:45] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-23 18:06:45] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-23 18:06:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-03-23 18:06:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 968 places, 3726 transitions and 18573 arcs took 20 ms.
[2023-03-23 18:06:46] [INFO ] Flatten gal took : 311 ms
Total runtime 82020 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: gen
(NrP: 968 NrTr: 3726 NrArc: 18573)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.492sec

net check time: 0m 0.002sec

init dd package: 0m 2.766sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10571596 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16088400 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.054sec

21680 43632 66514 110529 164486 216499 286422 368051 451762 539171 652612

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="MultiCrashLeafsetExtension-PT-S16C06"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5348"
echo " Executing tool marciexred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C06, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420800782"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C06.tgz
mv MultiCrashLeafsetExtension-PT-S16C06 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;