About the Execution of Marcie+red for MultiCrashLeafsetExtension-PT-S16C03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5857.968 | 3600000.00 | 3661027.00 | 10702.50 | FFF??TT?TTF????F | normal |
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-167856420800753.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-S16C03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420800753
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 12K Feb 26 02:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 02:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 02:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 02:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 02:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 02:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:23 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 3.5M 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-S16C03-CTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679583884082
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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 15:04:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 15:04:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 15:04:45] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2023-03-23 15:04:45] [INFO ] Transformed 3606 places.
[2023-03-23 15:04:45] [INFO ] Transformed 5141 transitions.
[2023-03-23 15:04:46] [INFO ] Parsed PT model containing 3606 places and 5141 transitions and 20838 arcs in 462 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Support contains 136 out of 3606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3606/3606 places, 5141/5141 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 3581 transition count 5141
Discarding 781 places :
Symmetric choice reduction at 1 with 781 rule applications. Total rules 806 place count 2800 transition count 4360
Iterating global reduction 1 with 781 rules applied. Total rules applied 1587 place count 2800 transition count 4360
Discarding 660 places :
Symmetric choice reduction at 1 with 660 rule applications. Total rules 2247 place count 2140 transition count 3700
Iterating global reduction 1 with 660 rules applied. Total rules applied 2907 place count 2140 transition count 3700
Discarding 177 places :
Symmetric choice reduction at 1 with 177 rule applications. Total rules 3084 place count 1963 transition count 3169
Iterating global reduction 1 with 177 rules applied. Total rules applied 3261 place count 1963 transition count 3169
Applied a total of 3261 rules in 756 ms. Remains 1963 /3606 variables (removed 1643) and now considering 3169/5141 (removed 1972) transitions.
[2023-03-23 15:04:46] [INFO ] Flow matrix only has 2897 transitions (discarded 272 similar events)
// Phase 1: matrix 2897 rows 1963 cols
[2023-03-23 15:04:47] [INFO ] Computed 434 place invariants in 173 ms
[2023-03-23 15:04:49] [INFO ] Implicit Places using invariants in 2441 ms returned [4, 8, 16, 18, 23, 32, 44, 55, 68, 83, 99, 115, 119, 121, 136, 147, 156, 163, 168, 174, 189, 197, 200, 202, 203, 207, 213, 223, 232, 243, 256, 270, 286, 287, 298, 307, 314, 319, 322, 327, 347, 354, 357, 358, 360, 362, 365, 371, 390, 401, 413, 425, 427, 428, 437, 449, 452, 454, 459, 474, 481, 487, 492, 495, 498, 505, 523, 533, 543, 544, 546, 553, 558, 561, 563, 568, 570, 586, 593, 596, 597, 598, 599, 602, 604, 607, 611, 623, 631, 641, 642, 649, 652, 654, 659, 664, 666, 683, 693, 694, 695, 696, 698, 700, 702, 704, 707, 712, 718, 724, 725, 726, 727, 730, 732, 734, 736, 738, 740, 755, 762, 766, 767, 768, 770, 775, 777, 779, 781, 788, 792, 793, 796, 800, 802, 804, 806, 810, 812, 827, 834, 837, 838, 840, 842, 844, 846, 848, 850, 855, 857, 861, 862, 863, 867, 872, 874, 876, 878, 880, 895, 897, 901, 905, 906, 907, 911, 913, 915, 917, 919, 923, 929, 931, 933, 939, 941, 943, 945, 964, 971, 974, 975, 977, 979, 981, 985, 987, 989, 991, 993, 996, 997, 1001, 1003, 1005, 1007, 1009, 1013, 1028, 1035, 1038, 1046, 1049, 1053, 1055, 1057, 1059, 1062, 1067, 1068, 1069, 1070, 1073, 1075, 1077, 1079, 1081, 1083, 1098, 1105, 1110, 1111, 1113, 1115, 1117, 1121, 1125, 1128, 1133, 1142, 1143, 1144, 1151, 1154, 1156, 1158, 1160, 1162, 1177, 1184, 1188, 1189, 1190, 1192, 1194, 1199, 1201, 1204, 1209, 1216, 1225, 1226, 1228, 1235, 1240, 1245, 1249, 1252, 1267, 1274, 1278, 1280, 1285, 1290, 1292, 1295, 1300, 1307, 1316, 1328, 1330, 1339, 1346, 1351, 1354, 1359, 1361, 1378, 1385, 1389, 1392, 1396, 1401, 1404, 1409, 1416, 1425, 1436, 1453, 1466, 1477, 1487, 1492, 1495, 1500, 1515, 1522, 1525, 1527, 1528, 1530, 1539, 1546, 1557, 1568, 1581, 1596, 1597, 1599, 1614, 1625, 1636, 1643, 1651, 1654, 1669, 1671, 1675, 1678, 1679, 1680, 1681, 1684, 1689, 1696, 1705, 1716, 1729, 1744, 1761, 1762, 1764, 1779, 1792, 1803, 1812, 1819, 1826, 1842]
Discarding 340 places :
Implicit Place search using SMT only with invariants took 2474 ms to find 340 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1623/3606 places, 3169/5141 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 1575 transition count 3121
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 1575 transition count 3121
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 142 place count 1529 transition count 3075
Iterating global reduction 0 with 46 rules applied. Total rules applied 188 place count 1529 transition count 3075
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 232 place count 1485 transition count 3031
Iterating global reduction 0 with 44 rules applied. Total rules applied 276 place count 1485 transition count 3031
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 279 place count 1482 transition count 3022
Iterating global reduction 0 with 3 rules applied. Total rules applied 282 place count 1482 transition count 3022
Applied a total of 282 rules in 175 ms. Remains 1482 /1623 variables (removed 141) and now considering 3022/3169 (removed 147) transitions.
[2023-03-23 15:04:49] [INFO ] Flow matrix only has 2750 transitions (discarded 272 similar events)
// Phase 1: matrix 2750 rows 1482 cols
[2023-03-23 15:04:49] [INFO ] Computed 94 place invariants in 42 ms
[2023-03-23 15:04:50] [INFO ] Implicit Places using invariants in 1120 ms returned []
[2023-03-23 15:04:50] [INFO ] Flow matrix only has 2750 transitions (discarded 272 similar events)
[2023-03-23 15:04:50] [INFO ] Invariant cache hit.
[2023-03-23 15:04:51] [INFO ] State equation strengthened by 1002 read => feed constraints.
[2023-03-23 15:05:07] [INFO ] Implicit Places using invariants and state equation in 17053 ms returned []
Implicit Place search using SMT with State Equation took 18179 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1482/3606 places, 3022/5141 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21585 ms. Remains : 1482/3606 places, 3022/5141 transitions.
Support contains 136 out of 1482 places after structural reductions.
[2023-03-23 15:05:08] [INFO ] Flatten gal took : 220 ms
[2023-03-23 15:05:08] [INFO ] Flatten gal took : 138 ms
[2023-03-23 15:05:08] [INFO ] Input system was already deterministic with 3022 transitions.
Support contains 134 out of 1482 places (down from 136) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 318 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 78) seen :17
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 61) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 61) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 60) seen :2
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 58) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 57) seen :0
Running SMT prover for 57 properties.
[2023-03-23 15:05:09] [INFO ] Flow matrix only has 2750 transitions (discarded 272 similar events)
[2023-03-23 15:05:09] [INFO ] Invariant cache hit.
[2023-03-23 15:05:11] [INFO ] After 1660ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:57
[2023-03-23 15:05:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 15:05:12] [INFO ] [Nat]Absence check using 31 positive and 63 generalized place invariants in 25 ms returned sat
[2023-03-23 15:05:16] [INFO ] After 2923ms SMT Verify possible using state equation in natural domain returned unsat :44 sat :13
[2023-03-23 15:05:16] [INFO ] State equation strengthened by 1002 read => feed constraints.
[2023-03-23 15:05:17] [INFO ] After 1827ms SMT Verify possible using 1002 Read/Feed constraints in natural domain returned unsat :49 sat :8
[2023-03-23 15:05:18] [INFO ] Deduced a trap composed of 405 places in 681 ms of which 9 ms to minimize.
[2023-03-23 15:05:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 831 ms
[2023-03-23 15:05:20] [INFO ] Deduced a trap composed of 312 places in 784 ms of which 1 ms to minimize.
[2023-03-23 15:05:20] [INFO ] Deduced a trap composed of 329 places in 709 ms of which 2 ms to minimize.
[2023-03-23 15:05:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1722 ms
[2023-03-23 15:05:22] [INFO ] Deduced a trap composed of 366 places in 640 ms of which 2 ms to minimize.
[2023-03-23 15:05:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 789 ms
[2023-03-23 15:05:23] [INFO ] Deduced a trap composed of 317 places in 708 ms of which 1 ms to minimize.
[2023-03-23 15:05:23] [INFO ] Deduced a trap composed of 373 places in 661 ms of which 1 ms to minimize.
[2023-03-23 15:05:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1595 ms
[2023-03-23 15:05:24] [INFO ] After 7926ms SMT Verify possible using trap constraints in natural domain returned unsat :49 sat :8
Attempting to minimize the solution found.
Minimization took 1846 ms.
[2023-03-23 15:05:25] [INFO ] After 14400ms SMT Verify possible using all constraints in natural domain returned unsat :49 sat :8
Fused 57 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 16 out of 1482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1482/1482 places, 3022/3022 transitions.
Graph (complete) has 6355 edges and 1482 vertex of which 1481 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 1481 transition count 2985
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 1444 transition count 2985
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 75 place count 1444 transition count 2940
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 165 place count 1399 transition count 2940
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 205 place count 1359 transition count 2882
Iterating global reduction 2 with 40 rules applied. Total rules applied 245 place count 1359 transition count 2882
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 270 place count 1334 transition count 2821
Iterating global reduction 2 with 25 rules applied. Total rules applied 295 place count 1334 transition count 2821
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 10 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 353 place count 1305 transition count 2792
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 380 place count 1278 transition count 2765
Iterating global reduction 2 with 27 rules applied. Total rules applied 407 place count 1278 transition count 2765
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 434 place count 1251 transition count 2684
Iterating global reduction 2 with 27 rules applied. Total rules applied 461 place count 1251 transition count 2684
Free-agglomeration rule (complex) applied 160 times.
Iterating global reduction 2 with 160 rules applied. Total rules applied 621 place count 1251 transition count 2964
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 781 place count 1091 transition count 2964
Partial Free-agglomeration rule applied 43 times.
Drop transitions removed 43 transitions
Iterating global reduction 3 with 43 rules applied. Total rules applied 824 place count 1091 transition count 2964
Applied a total of 824 rules in 1140 ms. Remains 1091 /1482 variables (removed 391) and now considering 2964/3022 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1141 ms. Remains : 1091/1482 places, 2964/3022 transitions.
Incomplete random walk after 10000 steps, including 558 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :2
Running SMT prover for 3 properties.
[2023-03-23 15:05:27] [INFO ] Flow matrix only has 2569 transitions (discarded 395 similar events)
// Phase 1: matrix 2569 rows 1091 cols
[2023-03-23 15:05:27] [INFO ] Computed 93 place invariants in 24 ms
[2023-03-23 15:05:27] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 15:05:27] [INFO ] [Nat]Absence check using 32 positive place invariants in 23 ms returned sat
[2023-03-23 15:05:27] [INFO ] [Nat]Absence check using 32 positive and 61 generalized place invariants in 10 ms returned sat
[2023-03-23 15:05:28] [INFO ] After 713ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 15:05:28] [INFO ] State equation strengthened by 1334 read => feed constraints.
[2023-03-23 15:05:29] [INFO ] After 1141ms SMT Verify possible using 1334 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 15:05:30] [INFO ] Deduced a trap composed of 180 places in 437 ms of which 1 ms to minimize.
[2023-03-23 15:05:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 562 ms
[2023-03-23 15:05:31] [INFO ] Deduced a trap composed of 88 places in 479 ms of which 1 ms to minimize.
[2023-03-23 15:05:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 610 ms
[2023-03-23 15:05:31] [INFO ] After 2811ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 337 ms.
[2023-03-23 15:05:31] [INFO ] After 4090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2964/2964 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1091 transition count 2975
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 1088 transition count 2975
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 1088 transition count 2975
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 1085 transition count 2972
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 1085 transition count 2972
Applied a total of 15 rules in 231 ms. Remains 1085 /1091 variables (removed 6) and now considering 2972/2964 (removed -8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 1085/1091 places, 2972/2964 transitions.
Incomplete random walk after 10000 steps, including 562 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 68003 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68003 steps, saw 29323 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 15:05:35] [INFO ] Flow matrix only has 2577 transitions (discarded 395 similar events)
// Phase 1: matrix 2577 rows 1085 cols
[2023-03-23 15:05:35] [INFO ] Computed 93 place invariants in 27 ms
[2023-03-23 15:05:35] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 15:05:35] [INFO ] [Nat]Absence check using 32 positive place invariants in 21 ms returned sat
[2023-03-23 15:05:35] [INFO ] [Nat]Absence check using 32 positive and 61 generalized place invariants in 10 ms returned sat
[2023-03-23 15:05:36] [INFO ] After 934ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 15:05:36] [INFO ] State equation strengthened by 1348 read => feed constraints.
[2023-03-23 15:05:37] [INFO ] After 890ms SMT Verify possible using 1348 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 15:05:38] [INFO ] Deduced a trap composed of 187 places in 424 ms of which 1 ms to minimize.
[2023-03-23 15:05:38] [INFO ] Deduced a trap composed of 81 places in 470 ms of which 1 ms to minimize.
[2023-03-23 15:05:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1089 ms
[2023-03-23 15:05:39] [INFO ] Deduced a trap composed of 105 places in 484 ms of which 1 ms to minimize.
[2023-03-23 15:05:39] [INFO ] Deduced a trap composed of 173 places in 431 ms of which 1 ms to minimize.
[2023-03-23 15:05:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1110 ms
[2023-03-23 15:05:40] [INFO ] After 3405ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 254 ms.
[2023-03-23 15:05:40] [INFO ] After 4826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 1085 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 2972/2972 transitions.
Applied a total of 0 rules in 79 ms. Remains 1085 /1085 variables (removed 0) and now considering 2972/2972 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 1085/1085 places, 2972/2972 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1085/1085 places, 2972/2972 transitions.
Applied a total of 0 rules in 69 ms. Remains 1085 /1085 variables (removed 0) and now considering 2972/2972 (removed 0) transitions.
[2023-03-23 15:05:40] [INFO ] Flow matrix only has 2577 transitions (discarded 395 similar events)
[2023-03-23 15:05:40] [INFO ] Invariant cache hit.
[2023-03-23 15:05:41] [INFO ] Implicit Places using invariants in 1096 ms returned [8, 85, 135, 195, 196, 235, 246, 282, 295, 314, 315, 316, 351, 384, 401, 402, 420, 451, 458, 462, 479, 488, 503, 510, 513, 514, 515, 533, 542, 543, 560, 561, 562, 588, 589, 604, 624, 644, 656, 669, 670, 698, 699, 730, 731, 769, 771, 813, 816, 865, 973]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 1100 ms to find 51 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1034/1085 places, 2972/2972 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 999 transition count 2937
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 999 transition count 2937
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 105 place count 964 transition count 2902
Iterating global reduction 0 with 35 rules applied. Total rules applied 140 place count 964 transition count 2902
Applied a total of 140 rules in 106 ms. Remains 964 /1034 variables (removed 70) and now considering 2902/2972 (removed 70) transitions.
[2023-03-23 15:05:41] [INFO ] Flow matrix only has 2507 transitions (discarded 395 similar events)
// Phase 1: matrix 2507 rows 964 cols
[2023-03-23 15:05:41] [INFO ] Computed 42 place invariants in 53 ms
[2023-03-23 15:05:42] [INFO ] Implicit Places using invariants in 933 ms returned []
[2023-03-23 15:05:42] [INFO ] Flow matrix only has 2507 transitions (discarded 395 similar events)
[2023-03-23 15:05:42] [INFO ] Invariant cache hit.
[2023-03-23 15:05:43] [INFO ] State equation strengthened by 1348 read => feed constraints.
[2023-03-23 15:05:55] [INFO ] Implicit Places using invariants and state equation in 13089 ms returned []
Implicit Place search using SMT with State Equation took 14025 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 964/1085 places, 2902/2972 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15314 ms. Remains : 964/1085 places, 2902/2972 transitions.
Incomplete random walk after 10000 steps, including 561 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 77678 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77678 steps, saw 32545 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-23 15:05:59] [INFO ] Flow matrix only has 2507 transitions (discarded 395 similar events)
[2023-03-23 15:05:59] [INFO ] Invariant cache hit.
[2023-03-23 15:05:59] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 15:05:59] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 15:05:59] [INFO ] [Nat]Absence check using 31 positive and 11 generalized place invariants in 2 ms returned sat
[2023-03-23 15:06:00] [INFO ] After 847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 15:06:00] [INFO ] State equation strengthened by 1348 read => feed constraints.
[2023-03-23 15:06:00] [INFO ] After 396ms SMT Verify possible using 1348 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 15:06:01] [INFO ] Deduced a trap composed of 163 places in 372 ms of which 1 ms to minimize.
[2023-03-23 15:06:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 492 ms
[2023-03-23 15:06:01] [INFO ] Deduced a trap composed of 76 places in 396 ms of which 1 ms to minimize.
[2023-03-23 15:06:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 510 ms
[2023-03-23 15:06:02] [INFO ] Deduced a trap composed of 130 places in 404 ms of which 1 ms to minimize.
[2023-03-23 15:06:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 526 ms
[2023-03-23 15:06:02] [INFO ] After 2178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 225 ms.
[2023-03-23 15:06:02] [INFO ] After 3455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 2902/2902 transitions.
Applied a total of 0 rules in 63 ms. Remains 964 /964 variables (removed 0) and now considering 2902/2902 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 964/964 places, 2902/2902 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 2902/2902 transitions.
Applied a total of 0 rules in 62 ms. Remains 964 /964 variables (removed 0) and now considering 2902/2902 (removed 0) transitions.
[2023-03-23 15:06:02] [INFO ] Flow matrix only has 2507 transitions (discarded 395 similar events)
[2023-03-23 15:06:02] [INFO ] Invariant cache hit.
[2023-03-23 15:06:03] [INFO ] Implicit Places using invariants in 840 ms returned []
[2023-03-23 15:06:03] [INFO ] Flow matrix only has 2507 transitions (discarded 395 similar events)
[2023-03-23 15:06:03] [INFO ] Invariant cache hit.
[2023-03-23 15:06:04] [INFO ] State equation strengthened by 1348 read => feed constraints.
[2023-03-23 15:06:17] [INFO ] Implicit Places using invariants and state equation in 13709 ms returned []
Implicit Place search using SMT with State Equation took 14553 ms to find 0 implicit places.
[2023-03-23 15:06:17] [INFO ] Redundant transitions in 202 ms returned []
[2023-03-23 15:06:17] [INFO ] Flow matrix only has 2507 transitions (discarded 395 similar events)
[2023-03-23 15:06:17] [INFO ] Invariant cache hit.
[2023-03-23 15:06:18] [INFO ] Dead Transitions using invariants and state equation in 1012 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15842 ms. Remains : 964/964 places, 2902/2902 transitions.
Graph (trivial) has 1049 edges and 964 vertex of which 17 / 964 are part of one of the 1 SCC in 4 ms
Free SCC test removed 16 places
Drop transitions removed 295 transitions
Ensure Unique test removed 372 transitions
Reduce isomorphic transitions removed 667 transitions.
Graph (complete) has 3457 edges and 948 vertex of which 934 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 t1289.t1530 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 917 transition count 2136
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 820 transition count 1943
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 724 transition count 1775
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 652 transition count 1633
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 582 transition count 1513
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 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 147 rules applied. Total rules applied 1206 place count 532 transition count 1416
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 47 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 126 rules applied. Total rules applied 1332 place count 485 transition count 1337
Ensure Unique test removed 1 places
Reduce places removed 33 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 95 rules applied. Total rules applied 1427 place count 452 transition count 1275
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 1505 place count 422 transition count 1227
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 1557 place count 404 transition count 1193
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 1597 place count 388 transition count 1169
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 1619 place count 380 transition count 1155
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 1633 place count 374 transition count 1147
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1638 place count 372 transition count 1144
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1640 place count 371 transition count 1143
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 12 Pre rules applied. Total rules applied 1640 place count 371 transition count 1131
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 15 with 24 rules applied. Total rules applied 1664 place count 359 transition count 1131
Discarding 269 places :
Symmetric choice reduction at 15 with 269 rule applications. Total rules 1933 place count 90 transition count 376
Iterating global reduction 15 with 269 rules applied. Total rules applied 2202 place count 90 transition count 376
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 15 with 127 rules applied. Total rules applied 2329 place count 90 transition count 249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2329 place count 90 transition count 248
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 2331 place count 89 transition count 248
Discarding 14 places :
Symmetric choice reduction at 16 with 14 rule applications. Total rules 2345 place count 75 transition count 184
Iterating global reduction 16 with 14 rules applied. Total rules applied 2359 place count 75 transition count 184
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 16 with 63 rules applied. Total rules applied 2422 place count 75 transition count 121
Discarding 5 places :
Symmetric choice reduction at 17 with 5 rule applications. Total rules 2427 place count 70 transition count 114
Iterating global reduction 17 with 5 rules applied. Total rules applied 2432 place count 70 transition count 114
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2433 place count 69 transition count 113
Iterating global reduction 17 with 1 rules applied. Total rules applied 2434 place count 69 transition count 113
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 17 with 20 rules applied. Total rules applied 2454 place count 59 transition count 103
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2455 place count 58 transition count 100
Iterating global reduction 17 with 1 rules applied. Total rules applied 2456 place count 58 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 2458 place count 57 transition count 101
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2459 place count 56 transition count 98
Iterating global reduction 17 with 1 rules applied. Total rules applied 2460 place count 56 transition count 98
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 2465 place count 56 transition count 93
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 18 with 4 rules applied. Total rules applied 2469 place count 56 transition count 89
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 2473 place count 52 transition count 89
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 19 with 18 rules applied. Total rules applied 2491 place count 52 transition count 89
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 2493 place count 50 transition count 83
Iterating global reduction 19 with 2 rules applied. Total rules applied 2495 place count 50 transition count 83
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 19 with 11 rules applied. Total rules applied 2506 place count 50 transition count 72
Applied a total of 2506 rules in 348 ms. Remains 50 /964 variables (removed 914) and now considering 72/2902 (removed 2830) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 72 rows 50 cols
[2023-03-23 15:06:18] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-23 15:06:18] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 15:06:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 15:06:18] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-23 15:06:18] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 15:06:19] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-23 15:06:19] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 49 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 15:06:19] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-23 15:06:19] [INFO ] Flatten gal took : 89 ms
[2023-03-23 15:06:19] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 15:06:19] [INFO ] Flatten gal took : 90 ms
[2023-03-23 15:06:19] [INFO ] Input system was already deterministic with 3022 transitions.
Support contains 21 out of 1482 places (down from 38) after GAL structural reductions.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 650 stabilizing places and 1389 stable transitions
Graph (complete) has 9283 edges and 1482 vertex of which 1481 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Starting structural reductions in LTL mode, iteration 0 : 1482/1482 places, 3022/3022 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1481 transition count 3022
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 75 place count 1407 transition count 2926
Iterating global reduction 1 with 74 rules applied. Total rules applied 149 place count 1407 transition count 2926
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 207 place count 1349 transition count 2824
Iterating global reduction 1 with 58 rules applied. Total rules applied 265 place count 1349 transition count 2824
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 298 place count 1316 transition count 2735
Iterating global reduction 1 with 33 rules applied. Total rules applied 331 place count 1316 transition count 2735
Applied a total of 331 rules in 158 ms. Remains 1316 /1482 variables (removed 166) and now considering 2735/3022 (removed 287) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 1316/1482 places, 2735/3022 transitions.
[2023-03-23 15:06:19] [INFO ] Flatten gal took : 65 ms
[2023-03-23 15:06:19] [INFO ] Flatten gal took : 74 ms
[2023-03-23 15:06:19] [INFO ] Input system was already deterministic with 2735 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1482/1482 places, 3022/3022 transitions.
Graph (complete) has 9283 edges and 1482 vertex of which 1481 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 1481 transition count 2985
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 1444 transition count 2985
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 75 place count 1444 transition count 2940
Deduced a syphon composed of 45 places in 12 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 165 place count 1399 transition count 2940
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 210 place count 1354 transition count 2873
Iterating global reduction 2 with 45 rules applied. Total rules applied 255 place count 1354 transition count 2873
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 284 place count 1325 transition count 2800
Iterating global reduction 2 with 29 rules applied. Total rules applied 313 place count 1325 transition count 2800
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 371 place count 1296 transition count 2771
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 398 place count 1269 transition count 2744
Iterating global reduction 2 with 27 rules applied. Total rules applied 425 place count 1269 transition count 2744
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 451 place count 1243 transition count 2666
Iterating global reduction 2 with 26 rules applied. Total rules applied 477 place count 1243 transition count 2666
Applied a total of 477 rules in 429 ms. Remains 1243 /1482 variables (removed 239) and now considering 2666/3022 (removed 356) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 433 ms. Remains : 1243/1482 places, 2666/3022 transitions.
[2023-03-23 15:06:20] [INFO ] Flatten gal took : 96 ms
[2023-03-23 15:06:20] [INFO ] Flatten gal took : 106 ms
[2023-03-23 15:06:20] [INFO ] Input system was already deterministic with 2666 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1482/1482 places, 3022/3022 transitions.
Graph (complete) has 9283 edges and 1482 vertex of which 1481 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 1481 transition count 2985
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 1444 transition count 2985
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 75 place count 1444 transition count 2940
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 165 place count 1399 transition count 2940
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 209 place count 1355 transition count 2874
Iterating global reduction 2 with 44 rules applied. Total rules applied 253 place count 1355 transition count 2874
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 280 place count 1328 transition count 2805
Iterating global reduction 2 with 27 rules applied. Total rules applied 307 place count 1328 transition count 2805
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 365 place count 1299 transition count 2776
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 393 place count 1271 transition count 2748
Iterating global reduction 2 with 28 rules applied. Total rules applied 421 place count 1271 transition count 2748
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 449 place count 1243 transition count 2664
Iterating global reduction 2 with 28 rules applied. Total rules applied 477 place count 1243 transition count 2664
Applied a total of 477 rules in 332 ms. Remains 1243 /1482 variables (removed 239) and now considering 2664/3022 (removed 358) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 340 ms. Remains : 1243/1482 places, 2664/3022 transitions.
[2023-03-23 15:06:21] [INFO ] Flatten gal took : 55 ms
[2023-03-23 15:06:21] [INFO ] Flatten gal took : 65 ms
[2023-03-23 15:06:21] [INFO ] Input system was already deterministic with 2664 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1482/1482 places, 3022/3022 transitions.
Graph (complete) has 9283 edges and 1482 vertex of which 1481 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 1481 transition count 2984
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 1443 transition count 2984
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 77 place count 1443 transition count 2939
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 167 place count 1398 transition count 2939
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 213 place count 1352 transition count 2871
Iterating global reduction 2 with 46 rules applied. Total rules applied 259 place count 1352 transition count 2871
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 288 place count 1323 transition count 2798
Iterating global reduction 2 with 29 rules applied. Total rules applied 317 place count 1323 transition count 2798
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 375 place count 1294 transition count 2769
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 403 place count 1266 transition count 2741
Iterating global reduction 2 with 28 rules applied. Total rules applied 431 place count 1266 transition count 2741
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 459 place count 1238 transition count 2657
Iterating global reduction 2 with 28 rules applied. Total rules applied 487 place count 1238 transition count 2657
Applied a total of 487 rules in 332 ms. Remains 1238 /1482 variables (removed 244) and now considering 2657/3022 (removed 365) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 332 ms. Remains : 1238/1482 places, 2657/3022 transitions.
[2023-03-23 15:06:21] [INFO ] Flatten gal took : 52 ms
[2023-03-23 15:06:21] [INFO ] Flatten gal took : 56 ms
[2023-03-23 15:06:21] [INFO ] Input system was already deterministic with 2657 transitions.
Incomplete random walk after 10000 steps, including 425 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 76239 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76239 steps, saw 33804 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 15:06:24] [INFO ] Flow matrix only has 2385 transitions (discarded 272 similar events)
// Phase 1: matrix 2385 rows 1238 cols
[2023-03-23 15:06:24] [INFO ] Computed 93 place invariants in 39 ms
[2023-03-23 15:06:25] [INFO ] [Real]Absence check using 32 positive place invariants in 22 ms returned sat
[2023-03-23 15:06:25] [INFO ] [Real]Absence check using 32 positive and 61 generalized place invariants in 9 ms returned sat
[2023-03-23 15:06:25] [INFO ] After 568ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 15:06:25] [INFO ] State equation strengthened by 880 read => feed constraints.
[2023-03-23 15:06:25] [INFO ] After 203ms SMT Verify possible using 880 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 15:06:25] [INFO ] After 956ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 15:06:26] [INFO ] [Nat]Absence check using 32 positive place invariants in 22 ms returned sat
[2023-03-23 15:06:26] [INFO ] [Nat]Absence check using 32 positive and 61 generalized place invariants in 13 ms returned sat
[2023-03-23 15:06:26] [INFO ] After 565ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 15:06:27] [INFO ] After 427ms SMT Verify possible using 880 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 15:06:27] [INFO ] Deduced a trap composed of 171 places in 488 ms of which 1 ms to minimize.
[2023-03-23 15:06:28] [INFO ] Deduced a trap composed of 349 places in 481 ms of which 2 ms to minimize.
[2023-03-23 15:06:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1163 ms
[2023-03-23 15:06:28] [INFO ] After 1647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-23 15:06:28] [INFO ] After 2451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1238/1238 places, 2657/2657 transitions.
Free-agglomeration rule (complex) applied 159 times.
Iterating global reduction 0 with 159 rules applied. Total rules applied 159 place count 1238 transition count 2980
Reduce places removed 159 places and 0 transitions.
Iterating post reduction 0 with 159 rules applied. Total rules applied 318 place count 1079 transition count 2980
Partial Free-agglomeration rule applied 43 times.
Drop transitions removed 43 transitions
Iterating global reduction 1 with 43 rules applied. Total rules applied 361 place count 1079 transition count 2980
Applied a total of 361 rules in 219 ms. Remains 1079 /1238 variables (removed 159) and now considering 2980/2657 (removed -323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 1079/1238 places, 2980/2657 transitions.
Incomplete random walk after 1000000 steps, including 56630 resets, run finished after 9226 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5717 resets, run finished after 1476 ms. (steps per millisecond=677 ) properties (out of 1) seen :0
Probably explored full state space saw : 101069 states, properties seen :0
Probabilistic random walk after 237677 steps, saw 101069 distinct states, run finished after 8660 ms. (steps per millisecond=27 ) properties seen :0
Explored full state space saw : 101071 states, properties seen :0
Exhaustive walk after 237681 steps, saw 101071 distinct states, run finished after 8623 ms. (steps per millisecond=27 ) properties seen :0
FORMULA MultiCrashLeafsetExtension-PT-S16C03-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
Starting structural reductions in LTL mode, iteration 0 : 1482/1482 places, 3022/3022 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1481 transition count 3022
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 70 place count 1412 transition count 2933
Iterating global reduction 1 with 69 rules applied. Total rules applied 139 place count 1412 transition count 2933
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 193 place count 1358 transition count 2835
Iterating global reduction 1 with 54 rules applied. Total rules applied 247 place count 1358 transition count 2835
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 276 place count 1329 transition count 2758
Iterating global reduction 1 with 29 rules applied. Total rules applied 305 place count 1329 transition count 2758
Applied a total of 305 rules in 137 ms. Remains 1329 /1482 variables (removed 153) and now considering 2758/3022 (removed 264) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 1329/1482 places, 2758/3022 transitions.
[2023-03-23 15:06:56] [INFO ] Flatten gal took : 58 ms
[2023-03-23 15:06:56] [INFO ] Flatten gal took : 63 ms
[2023-03-23 15:06:56] [INFO ] Input system was already deterministic with 2758 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1482/1482 places, 3022/3022 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1481 transition count 3022
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 74 place count 1408 transition count 2927
Iterating global reduction 1 with 73 rules applied. Total rules applied 147 place count 1408 transition count 2927
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 204 place count 1351 transition count 2826
Iterating global reduction 1 with 57 rules applied. Total rules applied 261 place count 1351 transition count 2826
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 293 place count 1319 transition count 2738
Iterating global reduction 1 with 32 rules applied. Total rules applied 325 place count 1319 transition count 2738
Applied a total of 325 rules in 135 ms. Remains 1319 /1482 variables (removed 163) and now considering 2738/3022 (removed 284) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 1319/1482 places, 2738/3022 transitions.
[2023-03-23 15:06:57] [INFO ] Flatten gal took : 55 ms
[2023-03-23 15:06:57] [INFO ] Flatten gal took : 60 ms
[2023-03-23 15:06:57] [INFO ] Input system was already deterministic with 2738 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1482/1482 places, 3022/3022 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1481 transition count 3022
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 74 place count 1408 transition count 2927
Iterating global reduction 1 with 73 rules applied. Total rules applied 147 place count 1408 transition count 2927
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 204 place count 1351 transition count 2826
Iterating global reduction 1 with 57 rules applied. Total rules applied 261 place count 1351 transition count 2826
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 293 place count 1319 transition count 2740
Iterating global reduction 1 with 32 rules applied. Total rules applied 325 place count 1319 transition count 2740
Applied a total of 325 rules in 146 ms. Remains 1319 /1482 variables (removed 163) and now considering 2740/3022 (removed 282) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 1319/1482 places, 2740/3022 transitions.
[2023-03-23 15:06:57] [INFO ] Flatten gal took : 55 ms
[2023-03-23 15:06:57] [INFO ] Flatten gal took : 62 ms
[2023-03-23 15:06:57] [INFO ] Input system was already deterministic with 2740 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1482/1482 places, 3022/3022 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1481 transition count 3022
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 73 place count 1409 transition count 2928
Iterating global reduction 1 with 72 rules applied. Total rules applied 145 place count 1409 transition count 2928
Discarding 57 places :
Symmetric choice reduction at 1 with 57 rule applications. Total rules 202 place count 1352 transition count 2827
Iterating global reduction 1 with 57 rules applied. Total rules applied 259 place count 1352 transition count 2827
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 290 place count 1321 transition count 2742
Iterating global reduction 1 with 31 rules applied. Total rules applied 321 place count 1321 transition count 2742
Applied a total of 321 rules in 133 ms. Remains 1321 /1482 variables (removed 161) and now considering 2742/3022 (removed 280) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 1321/1482 places, 2742/3022 transitions.
[2023-03-23 15:06:57] [INFO ] Flatten gal took : 53 ms
[2023-03-23 15:06:58] [INFO ] Flatten gal took : 58 ms
[2023-03-23 15:06:58] [INFO ] Input system was already deterministic with 2742 transitions.
[2023-03-23 15:06:58] [INFO ] Flatten gal took : 63 ms
[2023-03-23 15:06:58] [INFO ] Flatten gal took : 65 ms
[2023-03-23 15:06:58] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-23 15:06:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1482 places, 3022 transitions and 13198 arcs took 18 ms.
Total runtime 132779 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=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 1482 NrTr: 3022 NrArc: 13198)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.398sec
net check time: 0m 0.002sec
init dd package: 0m 2.690sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10286328 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16095528 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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.047sec
22446 46641 73240 90662 92990 129915 216021 329191 437248 542223 576804 591698
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-S16C03"
export BK_EXAMINATION="CTLCardinality"
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-S16C03, examination is CTLCardinality"
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-167856420800753"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C03.tgz
mv MultiCrashLeafsetExtension-PT-S16C03 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;