About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.039 | 3600000.00 | 6829105.00 | 9687.80 | FTFFTF?FTF?FFF?T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r246-tall-171654350800052.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654350800052
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 06:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 06:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.3M May 18 16:43 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-S16C08-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716576502144
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 18:48:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 18:48:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 18:48:23] [INFO ] Load time of PNML (sax parser for PT used): 433 ms
[2024-05-24 18:48:23] [INFO ] Transformed 6876 places.
[2024-05-24 18:48:23] [INFO ] Transformed 9571 transitions.
[2024-05-24 18:48:23] [INFO ] Parsed PT model containing 6876 places and 9571 transitions and 35518 arcs in 600 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 out of 6876 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6876/6876 places, 9571/9571 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 6840 transition count 9571
Discarding 2154 places :
Symmetric choice reduction at 1 with 2154 rule applications. Total rules 2190 place count 4686 transition count 7417
Iterating global reduction 1 with 2154 rules applied. Total rules applied 4344 place count 4686 transition count 7417
Discarding 1889 places :
Symmetric choice reduction at 1 with 1889 rule applications. Total rules 6233 place count 2797 transition count 5528
Iterating global reduction 1 with 1889 rules applied. Total rules applied 8122 place count 2797 transition count 5528
Discarding 215 places :
Symmetric choice reduction at 1 with 215 rule applications. Total rules 8337 place count 2582 transition count 3808
Iterating global reduction 1 with 215 rules applied. Total rules applied 8552 place count 2582 transition count 3808
Applied a total of 8552 rules in 1403 ms. Remains 2582 /6876 variables (removed 4294) and now considering 3808/9571 (removed 5763) transitions.
[2024-05-24 18:48:25] [INFO ] Flow matrix only has 3536 transitions (discarded 272 similar events)
// Phase 1: matrix 3536 rows 2582 cols
[2024-05-24 18:48:25] [INFO ] Computed 613 invariants in 190 ms
[2024-05-24 18:48:28] [INFO ] Implicit Places using invariants in 3240 ms returned [4, 8, 12, 14, 18, 20, 22, 24, 26, 28, 33, 40, 49, 63, 76, 91, 107, 123, 125, 127, 131, 133, 135, 137, 139, 152, 165, 174, 181, 186, 189, 224, 231, 234, 235, 236, 237, 238, 239, 240, 241, 242, 245, 250, 257, 266, 277, 290, 304, 318, 319, 320, 321, 322, 323, 324, 325, 326, 337, 346, 353, 358, 361, 363, 398, 405, 408, 409, 410, 411, 412, 413, 414, 415, 416, 418, 422, 427, 434, 443, 454, 466, 478, 479, 480, 481, 482, 483, 484, 485, 486, 495, 502, 507, 510, 512, 514, 549, 556, 559, 560, 561, 562, 563, 564, 566, 567, 571, 573, 576, 581, 588, 597, 607, 617, 618, 619, 620, 621, 622, 623, 624, 625, 632, 637, 640, 642, 644, 646, 681, 688, 691, 692, 693, 694, 695, 696, 697, 698, 699, 701, 703, 706, 709, 714, 721, 729, 737, 738, 739, 740, 741, 742, 743, 744, 745, 750, 753, 755, 757, 759, 761, 796, 803, 806, 807, 808, 809, 811, 812, 813, 814, 818, 820, 822, 824, 827, 832, 838, 844, 845, 846, 847, 848, 849, 850, 851, 852, 855, 857, 859, 861, 863, 865, 907, 910, 911, 912, 913, 914, 915, 916, 917, 918, 920, 922, 924, 928, 931, 935, 939, 940, 941, 942, 943, 945, 946, 947, 949, 951, 953, 955, 959, 961, 996, 1003, 1006, 1007, 1008, 1009, 1010, 1011, 1012, 1013, 1014, 1016, 1018, 1020, 1022, 1024, 1026, 1028, 1031, 1032, 1033, 1034, 1035, 1036, 1037, 1039, 1042, 1047, 1049, 1051, 1053, 1055, 1090, 1092, 1096, 1099, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1107, 1109, 1111, 1113, 1115, 1117, 1119, 1121, 1124, 1125, 1126, 1128, 1129, 1130, 1131, 1132, 1134, 1136, 1138, 1140, 1144, 1146, 1181, 1188, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198, 1199, 1201, 1203, 1205, 1207, 1209, 1211, 1213, 1216, 1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1226, 1228, 1230, 1232, 1234, 1236, 1271, 1278, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1291, 1293, 1295, 1297, 1299, 1301, 1304, 1309, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1317, 1320, 1322, 1324, 1326, 1328, 1330, 1365, 1372, 1375, 1376, 1377, 1378, 1379, 1380, 1381, 1382, 1383, 1385, 1387, 1389, 1391, 1393, 1396, 1401, 1408, 1409, 1410, 1411, 1412, 1413, 1414, 1415, 1416, 1421, 1424, 1426, 1428, 1430, 1432, 1467, 1474, 1477, 1478, 1479, 1480, 1481, 1482, 1483, 1485, 1487, 1489, 1491, 1496, 1499, 1504, 1511, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1528, 1535, 1540, 1543, 1545, 1547, 1549, 1584, 1591, 1594, 1595, 1597, 1598, 1599, 1600, 1601, 1602, 1605, 1607, 1609, 1612, 1618, 1628, 1637, 1648, 1649, 1650, 1651, 1652, 1653, 1654, 1656, 1667, 1674, 1679, 1682, 1684, 1687, 1722, 1729, 1732, 1733, 1734, 1735, 1736, 1737, 1739, 1740, 1742, 1744, 1747, 1752, 1759, 1770, 1781, 1794, 1795, 1797, 1798, 1800, 1801, 1802, 1813, 1822, 1829, 1837, 1842, 1844, 1879, 1886, 1889, 1890, 1891, 1892, 1893, 1894, 1895, 1896, 1897, 1899, 1903, 1908, 1915, 1924, 1935, 1948, 1963, 1964, 1965, 1966, 1967, 1968, 1969, 1971, 1984, 1995, 2004, 2011, 2018, 2021, 2056, 2058, 2062, 2065, 2067, 2068, 2069, 2070, 2071, 2072, 2073, 2076, 2084, 2091, 2100, 2111, 2124, 2139, 2156, 2157, 2158, 2159, 2160, 2161, 2162, 2163, 2164, 2179, 2192, 2203, 2212, 2219, 2224, 2261]
[2024-05-24 18:48:28] [INFO ] Actually due to overlaps returned [224, 398, 549, 681, 796, 996, 1090, 1181, 1271, 1365, 1467, 1584, 1722, 1879, 2056, 2261, 4, 12, 14, 18, 20, 22, 24, 26, 49, 123, 125, 127, 131, 133, 135, 137, 234, 235, 236, 237, 238, 239, 240, 241, 257, 318, 319, 320, 321, 322, 323, 324, 325, 408, 409, 410, 411, 412, 413, 414, 415, 427, 478, 479, 480, 481, 482, 483, 484, 485, 559, 560, 561, 562, 563, 564, 566, 576, 617, 618, 619, 620, 621, 622, 623, 624, 691, 692, 693, 694, 695, 696, 697, 698, 706, 737, 738, 739, 740, 741, 742, 743, 744, 806, 807, 808, 809, 811, 812, 813, 844, 845, 846, 847, 848, 849, 850, 851, 910, 911, 912, 913, 914, 915, 916, 917, 939, 940, 941, 942, 943, 945, 946, 1006, 1007, 1008, 1009, 1010, 1011, 1012, 1013, 1022, 1031, 1032, 1033, 1034, 1035, 1036, 1037, 1092, 1099, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1115, 1124, 1125, 1126, 1128, 1129, 1130, 1131, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198, 1207, 1216, 1217, 1218, 1219, 1220, 1221, 1222, 1223, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1297, 1309, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1375, 1376, 1377, 1378, 1379, 1380, 1381, 1382, 1391, 1408, 1409, 1410, 1411, 1412, 1413, 1414, 1415, 1477, 1478, 1479, 1480, 1481, 1482, 1483, 1496, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1594, 1595, 1597, 1598, 1599, 1600, 1601, 1612, 1648, 1649, 1650, 1651, 1652, 1653, 1654, 1732, 1733, 1734, 1735, 1736, 1737, 1739, 1752, 1794, 1795, 1797, 1798, 1800, 1801, 1889, 1890, 1891, 1892, 1893, 1894, 1895, 1896, 1915, 1963, 1964, 1965, 1966, 1967, 1968, 1969, 2058, 2065, 2067, 2068, 2069, 2070, 2071, 2072, 2100, 2156, 2157, 2158, 2159, 2160, 2161, 2162, 2163]
Discarding 291 places :
Implicit Place search using SMT only with invariants took 3356 ms to find 291 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2291/6876 places, 3808/9571 transitions.
Discarding 241 places :
Symmetric choice reduction at 0 with 241 rule applications. Total rules 241 place count 2050 transition count 3567
Iterating global reduction 0 with 241 rules applied. Total rules applied 482 place count 2050 transition count 3567
Discarding 238 places :
Symmetric choice reduction at 0 with 238 rule applications. Total rules 720 place count 1812 transition count 3329
Iterating global reduction 0 with 238 rules applied. Total rules applied 958 place count 1812 transition count 3329
Discarding 238 places :
Symmetric choice reduction at 0 with 238 rule applications. Total rules 1196 place count 1574 transition count 3091
Iterating global reduction 0 with 238 rules applied. Total rules applied 1434 place count 1574 transition count 3091
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 1449 place count 1559 transition count 2971
Iterating global reduction 0 with 15 rules applied. Total rules applied 1464 place count 1559 transition count 2971
Applied a total of 1464 rules in 253 ms. Remains 1559 /2291 variables (removed 732) and now considering 2971/3808 (removed 837) transitions.
[2024-05-24 18:48:29] [INFO ] Flow matrix only has 2699 transitions (discarded 272 similar events)
// Phase 1: matrix 2699 rows 1559 cols
[2024-05-24 18:48:29] [INFO ] Computed 322 invariants in 68 ms
[2024-05-24 18:48:30] [INFO ] Implicit Places using invariants in 1459 ms returned [7, 20, 25, 32, 54, 67, 82, 98, 123, 136, 149, 158, 165, 170, 173, 214, 217, 220, 225, 240, 251, 264, 278, 292, 303, 312, 319, 324, 327, 329, 342, 345, 347, 351, 362, 371, 382, 394, 406, 415, 422, 427, 430, 432, 434, 445, 449, 453, 455, 462, 469, 478, 488, 497, 504, 509, 512, 514, 516, 518, 529, 531, 533, 535, 540, 545, 552, 560, 567, 572, 575, 577, 579, 581, 583, 592, 596, 600, 602, 604, 606, 609, 614, 620, 625, 628, 630, 632, 634, 636, 638, 650, 652, 654, 656, 658, 662, 665, 669, 674, 676, 678, 680, 682, 686, 688, 699, 701, 703, 705, 707, 710, 712, 714, 718, 721, 726, 728, 730, 732, 734, 743, 745, 747, 749, 751, 754, 756, 758, 762, 764, 766, 768, 770, 774, 776, 787, 789, 791, 793, 795, 798, 800, 802, 804, 806, 808, 810, 812, 814, 816, 825, 827, 829, 831, 833, 836, 838, 841, 845, 848, 850, 852, 854, 856, 858, 867, 869, 871, 873, 875, 878, 881, 886, 892, 897, 900, 902, 904, 906, 908, 917, 921, 923, 925, 927, 934, 939, 946, 955, 962, 967, 970, 972, 974, 976, 988, 992, 995, 997, 999, 1007, 1017, 1026, 1038, 1049, 1056, 1061, 1064, 1066, 1069, 1082, 1086, 1088, 1090, 1093, 1104, 1115, 1126, 1141, 1152, 1161, 1168, 1176, 1181, 1183, 1198, 1200, 1202, 1206, 1211, 1226, 1237, 1250, 1266, 1279, 1290, 1299, 1306, 1313, 1316, 1325, 1329, 1332, 1340, 1347, 1366, 1379, 1394, 1410, 1425, 1438, 1449, 1458, 1465, 1470]
Discarding 256 places :
Implicit Place search using SMT only with invariants took 1466 ms to find 256 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1303/6876 places, 2971/9571 transitions.
Applied a total of 0 rules in 60 ms. Remains 1303 /1303 variables (removed 0) and now considering 2971/2971 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6556 ms. Remains : 1303/6876 places, 2971/9571 transitions.
Support contains 69 out of 1303 places after structural reductions.
[2024-05-24 18:48:31] [INFO ] Flatten gal took : 208 ms
[2024-05-24 18:48:31] [INFO ] Flatten gal took : 151 ms
[2024-05-24 18:48:31] [INFO ] Input system was already deterministic with 2971 transitions.
RANDOM walk for 40000 steps (480 resets) in 2397 ms. (16 steps per ms) remains 18/33 properties
BEST_FIRST walk for 4002 steps (12 resets) in 48 ms. (81 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 47 ms. (83 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (12 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 48 ms. (81 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (12 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 74 ms. (53 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (12 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (12 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (12 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (12 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (12 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (12 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
[2024-05-24 18:48:32] [INFO ] Flow matrix only has 2699 transitions (discarded 272 similar events)
// Phase 1: matrix 2699 rows 1303 cols
[2024-05-24 18:48:32] [INFO ] Computed 66 invariants in 75 ms
[2024-05-24 18:48:32] [INFO ] State equation strengthened by 1112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 2 (OVERLAPS) 1178/1218 variables, 11/13 constraints. Problems are: Problem set: 4 solved, 14 unsolved
[2024-05-24 18:48:33] [INFO ] Deduced a trap composed of 377 places in 574 ms of which 21 ms to minimize.
[2024-05-24 18:48:34] [INFO ] Deduced a trap composed of 279 places in 581 ms of which 8 ms to minimize.
[2024-05-24 18:48:34] [INFO ] Deduced a trap composed of 374 places in 556 ms of which 8 ms to minimize.
[2024-05-24 18:48:35] [INFO ] Deduced a trap composed of 333 places in 555 ms of which 7 ms to minimize.
[2024-05-24 18:48:35] [INFO ] Deduced a trap composed of 295 places in 560 ms of which 7 ms to minimize.
[2024-05-24 18:48:36] [INFO ] Deduced a trap composed of 380 places in 547 ms of which 7 ms to minimize.
[2024-05-24 18:48:37] [INFO ] Deduced a trap composed of 364 places in 578 ms of which 7 ms to minimize.
[2024-05-24 18:48:37] [INFO ] Deduced a trap composed of 360 places in 571 ms of which 8 ms to minimize.
SMT process timed out in 5243ms, After SMT, problems are : Problem set: 4 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 1303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1303 transition count 2947
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1279 transition count 2947
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 48 place count 1279 transition count 2921
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 100 place count 1253 transition count 2921
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 114 place count 1239 transition count 2872
Iterating global reduction 2 with 14 rules applied. Total rules applied 128 place count 1239 transition count 2872
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 128 place count 1239 transition count 2869
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 134 place count 1236 transition count 2869
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 143 place count 1227 transition count 2818
Iterating global reduction 2 with 9 rules applied. Total rules applied 152 place count 1227 transition count 2818
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 155 place count 1224 transition count 2794
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 1224 transition count 2794
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 212 place count 1197 transition count 2767
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 216 place count 1193 transition count 2763
Iterating global reduction 2 with 4 rules applied. Total rules applied 220 place count 1193 transition count 2763
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 224 place count 1189 transition count 2731
Iterating global reduction 2 with 4 rules applied. Total rules applied 228 place count 1189 transition count 2731
Free-agglomeration rule (complex) applied 146 times.
Iterating global reduction 2 with 146 rules applied. Total rules applied 374 place count 1189 transition count 4321
Reduce places removed 146 places and 0 transitions.
Iterating post reduction 2 with 146 rules applied. Total rules applied 520 place count 1043 transition count 4321
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 528 place count 1043 transition count 4321
Applied a total of 528 rules in 1052 ms. Remains 1043 /1303 variables (removed 260) and now considering 4321/2971 (removed -1350) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1053 ms. Remains : 1043/1303 places, 4321/2971 transitions.
RANDOM walk for 40000 steps (838 resets) in 1272 ms. (31 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40003 steps (106 resets) in 177 ms. (224 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (118 resets) in 212 ms. (187 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (116 resets) in 217 ms. (183 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (119 resets) in 227 ms. (175 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (118 resets) in 231 ms. (172 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (108 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (119 resets) in 146 ms. (272 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (132 resets) in 200 ms. (199 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (121 resets) in 156 ms. (254 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (120 resets) in 151 ms. (263 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (120 resets) in 148 ms. (268 steps per ms) remains 10/10 properties
[2024-05-24 18:48:39] [INFO ] Flow matrix only has 3927 transitions (discarded 394 similar events)
// Phase 1: matrix 3927 rows 1043 cols
[2024-05-24 18:48:39] [INFO ] Computed 66 invariants in 35 ms
[2024-05-24 18:48:39] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 939/958 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:48:40] [INFO ] Deduced a trap composed of 239 places in 634 ms of which 6 ms to minimize.
[2024-05-24 18:48:41] [INFO ] Deduced a trap composed of 128 places in 633 ms of which 6 ms to minimize.
[2024-05-24 18:48:42] [INFO ] Deduced a trap composed of 166 places in 615 ms of which 6 ms to minimize.
[2024-05-24 18:48:42] [INFO ] Deduced a trap composed of 116 places in 641 ms of which 6 ms to minimize.
[2024-05-24 18:48:43] [INFO ] Deduced a trap composed of 140 places in 623 ms of which 6 ms to minimize.
[2024-05-24 18:48:44] [INFO ] Deduced a trap composed of 117 places in 610 ms of which 6 ms to minimize.
[2024-05-24 18:48:44] [INFO ] Deduced a trap composed of 133 places in 589 ms of which 6 ms to minimize.
[2024-05-24 18:48:45] [INFO ] Deduced a trap composed of 116 places in 580 ms of which 6 ms to minimize.
[2024-05-24 18:48:45] [INFO ] Deduced a trap composed of 132 places in 584 ms of which 6 ms to minimize.
[2024-05-24 18:48:46] [INFO ] Deduced a trap composed of 140 places in 584 ms of which 6 ms to minimize.
[2024-05-24 18:48:47] [INFO ] Deduced a trap composed of 485 places in 465 ms of which 6 ms to minimize.
[2024-05-24 18:48:47] [INFO ] Deduced a trap composed of 145 places in 437 ms of which 6 ms to minimize.
[2024-05-24 18:48:47] [INFO ] Deduced a trap composed of 492 places in 417 ms of which 6 ms to minimize.
[2024-05-24 18:48:48] [INFO ] Deduced a trap composed of 500 places in 476 ms of which 6 ms to minimize.
[2024-05-24 18:48:49] [INFO ] Deduced a trap composed of 132 places in 606 ms of which 6 ms to minimize.
[2024-05-24 18:48:49] [INFO ] Deduced a trap composed of 167 places in 594 ms of which 6 ms to minimize.
[2024-05-24 18:48:50] [INFO ] Deduced a trap composed of 149 places in 585 ms of which 6 ms to minimize.
[2024-05-24 18:48:50] [INFO ] Deduced a trap composed of 163 places in 594 ms of which 5 ms to minimize.
[2024-05-24 18:48:51] [INFO ] Deduced a trap composed of 128 places in 574 ms of which 6 ms to minimize.
[2024-05-24 18:48:52] [INFO ] Deduced a trap composed of 164 places in 581 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/958 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:48:52] [INFO ] Deduced a trap composed of 129 places in 568 ms of which 6 ms to minimize.
[2024-05-24 18:48:53] [INFO ] Deduced a trap composed of 248 places in 573 ms of which 6 ms to minimize.
[2024-05-24 18:48:54] [INFO ] Deduced a trap composed of 162 places in 575 ms of which 6 ms to minimize.
[2024-05-24 18:48:54] [INFO ] Deduced a trap composed of 146 places in 573 ms of which 5 ms to minimize.
[2024-05-24 18:48:55] [INFO ] Deduced a trap composed of 199 places in 578 ms of which 5 ms to minimize.
[2024-05-24 18:48:56] [INFO ] Deduced a trap composed of 179 places in 589 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/958 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:48:56] [INFO ] Deduced a trap composed of 350 places in 473 ms of which 10 ms to minimize.
[2024-05-24 18:48:57] [INFO ] Deduced a trap composed of 320 places in 531 ms of which 6 ms to minimize.
[2024-05-24 18:48:57] [INFO ] Deduced a trap composed of 124 places in 582 ms of which 6 ms to minimize.
[2024-05-24 18:48:58] [INFO ] Deduced a trap composed of 116 places in 585 ms of which 6 ms to minimize.
[2024-05-24 18:48:59] [INFO ] Deduced a trap composed of 131 places in 572 ms of which 6 ms to minimize.
[2024-05-24 18:48:59] [INFO ] Deduced a trap composed of 162 places in 611 ms of which 7 ms to minimize.
[2024-05-24 18:49:00] [INFO ] Deduced a trap composed of 116 places in 605 ms of which 6 ms to minimize.
[2024-05-24 18:49:01] [INFO ] Deduced a trap composed of 239 places in 600 ms of which 5 ms to minimize.
[2024-05-24 18:49:01] [INFO ] Deduced a trap composed of 229 places in 567 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/958 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:49:02] [INFO ] Deduced a trap composed of 152 places in 580 ms of which 6 ms to minimize.
[2024-05-24 18:49:03] [INFO ] Deduced a trap composed of 134 places in 566 ms of which 6 ms to minimize.
[2024-05-24 18:49:03] [INFO ] Deduced a trap composed of 151 places in 584 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/958 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:49:04] [INFO ] Deduced a trap composed of 220 places in 576 ms of which 5 ms to minimize.
[2024-05-24 18:49:05] [INFO ] Deduced a trap composed of 190 places in 581 ms of which 6 ms to minimize.
[2024-05-24 18:49:05] [INFO ] Deduced a trap composed of 180 places in 594 ms of which 6 ms to minimize.
[2024-05-24 18:49:06] [INFO ] Deduced a trap composed of 116 places in 593 ms of which 6 ms to minimize.
[2024-05-24 18:49:07] [INFO ] Deduced a trap composed of 115 places in 615 ms of which 6 ms to minimize.
[2024-05-24 18:49:07] [INFO ] Deduced a trap composed of 124 places in 578 ms of which 6 ms to minimize.
[2024-05-24 18:49:08] [INFO ] Deduced a trap composed of 213 places in 603 ms of which 6 ms to minimize.
[2024-05-24 18:49:09] [INFO ] Deduced a trap composed of 171 places in 568 ms of which 6 ms to minimize.
[2024-05-24 18:49:09] [INFO ] Deduced a trap composed of 181 places in 570 ms of which 5 ms to minimize.
[2024-05-24 18:49:10] [INFO ] Deduced a trap composed of 133 places in 582 ms of which 7 ms to minimize.
[2024-05-24 18:49:10] [INFO ] Deduced a trap composed of 174 places in 587 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/958 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:49:11] [INFO ] Deduced a trap composed of 507 places in 471 ms of which 6 ms to minimize.
[2024-05-24 18:49:12] [INFO ] Deduced a trap composed of 117 places in 562 ms of which 6 ms to minimize.
[2024-05-24 18:49:12] [INFO ] Deduced a trap composed of 635 places in 470 ms of which 6 ms to minimize.
[2024-05-24 18:49:13] [INFO ] Deduced a trap composed of 144 places in 600 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/958 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:49:14] [INFO ] Deduced a trap composed of 187 places in 572 ms of which 5 ms to minimize.
[2024-05-24 18:49:14] [INFO ] Deduced a trap composed of 213 places in 577 ms of which 5 ms to minimize.
[2024-05-24 18:49:15] [INFO ] Deduced a trap composed of 116 places in 567 ms of which 5 ms to minimize.
[2024-05-24 18:49:15] [INFO ] Deduced a trap composed of 161 places in 556 ms of which 5 ms to minimize.
[2024-05-24 18:49:16] [INFO ] Deduced a trap composed of 133 places in 562 ms of which 6 ms to minimize.
[2024-05-24 18:49:17] [INFO ] Deduced a trap composed of 116 places in 605 ms of which 6 ms to minimize.
[2024-05-24 18:49:17] [INFO ] Deduced a trap composed of 162 places in 600 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/958 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:49:18] [INFO ] Deduced a trap composed of 117 places in 569 ms of which 6 ms to minimize.
[2024-05-24 18:49:19] [INFO ] Deduced a trap composed of 128 places in 574 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/958 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/958 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 2/960 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/960 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 50/1010 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:49:21] [INFO ] Deduced a trap composed of 5 places in 629 ms of which 6 ms to minimize.
[2024-05-24 18:49:21] [INFO ] Deduced a trap composed of 114 places in 622 ms of which 6 ms to minimize.
[2024-05-24 18:49:22] [INFO ] Deduced a trap composed of 100 places in 655 ms of which 6 ms to minimize.
[2024-05-24 18:49:22] [INFO ] Deduced a trap composed of 82 places in 648 ms of which 6 ms to minimize.
[2024-05-24 18:49:23] [INFO ] Deduced a trap composed of 103 places in 651 ms of which 5 ms to minimize.
[2024-05-24 18:49:24] [INFO ] Deduced a trap composed of 115 places in 620 ms of which 5 ms to minimize.
[2024-05-24 18:49:24] [INFO ] Deduced a trap composed of 105 places in 644 ms of which 6 ms to minimize.
SMT process timed out in 45169ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 4321/4321 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1043 transition count 4320
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1042 transition count 4320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1041 transition count 4319
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1041 transition count 4319
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 1041 transition count 4317
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 1039 transition count 4317
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 1039 transition count 4317
Applied a total of 9 rules in 423 ms. Remains 1039 /1043 variables (removed 4) and now considering 4317/4321 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 423 ms. Remains : 1039/1043 places, 4317/4321 transitions.
RANDOM walk for 40000 steps (840 resets) in 1354 ms. (29 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (105 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (120 resets) in 182 ms. (218 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (119 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (121 resets) in 212 ms. (187 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (108 resets) in 180 ms. (221 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (117 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (132 resets) in 189 ms. (210 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (119 resets) in 229 ms. (173 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (121 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (121 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 59981 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 10
Probabilistic random walk after 59981 steps, saw 25376 distinct states, run finished after 3004 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-24 18:49:29] [INFO ] Flow matrix only has 3923 transitions (discarded 394 similar events)
// Phase 1: matrix 3923 rows 1039 cols
[2024-05-24 18:49:29] [INFO ] Computed 66 invariants in 28 ms
[2024-05-24 18:49:29] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 936/955 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:49:30] [INFO ] Deduced a trap composed of 239 places in 579 ms of which 6 ms to minimize.
[2024-05-24 18:49:31] [INFO ] Deduced a trap composed of 125 places in 590 ms of which 6 ms to minimize.
[2024-05-24 18:49:31] [INFO ] Deduced a trap composed of 138 places in 575 ms of which 5 ms to minimize.
[2024-05-24 18:49:32] [INFO ] Deduced a trap composed of 113 places in 579 ms of which 5 ms to minimize.
[2024-05-24 18:49:32] [INFO ] Deduced a trap composed of 114 places in 593 ms of which 6 ms to minimize.
[2024-05-24 18:49:33] [INFO ] Deduced a trap composed of 130 places in 578 ms of which 6 ms to minimize.
[2024-05-24 18:49:34] [INFO ] Deduced a trap composed of 158 places in 580 ms of which 6 ms to minimize.
[2024-05-24 18:49:34] [INFO ] Deduced a trap composed of 121 places in 567 ms of which 6 ms to minimize.
[2024-05-24 18:49:35] [INFO ] Deduced a trap composed of 510 places in 456 ms of which 5 ms to minimize.
[2024-05-24 18:49:35] [INFO ] Deduced a trap composed of 489 places in 457 ms of which 6 ms to minimize.
[2024-05-24 18:49:35] [INFO ] Deduced a trap composed of 145 places in 82 ms of which 2 ms to minimize.
[2024-05-24 18:49:36] [INFO ] Deduced a trap composed of 113 places in 589 ms of which 6 ms to minimize.
[2024-05-24 18:49:37] [INFO ] Deduced a trap composed of 153 places in 567 ms of which 6 ms to minimize.
[2024-05-24 18:49:37] [INFO ] Deduced a trap composed of 125 places in 592 ms of which 5 ms to minimize.
[2024-05-24 18:49:38] [INFO ] Deduced a trap composed of 165 places in 588 ms of which 6 ms to minimize.
[2024-05-24 18:49:38] [INFO ] Deduced a trap composed of 126 places in 579 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/955 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:49:39] [INFO ] Deduced a trap composed of 113 places in 581 ms of which 6 ms to minimize.
[2024-05-24 18:49:40] [INFO ] Deduced a trap composed of 129 places in 579 ms of which 6 ms to minimize.
[2024-05-24 18:49:41] [INFO ] Deduced a trap composed of 137 places in 597 ms of which 6 ms to minimize.
[2024-05-24 18:49:41] [INFO ] Deduced a trap composed of 126 places in 606 ms of which 6 ms to minimize.
[2024-05-24 18:49:42] [INFO ] Deduced a trap composed of 130 places in 599 ms of which 6 ms to minimize.
[2024-05-24 18:49:42] [INFO ] Deduced a trap composed of 139 places in 575 ms of which 6 ms to minimize.
[2024-05-24 18:49:43] [INFO ] Deduced a trap composed of 248 places in 562 ms of which 6 ms to minimize.
[2024-05-24 18:49:44] [INFO ] Deduced a trap composed of 129 places in 583 ms of which 6 ms to minimize.
[2024-05-24 18:49:44] [INFO ] Deduced a trap composed of 157 places in 615 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/955 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:49:45] [INFO ] Deduced a trap composed of 173 places in 575 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/955 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/955 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/957 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:49:46] [INFO ] Deduced a trap composed of 153 places in 571 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/957 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/957 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 49/1006 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:49:47] [INFO ] Deduced a trap composed of 5 places in 545 ms of which 6 ms to minimize.
[2024-05-24 18:49:48] [INFO ] Deduced a trap composed of 82 places in 559 ms of which 6 ms to minimize.
[2024-05-24 18:49:49] [INFO ] Deduced a trap composed of 244 places in 564 ms of which 6 ms to minimize.
[2024-05-24 18:49:49] [INFO ] Deduced a trap composed of 200 places in 544 ms of which 6 ms to minimize.
[2024-05-24 18:49:50] [INFO ] Deduced a trap composed of 143 places in 568 ms of which 6 ms to minimize.
[2024-05-24 18:49:50] [INFO ] Deduced a trap composed of 27 places in 509 ms of which 7 ms to minimize.
[2024-05-24 18:49:51] [INFO ] Deduced a trap composed of 185 places in 550 ms of which 6 ms to minimize.
[2024-05-24 18:49:51] [INFO ] Deduced a trap composed of 103 places in 544 ms of which 6 ms to minimize.
[2024-05-24 18:49:52] [INFO ] Deduced a trap composed of 103 places in 653 ms of which 6 ms to minimize.
[2024-05-24 18:49:53] [INFO ] Deduced a trap composed of 103 places in 623 ms of which 6 ms to minimize.
[2024-05-24 18:49:53] [INFO ] Deduced a trap composed of 97 places in 604 ms of which 5 ms to minimize.
[2024-05-24 18:49:54] [INFO ] Deduced a trap composed of 84 places in 632 ms of which 5 ms to minimize.
[2024-05-24 18:49:55] [INFO ] Deduced a trap composed of 102 places in 603 ms of which 6 ms to minimize.
[2024-05-24 18:49:55] [INFO ] Deduced a trap composed of 92 places in 623 ms of which 6 ms to minimize.
[2024-05-24 18:49:56] [INFO ] Deduced a trap composed of 114 places in 588 ms of which 6 ms to minimize.
[2024-05-24 18:49:57] [INFO ] Deduced a trap composed of 93 places in 615 ms of which 6 ms to minimize.
[2024-05-24 18:49:57] [INFO ] Deduced a trap composed of 92 places in 650 ms of which 7 ms to minimize.
[2024-05-24 18:49:58] [INFO ] Deduced a trap composed of 166 places in 544 ms of which 6 ms to minimize.
[2024-05-24 18:49:58] [INFO ] Deduced a trap composed of 163 places in 496 ms of which 6 ms to minimize.
[2024-05-24 18:49:59] [INFO ] Deduced a trap composed of 161 places in 506 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1006 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:50:00] [INFO ] Deduced a trap composed of 111 places in 615 ms of which 6 ms to minimize.
[2024-05-24 18:50:00] [INFO ] Deduced a trap composed of 106 places in 618 ms of which 6 ms to minimize.
[2024-05-24 18:50:01] [INFO ] Deduced a trap composed of 103 places in 635 ms of which 6 ms to minimize.
[2024-05-24 18:50:01] [INFO ] Deduced a trap composed of 125 places in 652 ms of which 6 ms to minimize.
[2024-05-24 18:50:02] [INFO ] Deduced a trap composed of 118 places in 533 ms of which 6 ms to minimize.
[2024-05-24 18:50:03] [INFO ] Deduced a trap composed of 101 places in 634 ms of which 6 ms to minimize.
[2024-05-24 18:50:03] [INFO ] Deduced a trap composed of 117 places in 630 ms of which 6 ms to minimize.
[2024-05-24 18:50:04] [INFO ] Deduced a trap composed of 113 places in 642 ms of which 6 ms to minimize.
[2024-05-24 18:50:05] [INFO ] Deduced a trap composed of 118 places in 627 ms of which 6 ms to minimize.
[2024-05-24 18:50:05] [INFO ] Deduced a trap composed of 118 places in 631 ms of which 6 ms to minimize.
[2024-05-24 18:50:06] [INFO ] Deduced a trap composed of 106 places in 627 ms of which 6 ms to minimize.
[2024-05-24 18:50:07] [INFO ] Deduced a trap composed of 109 places in 631 ms of which 6 ms to minimize.
[2024-05-24 18:50:07] [INFO ] Deduced a trap composed of 136 places in 630 ms of which 6 ms to minimize.
[2024-05-24 18:50:08] [INFO ] Deduced a trap composed of 105 places in 640 ms of which 6 ms to minimize.
[2024-05-24 18:50:08] [INFO ] Deduced a trap composed of 186 places in 522 ms of which 6 ms to minimize.
[2024-05-24 18:50:09] [INFO ] Deduced a trap composed of 97 places in 636 ms of which 6 ms to minimize.
[2024-05-24 18:50:10] [INFO ] Deduced a trap composed of 103 places in 621 ms of which 6 ms to minimize.
[2024-05-24 18:50:10] [INFO ] Deduced a trap composed of 115 places in 629 ms of which 6 ms to minimize.
[2024-05-24 18:50:11] [INFO ] Deduced a trap composed of 134 places in 630 ms of which 7 ms to minimize.
[2024-05-24 18:50:12] [INFO ] Deduced a trap composed of 172 places in 523 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1006 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:50:12] [INFO ] Deduced a trap composed of 162 places in 484 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1006 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:50:13] [INFO ] Deduced a trap composed of 116 places in 645 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1006 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:50:14] [INFO ] Deduced a trap composed of 96 places in 617 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1006 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:50:15] [INFO ] Deduced a trap composed of 207 places in 530 ms of which 6 ms to minimize.
[2024-05-24 18:50:16] [INFO ] Deduced a trap composed of 209 places in 535 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1006 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:50:17] [INFO ] Deduced a trap composed of 83 places in 626 ms of which 6 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1006 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/1006 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 20/1026 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:50:18] [INFO ] Deduced a trap composed of 98 places in 615 ms of which 6 ms to minimize.
[2024-05-24 18:50:18] [INFO ] Deduced a trap composed of 97 places in 624 ms of which 6 ms to minimize.
[2024-05-24 18:50:19] [INFO ] Deduced a trap composed of 187 places in 532 ms of which 6 ms to minimize.
[2024-05-24 18:50:19] [INFO ] Deduced a trap composed of 189 places in 514 ms of which 6 ms to minimize.
[2024-05-24 18:50:20] [INFO ] Deduced a trap composed of 198 places in 531 ms of which 7 ms to minimize.
[2024-05-24 18:50:21] [INFO ] Deduced a trap composed of 92 places in 631 ms of which 6 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1026 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:50:22] [INFO ] Deduced a trap composed of 92 places in 637 ms of which 7 ms to minimize.
[2024-05-24 18:50:22] [INFO ] Deduced a trap composed of 121 places in 637 ms of which 6 ms to minimize.
[2024-05-24 18:50:23] [INFO ] Deduced a trap composed of 90 places in 628 ms of which 6 ms to minimize.
[2024-05-24 18:50:24] [INFO ] Deduced a trap composed of 97 places in 641 ms of which 6 ms to minimize.
[2024-05-24 18:50:24] [INFO ] Deduced a trap composed of 114 places in 663 ms of which 6 ms to minimize.
[2024-05-24 18:50:25] [INFO ] Deduced a trap composed of 90 places in 546 ms of which 7 ms to minimize.
[2024-05-24 18:50:25] [INFO ] Deduced a trap composed of 200 places in 551 ms of which 6 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1026 variables, 7/139 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:50:26] [INFO ] Deduced a trap composed of 185 places in 533 ms of which 6 ms to minimize.
[2024-05-24 18:50:27] [INFO ] Deduced a trap composed of 199 places in 545 ms of which 6 ms to minimize.
[2024-05-24 18:50:27] [INFO ] Deduced a trap composed of 100 places in 530 ms of which 6 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1026 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:50:28] [INFO ] Deduced a trap composed of 97 places in 542 ms of which 6 ms to minimize.
[2024-05-24 18:50:29] [INFO ] Deduced a trap composed of 175 places in 555 ms of which 6 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1026 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:50:30] [INFO ] Deduced a trap composed of 90 places in 629 ms of which 8 ms to minimize.
[2024-05-24 18:50:30] [INFO ] Deduced a trap composed of 119 places in 627 ms of which 6 ms to minimize.
[2024-05-24 18:50:31] [INFO ] Deduced a trap composed of 204 places in 529 ms of which 7 ms to minimize.
[2024-05-24 18:50:32] [INFO ] Deduced a trap composed of 99 places in 652 ms of which 6 ms to minimize.
[2024-05-24 18:50:32] [INFO ] Deduced a trap composed of 96 places in 650 ms of which 6 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1026 variables, 5/149 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:50:33] [INFO ] Deduced a trap composed of 106 places in 646 ms of which 6 ms to minimize.
[2024-05-24 18:50:34] [INFO ] Deduced a trap composed of 87 places in 633 ms of which 7 ms to minimize.
[2024-05-24 18:50:34] [INFO ] Deduced a trap composed of 81 places in 613 ms of which 6 ms to minimize.
[2024-05-24 18:50:35] [INFO ] Deduced a trap composed of 117 places in 626 ms of which 6 ms to minimize.
[2024-05-24 18:50:36] [INFO ] Deduced a trap composed of 99 places in 605 ms of which 6 ms to minimize.
[2024-05-24 18:50:36] [INFO ] Deduced a trap composed of 109 places in 634 ms of which 6 ms to minimize.
[2024-05-24 18:50:37] [INFO ] Deduced a trap composed of 103 places in 669 ms of which 6 ms to minimize.
[2024-05-24 18:50:38] [INFO ] Deduced a trap composed of 96 places in 603 ms of which 6 ms to minimize.
[2024-05-24 18:50:38] [INFO ] Deduced a trap composed of 98 places in 600 ms of which 6 ms to minimize.
[2024-05-24 18:50:39] [INFO ] Deduced a trap composed of 101 places in 597 ms of which 6 ms to minimize.
[2024-05-24 18:50:40] [INFO ] Deduced a trap composed of 92 places in 607 ms of which 6 ms to minimize.
[2024-05-24 18:50:40] [INFO ] Deduced a trap composed of 120 places in 614 ms of which 6 ms to minimize.
[2024-05-24 18:50:41] [INFO ] Deduced a trap composed of 102 places in 608 ms of which 6 ms to minimize.
[2024-05-24 18:50:42] [INFO ] Deduced a trap composed of 100 places in 617 ms of which 7 ms to minimize.
[2024-05-24 18:50:42] [INFO ] Deduced a trap composed of 104 places in 641 ms of which 6 ms to minimize.
[2024-05-24 18:50:43] [INFO ] Deduced a trap composed of 105 places in 593 ms of which 6 ms to minimize.
[2024-05-24 18:50:43] [INFO ] Deduced a trap composed of 112 places in 587 ms of which 5 ms to minimize.
[2024-05-24 18:50:44] [INFO ] Deduced a trap composed of 124 places in 650 ms of which 7 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1026/4962 variables, and 167 constraints, problems are : Problem set: 0 solved, 10 unsolved in 75020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 20/33 constraints, State Equation: 0/1039 constraints, ReadFeed: 0/2722 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 114/114 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 936/955 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/955 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/955 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/957 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/957 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 49/1006 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1006 variables, 72/132 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:50:46] [INFO ] Deduced a trap composed of 98 places in 633 ms of which 6 ms to minimize.
[2024-05-24 18:50:46] [INFO ] Deduced a trap composed of 171 places in 607 ms of which 6 ms to minimize.
[2024-05-24 18:50:47] [INFO ] Deduced a trap composed of 110 places in 634 ms of which 7 ms to minimize.
[2024-05-24 18:50:48] [INFO ] Deduced a trap composed of 119 places in 626 ms of which 6 ms to minimize.
[2024-05-24 18:50:48] [INFO ] Deduced a trap composed of 103 places in 627 ms of which 6 ms to minimize.
[2024-05-24 18:50:49] [INFO ] Deduced a trap composed of 105 places in 622 ms of which 6 ms to minimize.
[2024-05-24 18:50:50] [INFO ] Deduced a trap composed of 82 places in 596 ms of which 6 ms to minimize.
[2024-05-24 18:50:50] [INFO ] Deduced a trap composed of 27 places in 599 ms of which 5 ms to minimize.
[2024-05-24 18:50:51] [INFO ] Deduced a trap composed of 118 places in 614 ms of which 6 ms to minimize.
[2024-05-24 18:50:52] [INFO ] Deduced a trap composed of 111 places in 651 ms of which 6 ms to minimize.
[2024-05-24 18:50:52] [INFO ] Deduced a trap composed of 98 places in 644 ms of which 6 ms to minimize.
[2024-05-24 18:50:53] [INFO ] Deduced a trap composed of 116 places in 642 ms of which 6 ms to minimize.
[2024-05-24 18:50:54] [INFO ] Deduced a trap composed of 114 places in 652 ms of which 6 ms to minimize.
[2024-05-24 18:50:54] [INFO ] Deduced a trap composed of 116 places in 643 ms of which 7 ms to minimize.
[2024-05-24 18:50:55] [INFO ] Deduced a trap composed of 125 places in 609 ms of which 6 ms to minimize.
[2024-05-24 18:50:55] [INFO ] Deduced a trap composed of 101 places in 618 ms of which 6 ms to minimize.
[2024-05-24 18:50:56] [INFO ] Deduced a trap composed of 119 places in 623 ms of which 6 ms to minimize.
[2024-05-24 18:50:57] [INFO ] Deduced a trap composed of 109 places in 602 ms of which 5 ms to minimize.
[2024-05-24 18:50:57] [INFO ] Deduced a trap composed of 127 places in 530 ms of which 6 ms to minimize.
[2024-05-24 18:50:58] [INFO ] Deduced a trap composed of 222 places in 604 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1006 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:50:59] [INFO ] Deduced a trap composed of 110 places in 646 ms of which 6 ms to minimize.
[2024-05-24 18:50:59] [INFO ] Deduced a trap composed of 114 places in 625 ms of which 6 ms to minimize.
[2024-05-24 18:51:00] [INFO ] Deduced a trap composed of 108 places in 606 ms of which 6 ms to minimize.
[2024-05-24 18:51:01] [INFO ] Deduced a trap composed of 100 places in 628 ms of which 6 ms to minimize.
[2024-05-24 18:51:01] [INFO ] Deduced a trap composed of 127 places in 622 ms of which 7 ms to minimize.
[2024-05-24 18:51:02] [INFO ] Deduced a trap composed of 80 places in 643 ms of which 6 ms to minimize.
[2024-05-24 18:51:03] [INFO ] Deduced a trap composed of 107 places in 622 ms of which 6 ms to minimize.
[2024-05-24 18:51:03] [INFO ] Deduced a trap composed of 111 places in 617 ms of which 6 ms to minimize.
[2024-05-24 18:51:04] [INFO ] Deduced a trap composed of 256 places in 610 ms of which 6 ms to minimize.
[2024-05-24 18:51:04] [INFO ] Deduced a trap composed of 119 places in 632 ms of which 6 ms to minimize.
[2024-05-24 18:51:05] [INFO ] Deduced a trap composed of 127 places in 623 ms of which 6 ms to minimize.
[2024-05-24 18:51:06] [INFO ] Deduced a trap composed of 112 places in 647 ms of which 6 ms to minimize.
[2024-05-24 18:51:06] [INFO ] Deduced a trap composed of 118 places in 622 ms of which 6 ms to minimize.
[2024-05-24 18:51:07] [INFO ] Deduced a trap composed of 112 places in 610 ms of which 6 ms to minimize.
[2024-05-24 18:51:08] [INFO ] Deduced a trap composed of 115 places in 627 ms of which 6 ms to minimize.
[2024-05-24 18:51:08] [INFO ] Deduced a trap composed of 101 places in 634 ms of which 6 ms to minimize.
[2024-05-24 18:51:09] [INFO ] Deduced a trap composed of 108 places in 625 ms of which 5 ms to minimize.
[2024-05-24 18:51:10] [INFO ] Deduced a trap composed of 135 places in 617 ms of which 6 ms to minimize.
[2024-05-24 18:51:10] [INFO ] Deduced a trap composed of 103 places in 624 ms of which 6 ms to minimize.
[2024-05-24 18:51:11] [INFO ] Deduced a trap composed of 106 places in 609 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1006 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:51:12] [INFO ] Deduced a trap composed of 97 places in 623 ms of which 7 ms to minimize.
[2024-05-24 18:51:12] [INFO ] Deduced a trap composed of 113 places in 614 ms of which 6 ms to minimize.
[2024-05-24 18:51:13] [INFO ] Deduced a trap composed of 120 places in 629 ms of which 6 ms to minimize.
[2024-05-24 18:51:14] [INFO ] Deduced a trap composed of 102 places in 625 ms of which 6 ms to minimize.
[2024-05-24 18:51:14] [INFO ] Deduced a trap composed of 103 places in 611 ms of which 5 ms to minimize.
[2024-05-24 18:51:15] [INFO ] Deduced a trap composed of 110 places in 613 ms of which 6 ms to minimize.
[2024-05-24 18:51:16] [INFO ] Deduced a trap composed of 109 places in 630 ms of which 6 ms to minimize.
[2024-05-24 18:51:16] [INFO ] Deduced a trap composed of 124 places in 629 ms of which 6 ms to minimize.
[2024-05-24 18:51:17] [INFO ] Deduced a trap composed of 107 places in 629 ms of which 6 ms to minimize.
[2024-05-24 18:51:17] [INFO ] Deduced a trap composed of 102 places in 655 ms of which 6 ms to minimize.
[2024-05-24 18:51:18] [INFO ] Deduced a trap composed of 102 places in 623 ms of which 6 ms to minimize.
[2024-05-24 18:51:19] [INFO ] Deduced a trap composed of 110 places in 655 ms of which 7 ms to minimize.
[2024-05-24 18:51:19] [INFO ] Deduced a trap composed of 82 places in 612 ms of which 6 ms to minimize.
[2024-05-24 18:51:20] [INFO ] Deduced a trap composed of 124 places in 645 ms of which 6 ms to minimize.
[2024-05-24 18:51:21] [INFO ] Deduced a trap composed of 129 places in 625 ms of which 6 ms to minimize.
[2024-05-24 18:51:21] [INFO ] Deduced a trap composed of 117 places in 630 ms of which 6 ms to minimize.
[2024-05-24 18:51:22] [INFO ] Deduced a trap composed of 103 places in 630 ms of which 6 ms to minimize.
[2024-05-24 18:51:23] [INFO ] Deduced a trap composed of 109 places in 626 ms of which 6 ms to minimize.
[2024-05-24 18:51:23] [INFO ] Deduced a trap composed of 143 places in 617 ms of which 6 ms to minimize.
[2024-05-24 18:51:24] [INFO ] Deduced a trap composed of 113 places in 600 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1006 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:51:25] [INFO ] Deduced a trap composed of 94 places in 633 ms of which 6 ms to minimize.
[2024-05-24 18:51:25] [INFO ] Deduced a trap composed of 110 places in 614 ms of which 6 ms to minimize.
[2024-05-24 18:51:26] [INFO ] Deduced a trap composed of 94 places in 602 ms of which 6 ms to minimize.
[2024-05-24 18:51:27] [INFO ] Deduced a trap composed of 138 places in 629 ms of which 6 ms to minimize.
[2024-05-24 18:51:27] [INFO ] Deduced a trap composed of 110 places in 632 ms of which 6 ms to minimize.
[2024-05-24 18:51:28] [INFO ] Deduced a trap composed of 121 places in 619 ms of which 6 ms to minimize.
[2024-05-24 18:51:29] [INFO ] Deduced a trap composed of 110 places in 619 ms of which 6 ms to minimize.
[2024-05-24 18:51:29] [INFO ] Deduced a trap composed of 133 places in 601 ms of which 6 ms to minimize.
[2024-05-24 18:51:30] [INFO ] Deduced a trap composed of 102 places in 624 ms of which 6 ms to minimize.
[2024-05-24 18:51:31] [INFO ] Deduced a trap composed of 113 places in 603 ms of which 6 ms to minimize.
[2024-05-24 18:51:31] [INFO ] Deduced a trap composed of 107 places in 601 ms of which 6 ms to minimize.
[2024-05-24 18:51:32] [INFO ] Deduced a trap composed of 99 places in 613 ms of which 6 ms to minimize.
[2024-05-24 18:51:32] [INFO ] Deduced a trap composed of 118 places in 618 ms of which 5 ms to minimize.
[2024-05-24 18:51:33] [INFO ] Deduced a trap composed of 122 places in 640 ms of which 6 ms to minimize.
[2024-05-24 18:51:34] [INFO ] Deduced a trap composed of 98 places in 647 ms of which 6 ms to minimize.
[2024-05-24 18:51:34] [INFO ] Deduced a trap composed of 115 places in 623 ms of which 6 ms to minimize.
[2024-05-24 18:51:35] [INFO ] Deduced a trap composed of 103 places in 635 ms of which 6 ms to minimize.
[2024-05-24 18:51:36] [INFO ] Deduced a trap composed of 113 places in 621 ms of which 6 ms to minimize.
[2024-05-24 18:51:36] [INFO ] Deduced a trap composed of 123 places in 614 ms of which 6 ms to minimize.
[2024-05-24 18:51:37] [INFO ] Deduced a trap composed of 121 places in 624 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1006 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:51:38] [INFO ] Deduced a trap composed of 122 places in 618 ms of which 6 ms to minimize.
[2024-05-24 18:51:38] [INFO ] Deduced a trap composed of 135 places in 637 ms of which 7 ms to minimize.
[2024-05-24 18:51:39] [INFO ] Deduced a trap composed of 216 places in 550 ms of which 6 ms to minimize.
[2024-05-24 18:51:40] [INFO ] Deduced a trap composed of 145 places in 526 ms of which 5 ms to minimize.
[2024-05-24 18:51:40] [INFO ] Deduced a trap composed of 123 places in 625 ms of which 6 ms to minimize.
[2024-05-24 18:51:41] [INFO ] Deduced a trap composed of 100 places in 628 ms of which 6 ms to minimize.
[2024-05-24 18:51:41] [INFO ] Deduced a trap composed of 274 places in 531 ms of which 6 ms to minimize.
[2024-05-24 18:51:42] [INFO ] Deduced a trap composed of 204 places in 541 ms of which 6 ms to minimize.
[2024-05-24 18:51:43] [INFO ] Deduced a trap composed of 301 places in 532 ms of which 6 ms to minimize.
[2024-05-24 18:51:43] [INFO ] Deduced a trap composed of 101 places in 628 ms of which 6 ms to minimize.
[2024-05-24 18:51:44] [INFO ] Deduced a trap composed of 120 places in 621 ms of which 6 ms to minimize.
[2024-05-24 18:51:44] [INFO ] Deduced a trap composed of 138 places in 606 ms of which 6 ms to minimize.
[2024-05-24 18:51:45] [INFO ] Deduced a trap composed of 265 places in 543 ms of which 6 ms to minimize.
[2024-05-24 18:51:46] [INFO ] Deduced a trap composed of 278 places in 521 ms of which 6 ms to minimize.
[2024-05-24 18:51:46] [INFO ] Deduced a trap composed of 284 places in 513 ms of which 6 ms to minimize.
[2024-05-24 18:51:47] [INFO ] Deduced a trap composed of 129 places in 614 ms of which 6 ms to minimize.
[2024-05-24 18:51:47] [INFO ] Deduced a trap composed of 93 places in 603 ms of which 6 ms to minimize.
[2024-05-24 18:51:48] [INFO ] Deduced a trap composed of 319 places in 495 ms of which 6 ms to minimize.
[2024-05-24 18:51:48] [INFO ] Deduced a trap composed of 278 places in 487 ms of which 6 ms to minimize.
[2024-05-24 18:51:49] [INFO ] Deduced a trap composed of 279 places in 530 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1006 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 18:51:50] [INFO ] Deduced a trap composed of 126 places in 629 ms of which 6 ms to minimize.
[2024-05-24 18:51:50] [INFO ] Deduced a trap composed of 128 places in 601 ms of which 6 ms to minimize.
[2024-05-24 18:51:51] [INFO ] Deduced a trap composed of 120 places in 613 ms of which 6 ms to minimize.
[2024-05-24 18:51:52] [INFO ] Deduced a trap composed of 117 places in 596 ms of which 6 ms to minimize.
[2024-05-24 18:51:52] [INFO ] Deduced a trap composed of 160 places in 515 ms of which 5 ms to minimize.
[2024-05-24 18:51:53] [INFO ] Deduced a trap composed of 106 places in 597 ms of which 6 ms to minimize.
[2024-05-24 18:51:53] [INFO ] Deduced a trap composed of 133 places in 602 ms of which 6 ms to minimize.
[2024-05-24 18:51:54] [INFO ] Deduced a trap composed of 231 places in 513 ms of which 6 ms to minimize.
[2024-05-24 18:51:54] [INFO ] Deduced a trap composed of 287 places in 503 ms of which 6 ms to minimize.
[2024-05-24 18:51:55] [INFO ] Deduced a trap composed of 167 places in 487 ms of which 5 ms to minimize.
[2024-05-24 18:51:55] [INFO ] Deduced a trap composed of 169 places in 501 ms of which 6 ms to minimize.
[2024-05-24 18:51:56] [INFO ] Deduced a trap composed of 167 places in 611 ms of which 6 ms to minimize.
[2024-05-24 18:51:57] [INFO ] Deduced a trap composed of 169 places in 625 ms of which 6 ms to minimize.
[2024-05-24 18:51:57] [INFO ] Deduced a trap composed of 172 places in 604 ms of which 6 ms to minimize.
[2024-05-24 18:51:58] [INFO ] Deduced a trap composed of 145 places in 519 ms of which 6 ms to minimize.
[2024-05-24 18:51:58] [INFO ] Deduced a trap composed of 299 places in 504 ms of which 5 ms to minimize.
[2024-05-24 18:51:59] [INFO ] Deduced a trap composed of 306 places in 520 ms of which 6 ms to minimize.
[2024-05-24 18:52:00] [INFO ] Deduced a trap composed of 180 places in 514 ms of which 6 ms to minimize.
SMT process timed out in 150515ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 19 out of 1039 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1039/1039 places, 4317/4317 transitions.
Applied a total of 0 rules in 119 ms. Remains 1039 /1039 variables (removed 0) and now considering 4317/4317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 1039/1039 places, 4317/4317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1039/1039 places, 4317/4317 transitions.
Applied a total of 0 rules in 112 ms. Remains 1039 /1039 variables (removed 0) and now considering 4317/4317 (removed 0) transitions.
[2024-05-24 18:52:00] [INFO ] Flow matrix only has 3923 transitions (discarded 394 similar events)
[2024-05-24 18:52:00] [INFO ] Invariant cache hit.
[2024-05-24 18:52:01] [INFO ] Implicit Places using invariants in 1303 ms returned [7, 84, 408, 433, 444, 450, 498, 630, 659, 728, 729, 817, 862]
[2024-05-24 18:52:01] [INFO ] Actually due to overlaps returned [433, 7, 84, 408, 450, 498, 630, 659, 728, 729, 817, 862]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1307 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1027/1039 places, 4317/4317 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1020 transition count 4310
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1020 transition count 4310
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1013 transition count 4303
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1013 transition count 4303
Applied a total of 28 rules in 192 ms. Remains 1013 /1027 variables (removed 14) and now considering 4303/4317 (removed 14) transitions.
[2024-05-24 18:52:01] [INFO ] Flow matrix only has 3909 transitions (discarded 394 similar events)
// Phase 1: matrix 3909 rows 1013 cols
[2024-05-24 18:52:01] [INFO ] Computed 54 invariants in 30 ms
[2024-05-24 18:52:02] [INFO ] Implicit Places using invariants in 1232 ms returned [438]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1236 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1012/1039 places, 4303/4317 transitions.
Applied a total of 0 rules in 113 ms. Remains 1012 /1012 variables (removed 0) and now considering 4303/4303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2961 ms. Remains : 1012/1039 places, 4303/4317 transitions.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 471 stabilizing places and 1338 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&G(p2)))))'
Support contains 4 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1279 transition count 2891
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1279 transition count 2891
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 64 place count 1263 transition count 2812
Iterating global reduction 0 with 16 rules applied. Total rules applied 80 place count 1263 transition count 2812
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 1256 transition count 2756
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 1256 transition count 2756
Applied a total of 94 rules in 195 ms. Remains 1256 /1303 variables (removed 47) and now considering 2756/2971 (removed 215) transitions.
[2024-05-24 18:52:03] [INFO ] Flow matrix only has 2484 transitions (discarded 272 similar events)
// Phase 1: matrix 2484 rows 1256 cols
[2024-05-24 18:52:03] [INFO ] Computed 66 invariants in 28 ms
[2024-05-24 18:52:04] [INFO ] Implicit Places using invariants in 1087 ms returned [12, 106, 392, 506, 537, 549, 559, 614, 772, 806, 843, 888, 889, 993, 1046]
[2024-05-24 18:52:04] [INFO ] Actually due to overlaps returned [537, 12, 106, 392, 506, 559, 614, 772, 806, 843, 888, 889, 993, 1046]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1090 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1242/1303 places, 2756/2971 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1229 transition count 2743
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1229 transition count 2743
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1216 transition count 2730
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1216 transition count 2730
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1203 transition count 2717
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1203 transition count 2717
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 1191 transition count 2621
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 1191 transition count 2621
Applied a total of 102 rules in 243 ms. Remains 1191 /1242 variables (removed 51) and now considering 2621/2756 (removed 135) transitions.
[2024-05-24 18:52:04] [INFO ] Flow matrix only has 2349 transitions (discarded 272 similar events)
// Phase 1: matrix 2349 rows 1191 cols
[2024-05-24 18:52:04] [INFO ] Computed 52 invariants in 31 ms
[2024-05-24 18:52:05] [INFO ] Implicit Places using invariants in 995 ms returned [532]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 997 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1190/1303 places, 2621/2971 transitions.
Applied a total of 0 rules in 45 ms. Remains 1190 /1190 variables (removed 0) and now considering 2621/2621 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2572 ms. Remains : 1190/1303 places, 2621/2971 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-00 finished in 2902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1278 transition count 2890
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1278 transition count 2890
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 67 place count 1261 transition count 2817
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 1261 transition count 2817
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 93 place count 1252 transition count 2745
Iterating global reduction 0 with 9 rules applied. Total rules applied 102 place count 1252 transition count 2745
Applied a total of 102 rules in 193 ms. Remains 1252 /1303 variables (removed 51) and now considering 2745/2971 (removed 226) transitions.
[2024-05-24 18:52:06] [INFO ] Flow matrix only has 2473 transitions (discarded 272 similar events)
// Phase 1: matrix 2473 rows 1252 cols
[2024-05-24 18:52:06] [INFO ] Computed 66 invariants in 26 ms
[2024-05-24 18:52:07] [INFO ] Implicit Places using invariants in 1122 ms returned [12, 106, 508, 539, 551, 561, 588, 613, 717, 768, 802, 839, 884, 885, 989, 1042]
[2024-05-24 18:52:07] [INFO ] Actually due to overlaps returned [539, 12, 106, 508, 561, 588, 613, 717, 768, 802, 839, 884, 885, 989, 1042]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1125 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1237/1303 places, 2745/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1223 transition count 2731
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1223 transition count 2731
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1209 transition count 2717
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1209 transition count 2717
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1195 transition count 2703
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1195 transition count 2703
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 1182 transition count 2599
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 1182 transition count 2599
Applied a total of 110 rules in 241 ms. Remains 1182 /1237 variables (removed 55) and now considering 2599/2745 (removed 146) transitions.
[2024-05-24 18:52:07] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1182 cols
[2024-05-24 18:52:07] [INFO ] Computed 51 invariants in 27 ms
[2024-05-24 18:52:08] [INFO ] Implicit Places using invariants in 989 ms returned [538]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 991 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1181/1303 places, 2599/2971 transitions.
Applied a total of 0 rules in 44 ms. Remains 1181 /1181 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2596 ms. Remains : 1181/1303 places, 2599/2971 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-03 finished in 2715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 4 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1279 transition count 2898
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1279 transition count 2898
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 1262 transition count 2825
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 1262 transition count 2825
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 91 place count 1253 transition count 2753
Iterating global reduction 0 with 9 rules applied. Total rules applied 100 place count 1253 transition count 2753
Applied a total of 100 rules in 194 ms. Remains 1253 /1303 variables (removed 50) and now considering 2753/2971 (removed 218) transitions.
[2024-05-24 18:52:09] [INFO ] Flow matrix only has 2481 transitions (discarded 272 similar events)
// Phase 1: matrix 2481 rows 1253 cols
[2024-05-24 18:52:09] [INFO ] Computed 66 invariants in 31 ms
[2024-05-24 18:52:10] [INFO ] Implicit Places using invariants in 1099 ms returned [12, 394, 509, 540, 552, 562, 589, 614, 718, 769, 803, 840, 885, 886, 990, 1043]
[2024-05-24 18:52:10] [INFO ] Actually due to overlaps returned [540, 12, 394, 509, 562, 589, 614, 718, 769, 803, 840, 885, 886, 990, 1043]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1102 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1238/1303 places, 2753/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1224 transition count 2739
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1224 transition count 2739
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1210 transition count 2725
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1210 transition count 2725
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1196 transition count 2711
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1196 transition count 2711
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 1183 transition count 2607
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 1183 transition count 2607
Applied a total of 110 rules in 248 ms. Remains 1183 /1238 variables (removed 55) and now considering 2607/2753 (removed 146) transitions.
[2024-05-24 18:52:10] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1183 cols
[2024-05-24 18:52:10] [INFO ] Computed 51 invariants in 25 ms
[2024-05-24 18:52:11] [INFO ] Implicit Places using invariants in 1024 ms returned [539]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1025 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1182/1303 places, 2607/2971 transitions.
Applied a total of 0 rules in 44 ms. Remains 1182 /1182 variables (removed 0) and now considering 2607/2607 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2615 ms. Remains : 1182/1303 places, 2607/2971 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06
Product exploration explored 100000 steps with 1205 reset in 469 ms.
Product exploration explored 100000 steps with 1203 reset in 467 ms.
Computed a total of 350 stabilizing places and 974 stable transitions
Computed a total of 350 stabilizing places and 974 stable transitions
Detected a total of 350/1182 stabilizing places and 974/2607 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 38589 steps (463 resets) in 334 ms. (115 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 2607/2607 transitions.
Applied a total of 0 rules in 51 ms. Remains 1182 /1182 variables (removed 0) and now considering 2607/2607 (removed 0) transitions.
[2024-05-24 18:52:13] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1182 cols
[2024-05-24 18:52:13] [INFO ] Computed 50 invariants in 22 ms
[2024-05-24 18:52:14] [INFO ] Implicit Places using invariants in 987 ms returned []
[2024-05-24 18:52:14] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2024-05-24 18:52:14] [INFO ] Invariant cache hit.
[2024-05-24 18:52:15] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-24 18:52:28] [INFO ] Implicit Places using invariants and state equation in 13430 ms returned []
Implicit Place search using SMT with State Equation took 14419 ms to find 0 implicit places.
Running 2590 sub problems to find dead transitions.
[2024-05-24 18:52:28] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2024-05-24 18:52:28] [INFO ] Invariant cache hit.
[2024-05-24 18:52:28] [INFO ] State equation strengthened by 853 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1180 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2590 unsolved
SMT process timed out in 32560ms, After SMT, problems are : Problem set: 0 solved, 2590 unsolved
Search for dead transitions found 0 dead transitions in 32588ms
Finished structural reductions in LTL mode , in 1 iterations and 47074 ms. Remains : 1182/1182 places, 2607/2607 transitions.
Computed a total of 350 stabilizing places and 974 stable transitions
Computed a total of 350 stabilizing places and 974 stable transitions
Detected a total of 350/1182 stabilizing places and 974/2607 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 24395 steps (291 resets) in 170 ms. (142 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 271 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1206 reset in 404 ms.
Product exploration explored 100000 steps with 1206 reset in 419 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1182/1182 places, 2607/2607 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1182 transition count 2607
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 31 place count 1182 transition count 2607
Deduced a syphon composed of 47 places in 2 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 47 place count 1182 transition count 2607
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 62 place count 1167 transition count 2592
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 1167 transition count 2592
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 95 place count 1167 transition count 2592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 1166 transition count 2591
Deduced a syphon composed of 49 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 1166 transition count 2591
Deduced a syphon composed of 49 places in 1 ms
Applied a total of 97 rules in 477 ms. Remains 1166 /1182 variables (removed 16) and now considering 2591/2607 (removed 16) transitions.
[2024-05-24 18:53:03] [INFO ] Redundant transitions in 206 ms returned []
Running 2574 sub problems to find dead transitions.
[2024-05-24 18:53:03] [INFO ] Flow matrix only has 2319 transitions (discarded 272 similar events)
// Phase 1: matrix 2319 rows 1166 cols
[2024-05-24 18:53:03] [INFO ] Computed 50 invariants in 25 ms
[2024-05-24 18:53:03] [INFO ] State equation strengthened by 853 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1164 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2574 unsolved
SMT process timed out in 32953ms, After SMT, problems are : Problem set: 0 solved, 2574 unsolved
Search for dead transitions found 0 dead transitions in 32977ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1166/1182 places, 2591/2607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33671 ms. Remains : 1166/1182 places, 2591/2607 transitions.
Built C files in :
/tmp/ltsmin14342017607143693043
[2024-05-24 18:53:36] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14342017607143693043
Running compilation step : cd /tmp/ltsmin14342017607143693043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14342017607143693043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14342017607143693043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 2607/2607 transitions.
Applied a total of 0 rules in 49 ms. Remains 1182 /1182 variables (removed 0) and now considering 2607/2607 (removed 0) transitions.
[2024-05-24 18:53:39] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
// Phase 1: matrix 2335 rows 1182 cols
[2024-05-24 18:53:39] [INFO ] Computed 50 invariants in 21 ms
[2024-05-24 18:53:40] [INFO ] Implicit Places using invariants in 994 ms returned []
[2024-05-24 18:53:40] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2024-05-24 18:53:40] [INFO ] Invariant cache hit.
[2024-05-24 18:53:41] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-24 18:53:54] [INFO ] Implicit Places using invariants and state equation in 13907 ms returned []
Implicit Place search using SMT with State Equation took 14903 ms to find 0 implicit places.
Running 2590 sub problems to find dead transitions.
[2024-05-24 18:53:54] [INFO ] Flow matrix only has 2335 transitions (discarded 272 similar events)
[2024-05-24 18:53:54] [INFO ] Invariant cache hit.
[2024-05-24 18:53:54] [INFO ] State equation strengthened by 853 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1180 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2590 unsolved
SMT process timed out in 32501ms, After SMT, problems are : Problem set: 0 solved, 2590 unsolved
Search for dead transitions found 0 dead transitions in 32524ms
Finished structural reductions in LTL mode , in 1 iterations and 47483 ms. Remains : 1182/1182 places, 2607/2607 transitions.
Built C files in :
/tmp/ltsmin13598010059226704706
[2024-05-24 18:54:27] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13598010059226704706
Running compilation step : cd /tmp/ltsmin13598010059226704706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13598010059226704706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13598010059226704706;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 18:54:30] [INFO ] Flatten gal took : 104 ms
[2024-05-24 18:54:30] [INFO ] Flatten gal took : 109 ms
[2024-05-24 18:54:30] [INFO ] Time to serialize gal into /tmp/LTL763955015307316600.gal : 37 ms
[2024-05-24 18:54:30] [INFO ] Time to serialize properties into /tmp/LTL5498027245482313536.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL763955015307316600.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6696948807619794722.hoa' '-atoms' '/tmp/LTL5498027245482313536.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL5498027245482313536.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6696948807619794722.hoa
Detected timeout of ITS tools.
[2024-05-24 18:54:45] [INFO ] Flatten gal took : 73 ms
[2024-05-24 18:54:45] [INFO ] Flatten gal took : 74 ms
[2024-05-24 18:54:45] [INFO ] Time to serialize gal into /tmp/LTL12642941769075149595.gal : 15 ms
[2024-05-24 18:54:45] [INFO ] Time to serialize properties into /tmp/LTL9779298728871945216.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12642941769075149595.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9779298728871945216.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(LeafSetOfRx3IsSentToNode0<1))")))||(G("((Node4ManageTheCrashOfNode3<1)...204
Formula 0 simplified : XX(GF!"((Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(LeafSetOfRx3IsSentToNode0<1))" & F!"((Node4ManageTheCrashOfNode3<1)||(Lx0I...192
Detected timeout of ITS tools.
[2024-05-24 18:55:01] [INFO ] Flatten gal took : 76 ms
[2024-05-24 18:55:01] [INFO ] Applying decomposition
[2024-05-24 18:55:01] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2091661811775640107.txt' '-o' '/tmp/graph2091661811775640107.bin' '-w' '/tmp/graph2091661811775640107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2091661811775640107.bin' '-l' '-1' '-v' '-w' '/tmp/graph2091661811775640107.weights' '-q' '0' '-e' '0.001'
[2024-05-24 18:55:01] [INFO ] Decomposing Gal with order
[2024-05-24 18:55:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 18:55:01] [INFO ] Removed a total of 1909 redundant transitions.
[2024-05-24 18:55:02] [INFO ] Flatten gal took : 376 ms
[2024-05-24 18:55:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 1063 labels/synchronizations in 128 ms.
[2024-05-24 18:55:02] [INFO ] Time to serialize gal into /tmp/LTL9514967252697056981.gal : 29 ms
[2024-05-24 18:55:02] [INFO ] Time to serialize properties into /tmp/LTL9237627772144187561.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9514967252697056981.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9237627772144187561.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((i12.i1.i2.u186.Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(i12.i1.i2.u30.LeafSetOfRx3IsSentToNode0<1))")))||(G("((...262
Formula 0 simplified : XX(GF!"((i12.i1.i2.u186.Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(i12.i1.i2.u30.LeafSetOfRx3IsSentToNode0<1))" & F!"((i12.i0....250
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06 finished in 188348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1279 transition count 2891
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1279 transition count 2891
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 64 place count 1263 transition count 2819
Iterating global reduction 0 with 16 rules applied. Total rules applied 80 place count 1263 transition count 2819
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 88 place count 1255 transition count 2755
Iterating global reduction 0 with 8 rules applied. Total rules applied 96 place count 1255 transition count 2755
Applied a total of 96 rules in 144 ms. Remains 1255 /1303 variables (removed 48) and now considering 2755/2971 (removed 216) transitions.
[2024-05-24 18:55:17] [INFO ] Flow matrix only has 2483 transitions (discarded 272 similar events)
// Phase 1: matrix 2483 rows 1255 cols
[2024-05-24 18:55:17] [INFO ] Computed 66 invariants in 33 ms
[2024-05-24 18:55:18] [INFO ] Implicit Places using invariants in 1158 ms returned [109, 395, 509, 540, 552, 591, 616, 720, 771, 805, 842, 887, 888, 992, 1045]
[2024-05-24 18:55:18] [INFO ] Actually due to overlaps returned [540, 109, 395, 509, 591, 616, 720, 771, 805, 842, 887, 888, 992, 1045]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1162 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1241/1303 places, 2755/2971 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1228 transition count 2742
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1228 transition count 2742
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1215 transition count 2729
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1215 transition count 2729
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 1202 transition count 2716
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 1202 transition count 2716
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 1190 transition count 2620
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 1190 transition count 2620
Applied a total of 102 rules in 182 ms. Remains 1190 /1241 variables (removed 51) and now considering 2620/2755 (removed 135) transitions.
[2024-05-24 18:55:18] [INFO ] Flow matrix only has 2348 transitions (discarded 272 similar events)
// Phase 1: matrix 2348 rows 1190 cols
[2024-05-24 18:55:18] [INFO ] Computed 52 invariants in 24 ms
[2024-05-24 18:55:19] [INFO ] Implicit Places using invariants in 995 ms returned [539]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 998 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1189/1303 places, 2620/2971 transitions.
Applied a total of 0 rules in 41 ms. Remains 1189 /1189 variables (removed 0) and now considering 2620/2620 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2529 ms. Remains : 1189/1303 places, 2620/2971 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07
Stuttering criterion allowed to conclude after 84 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-07 finished in 2662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 1303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1303 transition count 2945
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1277 transition count 2945
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 52 place count 1277 transition count 2917
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 108 place count 1249 transition count 2917
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 127 place count 1230 transition count 2842
Iterating global reduction 2 with 19 rules applied. Total rules applied 146 place count 1230 transition count 2842
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 146 place count 1230 transition count 2839
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 152 place count 1227 transition count 2839
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 163 place count 1216 transition count 2772
Iterating global reduction 2 with 11 rules applied. Total rules applied 174 place count 1216 transition count 2772
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 177 place count 1213 transition count 2748
Iterating global reduction 2 with 3 rules applied. Total rules applied 180 place count 1213 transition count 2748
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 236 place count 1185 transition count 2720
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 242 place count 1179 transition count 2714
Iterating global reduction 2 with 6 rules applied. Total rules applied 248 place count 1179 transition count 2714
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 254 place count 1173 transition count 2666
Iterating global reduction 2 with 6 rules applied. Total rules applied 260 place count 1173 transition count 2666
Applied a total of 260 rules in 367 ms. Remains 1173 /1303 variables (removed 130) and now considering 2666/2971 (removed 305) transitions.
[2024-05-24 18:55:20] [INFO ] Flow matrix only has 2394 transitions (discarded 272 similar events)
// Phase 1: matrix 2394 rows 1173 cols
[2024-05-24 18:55:20] [INFO ] Computed 66 invariants in 27 ms
[2024-05-24 18:55:21] [INFO ] Implicit Places using invariants in 1060 ms returned [9, 95, 355, 466, 496, 507, 517, 542, 565, 664, 713, 747, 781, 827, 930, 981]
[2024-05-24 18:55:21] [INFO ] Actually due to overlaps returned [496, 9, 95, 355, 466, 517, 542, 565, 664, 713, 747, 781, 827, 930, 981]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1071 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1158/1303 places, 2666/2971 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1149 transition count 2657
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1149 transition count 2657
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1140 transition count 2648
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1140 transition count 2648
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 1132 transition count 2584
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 1132 transition count 2584
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 1127 transition count 2579
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 1122 transition count 2574
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 1122 transition count 2574
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 1117 transition count 2534
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 1117 transition count 2534
Applied a total of 82 rules in 348 ms. Remains 1117 /1158 variables (removed 41) and now considering 2534/2666 (removed 132) transitions.
[2024-05-24 18:55:21] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1117 cols
[2024-05-24 18:55:21] [INFO ] Computed 51 invariants in 24 ms
[2024-05-24 18:55:22] [INFO ] Implicit Places using invariants in 946 ms returned [494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 948 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1116/1303 places, 2534/2971 transitions.
Applied a total of 0 rules in 64 ms. Remains 1116 /1116 variables (removed 0) and now considering 2534/2534 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2799 ms. Remains : 1116/1303 places, 2534/2971 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08
Product exploration explored 100000 steps with 1710 reset in 466 ms.
Product exploration explored 100000 steps with 1710 reset in 494 ms.
Computed a total of 301 stabilizing places and 918 stable transitions
Computed a total of 301 stabilizing places and 918 stable transitions
Detected a total of 301/1116 stabilizing places and 918/2534 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 129 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (683 resets) in 350 ms. (113 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (148 resets) in 413 ms. (96 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (148 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
[2024-05-24 18:55:24] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1116 cols
[2024-05-24 18:55:24] [INFO ] Computed 50 invariants in 19 ms
[2024-05-24 18:55:24] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 1036/1040 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 18:55:25] [INFO ] Deduced a trap composed of 114 places in 533 ms of which 6 ms to minimize.
[2024-05-24 18:55:25] [INFO ] Deduced a trap composed of 90 places in 439 ms of which 6 ms to minimize.
[2024-05-24 18:55:25] [INFO ] Deduced a trap composed of 172 places in 413 ms of which 6 ms to minimize.
[2024-05-24 18:55:26] [INFO ] Deduced a trap composed of 191 places in 439 ms of which 7 ms to minimize.
[2024-05-24 18:55:26] [INFO ] Deduced a trap composed of 130 places in 421 ms of which 6 ms to minimize.
[2024-05-24 18:55:27] [INFO ] Deduced a trap composed of 105 places in 418 ms of which 6 ms to minimize.
[2024-05-24 18:55:27] [INFO ] Deduced a trap composed of 114 places in 397 ms of which 6 ms to minimize.
[2024-05-24 18:55:28] [INFO ] Deduced a trap composed of 109 places in 392 ms of which 8 ms to minimize.
[2024-05-24 18:55:28] [INFO ] Deduced a trap composed of 214 places in 394 ms of which 6 ms to minimize.
[2024-05-24 18:55:28] [INFO ] Deduced a trap composed of 105 places in 399 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1040 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1040 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 34/1074 variables, 3/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1074 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/1100 variables, 26/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1100 variables, 0/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 16/1116 variables, 16/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1116 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3378/3378 variables, and 1176 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 1116/1116 constraints, ReadFeed: 0/846 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1019/1021 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1021 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/1039 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1039 variables, 10/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1039 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 35/1074 variables, 3/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 18:55:30] [INFO ] Deduced a trap composed of 47 places in 450 ms of which 7 ms to minimize.
[2024-05-24 18:55:30] [INFO ] Deduced a trap composed of 92 places in 450 ms of which 6 ms to minimize.
[2024-05-24 18:55:31] [INFO ] Deduced a trap composed of 95 places in 475 ms of which 6 ms to minimize.
[2024-05-24 18:55:31] [INFO ] Deduced a trap composed of 93 places in 441 ms of which 6 ms to minimize.
[2024-05-24 18:55:31] [INFO ] Deduced a trap composed of 109 places in 444 ms of which 6 ms to minimize.
[2024-05-24 18:55:32] [INFO ] Deduced a trap composed of 100 places in 443 ms of which 6 ms to minimize.
[2024-05-24 18:55:32] [INFO ] Deduced a trap composed of 97 places in 434 ms of which 7 ms to minimize.
[2024-05-24 18:55:33] [INFO ] Deduced a trap composed of 117 places in 437 ms of which 6 ms to minimize.
[2024-05-24 18:55:33] [INFO ] Deduced a trap composed of 87 places in 460 ms of which 6 ms to minimize.
[2024-05-24 18:55:34] [INFO ] Deduced a trap composed of 94 places in 451 ms of which 6 ms to minimize.
[2024-05-24 18:55:34] [INFO ] Deduced a trap composed of 104 places in 468 ms of which 7 ms to minimize.
SMT process timed out in 10406ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1116/1116 places, 2534/2534 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1116 transition count 2533
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1115 transition count 2533
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1114 transition count 2532
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1114 transition count 2532
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1113 transition count 2524
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1113 transition count 2524
Free-agglomeration rule (complex) applied 132 times.
Iterating global reduction 0 with 132 rules applied. Total rules applied 138 place count 1113 transition count 4275
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 0 with 132 rules applied. Total rules applied 270 place count 981 transition count 4275
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 271 place count 981 transition count 4275
Applied a total of 271 rules in 384 ms. Remains 981 /1116 variables (removed 135) and now considering 4275/2534 (removed -1741) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 981/1116 places, 4275/2534 transitions.
RANDOM walk for 40000 steps (838 resets) in 971 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (107 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 67854 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 67854 steps, saw 28601 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-24 18:55:38] [INFO ] Flow matrix only has 3877 transitions (discarded 398 similar events)
// Phase 1: matrix 3877 rows 981 cols
[2024-05-24 18:55:38] [INFO ] Computed 50 invariants in 29 ms
[2024-05-24 18:55:38] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 885/887 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 18:55:39] [INFO ] Deduced a trap composed of 196 places in 517 ms of which 6 ms to minimize.
[2024-05-24 18:55:39] [INFO ] Deduced a trap composed of 153 places in 514 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 34/939 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 18:55:40] [INFO ] Deduced a trap composed of 5 places in 481 ms of which 5 ms to minimize.
[2024-05-24 18:55:40] [INFO ] Deduced a trap composed of 27 places in 473 ms of which 5 ms to minimize.
[2024-05-24 18:55:41] [INFO ] Deduced a trap composed of 62 places in 513 ms of which 5 ms to minimize.
[2024-05-24 18:55:41] [INFO ] Deduced a trap composed of 154 places in 478 ms of which 6 ms to minimize.
[2024-05-24 18:55:42] [INFO ] Deduced a trap composed of 82 places in 475 ms of which 5 ms to minimize.
[2024-05-24 18:55:42] [INFO ] Deduced a trap composed of 85 places in 473 ms of which 5 ms to minimize.
[2024-05-24 18:55:43] [INFO ] Deduced a trap composed of 85 places in 482 ms of which 6 ms to minimize.
[2024-05-24 18:55:43] [INFO ] Deduced a trap composed of 62 places in 492 ms of which 6 ms to minimize.
[2024-05-24 18:55:44] [INFO ] Deduced a trap composed of 97 places in 485 ms of which 5 ms to minimize.
[2024-05-24 18:55:44] [INFO ] Deduced a trap composed of 27 places in 469 ms of which 5 ms to minimize.
[2024-05-24 18:55:45] [INFO ] Deduced a trap composed of 57 places in 486 ms of which 5 ms to minimize.
[2024-05-24 18:55:45] [INFO ] Deduced a trap composed of 62 places in 487 ms of which 6 ms to minimize.
[2024-05-24 18:55:46] [INFO ] Deduced a trap composed of 104 places in 484 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/939 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 26/965 variables, 26/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/965 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/981 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/981 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3877/4858 variables, 981/1046 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4858 variables, 2722/3768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4858 variables, 0/3768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4858 variables, 0/3768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4858/4858 variables, and 3768 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10134 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 981/981 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 885/887 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/905 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 18:55:49] [INFO ] Deduced a trap composed of 99 places in 523 ms of which 5 ms to minimize.
[2024-05-24 18:55:49] [INFO ] Deduced a trap composed of 83 places in 529 ms of which 5 ms to minimize.
[2024-05-24 18:55:50] [INFO ] Deduced a trap composed of 136 places in 535 ms of which 5 ms to minimize.
[2024-05-24 18:55:50] [INFO ] Deduced a trap composed of 83 places in 520 ms of which 5 ms to minimize.
[2024-05-24 18:55:51] [INFO ] Deduced a trap composed of 153 places in 520 ms of which 6 ms to minimize.
[2024-05-24 18:55:52] [INFO ] Deduced a trap composed of 179 places in 526 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/905 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/939 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/939 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 18:55:52] [INFO ] Deduced a trap composed of 88 places in 573 ms of which 5 ms to minimize.
[2024-05-24 18:55:53] [INFO ] Deduced a trap composed of 80 places in 580 ms of which 6 ms to minimize.
[2024-05-24 18:55:53] [INFO ] Deduced a trap composed of 66 places in 575 ms of which 5 ms to minimize.
[2024-05-24 18:55:54] [INFO ] Deduced a trap composed of 70 places in 573 ms of which 6 ms to minimize.
[2024-05-24 18:55:55] [INFO ] Deduced a trap composed of 171 places in 611 ms of which 6 ms to minimize.
[2024-05-24 18:55:55] [INFO ] Deduced a trap composed of 72 places in 564 ms of which 6 ms to minimize.
[2024-05-24 18:55:56] [INFO ] Deduced a trap composed of 46 places in 576 ms of which 6 ms to minimize.
[2024-05-24 18:55:56] [INFO ] Deduced a trap composed of 74 places in 569 ms of which 6 ms to minimize.
[2024-05-24 18:55:57] [INFO ] Deduced a trap composed of 76 places in 564 ms of which 5 ms to minimize.
[2024-05-24 18:55:58] [INFO ] Deduced a trap composed of 72 places in 560 ms of which 5 ms to minimize.
[2024-05-24 18:55:58] [INFO ] Deduced a trap composed of 73 places in 577 ms of which 5 ms to minimize.
[2024-05-24 18:55:59] [INFO ] Deduced a trap composed of 72 places in 574 ms of which 5 ms to minimize.
[2024-05-24 18:55:59] [INFO ] Deduced a trap composed of 73 places in 562 ms of which 6 ms to minimize.
[2024-05-24 18:56:00] [INFO ] Deduced a trap composed of 89 places in 570 ms of which 5 ms to minimize.
[2024-05-24 18:56:00] [INFO ] Deduced a trap composed of 63 places in 566 ms of which 5 ms to minimize.
[2024-05-24 18:56:01] [INFO ] Deduced a trap composed of 62 places in 493 ms of which 6 ms to minimize.
[2024-05-24 18:56:02] [INFO ] Deduced a trap composed of 71 places in 569 ms of which 6 ms to minimize.
[2024-05-24 18:56:02] [INFO ] Deduced a trap composed of 66 places in 561 ms of which 6 ms to minimize.
[2024-05-24 18:56:03] [INFO ] Deduced a trap composed of 71 places in 570 ms of which 5 ms to minimize.
[2024-05-24 18:56:03] [INFO ] Deduced a trap composed of 77 places in 566 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 18:56:04] [INFO ] Deduced a trap composed of 75 places in 564 ms of which 6 ms to minimize.
[2024-05-24 18:56:05] [INFO ] Deduced a trap composed of 104 places in 571 ms of which 6 ms to minimize.
[2024-05-24 18:56:05] [INFO ] Deduced a trap composed of 66 places in 564 ms of which 6 ms to minimize.
[2024-05-24 18:56:06] [INFO ] Deduced a trap composed of 75 places in 573 ms of which 6 ms to minimize.
[2024-05-24 18:56:06] [INFO ] Deduced a trap composed of 104 places in 579 ms of which 6 ms to minimize.
[2024-05-24 18:56:07] [INFO ] Deduced a trap composed of 68 places in 568 ms of which 5 ms to minimize.
[2024-05-24 18:56:07] [INFO ] Deduced a trap composed of 82 places in 567 ms of which 5 ms to minimize.
[2024-05-24 18:56:08] [INFO ] Deduced a trap composed of 82 places in 576 ms of which 5 ms to minimize.
[2024-05-24 18:56:09] [INFO ] Deduced a trap composed of 163 places in 587 ms of which 6 ms to minimize.
[2024-05-24 18:56:09] [INFO ] Deduced a trap composed of 92 places in 583 ms of which 5 ms to minimize.
[2024-05-24 18:56:10] [INFO ] Deduced a trap composed of 87 places in 566 ms of which 5 ms to minimize.
[2024-05-24 18:56:10] [INFO ] Deduced a trap composed of 72 places in 576 ms of which 5 ms to minimize.
[2024-05-24 18:56:11] [INFO ] Deduced a trap composed of 71 places in 559 ms of which 5 ms to minimize.
[2024-05-24 18:56:12] [INFO ] Deduced a trap composed of 77 places in 564 ms of which 5 ms to minimize.
[2024-05-24 18:56:12] [INFO ] Deduced a trap composed of 84 places in 572 ms of which 5 ms to minimize.
[2024-05-24 18:56:13] [INFO ] Deduced a trap composed of 86 places in 571 ms of which 5 ms to minimize.
[2024-05-24 18:56:13] [INFO ] Deduced a trap composed of 85 places in 562 ms of which 5 ms to minimize.
[2024-05-24 18:56:14] [INFO ] Deduced a trap composed of 84 places in 571 ms of which 5 ms to minimize.
[2024-05-24 18:56:15] [INFO ] Deduced a trap composed of 66 places in 572 ms of which 5 ms to minimize.
[2024-05-24 18:56:15] [INFO ] Deduced a trap composed of 64 places in 615 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/939 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 18:56:16] [INFO ] Deduced a trap composed of 80 places in 566 ms of which 6 ms to minimize.
[2024-05-24 18:56:16] [INFO ] Deduced a trap composed of 70 places in 571 ms of which 5 ms to minimize.
[2024-05-24 18:56:17] [INFO ] Deduced a trap composed of 66 places in 583 ms of which 6 ms to minimize.
[2024-05-24 18:56:18] [INFO ] Deduced a trap composed of 66 places in 572 ms of which 5 ms to minimize.
[2024-05-24 18:56:18] [INFO ] Deduced a trap composed of 78 places in 544 ms of which 5 ms to minimize.
[2024-05-24 18:56:19] [INFO ] Deduced a trap composed of 66 places in 557 ms of which 6 ms to minimize.
[2024-05-24 18:56:19] [INFO ] Deduced a trap composed of 115 places in 561 ms of which 5 ms to minimize.
[2024-05-24 18:56:20] [INFO ] Deduced a trap composed of 76 places in 548 ms of which 6 ms to minimize.
[2024-05-24 18:56:20] [INFO ] Deduced a trap composed of 106 places in 559 ms of which 5 ms to minimize.
[2024-05-24 18:56:21] [INFO ] Deduced a trap composed of 101 places in 562 ms of which 6 ms to minimize.
[2024-05-24 18:56:22] [INFO ] Deduced a trap composed of 71 places in 591 ms of which 5 ms to minimize.
[2024-05-24 18:56:22] [INFO ] Deduced a trap composed of 77 places in 566 ms of which 5 ms to minimize.
[2024-05-24 18:56:23] [INFO ] Deduced a trap composed of 231 places in 556 ms of which 6 ms to minimize.
[2024-05-24 18:56:23] [INFO ] Deduced a trap composed of 95 places in 552 ms of which 6 ms to minimize.
[2024-05-24 18:56:24] [INFO ] Deduced a trap composed of 78 places in 559 ms of which 6 ms to minimize.
[2024-05-24 18:56:25] [INFO ] Deduced a trap composed of 88 places in 577 ms of which 5 ms to minimize.
[2024-05-24 18:56:25] [INFO ] Deduced a trap composed of 105 places in 564 ms of which 6 ms to minimize.
[2024-05-24 18:56:26] [INFO ] Deduced a trap composed of 99 places in 566 ms of which 6 ms to minimize.
[2024-05-24 18:56:26] [INFO ] Deduced a trap composed of 233 places in 562 ms of which 5 ms to minimize.
[2024-05-24 18:56:27] [INFO ] Deduced a trap composed of 215 places in 554 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/939 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 18:56:27] [INFO ] Deduced a trap composed of 88 places in 565 ms of which 5 ms to minimize.
[2024-05-24 18:56:28] [INFO ] Deduced a trap composed of 226 places in 591 ms of which 6 ms to minimize.
[2024-05-24 18:56:29] [INFO ] Deduced a trap composed of 99 places in 563 ms of which 6 ms to minimize.
[2024-05-24 18:56:29] [INFO ] Deduced a trap composed of 114 places in 560 ms of which 5 ms to minimize.
[2024-05-24 18:56:30] [INFO ] Deduced a trap composed of 81 places in 569 ms of which 6 ms to minimize.
[2024-05-24 18:56:30] [INFO ] Deduced a trap composed of 95 places in 557 ms of which 5 ms to minimize.
[2024-05-24 18:56:31] [INFO ] Deduced a trap composed of 81 places in 579 ms of which 6 ms to minimize.
[2024-05-24 18:56:32] [INFO ] Deduced a trap composed of 92 places in 599 ms of which 6 ms to minimize.
[2024-05-24 18:56:32] [INFO ] Deduced a trap composed of 70 places in 568 ms of which 5 ms to minimize.
[2024-05-24 18:56:33] [INFO ] Deduced a trap composed of 81 places in 607 ms of which 6 ms to minimize.
[2024-05-24 18:56:34] [INFO ] Deduced a trap composed of 79 places in 588 ms of which 6 ms to minimize.
SMT process timed out in 55550ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 981 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 981/981 places, 4275/4275 transitions.
Applied a total of 0 rules in 107 ms. Remains 981 /981 variables (removed 0) and now considering 4275/4275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 981/981 places, 4275/4275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 981/981 places, 4275/4275 transitions.
Applied a total of 0 rules in 151 ms. Remains 981 /981 variables (removed 0) and now considering 4275/4275 (removed 0) transitions.
[2024-05-24 18:56:34] [INFO ] Flow matrix only has 3877 transitions (discarded 398 similar events)
[2024-05-24 18:56:34] [INFO ] Invariant cache hit.
[2024-05-24 18:56:35] [INFO ] Implicit Places using invariants in 1173 ms returned [694]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1177 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 980/981 places, 4275/4275 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 979 transition count 4274
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 979 transition count 4274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 978 transition count 4273
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 978 transition count 4273
Applied a total of 4 rules in 159 ms. Remains 978 /980 variables (removed 2) and now considering 4273/4275 (removed 2) transitions.
[2024-05-24 18:56:35] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2024-05-24 18:56:35] [INFO ] Computed 49 invariants in 26 ms
[2024-05-24 18:56:36] [INFO ] Implicit Places using invariants in 1228 ms returned []
[2024-05-24 18:56:36] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 18:56:36] [INFO ] Invariant cache hit.
[2024-05-24 18:56:37] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 18:57:08] [INFO ] Performed 763/978 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 18:57:16] [INFO ] Implicit Places using invariants and state equation in 39505 ms returned []
Implicit Place search using SMT with State Equation took 40733 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 978/981 places, 4273/4275 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 42220 ms. Remains : 978/981 places, 4273/4275 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 18 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-08 finished in 116411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||X(p2))))'
Support contains 5 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1279 transition count 2898
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1279 transition count 2898
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 1262 transition count 2818
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 1262 transition count 2818
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 1254 transition count 2754
Iterating global reduction 0 with 8 rules applied. Total rules applied 98 place count 1254 transition count 2754
Applied a total of 98 rules in 151 ms. Remains 1254 /1303 variables (removed 49) and now considering 2754/2971 (removed 217) transitions.
[2024-05-24 18:57:16] [INFO ] Flow matrix only has 2482 transitions (discarded 272 similar events)
// Phase 1: matrix 2482 rows 1254 cols
[2024-05-24 18:57:16] [INFO ] Computed 66 invariants in 35 ms
[2024-05-24 18:57:17] [INFO ] Implicit Places using invariants in 1114 ms returned [12, 106, 392, 506, 537, 549, 559, 586, 611, 715, 768, 803, 840, 885, 886, 990, 1043]
[2024-05-24 18:57:17] [INFO ] Actually due to overlaps returned [537, 12, 106, 392, 506, 559, 586, 611, 715, 768, 803, 840, 885, 886, 990, 1043]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1120 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1238/1303 places, 2754/2971 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1223 transition count 2739
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1223 transition count 2739
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1208 transition count 2724
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1208 transition count 2724
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 75 place count 1193 transition count 2709
Iterating global reduction 0 with 15 rules applied. Total rules applied 90 place count 1193 transition count 2709
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 104 place count 1179 transition count 2597
Iterating global reduction 0 with 14 rules applied. Total rules applied 118 place count 1179 transition count 2597
Applied a total of 118 rules in 178 ms. Remains 1179 /1238 variables (removed 59) and now considering 2597/2754 (removed 157) transitions.
[2024-05-24 18:57:17] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
// Phase 1: matrix 2325 rows 1179 cols
[2024-05-24 18:57:17] [INFO ] Computed 50 invariants in 25 ms
[2024-05-24 18:57:18] [INFO ] Implicit Places using invariants in 1013 ms returned [532]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1014 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1178/1303 places, 2597/2971 transitions.
Applied a total of 0 rules in 34 ms. Remains 1178 /1178 variables (removed 0) and now considering 2597/2597 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2500 ms. Remains : 1178/1303 places, 2597/2971 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-09 finished in 2642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((p1||G(F(p2))))||p0))))'
Support contains 8 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1278 transition count 2890
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1278 transition count 2890
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 67 place count 1261 transition count 2817
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 1261 transition count 2817
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 93 place count 1252 transition count 2745
Iterating global reduction 0 with 9 rules applied. Total rules applied 102 place count 1252 transition count 2745
Applied a total of 102 rules in 147 ms. Remains 1252 /1303 variables (removed 51) and now considering 2745/2971 (removed 226) transitions.
[2024-05-24 18:57:19] [INFO ] Flow matrix only has 2473 transitions (discarded 272 similar events)
// Phase 1: matrix 2473 rows 1252 cols
[2024-05-24 18:57:19] [INFO ] Computed 66 invariants in 28 ms
[2024-05-24 18:57:20] [INFO ] Implicit Places using invariants in 1113 ms returned [12, 106, 392, 506, 537, 549, 559, 586, 611, 715, 766, 800, 884, 885, 989, 1042]
[2024-05-24 18:57:20] [INFO ] Actually due to overlaps returned [537, 12, 106, 392, 506, 559, 586, 611, 715, 766, 800, 884, 885, 989, 1042]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1115 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1237/1303 places, 2745/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1223 transition count 2731
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1223 transition count 2731
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1209 transition count 2717
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1209 transition count 2717
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1195 transition count 2703
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1195 transition count 2703
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 1182 transition count 2599
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 1182 transition count 2599
Applied a total of 110 rules in 180 ms. Remains 1182 /1237 variables (removed 55) and now considering 2599/2745 (removed 146) transitions.
[2024-05-24 18:57:20] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1182 cols
[2024-05-24 18:57:20] [INFO ] Computed 51 invariants in 28 ms
[2024-05-24 18:57:21] [INFO ] Implicit Places using invariants in 993 ms returned [532]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 996 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1181/1303 places, 2599/2971 transitions.
Applied a total of 0 rules in 34 ms. Remains 1181 /1181 variables (removed 0) and now considering 2599/2599 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2472 ms. Remains : 1181/1303 places, 2599/2971 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10
Product exploration explored 100000 steps with 1203 reset in 442 ms.
Product exploration explored 100000 steps with 1204 reset in 421 ms.
Computed a total of 349 stabilizing places and 966 stable transitions
Computed a total of 349 stabilizing places and 966 stable transitions
Detected a total of 349/1181 stabilizing places and 966/2599 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 140 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (480 resets) in 363 ms. (109 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (136 resets) in 135 ms. (294 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40001 steps (136 resets) in 363 ms. (109 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (136 resets) in 324 ms. (123 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (136 resets) in 404 ms. (98 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (136 resets) in 412 ms. (96 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (136 resets) in 257 ms. (155 steps per ms) remains 3/5 properties
[2024-05-24 18:57:23] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1181 cols
[2024-05-24 18:57:23] [INFO ] Computed 50 invariants in 17 ms
[2024-05-24 18:57:23] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1098/1106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/1108 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 33/1141 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1141 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 24/1165 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1165 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 16/1181 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1181 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2327/3508 variables, 1181/1231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3508 variables, 846/2077 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3508 variables, 0/2077 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/3508 variables, 0/2077 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3508/3508 variables, and 2077 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1363 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 1181/1181 constraints, ReadFeed: 846/846 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1098/1106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 18:57:25] [INFO ] Deduced a trap composed of 232 places in 506 ms of which 7 ms to minimize.
[2024-05-24 18:57:26] [INFO ] Deduced a trap composed of 174 places in 488 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1106 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1106 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/1108 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1108 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 33/1141 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 18:57:26] [INFO ] Deduced a trap composed of 51 places in 503 ms of which 7 ms to minimize.
[2024-05-24 18:57:27] [INFO ] Deduced a trap composed of 104 places in 151 ms of which 3 ms to minimize.
[2024-05-24 18:57:27] [INFO ] Deduced a trap composed of 191 places in 150 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1141 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1141 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 24/1165 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 18:57:28] [INFO ] Deduced a trap composed of 272 places in 507 ms of which 7 ms to minimize.
[2024-05-24 18:57:28] [INFO ] Deduced a trap composed of 116 places in 525 ms of which 7 ms to minimize.
[2024-05-24 18:57:29] [INFO ] Deduced a trap composed of 150 places in 524 ms of which 7 ms to minimize.
[2024-05-24 18:57:29] [INFO ] Deduced a trap composed of 152 places in 526 ms of which 7 ms to minimize.
[2024-05-24 18:57:30] [INFO ] Deduced a trap composed of 131 places in 502 ms of which 6 ms to minimize.
SMT process timed out in 6562ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 1181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1181/1181 places, 2599/2599 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1181 transition count 2568
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1150 transition count 2568
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 62 place count 1150 transition count 2552
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 94 place count 1134 transition count 2552
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 126 place count 1118 transition count 2536
Free-agglomeration rule (complex) applied 119 times.
Iterating global reduction 2 with 119 rules applied. Total rules applied 245 place count 1118 transition count 4293
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 2 with 119 rules applied. Total rules applied 364 place count 999 transition count 4293
Applied a total of 364 rules in 273 ms. Remains 999 /1181 variables (removed 182) and now considering 4293/2599 (removed -1694) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 999/1181 places, 4293/2599 transitions.
RANDOM walk for 40000 steps (841 resets) in 1709 ms. (23 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (132 resets) in 346 ms. (115 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (132 resets) in 296 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (132 resets) in 276 ms. (144 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 58314 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 3
Probabilistic random walk after 58314 steps, saw 24614 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-24 18:57:34] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
// Phase 1: matrix 3909 rows 999 cols
[2024-05-24 18:57:34] [INFO ] Computed 50 invariants in 43 ms
[2024-05-24 18:57:34] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 916/924 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/924 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/926 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/926 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 33/959 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/959 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 24/983 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/983 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 16/999 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/999 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3909/4908 variables, 999/1049 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4908 variables, 2722/3771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4908 variables, 0/3771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/4908 variables, 0/3771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4908/4908 variables, and 3771 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1794 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 999/999 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 916/924 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 18:57:36] [INFO ] Deduced a trap composed of 100 places in 568 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/924 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/924 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/926 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/926 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 33/959 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 18:57:37] [INFO ] Deduced a trap composed of 5 places in 620 ms of which 6 ms to minimize.
[2024-05-24 18:57:38] [INFO ] Deduced a trap composed of 73 places in 598 ms of which 5 ms to minimize.
[2024-05-24 18:57:38] [INFO ] Deduced a trap composed of 83 places in 595 ms of which 5 ms to minimize.
[2024-05-24 18:57:39] [INFO ] Deduced a trap composed of 73 places in 599 ms of which 6 ms to minimize.
[2024-05-24 18:57:40] [INFO ] Deduced a trap composed of 74 places in 620 ms of which 6 ms to minimize.
[2024-05-24 18:57:40] [INFO ] Deduced a trap composed of 94 places in 621 ms of which 6 ms to minimize.
[2024-05-24 18:57:41] [INFO ] Deduced a trap composed of 125 places in 161 ms of which 3 ms to minimize.
[2024-05-24 18:57:41] [INFO ] Deduced a trap composed of 115 places in 123 ms of which 2 ms to minimize.
[2024-05-24 18:57:41] [INFO ] Deduced a trap composed of 96 places in 612 ms of which 6 ms to minimize.
[2024-05-24 18:57:42] [INFO ] Deduced a trap composed of 75 places in 608 ms of which 6 ms to minimize.
[2024-05-24 18:57:43] [INFO ] Deduced a trap composed of 93 places in 606 ms of which 6 ms to minimize.
[2024-05-24 18:57:43] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 3 ms to minimize.
[2024-05-24 18:57:43] [INFO ] Deduced a trap composed of 108 places in 158 ms of which 3 ms to minimize.
[2024-05-24 18:57:44] [INFO ] Deduced a trap composed of 86 places in 598 ms of which 5 ms to minimize.
[2024-05-24 18:57:44] [INFO ] Deduced a trap composed of 106 places in 598 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/959 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/959 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 24/983 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 18:57:45] [INFO ] Deduced a trap composed of 56 places in 636 ms of which 6 ms to minimize.
[2024-05-24 18:57:46] [INFO ] Deduced a trap composed of 69 places in 609 ms of which 6 ms to minimize.
[2024-05-24 18:57:46] [INFO ] Deduced a trap composed of 79 places in 620 ms of which 6 ms to minimize.
[2024-05-24 18:57:47] [INFO ] Deduced a trap composed of 78 places in 595 ms of which 6 ms to minimize.
[2024-05-24 18:57:47] [INFO ] Deduced a trap composed of 77 places in 589 ms of which 6 ms to minimize.
[2024-05-24 18:57:48] [INFO ] Deduced a trap composed of 70 places in 609 ms of which 6 ms to minimize.
[2024-05-24 18:57:49] [INFO ] Deduced a trap composed of 84 places in 652 ms of which 6 ms to minimize.
[2024-05-24 18:57:49] [INFO ] Deduced a trap composed of 80 places in 634 ms of which 6 ms to minimize.
[2024-05-24 18:57:50] [INFO ] Deduced a trap composed of 179 places in 639 ms of which 6 ms to minimize.
[2024-05-24 18:57:51] [INFO ] Deduced a trap composed of 180 places in 682 ms of which 6 ms to minimize.
[2024-05-24 18:57:51] [INFO ] Deduced a trap composed of 77 places in 618 ms of which 6 ms to minimize.
[2024-05-24 18:57:52] [INFO ] Deduced a trap composed of 70 places in 638 ms of which 6 ms to minimize.
[2024-05-24 18:57:53] [INFO ] Deduced a trap composed of 84 places in 640 ms of which 6 ms to minimize.
[2024-05-24 18:57:53] [INFO ] Deduced a trap composed of 84 places in 636 ms of which 6 ms to minimize.
[2024-05-24 18:57:54] [INFO ] Deduced a trap composed of 182 places in 620 ms of which 6 ms to minimize.
[2024-05-24 18:57:55] [INFO ] Deduced a trap composed of 66 places in 632 ms of which 8 ms to minimize.
[2024-05-24 18:57:55] [INFO ] Deduced a trap composed of 71 places in 604 ms of which 5 ms to minimize.
[2024-05-24 18:57:56] [INFO ] Deduced a trap composed of 61 places in 602 ms of which 5 ms to minimize.
[2024-05-24 18:57:57] [INFO ] Deduced a trap composed of 64 places in 609 ms of which 5 ms to minimize.
[2024-05-24 18:57:57] [INFO ] Deduced a trap composed of 56 places in 596 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/983 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 18:57:58] [INFO ] Deduced a trap composed of 70 places in 593 ms of which 6 ms to minimize.
[2024-05-24 18:57:58] [INFO ] Deduced a trap composed of 69 places in 602 ms of which 6 ms to minimize.
[2024-05-24 18:57:59] [INFO ] Deduced a trap composed of 90 places in 592 ms of which 6 ms to minimize.
[2024-05-24 18:58:00] [INFO ] Deduced a trap composed of 68 places in 593 ms of which 6 ms to minimize.
[2024-05-24 18:58:00] [INFO ] Deduced a trap composed of 97 places in 584 ms of which 6 ms to minimize.
[2024-05-24 18:58:01] [INFO ] Deduced a trap composed of 78 places in 581 ms of which 6 ms to minimize.
[2024-05-24 18:58:01] [INFO ] Deduced a trap composed of 62 places in 598 ms of which 6 ms to minimize.
[2024-05-24 18:58:02] [INFO ] Deduced a trap composed of 95 places in 628 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/983 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 16/999 variables, 16/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/999 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 3909/4908 variables, 999/1093 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4908 variables, 2722/3815 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4908 variables, 3/3818 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4908 variables, 0/3818 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/4908 variables, 0/3818 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4908/4908 variables, and 3818 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31607 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 999/999 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 44/44 constraints]
After SMT, in 33487ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 239 ms.
Support contains 8 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 4293/4293 transitions.
Applied a total of 0 rules in 107 ms. Remains 999 /999 variables (removed 0) and now considering 4293/4293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 999/999 places, 4293/4293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 4293/4293 transitions.
Applied a total of 0 rules in 117 ms. Remains 999 /999 variables (removed 0) and now considering 4293/4293 (removed 0) transitions.
[2024-05-24 18:58:08] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-24 18:58:08] [INFO ] Invariant cache hit.
[2024-05-24 18:58:09] [INFO ] Implicit Places using invariants in 1248 ms returned []
[2024-05-24 18:58:09] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-24 18:58:09] [INFO ] Invariant cache hit.
[2024-05-24 18:58:10] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 18:58:40] [INFO ] Performed 839/999 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 18:58:53] [INFO ] Implicit Places using invariants and state equation in 43719 ms returned []
Implicit Place search using SMT with State Equation took 44969 ms to find 0 implicit places.
[2024-05-24 18:58:53] [INFO ] Redundant transitions in 334 ms returned []
Running 4231 sub problems to find dead transitions.
[2024-05-24 18:58:53] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-24 18:58:53] [INFO ] Invariant cache hit.
[2024-05-24 18:58:53] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4231 unsolved
SMT process timed out in 59797ms, After SMT, problems are : Problem set: 0 solved, 4231 unsolved
Search for dead transitions found 0 dead transitions in 59836ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105273 ms. Remains : 999/999 places, 4293/4293 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 15 factoid took 341 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 1181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1181/1181 places, 2599/2599 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1181 transition count 2568
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1150 transition count 2568
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 62 place count 1150 transition count 2552
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 94 place count 1134 transition count 2552
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 126 place count 1118 transition count 2536
Applied a total of 126 rules in 128 ms. Remains 1118 /1181 variables (removed 63) and now considering 2536/2599 (removed 63) transitions.
[2024-05-24 18:59:54] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
// Phase 1: matrix 2264 rows 1118 cols
[2024-05-24 18:59:54] [INFO ] Computed 50 invariants in 20 ms
[2024-05-24 18:59:55] [INFO ] Implicit Places using invariants in 958 ms returned []
[2024-05-24 18:59:55] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
[2024-05-24 18:59:55] [INFO ] Invariant cache hit.
[2024-05-24 18:59:55] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-24 19:00:06] [INFO ] Implicit Places using invariants and state equation in 11260 ms returned [1115]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12223 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1117/1181 places, 2536/2599 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1117 transition count 2535
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1116 transition count 2535
Applied a total of 2 rules in 77 ms. Remains 1116 /1117 variables (removed 1) and now considering 2535/2536 (removed 1) transitions.
[2024-05-24 19:00:06] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1116 cols
[2024-05-24 19:00:06] [INFO ] Computed 49 invariants in 27 ms
[2024-05-24 19:00:07] [INFO ] Implicit Places using invariants in 939 ms returned []
[2024-05-24 19:00:07] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 19:00:07] [INFO ] Invariant cache hit.
[2024-05-24 19:00:08] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-24 19:00:17] [INFO ] Implicit Places using invariants and state equation in 10536 ms returned []
Implicit Place search using SMT with State Equation took 11476 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1116/1181 places, 2535/2599 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23904 ms. Remains : 1116/1181 places, 2535/2599 transitions.
Computed a total of 299 stabilizing places and 917 stable transitions
Computed a total of 299 stabilizing places and 917 stable transitions
Detected a total of 299/1116 stabilizing places and 917/2535 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND p0 (NOT p1))), (X (AND (NOT p2) p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 161 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (685 resets) in 773 ms. (51 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (148 resets) in 164 ms. (242 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (148 resets) in 252 ms. (158 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (148 resets) in 218 ms. (182 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (148 resets) in 246 ms. (161 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (148 resets) in 254 ms. (156 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (148 resets) in 202 ms. (197 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (148 resets) in 238 ms. (167 steps per ms) remains 4/8 properties
[2024-05-24 19:00:19] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 19:00:19] [INFO ] Invariant cache hit.
[2024-05-24 19:00:19] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1034/1042 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1042 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/1044 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1044 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 33/1077 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/1101 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1101 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 15/1116 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1116 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2263/3379 variables, 1116/1165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3379 variables, 846/2011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3379 variables, 0/2011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/3379 variables, 0/2011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3379/3379 variables, and 2011 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1774 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1116/1116 constraints, ReadFeed: 846/846 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1034/1042 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:00:21] [INFO ] Deduced a trap composed of 147 places in 431 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1042 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1042 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/1044 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1044 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 33/1077 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:00:22] [INFO ] Deduced a trap composed of 47 places in 463 ms of which 7 ms to minimize.
[2024-05-24 19:00:22] [INFO ] Deduced a trap composed of 106 places in 449 ms of which 7 ms to minimize.
[2024-05-24 19:00:23] [INFO ] Deduced a trap composed of 190 places in 410 ms of which 6 ms to minimize.
[2024-05-24 19:00:23] [INFO ] Deduced a trap composed of 93 places in 396 ms of which 6 ms to minimize.
[2024-05-24 19:00:24] [INFO ] Deduced a trap composed of 194 places in 391 ms of which 6 ms to minimize.
[2024-05-24 19:00:24] [INFO ] Deduced a trap composed of 195 places in 382 ms of which 6 ms to minimize.
[2024-05-24 19:00:24] [INFO ] Deduced a trap composed of 166 places in 392 ms of which 6 ms to minimize.
[2024-05-24 19:00:25] [INFO ] Deduced a trap composed of 174 places in 392 ms of which 6 ms to minimize.
[2024-05-24 19:00:25] [INFO ] Deduced a trap composed of 174 places in 382 ms of which 6 ms to minimize.
[2024-05-24 19:00:26] [INFO ] Deduced a trap composed of 170 places in 421 ms of which 6 ms to minimize.
SMT process timed out in 6916ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 1116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1116/1116 places, 2535/2535 transitions.
Free-agglomeration rule (complex) applied 119 times.
Iterating global reduction 0 with 119 rules applied. Total rules applied 119 place count 1116 transition count 4292
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 238 place count 997 transition count 4292
Applied a total of 238 rules in 198 ms. Remains 997 /1116 variables (removed 119) and now considering 4292/2535 (removed -1757) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 997/1116 places, 4292/2535 transitions.
RANDOM walk for 40000 steps (840 resets) in 1418 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (118 resets) in 262 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (132 resets) in 294 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (132 resets) in 253 ms. (157 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (132 resets) in 263 ms. (151 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 55457 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 4
Probabilistic random walk after 55457 steps, saw 23418 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-24 19:00:30] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
// Phase 1: matrix 3908 rows 997 cols
[2024-05-24 19:00:30] [INFO ] Computed 49 invariants in 88 ms
[2024-05-24 19:00:30] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 915/923 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/923 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/925 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/925 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 33/958 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/958 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/982 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/982 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 15/997 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/997 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3908/4905 variables, 997/1046 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4905 variables, 2722/3768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4905 variables, 0/3768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/4905 variables, 0/3768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4905/4905 variables, and 3768 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2314 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 997/997 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 915/923 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:00:33] [INFO ] Deduced a trap composed of 104 places in 552 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/923 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/923 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/925 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/925 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 33/958 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:00:34] [INFO ] Deduced a trap composed of 5 places in 600 ms of which 6 ms to minimize.
[2024-05-24 19:00:34] [INFO ] Deduced a trap composed of 73 places in 582 ms of which 6 ms to minimize.
[2024-05-24 19:00:35] [INFO ] Deduced a trap composed of 69 places in 595 ms of which 6 ms to minimize.
[2024-05-24 19:00:35] [INFO ] Deduced a trap composed of 80 places in 573 ms of which 5 ms to minimize.
[2024-05-24 19:00:36] [INFO ] Deduced a trap composed of 88 places in 561 ms of which 5 ms to minimize.
[2024-05-24 19:00:37] [INFO ] Deduced a trap composed of 65 places in 597 ms of which 6 ms to minimize.
[2024-05-24 19:00:37] [INFO ] Deduced a trap composed of 72 places in 587 ms of which 6 ms to minimize.
[2024-05-24 19:00:38] [INFO ] Deduced a trap composed of 71 places in 588 ms of which 6 ms to minimize.
[2024-05-24 19:00:38] [INFO ] Deduced a trap composed of 85 places in 580 ms of which 6 ms to minimize.
[2024-05-24 19:00:39] [INFO ] Deduced a trap composed of 80 places in 579 ms of which 6 ms to minimize.
[2024-05-24 19:00:40] [INFO ] Deduced a trap composed of 84 places in 576 ms of which 6 ms to minimize.
[2024-05-24 19:00:40] [INFO ] Deduced a trap composed of 86 places in 577 ms of which 6 ms to minimize.
[2024-05-24 19:00:41] [INFO ] Deduced a trap composed of 79 places in 591 ms of which 5 ms to minimize.
[2024-05-24 19:00:41] [INFO ] Deduced a trap composed of 155 places in 451 ms of which 6 ms to minimize.
[2024-05-24 19:00:42] [INFO ] Deduced a trap composed of 170 places in 457 ms of which 5 ms to minimize.
[2024-05-24 19:00:42] [INFO ] Deduced a trap composed of 57 places in 583 ms of which 6 ms to minimize.
[2024-05-24 19:00:43] [INFO ] Deduced a trap composed of 82 places in 578 ms of which 5 ms to minimize.
[2024-05-24 19:00:44] [INFO ] Deduced a trap composed of 81 places in 579 ms of which 6 ms to minimize.
[2024-05-24 19:00:44] [INFO ] Deduced a trap composed of 102 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:00:45] [INFO ] Deduced a trap composed of 67 places in 576 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/958 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:00:45] [INFO ] Deduced a trap composed of 67 places in 572 ms of which 5 ms to minimize.
[2024-05-24 19:00:46] [INFO ] Deduced a trap composed of 70 places in 579 ms of which 6 ms to minimize.
[2024-05-24 19:00:46] [INFO ] Deduced a trap composed of 77 places in 576 ms of which 5 ms to minimize.
[2024-05-24 19:00:47] [INFO ] Deduced a trap composed of 66 places in 571 ms of which 9 ms to minimize.
[2024-05-24 19:00:48] [INFO ] Deduced a trap composed of 58 places in 571 ms of which 6 ms to minimize.
[2024-05-24 19:00:48] [INFO ] Deduced a trap composed of 69 places in 573 ms of which 6 ms to minimize.
[2024-05-24 19:00:49] [INFO ] Deduced a trap composed of 58 places in 617 ms of which 6 ms to minimize.
[2024-05-24 19:00:50] [INFO ] Deduced a trap composed of 58 places in 609 ms of which 6 ms to minimize.
[2024-05-24 19:00:50] [INFO ] Deduced a trap composed of 79 places in 629 ms of which 6 ms to minimize.
[2024-05-24 19:00:51] [INFO ] Deduced a trap composed of 115 places in 592 ms of which 6 ms to minimize.
[2024-05-24 19:00:51] [INFO ] Deduced a trap composed of 88 places in 562 ms of which 6 ms to minimize.
[2024-05-24 19:00:52] [INFO ] Deduced a trap composed of 57 places in 562 ms of which 5 ms to minimize.
[2024-05-24 19:00:53] [INFO ] Deduced a trap composed of 96 places in 559 ms of which 5 ms to minimize.
[2024-05-24 19:00:53] [INFO ] Deduced a trap composed of 68 places in 598 ms of which 5 ms to minimize.
[2024-05-24 19:00:54] [INFO ] Deduced a trap composed of 96 places in 560 ms of which 6 ms to minimize.
[2024-05-24 19:00:54] [INFO ] Deduced a trap composed of 98 places in 566 ms of which 5 ms to minimize.
[2024-05-24 19:00:55] [INFO ] Deduced a trap composed of 85 places in 562 ms of which 6 ms to minimize.
[2024-05-24 19:00:55] [INFO ] Deduced a trap composed of 73 places in 561 ms of which 6 ms to minimize.
[2024-05-24 19:00:56] [INFO ] Deduced a trap composed of 87 places in 576 ms of which 5 ms to minimize.
[2024-05-24 19:00:57] [INFO ] Deduced a trap composed of 80 places in 548 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/958 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:00:57] [INFO ] Deduced a trap composed of 72 places in 598 ms of which 6 ms to minimize.
[2024-05-24 19:00:58] [INFO ] Deduced a trap composed of 57 places in 614 ms of which 6 ms to minimize.
[2024-05-24 19:00:58] [INFO ] Deduced a trap composed of 54 places in 569 ms of which 5 ms to minimize.
[2024-05-24 19:00:59] [INFO ] Deduced a trap composed of 71 places in 552 ms of which 6 ms to minimize.
[2024-05-24 19:01:00] [INFO ] Deduced a trap composed of 256 places in 567 ms of which 6 ms to minimize.
[2024-05-24 19:01:00] [INFO ] Deduced a trap composed of 261 places in 571 ms of which 5 ms to minimize.
[2024-05-24 19:01:01] [INFO ] Deduced a trap composed of 108 places in 559 ms of which 5 ms to minimize.
[2024-05-24 19:01:01] [INFO ] Deduced a trap composed of 54 places in 579 ms of which 6 ms to minimize.
[2024-05-24 19:01:02] [INFO ] Deduced a trap composed of 56 places in 555 ms of which 6 ms to minimize.
[2024-05-24 19:01:03] [INFO ] Deduced a trap composed of 210 places in 587 ms of which 6 ms to minimize.
[2024-05-24 19:01:03] [INFO ] Deduced a trap composed of 100 places in 552 ms of which 5 ms to minimize.
[2024-05-24 19:01:04] [INFO ] Deduced a trap composed of 71 places in 580 ms of which 5 ms to minimize.
[2024-05-24 19:01:04] [INFO ] Deduced a trap composed of 86 places in 559 ms of which 5 ms to minimize.
[2024-05-24 19:01:05] [INFO ] Deduced a trap composed of 80 places in 588 ms of which 5 ms to minimize.
[2024-05-24 19:01:06] [INFO ] Deduced a trap composed of 71 places in 590 ms of which 5 ms to minimize.
[2024-05-24 19:01:06] [INFO ] Deduced a trap composed of 70 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:01:07] [INFO ] Deduced a trap composed of 55 places in 586 ms of which 5 ms to minimize.
[2024-05-24 19:01:07] [INFO ] Deduced a trap composed of 69 places in 609 ms of which 6 ms to minimize.
[2024-05-24 19:01:08] [INFO ] Deduced a trap composed of 84 places in 602 ms of which 6 ms to minimize.
[2024-05-24 19:01:09] [INFO ] Deduced a trap composed of 96 places in 605 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/958 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:01:09] [INFO ] Deduced a trap composed of 85 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:01:10] [INFO ] Deduced a trap composed of 114 places in 593 ms of which 6 ms to minimize.
[2024-05-24 19:01:10] [INFO ] Deduced a trap composed of 92 places in 633 ms of which 6 ms to minimize.
[2024-05-24 19:01:11] [INFO ] Deduced a trap composed of 98 places in 611 ms of which 6 ms to minimize.
[2024-05-24 19:01:12] [INFO ] Deduced a trap composed of 63 places in 603 ms of which 6 ms to minimize.
[2024-05-24 19:01:12] [INFO ] Deduced a trap composed of 111 places in 628 ms of which 6 ms to minimize.
[2024-05-24 19:01:13] [INFO ] Deduced a trap composed of 233 places in 649 ms of which 6 ms to minimize.
[2024-05-24 19:01:14] [INFO ] Deduced a trap composed of 89 places in 597 ms of which 6 ms to minimize.
[2024-05-24 19:01:14] [INFO ] Deduced a trap composed of 102 places in 594 ms of which 6 ms to minimize.
[2024-05-24 19:01:15] [INFO ] Deduced a trap composed of 54 places in 609 ms of which 6 ms to minimize.
[2024-05-24 19:01:16] [INFO ] Deduced a trap composed of 245 places in 610 ms of which 6 ms to minimize.
[2024-05-24 19:01:16] [INFO ] Deduced a trap composed of 55 places in 616 ms of which 6 ms to minimize.
[2024-05-24 19:01:17] [INFO ] Deduced a trap composed of 219 places in 634 ms of which 6 ms to minimize.
[2024-05-24 19:01:17] [INFO ] Deduced a trap composed of 71 places in 588 ms of which 6 ms to minimize.
SMT process timed out in 47903ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 997 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 4292/4292 transitions.
Applied a total of 0 rules in 109 ms. Remains 997 /997 variables (removed 0) and now considering 4292/4292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 997/997 places, 4292/4292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 4292/4292 transitions.
Applied a total of 0 rules in 106 ms. Remains 997 /997 variables (removed 0) and now considering 4292/4292 (removed 0) transitions.
[2024-05-24 19:01:18] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-24 19:01:18] [INFO ] Invariant cache hit.
[2024-05-24 19:01:19] [INFO ] Implicit Places using invariants in 1252 ms returned []
[2024-05-24 19:01:19] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-24 19:01:19] [INFO ] Invariant cache hit.
[2024-05-24 19:01:20] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:01:47] [INFO ] Implicit Places using invariants and state equation in 27897 ms returned []
Implicit Place search using SMT with State Equation took 29151 ms to find 0 implicit places.
[2024-05-24 19:01:47] [INFO ] Redundant transitions in 173 ms returned []
Running 4230 sub problems to find dead transitions.
[2024-05-24 19:01:47] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-24 19:01:47] [INFO ] Invariant cache hit.
[2024-05-24 19:01:47] [INFO ] State equation strengthened by 2722 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/995 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4230 unsolved
SMT process timed out in 59383ms, After SMT, problems are : Problem set: 0 solved, 4230 unsolved
Search for dead transitions found 0 dead transitions in 59419ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88866 ms. Remains : 997/997 places, 4292/4292 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND p0 (NOT p1))), (X (AND (NOT p2) p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 14 factoid took 299 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1713 reset in 486 ms.
Product exploration explored 100000 steps with 1714 reset in 515 ms.
Built C files in :
/tmp/ltsmin19917711336506944
[2024-05-24 19:02:48] [INFO ] Too many transitions (2535) to apply POR reductions. Disabling POR matrices.
[2024-05-24 19:02:48] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin19917711336506944
Running compilation step : cd /tmp/ltsmin19917711336506944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin19917711336506944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin19917711336506944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 8 out of 1116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1116/1116 places, 2535/2535 transitions.
Applied a total of 0 rules in 64 ms. Remains 1116 /1116 variables (removed 0) and now considering 2535/2535 (removed 0) transitions.
[2024-05-24 19:02:51] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1116 cols
[2024-05-24 19:02:51] [INFO ] Computed 49 invariants in 19 ms
[2024-05-24 19:02:52] [INFO ] Implicit Places using invariants in 927 ms returned []
[2024-05-24 19:02:52] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 19:02:52] [INFO ] Invariant cache hit.
[2024-05-24 19:02:53] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-24 19:03:03] [INFO ] Implicit Places using invariants and state equation in 10401 ms returned []
Implicit Place search using SMT with State Equation took 11330 ms to find 0 implicit places.
[2024-05-24 19:03:03] [INFO ] Redundant transitions in 85 ms returned []
Running 2518 sub problems to find dead transitions.
[2024-05-24 19:03:03] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 19:03:03] [INFO ] Invariant cache hit.
[2024-05-24 19:03:03] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1114 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2518 unsolved
SMT process timed out in 32484ms, After SMT, problems are : Problem set: 0 solved, 2518 unsolved
Search for dead transitions found 0 dead transitions in 32506ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43999 ms. Remains : 1116/1116 places, 2535/2535 transitions.
Built C files in :
/tmp/ltsmin2819957841216811043
[2024-05-24 19:03:35] [INFO ] Too many transitions (2535) to apply POR reductions. Disabling POR matrices.
[2024-05-24 19:03:35] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2819957841216811043
Running compilation step : cd /tmp/ltsmin2819957841216811043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2819957841216811043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2819957841216811043;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 19:03:38] [INFO ] Flatten gal took : 66 ms
[2024-05-24 19:03:38] [INFO ] Flatten gal took : 88 ms
[2024-05-24 19:03:38] [INFO ] Time to serialize gal into /tmp/LTL7453351340675239725.gal : 11 ms
[2024-05-24 19:03:38] [INFO ] Time to serialize properties into /tmp/LTL12898947601149920501.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7453351340675239725.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16733800494079460555.hoa' '-atoms' '/tmp/LTL12898947601149920501.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12898947601149920501.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16733800494079460555.hoa
Detected timeout of ITS tools.
[2024-05-24 19:03:54] [INFO ] Flatten gal took : 54 ms
[2024-05-24 19:03:54] [INFO ] Flatten gal took : 53 ms
[2024-05-24 19:03:54] [INFO ] Time to serialize gal into /tmp/LTL4611145818863047944.gal : 13 ms
[2024-05-24 19:03:54] [INFO ] Time to serialize properties into /tmp/LTL124430004258319319.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4611145818863047944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL124430004258319319.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(G(("((Node4AsksIsThereANodeMaster<1)||(Node14IsActive<1))")||(("(Node14IsTheNodeMaster<1)")||(F(("(((Node11IsActive>=1)&&(Node11I...314
Formula 0 simplified : XF(!"((Node4AsksIsThereANodeMaster<1)||(Node14IsActive<1))" & !"(Node14IsTheNodeMaster<1)" & G(!"(((Node11IsActive>=1)&&(Node11IsThe...300
Detected timeout of ITS tools.
[2024-05-24 19:04:09] [INFO ] Flatten gal took : 51 ms
[2024-05-24 19:04:09] [INFO ] Applying decomposition
[2024-05-24 19:04:09] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3141242488022433626.txt' '-o' '/tmp/graph3141242488022433626.bin' '-w' '/tmp/graph3141242488022433626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3141242488022433626.bin' '-l' '-1' '-v' '-w' '/tmp/graph3141242488022433626.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:04:09] [INFO ] Decomposing Gal with order
[2024-05-24 19:04:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:04:09] [INFO ] Removed a total of 2223 redundant transitions.
[2024-05-24 19:04:09] [INFO ] Flatten gal took : 222 ms
[2024-05-24 19:04:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 976 labels/synchronizations in 122 ms.
[2024-05-24 19:04:09] [INFO ] Time to serialize gal into /tmp/LTL519367554950484080.gal : 15 ms
[2024-05-24 19:04:09] [INFO ] Time to serialize properties into /tmp/LTL5798224847208825304.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL519367554950484080.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5798224847208825304.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(G(("((u0.Node4AsksIsThereANodeMaster<1)||(u0.Node14IsActive<1))")||(("(u0.Node14IsTheNodeMaster<1)")||(F(("(((u0.Node11IsActive>=...360
Formula 0 simplified : XF(!"((u0.Node4AsksIsThereANodeMaster<1)||(u0.Node14IsActive<1))" & !"(u0.Node14IsTheNodeMaster<1)" & G(!"(((u0.Node11IsActive>=1)&&...346
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10 finished in 425993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1303 transition count 2945
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1277 transition count 2945
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 52 place count 1277 transition count 2916
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 110 place count 1248 transition count 2916
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 129 place count 1229 transition count 2848
Iterating global reduction 2 with 19 rules applied. Total rules applied 148 place count 1229 transition count 2848
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 148 place count 1229 transition count 2844
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 156 place count 1225 transition count 2844
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 168 place count 1213 transition count 2769
Iterating global reduction 2 with 12 rules applied. Total rules applied 180 place count 1213 transition count 2769
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 183 place count 1210 transition count 2745
Iterating global reduction 2 with 3 rules applied. Total rules applied 186 place count 1210 transition count 2745
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 240 place count 1183 transition count 2718
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 246 place count 1177 transition count 2712
Iterating global reduction 2 with 6 rules applied. Total rules applied 252 place count 1177 transition count 2712
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 258 place count 1171 transition count 2664
Iterating global reduction 2 with 6 rules applied. Total rules applied 264 place count 1171 transition count 2664
Applied a total of 264 rules in 359 ms. Remains 1171 /1303 variables (removed 132) and now considering 2664/2971 (removed 307) transitions.
[2024-05-24 19:04:25] [INFO ] Flow matrix only has 2392 transitions (discarded 272 similar events)
// Phase 1: matrix 2392 rows 1171 cols
[2024-05-24 19:04:25] [INFO ] Computed 66 invariants in 33 ms
[2024-05-24 19:04:26] [INFO ] Implicit Places using invariants in 1047 ms returned [9, 94, 354, 465, 495, 506, 516, 541, 564, 663, 712, 746, 780, 825, 826, 926, 977]
[2024-05-24 19:04:26] [INFO ] Actually due to overlaps returned [495, 9, 94, 354, 465, 516, 541, 564, 663, 712, 746, 780, 825, 826, 926, 977]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1051 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1155/1303 places, 2664/2971 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1145 transition count 2654
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1145 transition count 2654
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1135 transition count 2644
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1135 transition count 2644
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 1126 transition count 2572
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 1126 transition count 2572
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 1121 transition count 2567
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 1116 transition count 2562
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 1116 transition count 2562
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 1111 transition count 2522
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 1111 transition count 2522
Applied a total of 88 rules in 292 ms. Remains 1111 /1155 variables (removed 44) and now considering 2522/2664 (removed 142) transitions.
[2024-05-24 19:04:26] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1111 cols
[2024-05-24 19:04:26] [INFO ] Computed 50 invariants in 30 ms
[2024-05-24 19:04:27] [INFO ] Implicit Places using invariants in 915 ms returned [493]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 919 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1110/1303 places, 2522/2971 transitions.
Applied a total of 0 rules in 63 ms. Remains 1110 /1110 variables (removed 0) and now considering 2522/2522 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2684 ms. Remains : 1110/1303 places, 2522/2971 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-11 finished in 2756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&F(p1)))))'
Support contains 5 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1278 transition count 2890
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1278 transition count 2890
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 67 place count 1261 transition count 2810
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 1261 transition count 2810
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 92 place count 1253 transition count 2746
Iterating global reduction 0 with 8 rules applied. Total rules applied 100 place count 1253 transition count 2746
Applied a total of 100 rules in 147 ms. Remains 1253 /1303 variables (removed 50) and now considering 2746/2971 (removed 225) transitions.
[2024-05-24 19:04:27] [INFO ] Flow matrix only has 2474 transitions (discarded 272 similar events)
// Phase 1: matrix 2474 rows 1253 cols
[2024-05-24 19:04:27] [INFO ] Computed 66 invariants in 37 ms
[2024-05-24 19:04:29] [INFO ] Implicit Places using invariants in 1084 ms returned [12, 106, 392, 506, 537, 549, 559, 586, 611, 715, 766, 800, 837, 882, 883, 987]
[2024-05-24 19:04:29] [INFO ] Actually due to overlaps returned [537, 12, 106, 392, 506, 559, 586, 611, 715, 766, 800, 837, 882, 883, 987]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1086 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1238/1303 places, 2746/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1224 transition count 2732
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1224 transition count 2732
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1210 transition count 2718
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1210 transition count 2718
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 69 place count 1197 transition count 2705
Iterating global reduction 0 with 13 rules applied. Total rules applied 82 place count 1197 transition count 2705
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 94 place count 1185 transition count 2609
Iterating global reduction 0 with 12 rules applied. Total rules applied 106 place count 1185 transition count 2609
Applied a total of 106 rules in 174 ms. Remains 1185 /1238 variables (removed 53) and now considering 2609/2746 (removed 137) transitions.
[2024-05-24 19:04:29] [INFO ] Flow matrix only has 2337 transitions (discarded 272 similar events)
// Phase 1: matrix 2337 rows 1185 cols
[2024-05-24 19:04:29] [INFO ] Computed 51 invariants in 26 ms
[2024-05-24 19:04:30] [INFO ] Implicit Places using invariants in 1041 ms returned [534]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1043 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1184/1303 places, 2609/2971 transitions.
Applied a total of 0 rules in 33 ms. Remains 1184 /1184 variables (removed 0) and now considering 2609/2609 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2483 ms. Remains : 1184/1303 places, 2609/2971 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-12 finished in 2689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1278 transition count 2890
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1278 transition count 2890
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 67 place count 1261 transition count 2810
Iterating global reduction 0 with 17 rules applied. Total rules applied 84 place count 1261 transition count 2810
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 92 place count 1253 transition count 2746
Iterating global reduction 0 with 8 rules applied. Total rules applied 100 place count 1253 transition count 2746
Applied a total of 100 rules in 146 ms. Remains 1253 /1303 variables (removed 50) and now considering 2746/2971 (removed 225) transitions.
[2024-05-24 19:04:30] [INFO ] Flow matrix only has 2474 transitions (discarded 272 similar events)
// Phase 1: matrix 2474 rows 1253 cols
[2024-05-24 19:04:30] [INFO ] Computed 66 invariants in 35 ms
[2024-05-24 19:04:31] [INFO ] Implicit Places using invariants in 1082 ms returned [12, 106, 392, 506, 537, 549, 559, 586, 611, 715, 803, 840, 885, 886, 990, 1043]
[2024-05-24 19:04:31] [INFO ] Actually due to overlaps returned [537, 12, 106, 392, 506, 559, 586, 611, 715, 803, 840, 885, 886, 990, 1043]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1085 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1238/1303 places, 2746/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1224 transition count 2732
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1224 transition count 2732
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1210 transition count 2718
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1210 transition count 2718
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1196 transition count 2704
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1196 transition count 2704
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 1183 transition count 2600
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 1183 transition count 2600
Applied a total of 110 rules in 176 ms. Remains 1183 /1238 variables (removed 55) and now considering 2600/2746 (removed 146) transitions.
[2024-05-24 19:04:31] [INFO ] Flow matrix only has 2328 transitions (discarded 272 similar events)
// Phase 1: matrix 2328 rows 1183 cols
[2024-05-24 19:04:31] [INFO ] Computed 51 invariants in 26 ms
[2024-05-24 19:04:32] [INFO ] Implicit Places using invariants in 1016 ms returned [532]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1018 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1182/1303 places, 2600/2971 transitions.
Applied a total of 0 rules in 33 ms. Remains 1182 /1182 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2459 ms. Remains : 1182/1303 places, 2600/2971 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-13 finished in 2592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(!p1&&X((G(!p0)||(!p0&&G(F(p2)))))))))'
Support contains 5 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1279 transition count 2898
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1279 transition count 2898
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 1262 transition count 2818
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 1262 transition count 2818
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 1254 transition count 2754
Iterating global reduction 0 with 8 rules applied. Total rules applied 98 place count 1254 transition count 2754
Applied a total of 98 rules in 146 ms. Remains 1254 /1303 variables (removed 49) and now considering 2754/2971 (removed 217) transitions.
[2024-05-24 19:04:33] [INFO ] Flow matrix only has 2482 transitions (discarded 272 similar events)
// Phase 1: matrix 2482 rows 1254 cols
[2024-05-24 19:04:33] [INFO ] Computed 66 invariants in 33 ms
[2024-05-24 19:04:34] [INFO ] Implicit Places using invariants in 1068 ms returned [12, 106, 394, 508, 539, 551, 561, 588, 613, 717, 768, 802, 839, 884, 885, 990, 1043]
[2024-05-24 19:04:34] [INFO ] Actually due to overlaps returned [539, 12, 106, 394, 508, 561, 588, 613, 717, 768, 802, 839, 884, 885, 990, 1043]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1070 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1238/1303 places, 2754/2971 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1223 transition count 2739
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1223 transition count 2739
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1208 transition count 2724
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1208 transition count 2724
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 75 place count 1193 transition count 2709
Iterating global reduction 0 with 15 rules applied. Total rules applied 90 place count 1193 transition count 2709
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 104 place count 1179 transition count 2597
Iterating global reduction 0 with 14 rules applied. Total rules applied 118 place count 1179 transition count 2597
Applied a total of 118 rules in 175 ms. Remains 1179 /1238 variables (removed 59) and now considering 2597/2754 (removed 157) transitions.
[2024-05-24 19:04:34] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
// Phase 1: matrix 2325 rows 1179 cols
[2024-05-24 19:04:34] [INFO ] Computed 50 invariants in 26 ms
[2024-05-24 19:04:35] [INFO ] Implicit Places using invariants in 1030 ms returned [534]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1032 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1178/1303 places, 2597/2971 transitions.
Applied a total of 0 rules in 34 ms. Remains 1178 /1178 variables (removed 0) and now considering 2597/2597 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2457 ms. Remains : 1178/1303 places, 2597/2971 transitions.
Stuttering acceptance computed with spot in 176 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14
Product exploration explored 100000 steps with 1205 reset in 393 ms.
Product exploration explored 100000 steps with 1205 reset in 404 ms.
Computed a total of 346 stabilizing places and 964 stable transitions
Computed a total of 346 stabilizing places and 964 stable transitions
Detected a total of 346/1178 stabilizing places and 964/2597 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 254 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (480 resets) in 285 ms. (139 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (136 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
[2024-05-24 19:04:37] [INFO ] Flow matrix only has 2325 transitions (discarded 272 similar events)
// Phase 1: matrix 2325 rows 1178 cols
[2024-05-24 19:04:37] [INFO ] Computed 49 invariants in 20 ms
[2024-05-24 19:04:37] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1082/1084 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1084 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1103 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:04:37] [INFO ] Deduced a trap composed of 658 places in 487 ms of which 7 ms to minimize.
[2024-05-24 19:04:38] [INFO ] Deduced a trap composed of 654 places in 495 ms of which 7 ms to minimize.
[2024-05-24 19:04:38] [INFO ] Deduced a trap composed of 650 places in 475 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1103 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/1136 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:04:39] [INFO ] Deduced a trap composed of 139 places in 547 ms of which 8 ms to minimize.
[2024-05-24 19:04:40] [INFO ] Deduced a trap composed of 94 places in 557 ms of which 8 ms to minimize.
[2024-05-24 19:04:40] [INFO ] Deduced a trap composed of 110 places in 555 ms of which 7 ms to minimize.
[2024-05-24 19:04:41] [INFO ] Deduced a trap composed of 82 places in 493 ms of which 6 ms to minimize.
[2024-05-24 19:04:41] [INFO ] Deduced a trap composed of 98 places in 480 ms of which 7 ms to minimize.
[2024-05-24 19:04:42] [INFO ] Deduced a trap composed of 134 places in 508 ms of which 7 ms to minimize.
SMT process timed out in 5080ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1178/1178 places, 2597/2597 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1178 transition count 2566
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1147 transition count 2566
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 62 place count 1147 transition count 2549
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 96 place count 1130 transition count 2549
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 1128 transition count 2540
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 1128 transition count 2540
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 1127 transition count 2539
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 1127 transition count 2539
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 1126 transition count 2531
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 1126 transition count 2531
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 138 place count 1109 transition count 2514
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 2 with 131 rules applied. Total rules applied 269 place count 1109 transition count 4273
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 2 with 131 rules applied. Total rules applied 400 place count 978 transition count 4273
Applied a total of 400 rules in 367 ms. Remains 978 /1178 variables (removed 200) and now considering 4273/2597 (removed -1676) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 978/1178 places, 4273/2597 transitions.
RANDOM walk for 40000 steps (840 resets) in 768 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (119 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 69287 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 69287 steps, saw 29185 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 19:04:45] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2024-05-24 19:04:45] [INFO ] Computed 49 invariants in 31 ms
[2024-05-24 19:04:45] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:04:46] [INFO ] Deduced a trap composed of 100 places in 525 ms of which 6 ms to minimize.
[2024-05-24 19:04:47] [INFO ] Deduced a trap composed of 490 places in 520 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/962 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/978 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/978 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3875/4853 variables, 978/1029 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4853 variables, 2722/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4853 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4853 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4853/4853 variables, and 3751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2532 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 978/978 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:04:49] [INFO ] Deduced a trap composed of 5 places in 478 ms of which 5 ms to minimize.
[2024-05-24 19:04:49] [INFO ] Deduced a trap composed of 46 places in 490 ms of which 6 ms to minimize.
[2024-05-24 19:04:50] [INFO ] Deduced a trap composed of 62 places in 496 ms of which 5 ms to minimize.
[2024-05-24 19:04:50] [INFO ] Deduced a trap composed of 75 places in 502 ms of which 6 ms to minimize.
[2024-05-24 19:04:51] [INFO ] Deduced a trap composed of 75 places in 543 ms of which 6 ms to minimize.
[2024-05-24 19:04:51] [INFO ] Deduced a trap composed of 162 places in 504 ms of which 6 ms to minimize.
[2024-05-24 19:04:52] [INFO ] Deduced a trap composed of 148 places in 489 ms of which 6 ms to minimize.
[2024-05-24 19:04:52] [INFO ] Deduced a trap composed of 177 places in 514 ms of which 6 ms to minimize.
[2024-05-24 19:04:53] [INFO ] Deduced a trap composed of 27 places in 492 ms of which 5 ms to minimize.
[2024-05-24 19:04:53] [INFO ] Deduced a trap composed of 182 places in 567 ms of which 6 ms to minimize.
[2024-05-24 19:04:54] [INFO ] Deduced a trap composed of 178 places in 553 ms of which 6 ms to minimize.
[2024-05-24 19:04:54] [INFO ] Deduced a trap composed of 171 places in 496 ms of which 6 ms to minimize.
[2024-05-24 19:04:55] [INFO ] Deduced a trap composed of 179 places in 474 ms of which 6 ms to minimize.
[2024-05-24 19:04:55] [INFO ] Deduced a trap composed of 179 places in 476 ms of which 6 ms to minimize.
[2024-05-24 19:04:56] [INFO ] Deduced a trap composed of 90 places in 474 ms of which 6 ms to minimize.
[2024-05-24 19:04:56] [INFO ] Deduced a trap composed of 160 places in 487 ms of which 5 ms to minimize.
[2024-05-24 19:04:57] [INFO ] Deduced a trap composed of 94 places in 479 ms of which 6 ms to minimize.
[2024-05-24 19:04:57] [INFO ] Deduced a trap composed of 172 places in 462 ms of which 5 ms to minimize.
[2024-05-24 19:04:58] [INFO ] Deduced a trap composed of 85 places in 470 ms of which 5 ms to minimize.
[2024-05-24 19:04:58] [INFO ] Deduced a trap composed of 176 places in 481 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:04:59] [INFO ] Deduced a trap composed of 165 places in 471 ms of which 5 ms to minimize.
[2024-05-24 19:04:59] [INFO ] Deduced a trap composed of 94 places in 465 ms of which 6 ms to minimize.
[2024-05-24 19:05:00] [INFO ] Deduced a trap composed of 173 places in 466 ms of which 5 ms to minimize.
[2024-05-24 19:05:00] [INFO ] Deduced a trap composed of 85 places in 472 ms of which 5 ms to minimize.
[2024-05-24 19:05:01] [INFO ] Deduced a trap composed of 211 places in 468 ms of which 5 ms to minimize.
[2024-05-24 19:05:01] [INFO ] Deduced a trap composed of 207 places in 472 ms of which 6 ms to minimize.
[2024-05-24 19:05:02] [INFO ] Deduced a trap composed of 233 places in 468 ms of which 6 ms to minimize.
[2024-05-24 19:05:02] [INFO ] Deduced a trap composed of 214 places in 462 ms of which 6 ms to minimize.
[2024-05-24 19:05:03] [INFO ] Deduced a trap composed of 214 places in 472 ms of which 5 ms to minimize.
[2024-05-24 19:05:03] [INFO ] Deduced a trap composed of 214 places in 458 ms of which 5 ms to minimize.
[2024-05-24 19:05:04] [INFO ] Deduced a trap composed of 164 places in 456 ms of which 5 ms to minimize.
[2024-05-24 19:05:04] [INFO ] Deduced a trap composed of 210 places in 460 ms of which 5 ms to minimize.
[2024-05-24 19:05:05] [INFO ] Deduced a trap composed of 218 places in 465 ms of which 6 ms to minimize.
[2024-05-24 19:05:05] [INFO ] Deduced a trap composed of 106 places in 468 ms of which 6 ms to minimize.
[2024-05-24 19:05:06] [INFO ] Deduced a trap composed of 198 places in 482 ms of which 6 ms to minimize.
[2024-05-24 19:05:06] [INFO ] Deduced a trap composed of 192 places in 467 ms of which 5 ms to minimize.
[2024-05-24 19:05:07] [INFO ] Deduced a trap composed of 224 places in 492 ms of which 5 ms to minimize.
[2024-05-24 19:05:07] [INFO ] Deduced a trap composed of 191 places in 486 ms of which 6 ms to minimize.
[2024-05-24 19:05:08] [INFO ] Deduced a trap composed of 196 places in 482 ms of which 5 ms to minimize.
[2024-05-24 19:05:08] [INFO ] Deduced a trap composed of 201 places in 474 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:05:09] [INFO ] Deduced a trap composed of 92 places in 471 ms of which 6 ms to minimize.
[2024-05-24 19:05:09] [INFO ] Deduced a trap composed of 217 places in 480 ms of which 6 ms to minimize.
[2024-05-24 19:05:10] [INFO ] Deduced a trap composed of 94 places in 478 ms of which 5 ms to minimize.
[2024-05-24 19:05:10] [INFO ] Deduced a trap composed of 219 places in 487 ms of which 6 ms to minimize.
[2024-05-24 19:05:11] [INFO ] Deduced a trap composed of 94 places in 468 ms of which 6 ms to minimize.
[2024-05-24 19:05:11] [INFO ] Deduced a trap composed of 76 places in 546 ms of which 5 ms to minimize.
[2024-05-24 19:05:12] [INFO ] Deduced a trap composed of 203 places in 483 ms of which 6 ms to minimize.
[2024-05-24 19:05:12] [INFO ] Deduced a trap composed of 79 places in 565 ms of which 6 ms to minimize.
[2024-05-24 19:05:13] [INFO ] Deduced a trap composed of 198 places in 477 ms of which 5 ms to minimize.
[2024-05-24 19:05:13] [INFO ] Deduced a trap composed of 193 places in 486 ms of which 5 ms to minimize.
[2024-05-24 19:05:14] [INFO ] Deduced a trap composed of 208 places in 479 ms of which 6 ms to minimize.
[2024-05-24 19:05:14] [INFO ] Deduced a trap composed of 203 places in 472 ms of which 6 ms to minimize.
[2024-05-24 19:05:15] [INFO ] Deduced a trap composed of 193 places in 469 ms of which 6 ms to minimize.
[2024-05-24 19:05:15] [INFO ] Deduced a trap composed of 147 places in 476 ms of which 6 ms to minimize.
[2024-05-24 19:05:16] [INFO ] Deduced a trap composed of 193 places in 485 ms of which 5 ms to minimize.
[2024-05-24 19:05:16] [INFO ] Deduced a trap composed of 226 places in 472 ms of which 6 ms to minimize.
[2024-05-24 19:05:17] [INFO ] Deduced a trap composed of 209 places in 496 ms of which 6 ms to minimize.
[2024-05-24 19:05:17] [INFO ] Deduced a trap composed of 209 places in 469 ms of which 6 ms to minimize.
[2024-05-24 19:05:18] [INFO ] Deduced a trap composed of 94 places in 457 ms of which 5 ms to minimize.
[2024-05-24 19:05:18] [INFO ] Deduced a trap composed of 94 places in 466 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/936 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:05:19] [INFO ] Deduced a trap composed of 207 places in 469 ms of which 6 ms to minimize.
[2024-05-24 19:05:19] [INFO ] Deduced a trap composed of 209 places in 468 ms of which 6 ms to minimize.
[2024-05-24 19:05:20] [INFO ] Deduced a trap composed of 206 places in 472 ms of which 6 ms to minimize.
[2024-05-24 19:05:20] [INFO ] Deduced a trap composed of 191 places in 456 ms of which 5 ms to minimize.
[2024-05-24 19:05:21] [INFO ] Deduced a trap composed of 199 places in 496 ms of which 6 ms to minimize.
[2024-05-24 19:05:21] [INFO ] Deduced a trap composed of 203 places in 456 ms of which 5 ms to minimize.
[2024-05-24 19:05:22] [INFO ] Deduced a trap composed of 192 places in 467 ms of which 5 ms to minimize.
[2024-05-24 19:05:22] [INFO ] Deduced a trap composed of 198 places in 509 ms of which 6 ms to minimize.
[2024-05-24 19:05:23] [INFO ] Deduced a trap composed of 95 places in 505 ms of which 6 ms to minimize.
[2024-05-24 19:05:23] [INFO ] Deduced a trap composed of 46 places in 460 ms of which 5 ms to minimize.
[2024-05-24 19:05:24] [INFO ] Deduced a trap composed of 185 places in 470 ms of which 6 ms to minimize.
[2024-05-24 19:05:24] [INFO ] Deduced a trap composed of 71 places in 467 ms of which 6 ms to minimize.
[2024-05-24 19:05:25] [INFO ] Deduced a trap composed of 120 places in 496 ms of which 5 ms to minimize.
[2024-05-24 19:05:25] [INFO ] Deduced a trap composed of 137 places in 468 ms of which 5 ms to minimize.
[2024-05-24 19:05:26] [INFO ] Deduced a trap composed of 57 places in 477 ms of which 5 ms to minimize.
[2024-05-24 19:05:26] [INFO ] Deduced a trap composed of 46 places in 512 ms of which 6 ms to minimize.
[2024-05-24 19:05:27] [INFO ] Deduced a trap composed of 88 places in 513 ms of which 6 ms to minimize.
[2024-05-24 19:05:27] [INFO ] Deduced a trap composed of 169 places in 510 ms of which 5 ms to minimize.
[2024-05-24 19:05:28] [INFO ] Deduced a trap composed of 236 places in 529 ms of which 5 ms to minimize.
[2024-05-24 19:05:28] [INFO ] Deduced a trap composed of 148 places in 524 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/936 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:05:29] [INFO ] Deduced a trap composed of 150 places in 521 ms of which 5 ms to minimize.
[2024-05-24 19:05:29] [INFO ] Deduced a trap composed of 191 places in 523 ms of which 6 ms to minimize.
[2024-05-24 19:05:30] [INFO ] Deduced a trap composed of 97 places in 475 ms of which 5 ms to minimize.
[2024-05-24 19:05:30] [INFO ] Deduced a trap composed of 183 places in 518 ms of which 6 ms to minimize.
[2024-05-24 19:05:31] [INFO ] Deduced a trap composed of 120 places in 487 ms of which 5 ms to minimize.
[2024-05-24 19:05:31] [INFO ] Deduced a trap composed of 211 places in 466 ms of which 6 ms to minimize.
[2024-05-24 19:05:32] [INFO ] Deduced a trap composed of 153 places in 528 ms of which 6 ms to minimize.
[2024-05-24 19:05:33] [INFO ] Deduced a trap composed of 95 places in 561 ms of which 6 ms to minimize.
[2024-05-24 19:05:33] [INFO ] Deduced a trap composed of 189 places in 507 ms of which 6 ms to minimize.
SMT process timed out in 47795ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 107 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 978/978 places, 4273/4273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 103 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
[2024-05-24 19:05:33] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:05:33] [INFO ] Invariant cache hit.
[2024-05-24 19:05:34] [INFO ] Implicit Places using invariants in 1176 ms returned []
[2024-05-24 19:05:34] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:05:34] [INFO ] Invariant cache hit.
[2024-05-24 19:05:35] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:06:06] [INFO ] Performed 919/978 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:06:13] [INFO ] Implicit Places using invariants and state equation in 38499 ms returned []
Implicit Place search using SMT with State Equation took 39676 ms to find 0 implicit places.
[2024-05-24 19:06:13] [INFO ] Redundant transitions in 222 ms returned []
Running 4211 sub problems to find dead transitions.
[2024-05-24 19:06:13] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:06:13] [INFO ] Invariant cache hit.
[2024-05-24 19:06:13] [INFO ] State equation strengthened by 2722 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4211 unsolved
SMT process timed out in 60537ms, After SMT, problems are : Problem set: 0 solved, 4211 unsolved
Search for dead transitions found 0 dead transitions in 60573ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100596 ms. Remains : 978/978 places, 4273/4273 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 17 factoid took 441 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 4 out of 1178 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1178/1178 places, 2597/2597 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1178 transition count 2566
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1147 transition count 2566
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 62 place count 1147 transition count 2550
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 94 place count 1131 transition count 2550
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 130 place count 1113 transition count 2532
Applied a total of 130 rules in 129 ms. Remains 1113 /1178 variables (removed 65) and now considering 2532/2597 (removed 65) transitions.
[2024-05-24 19:07:15] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
// Phase 1: matrix 2260 rows 1113 cols
[2024-05-24 19:07:15] [INFO ] Computed 49 invariants in 22 ms
[2024-05-24 19:07:16] [INFO ] Implicit Places using invariants in 978 ms returned []
[2024-05-24 19:07:16] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-24 19:07:16] [INFO ] Invariant cache hit.
[2024-05-24 19:07:16] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-24 19:07:27] [INFO ] Implicit Places using invariants and state equation in 11641 ms returned []
Implicit Place search using SMT with State Equation took 12621 ms to find 0 implicit places.
[2024-05-24 19:07:27] [INFO ] Redundant transitions in 77 ms returned []
Running 2515 sub problems to find dead transitions.
[2024-05-24 19:07:27] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-24 19:07:27] [INFO ] Invariant cache hit.
[2024-05-24 19:07:27] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1111 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2515 unsolved
SMT process timed out in 32638ms, After SMT, problems are : Problem set: 0 solved, 2515 unsolved
Search for dead transitions found 0 dead transitions in 32660ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1113/1178 places, 2532/2597 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45500 ms. Remains : 1113/1178 places, 2532/2597 transitions.
Computed a total of 298 stabilizing places and 916 stable transitions
Computed a total of 298 stabilizing places and 916 stable transitions
Detected a total of 298/1113 stabilizing places and 916/2532 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 128 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (683 resets) in 273 ms. (145 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (148 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
[2024-05-24 19:08:00] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-24 19:08:00] [INFO ] Invariant cache hit.
[2024-05-24 19:08:00] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1019 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1019 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1038 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:08:01] [INFO ] Deduced a trap composed of 601 places in 423 ms of which 6 ms to minimize.
[2024-05-24 19:08:01] [INFO ] Deduced a trap composed of 601 places in 407 ms of which 6 ms to minimize.
[2024-05-24 19:08:02] [INFO ] Deduced a trap composed of 601 places in 398 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1038 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/1071 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1071 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/1097 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1097 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/1113 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1113 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2260/3373 variables, 1113/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3373 variables, 846/2011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3373 variables, 0/2011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/3373 variables, 0/2011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3373/3373 variables, and 2011 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2304 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1113/1113 constraints, ReadFeed: 846/846 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1019 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1019 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1038 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1038 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/1071 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:08:03] [INFO ] Deduced a trap composed of 47 places in 461 ms of which 7 ms to minimize.
[2024-05-24 19:08:04] [INFO ] Deduced a trap composed of 153 places in 471 ms of which 7 ms to minimize.
[2024-05-24 19:08:04] [INFO ] Deduced a trap composed of 246 places in 479 ms of which 7 ms to minimize.
[2024-05-24 19:08:05] [INFO ] Deduced a trap composed of 93 places in 476 ms of which 7 ms to minimize.
[2024-05-24 19:08:05] [INFO ] Deduced a trap composed of 182 places in 476 ms of which 7 ms to minimize.
[2024-05-24 19:08:06] [INFO ] Deduced a trap composed of 249 places in 468 ms of which 7 ms to minimize.
[2024-05-24 19:08:06] [INFO ] Deduced a trap composed of 187 places in 465 ms of which 6 ms to minimize.
[2024-05-24 19:08:07] [INFO ] Deduced a trap composed of 179 places in 465 ms of which 6 ms to minimize.
[2024-05-24 19:08:07] [INFO ] Deduced a trap composed of 132 places in 452 ms of which 6 ms to minimize.
[2024-05-24 19:08:08] [INFO ] Deduced a trap composed of 154 places in 471 ms of which 6 ms to minimize.
SMT process timed out in 7368ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1112 transition count 2524
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1112 transition count 2524
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1111 transition count 2523
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1109 transition count 2514
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1109 transition count 2514
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 139 place count 1109 transition count 4273
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 270 place count 978 transition count 4273
Applied a total of 270 rules in 335 ms. Remains 978 /1113 variables (removed 135) and now considering 4273/2532 (removed -1741) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 335 ms. Remains : 978/1113 places, 4273/2532 transitions.
RANDOM walk for 40000 steps (840 resets) in 722 ms. (55 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (120 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 68889 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 68889 steps, saw 29027 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-24 19:08:11] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2024-05-24 19:08:11] [INFO ] Computed 49 invariants in 33 ms
[2024-05-24 19:08:11] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:08:12] [INFO ] Deduced a trap composed of 188 places in 583 ms of which 6 ms to minimize.
[2024-05-24 19:08:13] [INFO ] Deduced a trap composed of 132 places in 560 ms of which 6 ms to minimize.
[2024-05-24 19:08:13] [INFO ] Deduced a trap composed of 112 places in 575 ms of which 5 ms to minimize.
[2024-05-24 19:08:14] [INFO ] Deduced a trap composed of 183 places in 590 ms of which 5 ms to minimize.
[2024-05-24 19:08:14] [INFO ] Deduced a trap composed of 288 places in 567 ms of which 6 ms to minimize.
[2024-05-24 19:08:15] [INFO ] Deduced a trap composed of 101 places in 575 ms of which 5 ms to minimize.
[2024-05-24 19:08:16] [INFO ] Deduced a trap composed of 329 places in 585 ms of which 5 ms to minimize.
[2024-05-24 19:08:16] [INFO ] Deduced a trap composed of 126 places in 590 ms of which 6 ms to minimize.
[2024-05-24 19:08:17] [INFO ] Deduced a trap composed of 89 places in 583 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:08:17] [INFO ] Deduced a trap composed of 5 places in 612 ms of which 6 ms to minimize.
[2024-05-24 19:08:18] [INFO ] Deduced a trap composed of 27 places in 565 ms of which 6 ms to minimize.
[2024-05-24 19:08:19] [INFO ] Deduced a trap composed of 77 places in 627 ms of which 6 ms to minimize.
[2024-05-24 19:08:19] [INFO ] Deduced a trap composed of 80 places in 580 ms of which 5 ms to minimize.
[2024-05-24 19:08:20] [INFO ] Deduced a trap composed of 46 places in 584 ms of which 6 ms to minimize.
[2024-05-24 19:08:21] [INFO ] Deduced a trap composed of 74 places in 597 ms of which 6 ms to minimize.
[2024-05-24 19:08:21] [INFO ] Deduced a trap composed of 79 places in 596 ms of which 6 ms to minimize.
[2024-05-24 19:08:22] [INFO ] Deduced a trap composed of 69 places in 592 ms of which 6 ms to minimize.
[2024-05-24 19:08:22] [INFO ] Deduced a trap composed of 75 places in 582 ms of which 6 ms to minimize.
[2024-05-24 19:08:23] [INFO ] Deduced a trap composed of 96 places in 604 ms of which 5 ms to minimize.
[2024-05-24 19:08:24] [INFO ] Deduced a trap composed of 68 places in 598 ms of which 6 ms to minimize.
[2024-05-24 19:08:24] [INFO ] Deduced a trap composed of 69 places in 574 ms of which 6 ms to minimize.
[2024-05-24 19:08:25] [INFO ] Deduced a trap composed of 74 places in 582 ms of which 6 ms to minimize.
[2024-05-24 19:08:25] [INFO ] Deduced a trap composed of 74 places in 591 ms of which 6 ms to minimize.
[2024-05-24 19:08:26] [INFO ] Deduced a trap composed of 85 places in 588 ms of which 5 ms to minimize.
[2024-05-24 19:08:27] [INFO ] Deduced a trap composed of 80 places in 595 ms of which 6 ms to minimize.
[2024-05-24 19:08:27] [INFO ] Deduced a trap composed of 71 places in 575 ms of which 6 ms to minimize.
[2024-05-24 19:08:28] [INFO ] Deduced a trap composed of 72 places in 565 ms of which 6 ms to minimize.
[2024-05-24 19:08:28] [INFO ] Deduced a trap composed of 82 places in 596 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 26/962 variables, 26/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/962 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/978 variables, 16/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/978 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3875/4853 variables, 978/1055 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4853 variables, 2722/3777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4853 variables, 0/3777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4853 variables, 0/3777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4853/4853 variables, and 3777 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18877 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 978/978 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:08:31] [INFO ] Deduced a trap composed of 314 places in 526 ms of which 6 ms to minimize.
[2024-05-24 19:08:31] [INFO ] Deduced a trap composed of 124 places in 571 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/903 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/936 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:08:32] [INFO ] Deduced a trap composed of 27 places in 521 ms of which 5 ms to minimize.
[2024-05-24 19:08:33] [INFO ] Deduced a trap composed of 75 places in 623 ms of which 5 ms to minimize.
[2024-05-24 19:08:33] [INFO ] Deduced a trap composed of 66 places in 648 ms of which 6 ms to minimize.
[2024-05-24 19:08:34] [INFO ] Deduced a trap composed of 89 places in 644 ms of which 6 ms to minimize.
[2024-05-24 19:08:35] [INFO ] Deduced a trap composed of 83 places in 617 ms of which 5 ms to minimize.
[2024-05-24 19:08:35] [INFO ] Deduced a trap composed of 92 places in 656 ms of which 6 ms to minimize.
[2024-05-24 19:08:36] [INFO ] Deduced a trap composed of 83 places in 666 ms of which 6 ms to minimize.
[2024-05-24 19:08:37] [INFO ] Deduced a trap composed of 88 places in 642 ms of which 6 ms to minimize.
[2024-05-24 19:08:37] [INFO ] Deduced a trap composed of 91 places in 641 ms of which 6 ms to minimize.
[2024-05-24 19:08:38] [INFO ] Deduced a trap composed of 67 places in 658 ms of which 6 ms to minimize.
[2024-05-24 19:08:39] [INFO ] Deduced a trap composed of 65 places in 633 ms of which 6 ms to minimize.
[2024-05-24 19:08:39] [INFO ] Deduced a trap composed of 89 places in 584 ms of which 6 ms to minimize.
[2024-05-24 19:08:40] [INFO ] Deduced a trap composed of 78 places in 590 ms of which 5 ms to minimize.
[2024-05-24 19:08:41] [INFO ] Deduced a trap composed of 89 places in 604 ms of which 5 ms to minimize.
[2024-05-24 19:08:41] [INFO ] Deduced a trap composed of 75 places in 591 ms of which 6 ms to minimize.
[2024-05-24 19:08:42] [INFO ] Deduced a trap composed of 79 places in 593 ms of which 6 ms to minimize.
[2024-05-24 19:08:42] [INFO ] Deduced a trap composed of 106 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:08:43] [INFO ] Deduced a trap composed of 85 places in 571 ms of which 6 ms to minimize.
[2024-05-24 19:08:44] [INFO ] Deduced a trap composed of 82 places in 573 ms of which 5 ms to minimize.
[2024-05-24 19:08:44] [INFO ] Deduced a trap composed of 46 places in 591 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/936 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:08:45] [INFO ] Deduced a trap composed of 112 places in 601 ms of which 5 ms to minimize.
[2024-05-24 19:08:45] [INFO ] Deduced a trap composed of 75 places in 595 ms of which 5 ms to minimize.
[2024-05-24 19:08:46] [INFO ] Deduced a trap composed of 82 places in 604 ms of which 6 ms to minimize.
[2024-05-24 19:08:47] [INFO ] Deduced a trap composed of 46 places in 573 ms of which 6 ms to minimize.
[2024-05-24 19:08:47] [INFO ] Deduced a trap composed of 67 places in 572 ms of which 6 ms to minimize.
[2024-05-24 19:08:48] [INFO ] Deduced a trap composed of 71 places in 580 ms of which 6 ms to minimize.
[2024-05-24 19:08:48] [INFO ] Deduced a trap composed of 57 places in 576 ms of which 6 ms to minimize.
[2024-05-24 19:08:49] [INFO ] Deduced a trap composed of 62 places in 578 ms of which 6 ms to minimize.
[2024-05-24 19:08:50] [INFO ] Deduced a trap composed of 83 places in 599 ms of which 5 ms to minimize.
[2024-05-24 19:08:50] [INFO ] Deduced a trap composed of 88 places in 588 ms of which 6 ms to minimize.
[2024-05-24 19:08:51] [INFO ] Deduced a trap composed of 130 places in 587 ms of which 6 ms to minimize.
[2024-05-24 19:08:51] [INFO ] Deduced a trap composed of 66 places in 579 ms of which 6 ms to minimize.
[2024-05-24 19:08:52] [INFO ] Deduced a trap composed of 78 places in 622 ms of which 6 ms to minimize.
[2024-05-24 19:08:53] [INFO ] Deduced a trap composed of 79 places in 579 ms of which 6 ms to minimize.
[2024-05-24 19:08:53] [INFO ] Deduced a trap composed of 83 places in 574 ms of which 5 ms to minimize.
[2024-05-24 19:08:54] [INFO ] Deduced a trap composed of 83 places in 579 ms of which 6 ms to minimize.
[2024-05-24 19:08:54] [INFO ] Deduced a trap composed of 74 places in 578 ms of which 5 ms to minimize.
[2024-05-24 19:08:55] [INFO ] Deduced a trap composed of 73 places in 574 ms of which 6 ms to minimize.
[2024-05-24 19:08:56] [INFO ] Deduced a trap composed of 87 places in 573 ms of which 6 ms to minimize.
[2024-05-24 19:08:56] [INFO ] Deduced a trap composed of 87 places in 564 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/936 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:08:57] [INFO ] Deduced a trap composed of 87 places in 575 ms of which 6 ms to minimize.
[2024-05-24 19:08:57] [INFO ] Deduced a trap composed of 80 places in 572 ms of which 5 ms to minimize.
[2024-05-24 19:08:58] [INFO ] Deduced a trap composed of 59 places in 557 ms of which 6 ms to minimize.
[2024-05-24 19:08:59] [INFO ] Deduced a trap composed of 108 places in 577 ms of which 6 ms to minimize.
[2024-05-24 19:08:59] [INFO ] Deduced a trap composed of 89 places in 572 ms of which 5 ms to minimize.
[2024-05-24 19:09:00] [INFO ] Deduced a trap composed of 79 places in 579 ms of which 6 ms to minimize.
[2024-05-24 19:09:00] [INFO ] Deduced a trap composed of 104 places in 557 ms of which 6 ms to minimize.
[2024-05-24 19:09:01] [INFO ] Deduced a trap composed of 75 places in 556 ms of which 6 ms to minimize.
[2024-05-24 19:09:02] [INFO ] Deduced a trap composed of 100 places in 584 ms of which 6 ms to minimize.
[2024-05-24 19:09:02] [INFO ] Deduced a trap composed of 75 places in 574 ms of which 5 ms to minimize.
[2024-05-24 19:09:03] [INFO ] Deduced a trap composed of 71 places in 581 ms of which 6 ms to minimize.
[2024-05-24 19:09:03] [INFO ] Deduced a trap composed of 74 places in 616 ms of which 5 ms to minimize.
[2024-05-24 19:09:04] [INFO ] Deduced a trap composed of 85 places in 605 ms of which 5 ms to minimize.
[2024-05-24 19:09:05] [INFO ] Deduced a trap composed of 97 places in 580 ms of which 5 ms to minimize.
[2024-05-24 19:09:05] [INFO ] Deduced a trap composed of 58 places in 570 ms of which 6 ms to minimize.
[2024-05-24 19:09:06] [INFO ] Deduced a trap composed of 75 places in 576 ms of which 6 ms to minimize.
[2024-05-24 19:09:06] [INFO ] Deduced a trap composed of 94 places in 566 ms of which 6 ms to minimize.
[2024-05-24 19:09:07] [INFO ] Deduced a trap composed of 56 places in 587 ms of which 6 ms to minimize.
[2024-05-24 19:09:08] [INFO ] Deduced a trap composed of 71 places in 596 ms of which 6 ms to minimize.
[2024-05-24 19:09:08] [INFO ] Deduced a trap composed of 71 places in 630 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/936 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:09:09] [INFO ] Deduced a trap composed of 90 places in 587 ms of which 6 ms to minimize.
[2024-05-24 19:09:10] [INFO ] Deduced a trap composed of 76 places in 589 ms of which 6 ms to minimize.
[2024-05-24 19:09:10] [INFO ] Deduced a trap composed of 89 places in 568 ms of which 6 ms to minimize.
[2024-05-24 19:09:11] [INFO ] Deduced a trap composed of 85 places in 601 ms of which 6 ms to minimize.
[2024-05-24 19:09:11] [INFO ] Deduced a trap composed of 93 places in 593 ms of which 6 ms to minimize.
[2024-05-24 19:09:12] [INFO ] Deduced a trap composed of 97 places in 575 ms of which 5 ms to minimize.
[2024-05-24 19:09:13] [INFO ] Deduced a trap composed of 56 places in 592 ms of which 6 ms to minimize.
[2024-05-24 19:09:13] [INFO ] Deduced a trap composed of 72 places in 620 ms of which 6 ms to minimize.
[2024-05-24 19:09:14] [INFO ] Deduced a trap composed of 90 places in 622 ms of which 6 ms to minimize.
[2024-05-24 19:09:15] [INFO ] Deduced a trap composed of 92 places in 644 ms of which 6 ms to minimize.
[2024-05-24 19:09:15] [INFO ] Deduced a trap composed of 98 places in 627 ms of which 6 ms to minimize.
SMT process timed out in 64047ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 118 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 978/978 places, 4273/4273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 115 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
[2024-05-24 19:09:15] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:09:15] [INFO ] Invariant cache hit.
[2024-05-24 19:09:17] [INFO ] Implicit Places using invariants in 1265 ms returned []
[2024-05-24 19:09:17] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:09:17] [INFO ] Invariant cache hit.
[2024-05-24 19:09:18] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:09:48] [INFO ] Performed 658/978 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:10:01] [INFO ] Implicit Places using invariants and state equation in 44348 ms returned []
Implicit Place search using SMT with State Equation took 45614 ms to find 0 implicit places.
[2024-05-24 19:10:01] [INFO ] Redundant transitions in 227 ms returned []
Running 4211 sub problems to find dead transitions.
[2024-05-24 19:10:01] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:10:01] [INFO ] Invariant cache hit.
[2024-05-24 19:10:01] [INFO ] State equation strengthened by 2722 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4211 unsolved
SMT process timed out in 64090ms, After SMT, problems are : Problem set: 0 solved, 4211 unsolved
Search for dead transitions found 0 dead transitions in 64133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110112 ms. Remains : 978/978 places, 4273/4273 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 10 factoid took 245 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 81 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 89 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1713 reset in 528 ms.
Product exploration explored 100000 steps with 1712 reset in 570 ms.
Built C files in :
/tmp/ltsmin13856810178944736396
[2024-05-24 19:11:07] [INFO ] Too many transitions (2532) to apply POR reductions. Disabling POR matrices.
[2024-05-24 19:11:07] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13856810178944736396
Running compilation step : cd /tmp/ltsmin13856810178944736396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13856810178944736396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13856810178944736396;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 1113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1112 transition count 2531
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1111 transition count 2530
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1111 transition count 2530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Applied a total of 6 rules in 204 ms. Remains 1110 /1113 variables (removed 3) and now considering 2522/2532 (removed 10) transitions.
[2024-05-24 19:11:10] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2024-05-24 19:11:10] [INFO ] Computed 49 invariants in 37 ms
[2024-05-24 19:11:11] [INFO ] Implicit Places using invariants in 984 ms returned []
[2024-05-24 19:11:11] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
[2024-05-24 19:11:11] [INFO ] Invariant cache hit.
[2024-05-24 19:11:12] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 19:11:23] [INFO ] Implicit Places using invariants and state equation in 11245 ms returned [1107]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12234 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1109/1113 places, 2522/2532 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1109 transition count 2521
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1108 transition count 2521
Applied a total of 2 rules in 77 ms. Remains 1108 /1109 variables (removed 1) and now considering 2521/2522 (removed 1) transitions.
[2024-05-24 19:11:23] [INFO ] Flow matrix only has 2249 transitions (discarded 272 similar events)
// Phase 1: matrix 2249 rows 1108 cols
[2024-05-24 19:11:23] [INFO ] Computed 48 invariants in 41 ms
[2024-05-24 19:11:24] [INFO ] Implicit Places using invariants in 990 ms returned []
[2024-05-24 19:11:24] [INFO ] Flow matrix only has 2249 transitions (discarded 272 similar events)
[2024-05-24 19:11:24] [INFO ] Invariant cache hit.
[2024-05-24 19:11:24] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 19:11:33] [INFO ] Implicit Places using invariants and state equation in 9820 ms returned []
Implicit Place search using SMT with State Equation took 10810 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1108/1113 places, 2521/2532 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 23325 ms. Remains : 1108/1113 places, 2521/2532 transitions.
Built C files in :
/tmp/ltsmin13182689249732807662
[2024-05-24 19:11:34] [INFO ] Too many transitions (2521) to apply POR reductions. Disabling POR matrices.
[2024-05-24 19:11:34] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13182689249732807662
Running compilation step : cd /tmp/ltsmin13182689249732807662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13182689249732807662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13182689249732807662;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 19:11:37] [INFO ] Flatten gal took : 71 ms
[2024-05-24 19:11:37] [INFO ] Flatten gal took : 60 ms
[2024-05-24 19:11:37] [INFO ] Time to serialize gal into /tmp/LTL10930685940167613689.gal : 13 ms
[2024-05-24 19:11:37] [INFO ] Time to serialize properties into /tmp/LTL8335121980678777395.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10930685940167613689.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6833486906045902284.hoa' '-atoms' '/tmp/LTL8335121980678777395.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8335121980678777395.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6833486906045902284.hoa
Detected timeout of ITS tools.
[2024-05-24 19:11:52] [INFO ] Flatten gal took : 51 ms
[2024-05-24 19:11:52] [INFO ] Flatten gal took : 53 ms
[2024-05-24 19:11:52] [INFO ] Time to serialize gal into /tmp/LTL14411424821383470682.gal : 11 ms
[2024-05-24 19:11:52] [INFO ] Time to serialize properties into /tmp/LTL10357230182318651945.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14411424821383470682.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10357230182318651945.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtTheLeftExtremityOfTheLeafSet<1))"))||(((X((G("((Node15ManageTheCrashOfNode2<1)||(Lx...583
Formula 0 simplified : G(F!"((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtTheLeftExtremityOfTheLeafSet<1))" & (!"(((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtThe...567
Detected timeout of ITS tools.
[2024-05-24 19:12:07] [INFO ] Flatten gal took : 53 ms
[2024-05-24 19:12:07] [INFO ] Applying decomposition
[2024-05-24 19:12:07] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14269625137756594106.txt' '-o' '/tmp/graph14269625137756594106.bin' '-w' '/tmp/graph14269625137756594106.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14269625137756594106.bin' '-l' '-1' '-v' '-w' '/tmp/graph14269625137756594106.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:12:07] [INFO ] Decomposing Gal with order
[2024-05-24 19:12:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:12:07] [INFO ] Removed a total of 2266 redundant transitions.
[2024-05-24 19:12:08] [INFO ] Flatten gal took : 197 ms
[2024-05-24 19:12:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 962 labels/synchronizations in 68 ms.
[2024-05-24 19:12:08] [INFO ] Time to serialize gal into /tmp/LTL17473496611386193159.gal : 29 ms
[2024-05-24 19:12:08] [INFO ] Time to serialize properties into /tmp/LTL18140358591654710525.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17473496611386193159.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18140358591654710525.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("((i3.i0.i0.u18.Node15ManageTheCrashOfNode2<1)||(i3.i0.i0.u19.Lx1IsAtTheLeftExtremityOfTheLeafSet<1))"))||(((X((G("((i3.i0.i0....738
Formula 0 simplified : G(F!"((i3.i0.i0.u18.Node15ManageTheCrashOfNode2<1)||(i3.i0.i0.u19.Lx1IsAtTheLeftExtremityOfTheLeafSet<1))" & (!"(((i3.i0.i0.u18.Node...722
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14 finished in 470157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((X(p0) U p0) U G((p1 U (X(p2)||p3)))))'
Support contains 7 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1280 transition count 2906
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1280 transition count 2906
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 63 place count 1263 transition count 2833
Iterating global reduction 0 with 17 rules applied. Total rules applied 80 place count 1263 transition count 2833
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 1254 transition count 2761
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 1254 transition count 2761
Applied a total of 98 rules in 146 ms. Remains 1254 /1303 variables (removed 49) and now considering 2761/2971 (removed 210) transitions.
[2024-05-24 19:12:23] [INFO ] Flow matrix only has 2489 transitions (discarded 272 similar events)
// Phase 1: matrix 2489 rows 1254 cols
[2024-05-24 19:12:23] [INFO ] Computed 66 invariants in 30 ms
[2024-05-24 19:12:24] [INFO ] Implicit Places using invariants in 1049 ms returned [12, 106, 392, 506, 537, 549, 559, 586, 718, 769, 803, 841, 886, 887, 991, 1044]
[2024-05-24 19:12:24] [INFO ] Actually due to overlaps returned [537, 12, 106, 392, 506, 559, 586, 718, 769, 803, 841, 886, 887, 991, 1044]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1054 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1239/1303 places, 2761/2971 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1225 transition count 2747
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1225 transition count 2747
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1211 transition count 2733
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1211 transition count 2733
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 1197 transition count 2719
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 1197 transition count 2719
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 1184 transition count 2615
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 1184 transition count 2615
Applied a total of 110 rules in 177 ms. Remains 1184 /1239 variables (removed 55) and now considering 2615/2761 (removed 146) transitions.
[2024-05-24 19:12:24] [INFO ] Flow matrix only has 2343 transitions (discarded 272 similar events)
// Phase 1: matrix 2343 rows 1184 cols
[2024-05-24 19:12:24] [INFO ] Computed 51 invariants in 26 ms
[2024-05-24 19:12:25] [INFO ] Implicit Places using invariants in 981 ms returned [532]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 983 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1183/1303 places, 2615/2971 transitions.
Applied a total of 0 rules in 33 ms. Remains 1183 /1183 variables (removed 0) and now considering 2615/2615 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2393 ms. Remains : 1183/1303 places, 2615/2971 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR p2 p3), (OR p3 p2), (OR (AND p0 p2) (AND p0 p3)), p2]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 704 ms.
Product exploration explored 100000 steps with 50000 reset in 685 ms.
Computed a total of 351 stabilizing places and 982 stable transitions
Computed a total of 351 stabilizing places and 982 stable transitions
Detected a total of 351/1183 stabilizing places and 982/2615 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 p3))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p1 (NOT p3) p2))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p3 p2))), (X (NOT p0)), (X (NOT (OR (AND (NOT p0) p1) p3))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT p0))), (X (X (NOT (OR (AND (NOT p0) p1) p3)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 26 factoid took 816 ms. Reduced automaton from 4 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-15 finished in 4795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1303 transition count 2945
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1277 transition count 2945
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 52 place count 1277 transition count 2917
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 108 place count 1249 transition count 2917
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 126 place count 1231 transition count 2850
Iterating global reduction 2 with 18 rules applied. Total rules applied 144 place count 1231 transition count 2850
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 144 place count 1231 transition count 2847
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 1228 transition count 2847
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 161 place count 1217 transition count 2780
Iterating global reduction 2 with 11 rules applied. Total rules applied 172 place count 1217 transition count 2780
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 175 place count 1214 transition count 2756
Iterating global reduction 2 with 3 rules applied. Total rules applied 178 place count 1214 transition count 2756
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 234 place count 1186 transition count 2728
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 240 place count 1180 transition count 2722
Iterating global reduction 2 with 6 rules applied. Total rules applied 246 place count 1180 transition count 2722
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 252 place count 1174 transition count 2674
Iterating global reduction 2 with 6 rules applied. Total rules applied 258 place count 1174 transition count 2674
Applied a total of 258 rules in 328 ms. Remains 1174 /1303 variables (removed 129) and now considering 2674/2971 (removed 297) transitions.
[2024-05-24 19:12:28] [INFO ] Flow matrix only has 2402 transitions (discarded 272 similar events)
// Phase 1: matrix 2402 rows 1174 cols
[2024-05-24 19:12:28] [INFO ] Computed 66 invariants in 31 ms
[2024-05-24 19:12:29] [INFO ] Implicit Places using invariants in 1020 ms returned [9, 358, 470, 500, 511, 521, 546, 569, 668, 717, 751, 785, 830, 831, 931, 982]
[2024-05-24 19:12:29] [INFO ] Actually due to overlaps returned [500, 9, 358, 470, 521, 546, 569, 668, 717, 751, 785, 830, 831, 931, 982]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1022 ms to find 15 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1159/1303 places, 2674/2971 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1151 transition count 2666
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1151 transition count 2666
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1143 transition count 2658
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1143 transition count 2658
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1136 transition count 2602
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1136 transition count 2602
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 58 place count 1130 transition count 2596
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 1124 transition count 2590
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 1124 transition count 2590
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 1118 transition count 2542
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 1118 transition count 2542
Applied a total of 82 rules in 268 ms. Remains 1118 /1159 variables (removed 41) and now considering 2542/2674 (removed 132) transitions.
[2024-05-24 19:12:29] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1118 cols
[2024-05-24 19:12:29] [INFO ] Computed 51 invariants in 24 ms
[2024-05-24 19:12:30] [INFO ] Implicit Places using invariants in 947 ms returned [501]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 948 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1117/1303 places, 2542/2971 transitions.
Applied a total of 0 rules in 44 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2610 ms. Remains : 1117/1303 places, 2542/2971 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06
Product exploration explored 100000 steps with 1715 reset in 459 ms.
Product exploration explored 100000 steps with 1709 reset in 531 ms.
Computed a total of 302 stabilizing places and 926 stable transitions
Computed a total of 302 stabilizing places and 926 stable transitions
Detected a total of 302/1117 stabilizing places and 926/2542 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 31112 steps (530 resets) in 298 ms. (104 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1117/1117 places, 2542/2542 transitions.
Applied a total of 0 rules in 49 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2024-05-24 19:12:32] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1117 cols
[2024-05-24 19:12:32] [INFO ] Computed 50 invariants in 19 ms
[2024-05-24 19:12:33] [INFO ] Implicit Places using invariants in 933 ms returned []
[2024-05-24 19:12:33] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 19:12:33] [INFO ] Invariant cache hit.
[2024-05-24 19:12:34] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-24 19:12:44] [INFO ] Implicit Places using invariants and state equation in 10185 ms returned []
Implicit Place search using SMT with State Equation took 11127 ms to find 0 implicit places.
Running 2525 sub problems to find dead transitions.
[2024-05-24 19:12:44] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 19:12:44] [INFO ] Invariant cache hit.
[2024-05-24 19:12:44] [INFO ] State equation strengthened by 853 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1115 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2525 unsolved
SMT process timed out in 32836ms, After SMT, problems are : Problem set: 0 solved, 2525 unsolved
Search for dead transitions found 0 dead transitions in 32858ms
Finished structural reductions in LTL mode , in 1 iterations and 44047 ms. Remains : 1117/1117 places, 2542/2542 transitions.
Computed a total of 302 stabilizing places and 926 stable transitions
Computed a total of 302 stabilizing places and 926 stable transitions
Detected a total of 302/1117 stabilizing places and 926/2542 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 29153 steps (495 resets) in 268 ms. (108 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1710 reset in 499 ms.
Product exploration explored 100000 steps with 1709 reset in 519 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1117/1117 places, 2542/2542 transitions.
Applied a total of 0 rules in 65 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2024-05-24 19:13:19] [INFO ] Redundant transitions in 77 ms returned []
Running 2525 sub problems to find dead transitions.
[2024-05-24 19:13:19] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 19:13:19] [INFO ] Invariant cache hit.
[2024-05-24 19:13:19] [INFO ] State equation strengthened by 853 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1115 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2525 unsolved
SMT process timed out in 32965ms, After SMT, problems are : Problem set: 0 solved, 2525 unsolved
Search for dead transitions found 0 dead transitions in 32987ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33141 ms. Remains : 1117/1117 places, 2542/2542 transitions.
Built C files in :
/tmp/ltsmin4527109597889043123
[2024-05-24 19:13:52] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4527109597889043123
Running compilation step : cd /tmp/ltsmin4527109597889043123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4527109597889043123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4527109597889043123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 1117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1117/1117 places, 2542/2542 transitions.
Applied a total of 0 rules in 42 ms. Remains 1117 /1117 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2024-05-24 19:13:55] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 19:13:55] [INFO ] Invariant cache hit.
[2024-05-24 19:13:56] [INFO ] Implicit Places using invariants in 958 ms returned []
[2024-05-24 19:13:56] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 19:13:56] [INFO ] Invariant cache hit.
[2024-05-24 19:13:57] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-24 19:14:06] [INFO ] Implicit Places using invariants and state equation in 10398 ms returned []
Implicit Place search using SMT with State Equation took 11356 ms to find 0 implicit places.
Running 2525 sub problems to find dead transitions.
[2024-05-24 19:14:06] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 19:14:06] [INFO ] Invariant cache hit.
[2024-05-24 19:14:06] [INFO ] State equation strengthened by 853 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 1.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1115 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2525 unsolved
SMT process timed out in 32853ms, After SMT, problems are : Problem set: 0 solved, 2525 unsolved
Search for dead transitions found 0 dead transitions in 32878ms
Finished structural reductions in LTL mode , in 1 iterations and 44281 ms. Remains : 1117/1117 places, 2542/2542 transitions.
Built C files in :
/tmp/ltsmin11188302104411492988
[2024-05-24 19:14:39] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11188302104411492988
Running compilation step : cd /tmp/ltsmin11188302104411492988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11188302104411492988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11188302104411492988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 19:14:42] [INFO ] Flatten gal took : 51 ms
[2024-05-24 19:14:42] [INFO ] Flatten gal took : 52 ms
[2024-05-24 19:14:42] [INFO ] Time to serialize gal into /tmp/LTL15525456530278806642.gal : 11 ms
[2024-05-24 19:14:42] [INFO ] Time to serialize properties into /tmp/LTL10231952035929456456.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15525456530278806642.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3271262018149282207.hoa' '-atoms' '/tmp/LTL10231952035929456456.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10231952035929456456.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3271262018149282207.hoa
Detected timeout of ITS tools.
[2024-05-24 19:14:57] [INFO ] Flatten gal took : 53 ms
[2024-05-24 19:14:58] [INFO ] Flatten gal took : 55 ms
[2024-05-24 19:14:58] [INFO ] Time to serialize gal into /tmp/LTL447857906016663132.gal : 12 ms
[2024-05-24 19:14:58] [INFO ] Time to serialize properties into /tmp/LTL18187977480051468851.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL447857906016663132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18187977480051468851.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(LeafSetOfRx3IsSentToNode0<1))")))||(G("((Node4ManageTheCrashOfNode3<1)...204
Formula 0 simplified : XX(GF!"((Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(LeafSetOfRx3IsSentToNode0<1))" & F!"((Node4ManageTheCrashOfNode3<1)||(Lx0I...192
Detected timeout of ITS tools.
[2024-05-24 19:15:13] [INFO ] Flatten gal took : 48 ms
[2024-05-24 19:15:13] [INFO ] Applying decomposition
[2024-05-24 19:15:13] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9205462808633688230.txt' '-o' '/tmp/graph9205462808633688230.bin' '-w' '/tmp/graph9205462808633688230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9205462808633688230.bin' '-l' '-1' '-v' '-w' '/tmp/graph9205462808633688230.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:15:13] [INFO ] Decomposing Gal with order
[2024-05-24 19:15:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:15:13] [INFO ] Removed a total of 3374 redundant transitions.
[2024-05-24 19:15:13] [INFO ] Flatten gal took : 119 ms
[2024-05-24 19:15:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1670 labels/synchronizations in 70 ms.
[2024-05-24 19:15:13] [INFO ] Time to serialize gal into /tmp/LTL13290514179413931213.gal : 18 ms
[2024-05-24 19:15:13] [INFO ] Time to serialize properties into /tmp/LTL2011778470939008857.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13290514179413931213.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2011778470939008857.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((i2.i2.u182.Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(i2.i2.u182.LeafSetOfRx3IsSentToNode0<1))")))||(G("((i2.i4.u...246
Formula 0 simplified : XX(GF!"((i2.i2.u182.Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(i2.i2.u182.LeafSetOfRx3IsSentToNode0<1))" & F!"((i2.i4.u70.Node...234
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-06 finished in 180665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((p1||G(F(p2))))||p0))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1303 transition count 2945
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1277 transition count 2945
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 52 place count 1277 transition count 2917
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 108 place count 1249 transition count 2917
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 127 place count 1230 transition count 2842
Iterating global reduction 2 with 19 rules applied. Total rules applied 146 place count 1230 transition count 2842
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 146 place count 1230 transition count 2839
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 152 place count 1227 transition count 2839
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 163 place count 1216 transition count 2772
Iterating global reduction 2 with 11 rules applied. Total rules applied 174 place count 1216 transition count 2772
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 177 place count 1213 transition count 2748
Iterating global reduction 2 with 3 rules applied. Total rules applied 180 place count 1213 transition count 2748
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 232 place count 1187 transition count 2722
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 238 place count 1181 transition count 2716
Iterating global reduction 2 with 6 rules applied. Total rules applied 244 place count 1181 transition count 2716
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 250 place count 1175 transition count 2668
Iterating global reduction 2 with 6 rules applied. Total rules applied 256 place count 1175 transition count 2668
Applied a total of 256 rules in 315 ms. Remains 1175 /1303 variables (removed 128) and now considering 2668/2971 (removed 303) transitions.
[2024-05-24 19:15:29] [INFO ] Flow matrix only has 2396 transitions (discarded 272 similar events)
// Phase 1: matrix 2396 rows 1175 cols
[2024-05-24 19:15:29] [INFO ] Computed 66 invariants in 25 ms
[2024-05-24 19:15:30] [INFO ] Implicit Places using invariants in 986 ms returned [9, 95, 355, 466, 496, 507, 517, 542, 565, 665, 714, 748, 830, 831, 932, 983]
[2024-05-24 19:15:30] [INFO ] Actually due to overlaps returned [496, 9, 95, 355, 466, 517, 542, 565, 665, 714, 748, 830, 831, 932, 983]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 990 ms to find 15 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1160/1303 places, 2668/2971 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1152 transition count 2660
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1152 transition count 2660
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1144 transition count 2652
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1144 transition count 2652
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1137 transition count 2596
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1137 transition count 2596
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 58 place count 1131 transition count 2590
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 1125 transition count 2584
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 1125 transition count 2584
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 1119 transition count 2536
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 1119 transition count 2536
Applied a total of 82 rules in 369 ms. Remains 1119 /1160 variables (removed 41) and now considering 2536/2668 (removed 132) transitions.
[2024-05-24 19:15:30] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
// Phase 1: matrix 2264 rows 1119 cols
[2024-05-24 19:15:30] [INFO ] Computed 51 invariants in 31 ms
[2024-05-24 19:15:31] [INFO ] Implicit Places using invariants in 1023 ms returned [494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1028 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1118/1303 places, 2536/2971 transitions.
Applied a total of 0 rules in 43 ms. Remains 1118 /1118 variables (removed 0) and now considering 2536/2536 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2747 ms. Remains : 1118/1303 places, 2536/2971 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10
Product exploration explored 100000 steps with 1713 reset in 499 ms.
Product exploration explored 100000 steps with 1714 reset in 514 ms.
Computed a total of 301 stabilizing places and 918 stable transitions
Computed a total of 301 stabilizing places and 918 stable transitions
Detected a total of 301/1118 stabilizing places and 918/2536 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 168 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (682 resets) in 1416 ms. (28 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (148 resets) in 381 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (148 resets) in 357 ms. (111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (148 resets) in 291 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (148 resets) in 308 ms. (129 steps per ms) remains 4/4 properties
[2024-05-24 19:15:33] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
// Phase 1: matrix 2264 rows 1118 cols
[2024-05-24 19:15:33] [INFO ] Computed 50 invariants in 19 ms
[2024-05-24 19:15:33] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1035/1043 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1043 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/1045 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1045 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 33/1078 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/1102 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1102 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 16/1118 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1118 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2264/3382 variables, 1118/1168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3382 variables, 846/2014 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3382 variables, 0/2014 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/3382 variables, 0/2014 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3382/3382 variables, and 2014 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1550 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 1118/1118 constraints, ReadFeed: 846/846 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1035/1043 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:15:36] [INFO ] Deduced a trap composed of 114 places in 456 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1043 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1043 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/1045 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1045 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 33/1078 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:15:36] [INFO ] Deduced a trap composed of 47 places in 491 ms of which 6 ms to minimize.
[2024-05-24 19:15:37] [INFO ] Deduced a trap composed of 90 places in 491 ms of which 7 ms to minimize.
[2024-05-24 19:15:37] [INFO ] Deduced a trap composed of 120 places in 483 ms of which 8 ms to minimize.
[2024-05-24 19:15:38] [INFO ] Deduced a trap composed of 182 places in 457 ms of which 6 ms to minimize.
[2024-05-24 19:15:38] [INFO ] Deduced a trap composed of 110 places in 435 ms of which 7 ms to minimize.
[2024-05-24 19:15:39] [INFO ] Deduced a trap composed of 74 places in 456 ms of which 8 ms to minimize.
[2024-05-24 19:15:39] [INFO ] Deduced a trap composed of 92 places in 484 ms of which 7 ms to minimize.
[2024-05-24 19:15:40] [INFO ] Deduced a trap composed of 173 places in 482 ms of which 7 ms to minimize.
[2024-05-24 19:15:40] [INFO ] Deduced a trap composed of 61 places in 500 ms of which 7 ms to minimize.
SMT process timed out in 7003ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 1118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1118/1118 places, 2536/2536 transitions.
Free-agglomeration rule (complex) applied 119 times.
Iterating global reduction 0 with 119 rules applied. Total rules applied 119 place count 1118 transition count 4293
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 238 place count 999 transition count 4293
Applied a total of 238 rules in 212 ms. Remains 999 /1118 variables (removed 119) and now considering 4293/2536 (removed -1757) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 999/1118 places, 4293/2536 transitions.
RANDOM walk for 40000 steps (839 resets) in 1868 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (117 resets) in 281 ms. (141 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (132 resets) in 391 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (132 resets) in 396 ms. (100 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (132 resets) in 383 ms. (104 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 55711 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 4
Probabilistic random walk after 55711 steps, saw 23536 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-24 19:15:45] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
// Phase 1: matrix 3909 rows 999 cols
[2024-05-24 19:15:45] [INFO ] Computed 50 invariants in 26 ms
[2024-05-24 19:15:45] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 645/653 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/655 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/655 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 304/959 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/959 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/983 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/983 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 16/999 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/999 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3909/4908 variables, 999/1049 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4908 variables, 2722/3771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4908 variables, 0/3771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/4908 variables, 0/3771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4908/4908 variables, and 3771 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2188 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 999/999 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 645/653 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/655 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/655 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 304/959 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:15:48] [INFO ] Deduced a trap composed of 5 places in 676 ms of which 7 ms to minimize.
[2024-05-24 19:15:48] [INFO ] Deduced a trap composed of 76 places in 667 ms of which 6 ms to minimize.
[2024-05-24 19:15:49] [INFO ] Deduced a trap composed of 67 places in 678 ms of which 7 ms to minimize.
[2024-05-24 19:15:50] [INFO ] Deduced a trap composed of 65 places in 652 ms of which 6 ms to minimize.
[2024-05-24 19:15:51] [INFO ] Deduced a trap composed of 69 places in 671 ms of which 6 ms to minimize.
[2024-05-24 19:15:51] [INFO ] Deduced a trap composed of 76 places in 662 ms of which 7 ms to minimize.
[2024-05-24 19:15:52] [INFO ] Deduced a trap composed of 90 places in 663 ms of which 6 ms to minimize.
[2024-05-24 19:15:53] [INFO ] Deduced a trap composed of 166 places in 663 ms of which 6 ms to minimize.
[2024-05-24 19:15:53] [INFO ] Deduced a trap composed of 73 places in 692 ms of which 7 ms to minimize.
[2024-05-24 19:15:54] [INFO ] Deduced a trap composed of 182 places in 571 ms of which 6 ms to minimize.
[2024-05-24 19:15:55] [INFO ] Deduced a trap composed of 185 places in 608 ms of which 6 ms to minimize.
[2024-05-24 19:15:55] [INFO ] Deduced a trap composed of 186 places in 623 ms of which 6 ms to minimize.
[2024-05-24 19:15:56] [INFO ] Deduced a trap composed of 67 places in 674 ms of which 6 ms to minimize.
[2024-05-24 19:15:57] [INFO ] Deduced a trap composed of 68 places in 690 ms of which 6 ms to minimize.
[2024-05-24 19:15:57] [INFO ] Deduced a trap composed of 72 places in 679 ms of which 6 ms to minimize.
[2024-05-24 19:15:58] [INFO ] Deduced a trap composed of 72 places in 669 ms of which 6 ms to minimize.
[2024-05-24 19:15:59] [INFO ] Deduced a trap composed of 71 places in 666 ms of which 6 ms to minimize.
[2024-05-24 19:15:59] [INFO ] Deduced a trap composed of 61 places in 649 ms of which 6 ms to minimize.
[2024-05-24 19:16:00] [INFO ] Deduced a trap composed of 132 places in 615 ms of which 6 ms to minimize.
[2024-05-24 19:16:01] [INFO ] Deduced a trap composed of 81 places in 610 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/959 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:16:01] [INFO ] Deduced a trap composed of 27 places in 626 ms of which 6 ms to minimize.
[2024-05-24 19:16:02] [INFO ] Deduced a trap composed of 87 places in 637 ms of which 6 ms to minimize.
[2024-05-24 19:16:03] [INFO ] Deduced a trap composed of 65 places in 628 ms of which 6 ms to minimize.
[2024-05-24 19:16:03] [INFO ] Deduced a trap composed of 56 places in 634 ms of which 6 ms to minimize.
[2024-05-24 19:16:04] [INFO ] Deduced a trap composed of 56 places in 635 ms of which 6 ms to minimize.
[2024-05-24 19:16:04] [INFO ] Deduced a trap composed of 74 places in 627 ms of which 6 ms to minimize.
[2024-05-24 19:16:05] [INFO ] Deduced a trap composed of 27 places in 609 ms of which 6 ms to minimize.
[2024-05-24 19:16:06] [INFO ] Deduced a trap composed of 56 places in 624 ms of which 6 ms to minimize.
[2024-05-24 19:16:06] [INFO ] Deduced a trap composed of 56 places in 621 ms of which 6 ms to minimize.
[2024-05-24 19:16:07] [INFO ] Deduced a trap composed of 57 places in 604 ms of which 5 ms to minimize.
[2024-05-24 19:16:08] [INFO ] Deduced a trap composed of 68 places in 627 ms of which 5 ms to minimize.
[2024-05-24 19:16:08] [INFO ] Deduced a trap composed of 95 places in 628 ms of which 5 ms to minimize.
[2024-05-24 19:16:09] [INFO ] Deduced a trap composed of 92 places in 620 ms of which 6 ms to minimize.
[2024-05-24 19:16:10] [INFO ] Deduced a trap composed of 77 places in 632 ms of which 5 ms to minimize.
[2024-05-24 19:16:10] [INFO ] Deduced a trap composed of 70 places in 628 ms of which 6 ms to minimize.
[2024-05-24 19:16:11] [INFO ] Deduced a trap composed of 73 places in 634 ms of which 6 ms to minimize.
[2024-05-24 19:16:12] [INFO ] Deduced a trap composed of 97 places in 616 ms of which 6 ms to minimize.
[2024-05-24 19:16:12] [INFO ] Deduced a trap composed of 56 places in 621 ms of which 6 ms to minimize.
[2024-05-24 19:16:13] [INFO ] Deduced a trap composed of 86 places in 624 ms of which 6 ms to minimize.
[2024-05-24 19:16:13] [INFO ] Deduced a trap composed of 81 places in 560 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/959 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:16:14] [INFO ] Deduced a trap composed of 87 places in 630 ms of which 6 ms to minimize.
[2024-05-24 19:16:15] [INFO ] Deduced a trap composed of 85 places in 638 ms of which 6 ms to minimize.
[2024-05-24 19:16:15] [INFO ] Deduced a trap composed of 76 places in 633 ms of which 7 ms to minimize.
[2024-05-24 19:16:16] [INFO ] Deduced a trap composed of 58 places in 676 ms of which 6 ms to minimize.
[2024-05-24 19:16:17] [INFO ] Deduced a trap composed of 223 places in 674 ms of which 6 ms to minimize.
[2024-05-24 19:16:17] [INFO ] Deduced a trap composed of 57 places in 618 ms of which 6 ms to minimize.
[2024-05-24 19:16:18] [INFO ] Deduced a trap composed of 86 places in 650 ms of which 6 ms to minimize.
[2024-05-24 19:16:19] [INFO ] Deduced a trap composed of 55 places in 674 ms of which 6 ms to minimize.
[2024-05-24 19:16:19] [INFO ] Deduced a trap composed of 93 places in 642 ms of which 6 ms to minimize.
[2024-05-24 19:16:20] [INFO ] Deduced a trap composed of 208 places in 667 ms of which 6 ms to minimize.
[2024-05-24 19:16:21] [INFO ] Deduced a trap composed of 55 places in 672 ms of which 6 ms to minimize.
[2024-05-24 19:16:21] [INFO ] Deduced a trap composed of 212 places in 672 ms of which 6 ms to minimize.
[2024-05-24 19:16:22] [INFO ] Deduced a trap composed of 61 places in 680 ms of which 6 ms to minimize.
[2024-05-24 19:16:23] [INFO ] Deduced a trap composed of 79 places in 632 ms of which 6 ms to minimize.
[2024-05-24 19:16:24] [INFO ] Deduced a trap composed of 60 places in 645 ms of which 6 ms to minimize.
[2024-05-24 19:16:24] [INFO ] Deduced a trap composed of 86 places in 642 ms of which 6 ms to minimize.
[2024-05-24 19:16:25] [INFO ] Deduced a trap composed of 186 places in 662 ms of which 6 ms to minimize.
[2024-05-24 19:16:26] [INFO ] Deduced a trap composed of 66 places in 644 ms of which 7 ms to minimize.
[2024-05-24 19:16:26] [INFO ] Deduced a trap composed of 186 places in 661 ms of which 6 ms to minimize.
[2024-05-24 19:16:27] [INFO ] Deduced a trap composed of 55 places in 640 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/959 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:16:28] [INFO ] Deduced a trap composed of 88 places in 640 ms of which 6 ms to minimize.
[2024-05-24 19:16:28] [INFO ] Deduced a trap composed of 75 places in 628 ms of which 5 ms to minimize.
[2024-05-24 19:16:29] [INFO ] Deduced a trap composed of 97 places in 648 ms of which 7 ms to minimize.
[2024-05-24 19:16:30] [INFO ] Deduced a trap composed of 75 places in 649 ms of which 6 ms to minimize.
[2024-05-24 19:16:30] [INFO ] Deduced a trap composed of 77 places in 646 ms of which 6 ms to minimize.
[2024-05-24 19:16:31] [INFO ] Deduced a trap composed of 100 places in 632 ms of which 6 ms to minimize.
[2024-05-24 19:16:31] [INFO ] Deduced a trap composed of 194 places in 630 ms of which 6 ms to minimize.
[2024-05-24 19:16:32] [INFO ] Deduced a trap composed of 62 places in 626 ms of which 6 ms to minimize.
SMT process timed out in 47560ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 999 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 4293/4293 transitions.
Applied a total of 0 rules in 119 ms. Remains 999 /999 variables (removed 0) and now considering 4293/4293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 999/999 places, 4293/4293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 999/999 places, 4293/4293 transitions.
Applied a total of 0 rules in 115 ms. Remains 999 /999 variables (removed 0) and now considering 4293/4293 (removed 0) transitions.
[2024-05-24 19:16:32] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-24 19:16:32] [INFO ] Invariant cache hit.
[2024-05-24 19:16:34] [INFO ] Implicit Places using invariants in 1304 ms returned []
[2024-05-24 19:16:34] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-24 19:16:34] [INFO ] Invariant cache hit.
[2024-05-24 19:16:35] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:17:05] [INFO ] Performed 696/999 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:17:19] [INFO ] Implicit Places using invariants and state equation in 44822 ms returned []
Implicit Place search using SMT with State Equation took 46126 ms to find 0 implicit places.
[2024-05-24 19:17:19] [INFO ] Redundant transitions in 227 ms returned []
Running 4231 sub problems to find dead transitions.
[2024-05-24 19:17:19] [INFO ] Flow matrix only has 3909 transitions (discarded 384 similar events)
[2024-05-24 19:17:19] [INFO ] Invariant cache hit.
[2024-05-24 19:17:19] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4231 unsolved
SMT process timed out in 61557ms, After SMT, problems are : Problem set: 0 solved, 4231 unsolved
Search for dead transitions found 0 dead transitions in 61594ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108077 ms. Remains : 999/999 places, 4293/4293 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 15 factoid took 310 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 1118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1118/1118 places, 2536/2536 transitions.
Applied a total of 0 rules in 67 ms. Remains 1118 /1118 variables (removed 0) and now considering 2536/2536 (removed 0) transitions.
[2024-05-24 19:18:21] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
// Phase 1: matrix 2264 rows 1118 cols
[2024-05-24 19:18:21] [INFO ] Computed 50 invariants in 18 ms
[2024-05-24 19:18:22] [INFO ] Implicit Places using invariants in 913 ms returned []
[2024-05-24 19:18:22] [INFO ] Flow matrix only has 2264 transitions (discarded 272 similar events)
[2024-05-24 19:18:22] [INFO ] Invariant cache hit.
[2024-05-24 19:18:23] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-24 19:18:32] [INFO ] Implicit Places using invariants and state equation in 9662 ms returned [1111]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10576 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1117/1118 places, 2536/2536 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1117 transition count 2535
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1116 transition count 2535
Applied a total of 2 rules in 71 ms. Remains 1116 /1117 variables (removed 1) and now considering 2535/2536 (removed 1) transitions.
[2024-05-24 19:18:32] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1116 cols
[2024-05-24 19:18:32] [INFO ] Computed 49 invariants in 27 ms
[2024-05-24 19:18:33] [INFO ] Implicit Places using invariants in 917 ms returned []
[2024-05-24 19:18:33] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 19:18:33] [INFO ] Invariant cache hit.
[2024-05-24 19:18:33] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-24 19:18:43] [INFO ] Implicit Places using invariants and state equation in 10819 ms returned []
Implicit Place search using SMT with State Equation took 11738 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1116/1118 places, 2535/2536 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22452 ms. Remains : 1116/1118 places, 2535/2536 transitions.
Computed a total of 299 stabilizing places and 917 stable transitions
Computed a total of 299 stabilizing places and 917 stable transitions
Detected a total of 299/1116 stabilizing places and 917/2535 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND p0 (NOT p1))), (X (AND (NOT p2) p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 185 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (684 resets) in 1291 ms. (30 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (148 resets) in 353 ms. (113 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (148 resets) in 363 ms. (109 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (148 resets) in 463 ms. (86 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (148 resets) in 381 ms. (104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (148 resets) in 415 ms. (96 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (148 resets) in 393 ms. (101 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (148 resets) in 233 ms. (170 steps per ms) remains 4/8 properties
[2024-05-24 19:18:45] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 19:18:45] [INFO ] Invariant cache hit.
[2024-05-24 19:18:45] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1034/1042 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1042 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/1044 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1044 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 33/1077 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/1101 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1101 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 15/1116 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1116 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2263/3379 variables, 1116/1165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3379 variables, 846/2011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3379 variables, 0/2011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/3379 variables, 0/2011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3379/3379 variables, and 2011 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1579 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1116/1116 constraints, ReadFeed: 846/846 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1034/1042 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:18:47] [INFO ] Deduced a trap composed of 133 places in 433 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1042 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1042 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/1044 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1044 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 33/1077 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:18:48] [INFO ] Deduced a trap composed of 98 places in 441 ms of which 7 ms to minimize.
[2024-05-24 19:18:48] [INFO ] Deduced a trap composed of 47 places in 450 ms of which 7 ms to minimize.
[2024-05-24 19:18:49] [INFO ] Deduced a trap composed of 71 places in 464 ms of which 6 ms to minimize.
[2024-05-24 19:18:49] [INFO ] Deduced a trap composed of 93 places in 461 ms of which 7 ms to minimize.
[2024-05-24 19:18:50] [INFO ] Deduced a trap composed of 65 places in 454 ms of which 7 ms to minimize.
[2024-05-24 19:18:50] [INFO ] Deduced a trap composed of 63 places in 485 ms of which 6 ms to minimize.
[2024-05-24 19:18:51] [INFO ] Deduced a trap composed of 230 places in 435 ms of which 6 ms to minimize.
[2024-05-24 19:18:51] [INFO ] Deduced a trap composed of 155 places in 419 ms of which 6 ms to minimize.
[2024-05-24 19:18:52] [INFO ] Deduced a trap composed of 88 places in 465 ms of which 7 ms to minimize.
SMT process timed out in 6716ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 8 out of 1116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1116/1116 places, 2535/2535 transitions.
Free-agglomeration rule (complex) applied 119 times.
Iterating global reduction 0 with 119 rules applied. Total rules applied 119 place count 1116 transition count 4292
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 238 place count 997 transition count 4292
Applied a total of 238 rules in 217 ms. Remains 997 /1116 variables (removed 119) and now considering 4292/2535 (removed -1757) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 997/1116 places, 4292/2535 transitions.
RANDOM walk for 40000 steps (839 resets) in 1920 ms. (20 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (120 resets) in 343 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (132 resets) in 350 ms. (113 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (132 resets) in 423 ms. (94 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (132 resets) in 351 ms. (113 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 55932 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 4
Probabilistic random walk after 55932 steps, saw 23624 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-24 19:18:56] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
// Phase 1: matrix 3908 rows 997 cols
[2024-05-24 19:18:56] [INFO ] Computed 49 invariants in 30 ms
[2024-05-24 19:18:56] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 644/652 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/652 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/654 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 304/958 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/958 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 24/982 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/982 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 15/997 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/997 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3908/4905 variables, 997/1046 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4905 variables, 2722/3768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4905 variables, 0/3768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/4905 variables, 0/3768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4905/4905 variables, and 3768 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2195 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 997/997 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 644/652 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/652 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/654 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 304/958 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:18:59] [INFO ] Deduced a trap composed of 65 places in 638 ms of which 6 ms to minimize.
[2024-05-24 19:19:00] [INFO ] Deduced a trap composed of 56 places in 630 ms of which 6 ms to minimize.
[2024-05-24 19:19:00] [INFO ] Deduced a trap composed of 57 places in 624 ms of which 6 ms to minimize.
[2024-05-24 19:19:01] [INFO ] Deduced a trap composed of 73 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:19:02] [INFO ] Deduced a trap composed of 5 places in 587 ms of which 6 ms to minimize.
[2024-05-24 19:19:02] [INFO ] Deduced a trap composed of 68 places in 578 ms of which 6 ms to minimize.
[2024-05-24 19:19:03] [INFO ] Deduced a trap composed of 90 places in 601 ms of which 6 ms to minimize.
[2024-05-24 19:19:03] [INFO ] Deduced a trap composed of 71 places in 576 ms of which 5 ms to minimize.
[2024-05-24 19:19:04] [INFO ] Deduced a trap composed of 69 places in 572 ms of which 5 ms to minimize.
[2024-05-24 19:19:05] [INFO ] Deduced a trap composed of 78 places in 583 ms of which 6 ms to minimize.
[2024-05-24 19:19:05] [INFO ] Deduced a trap composed of 81 places in 595 ms of which 5 ms to minimize.
[2024-05-24 19:19:06] [INFO ] Deduced a trap composed of 67 places in 581 ms of which 6 ms to minimize.
[2024-05-24 19:19:06] [INFO ] Deduced a trap composed of 59 places in 581 ms of which 6 ms to minimize.
[2024-05-24 19:19:07] [INFO ] Deduced a trap composed of 59 places in 613 ms of which 6 ms to minimize.
[2024-05-24 19:19:08] [INFO ] Deduced a trap composed of 71 places in 568 ms of which 5 ms to minimize.
[2024-05-24 19:19:08] [INFO ] Deduced a trap composed of 130 places in 615 ms of which 6 ms to minimize.
[2024-05-24 19:19:09] [INFO ] Deduced a trap composed of 98 places in 582 ms of which 6 ms to minimize.
[2024-05-24 19:19:10] [INFO ] Deduced a trap composed of 78 places in 573 ms of which 6 ms to minimize.
[2024-05-24 19:19:10] [INFO ] Deduced a trap composed of 71 places in 572 ms of which 5 ms to minimize.
[2024-05-24 19:19:11] [INFO ] Deduced a trap composed of 74 places in 575 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/958 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:19:11] [INFO ] Deduced a trap composed of 73 places in 573 ms of which 5 ms to minimize.
[2024-05-24 19:19:12] [INFO ] Deduced a trap composed of 80 places in 576 ms of which 5 ms to minimize.
[2024-05-24 19:19:13] [INFO ] Deduced a trap composed of 85 places in 562 ms of which 5 ms to minimize.
[2024-05-24 19:19:13] [INFO ] Deduced a trap composed of 71 places in 571 ms of which 5 ms to minimize.
[2024-05-24 19:19:14] [INFO ] Deduced a trap composed of 66 places in 575 ms of which 5 ms to minimize.
[2024-05-24 19:19:14] [INFO ] Deduced a trap composed of 73 places in 565 ms of which 5 ms to minimize.
[2024-05-24 19:19:15] [INFO ] Deduced a trap composed of 80 places in 583 ms of which 5 ms to minimize.
[2024-05-24 19:19:16] [INFO ] Deduced a trap composed of 78 places in 566 ms of which 6 ms to minimize.
[2024-05-24 19:19:16] [INFO ] Deduced a trap composed of 60 places in 574 ms of which 5 ms to minimize.
[2024-05-24 19:19:17] [INFO ] Deduced a trap composed of 70 places in 571 ms of which 6 ms to minimize.
[2024-05-24 19:19:17] [INFO ] Deduced a trap composed of 78 places in 570 ms of which 6 ms to minimize.
[2024-05-24 19:19:18] [INFO ] Deduced a trap composed of 73 places in 569 ms of which 6 ms to minimize.
[2024-05-24 19:19:19] [INFO ] Deduced a trap composed of 76 places in 603 ms of which 6 ms to minimize.
[2024-05-24 19:19:19] [INFO ] Deduced a trap composed of 90 places in 603 ms of which 6 ms to minimize.
[2024-05-24 19:19:20] [INFO ] Deduced a trap composed of 91 places in 577 ms of which 7 ms to minimize.
[2024-05-24 19:19:20] [INFO ] Deduced a trap composed of 83 places in 576 ms of which 6 ms to minimize.
[2024-05-24 19:19:21] [INFO ] Deduced a trap composed of 58 places in 583 ms of which 6 ms to minimize.
[2024-05-24 19:19:22] [INFO ] Deduced a trap composed of 60 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:19:22] [INFO ] Deduced a trap composed of 77 places in 572 ms of which 6 ms to minimize.
[2024-05-24 19:19:23] [INFO ] Deduced a trap composed of 74 places in 577 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/958 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:19:23] [INFO ] Deduced a trap composed of 55 places in 607 ms of which 6 ms to minimize.
[2024-05-24 19:19:24] [INFO ] Deduced a trap composed of 58 places in 577 ms of which 6 ms to minimize.
[2024-05-24 19:19:25] [INFO ] Deduced a trap composed of 76 places in 586 ms of which 6 ms to minimize.
[2024-05-24 19:19:25] [INFO ] Deduced a trap composed of 86 places in 570 ms of which 6 ms to minimize.
[2024-05-24 19:19:26] [INFO ] Deduced a trap composed of 73 places in 572 ms of which 6 ms to minimize.
[2024-05-24 19:19:26] [INFO ] Deduced a trap composed of 115 places in 580 ms of which 5 ms to minimize.
[2024-05-24 19:19:27] [INFO ] Deduced a trap composed of 61 places in 579 ms of which 6 ms to minimize.
[2024-05-24 19:19:28] [INFO ] Deduced a trap composed of 58 places in 574 ms of which 5 ms to minimize.
[2024-05-24 19:19:28] [INFO ] Deduced a trap composed of 67 places in 574 ms of which 5 ms to minimize.
[2024-05-24 19:19:29] [INFO ] Deduced a trap composed of 71 places in 591 ms of which 6 ms to minimize.
[2024-05-24 19:19:29] [INFO ] Deduced a trap composed of 73 places in 547 ms of which 6 ms to minimize.
[2024-05-24 19:19:30] [INFO ] Deduced a trap composed of 60 places in 573 ms of which 5 ms to minimize.
[2024-05-24 19:19:31] [INFO ] Deduced a trap composed of 59 places in 570 ms of which 6 ms to minimize.
[2024-05-24 19:19:31] [INFO ] Deduced a trap composed of 61 places in 574 ms of which 5 ms to minimize.
[2024-05-24 19:19:32] [INFO ] Deduced a trap composed of 68 places in 573 ms of which 6 ms to minimize.
[2024-05-24 19:19:32] [INFO ] Deduced a trap composed of 62 places in 564 ms of which 6 ms to minimize.
[2024-05-24 19:19:33] [INFO ] Deduced a trap composed of 61 places in 564 ms of which 6 ms to minimize.
[2024-05-24 19:19:33] [INFO ] Deduced a trap composed of 61 places in 578 ms of which 6 ms to minimize.
[2024-05-24 19:19:34] [INFO ] Deduced a trap composed of 71 places in 597 ms of which 6 ms to minimize.
[2024-05-24 19:19:35] [INFO ] Deduced a trap composed of 86 places in 564 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/958 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 19:19:35] [INFO ] Deduced a trap composed of 93 places in 565 ms of which 5 ms to minimize.
[2024-05-24 19:19:36] [INFO ] Deduced a trap composed of 95 places in 561 ms of which 5 ms to minimize.
[2024-05-24 19:19:36] [INFO ] Deduced a trap composed of 87 places in 569 ms of which 6 ms to minimize.
[2024-05-24 19:19:37] [INFO ] Deduced a trap composed of 69 places in 570 ms of which 5 ms to minimize.
[2024-05-24 19:19:38] [INFO ] Deduced a trap composed of 69 places in 567 ms of which 6 ms to minimize.
[2024-05-24 19:19:38] [INFO ] Deduced a trap composed of 76 places in 579 ms of which 5 ms to minimize.
[2024-05-24 19:19:39] [INFO ] Deduced a trap composed of 82 places in 566 ms of which 5 ms to minimize.
[2024-05-24 19:19:39] [INFO ] Deduced a trap composed of 92 places in 557 ms of which 6 ms to minimize.
[2024-05-24 19:19:40] [INFO ] Deduced a trap composed of 76 places in 561 ms of which 6 ms to minimize.
[2024-05-24 19:19:41] [INFO ] Deduced a trap composed of 69 places in 563 ms of which 6 ms to minimize.
[2024-05-24 19:19:41] [INFO ] Deduced a trap composed of 59 places in 574 ms of which 5 ms to minimize.
[2024-05-24 19:19:42] [INFO ] Deduced a trap composed of 60 places in 560 ms of which 6 ms to minimize.
[2024-05-24 19:19:42] [INFO ] Deduced a trap composed of 85 places in 566 ms of which 5 ms to minimize.
[2024-05-24 19:19:43] [INFO ] Deduced a trap composed of 69 places in 581 ms of which 5 ms to minimize.
[2024-05-24 19:19:43] [INFO ] Deduced a trap composed of 82 places in 561 ms of which 5 ms to minimize.
SMT process timed out in 47547ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 997 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 4292/4292 transitions.
Applied a total of 0 rules in 116 ms. Remains 997 /997 variables (removed 0) and now considering 4292/4292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 997/997 places, 4292/4292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 997/997 places, 4292/4292 transitions.
Applied a total of 0 rules in 111 ms. Remains 997 /997 variables (removed 0) and now considering 4292/4292 (removed 0) transitions.
[2024-05-24 19:19:44] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-24 19:19:44] [INFO ] Invariant cache hit.
[2024-05-24 19:19:45] [INFO ] Implicit Places using invariants in 1203 ms returned []
[2024-05-24 19:19:45] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-24 19:19:45] [INFO ] Invariant cache hit.
[2024-05-24 19:19:46] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:20:13] [INFO ] Implicit Places using invariants and state equation in 27718 ms returned []
Implicit Place search using SMT with State Equation took 28923 ms to find 0 implicit places.
[2024-05-24 19:20:13] [INFO ] Redundant transitions in 220 ms returned []
Running 4230 sub problems to find dead transitions.
[2024-05-24 19:20:13] [INFO ] Flow matrix only has 3908 transitions (discarded 384 similar events)
[2024-05-24 19:20:13] [INFO ] Invariant cache hit.
[2024-05-24 19:20:13] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/995 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4230 unsolved
SMT process timed out in 60782ms, After SMT, problems are : Problem set: 0 solved, 4230 unsolved
Search for dead transitions found 0 dead transitions in 60822ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90103 ms. Remains : 997/997 places, 4292/4292 transitions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND p0 (NOT p1))), (X (AND (NOT p2) p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (AND (NOT p2) p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 14 factoid took 385 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1712 reset in 589 ms.
Product exploration explored 100000 steps with 1715 reset in 578 ms.
Built C files in :
/tmp/ltsmin13601699513729433525
[2024-05-24 19:21:16] [INFO ] Too many transitions (2535) to apply POR reductions. Disabling POR matrices.
[2024-05-24 19:21:16] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13601699513729433525
Running compilation step : cd /tmp/ltsmin13601699513729433525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13601699513729433525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13601699513729433525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 8 out of 1116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1116/1116 places, 2535/2535 transitions.
Applied a total of 0 rules in 69 ms. Remains 1116 /1116 variables (removed 0) and now considering 2535/2535 (removed 0) transitions.
[2024-05-24 19:21:19] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1116 cols
[2024-05-24 19:21:19] [INFO ] Computed 49 invariants in 25 ms
[2024-05-24 19:21:20] [INFO ] Implicit Places using invariants in 937 ms returned []
[2024-05-24 19:21:20] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 19:21:20] [INFO ] Invariant cache hit.
[2024-05-24 19:21:20] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-24 19:21:31] [INFO ] Implicit Places using invariants and state equation in 10952 ms returned []
Implicit Place search using SMT with State Equation took 11891 ms to find 0 implicit places.
[2024-05-24 19:21:31] [INFO ] Redundant transitions in 74 ms returned []
Running 2518 sub problems to find dead transitions.
[2024-05-24 19:21:31] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 19:21:31] [INFO ] Invariant cache hit.
[2024-05-24 19:21:31] [INFO ] State equation strengthened by 846 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1114 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2518 unsolved
SMT process timed out in 32669ms, After SMT, problems are : Problem set: 0 solved, 2518 unsolved
Search for dead transitions found 0 dead transitions in 32690ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44732 ms. Remains : 1116/1116 places, 2535/2535 transitions.
Built C files in :
/tmp/ltsmin6188160328125711400
[2024-05-24 19:22:03] [INFO ] Too many transitions (2535) to apply POR reductions. Disabling POR matrices.
[2024-05-24 19:22:04] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6188160328125711400
Running compilation step : cd /tmp/ltsmin6188160328125711400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6188160328125711400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6188160328125711400;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 19:22:07] [INFO ] Flatten gal took : 48 ms
[2024-05-24 19:22:07] [INFO ] Flatten gal took : 48 ms
[2024-05-24 19:22:07] [INFO ] Time to serialize gal into /tmp/LTL15507373983380913392.gal : 10 ms
[2024-05-24 19:22:07] [INFO ] Time to serialize properties into /tmp/LTL7475619607929129163.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15507373983380913392.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17149866243344179446.hoa' '-atoms' '/tmp/LTL7475619607929129163.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7475619607929129163.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17149866243344179446.hoa
Detected timeout of ITS tools.
[2024-05-24 19:22:22] [INFO ] Flatten gal took : 49 ms
[2024-05-24 19:22:22] [INFO ] Flatten gal took : 48 ms
[2024-05-24 19:22:22] [INFO ] Time to serialize gal into /tmp/LTL1769843250186242276.gal : 9 ms
[2024-05-24 19:22:22] [INFO ] Time to serialize properties into /tmp/LTL16841873582782864576.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1769843250186242276.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16841873582782864576.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((Node4AsksIsThereANodeMaster<1)||(Node14IsActive<1))")||(("(Node14IsTheNodeMaster<1)")||(F(("(((Node11IsActive>=1)&&(Node11I...314
Formula 0 simplified : XF(!"((Node4AsksIsThereANodeMaster<1)||(Node14IsActive<1))" & !"(Node14IsTheNodeMaster<1)" & G(!"(((Node11IsActive>=1)&&(Node11IsThe...300
Detected timeout of ITS tools.
[2024-05-24 19:22:37] [INFO ] Flatten gal took : 49 ms
[2024-05-24 19:22:37] [INFO ] Applying decomposition
[2024-05-24 19:22:37] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph909915830966460353.txt' '-o' '/tmp/graph909915830966460353.bin' '-w' '/tmp/graph909915830966460353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph909915830966460353.bin' '-l' '-1' '-v' '-w' '/tmp/graph909915830966460353.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:22:37] [INFO ] Decomposing Gal with order
[2024-05-24 19:22:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:22:37] [INFO ] Removed a total of 2215 redundant transitions.
[2024-05-24 19:22:37] [INFO ] Flatten gal took : 168 ms
[2024-05-24 19:22:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 1005 labels/synchronizations in 47 ms.
[2024-05-24 19:22:37] [INFO ] Time to serialize gal into /tmp/LTL2242525943146779902.gal : 16 ms
[2024-05-24 19:22:37] [INFO ] Time to serialize properties into /tmp/LTL8022522444620937545.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2242525943146779902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8022522444620937545.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("((u9.Node4AsksIsThereANodeMaster<1)||(u9.Node14IsActive<1))")||(("(u9.Node14IsTheNodeMaster<1)")||(F(("(((u9.Node11IsActive>=...360
Formula 0 simplified : XF(!"((u9.Node4AsksIsThereANodeMaster<1)||(u9.Node14IsActive<1))" & !"(u9.Node14IsTheNodeMaster<1)" & G(!"(((u9.Node11IsActive>=1)&&...346
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-10 finished in 444272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(!p1&&X((G(!p0)||(!p0&&G(F(p2)))))))))'
Found a Shortening insensitive property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14
Stuttering acceptance computed with spot in 159 ms :[p0, p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 5 out of 1303 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1303/1303 places, 2971/2971 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1303 transition count 2945
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1277 transition count 2945
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 52 place count 1277 transition count 2917
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 108 place count 1249 transition count 2917
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 126 place count 1231 transition count 2850
Iterating global reduction 2 with 18 rules applied. Total rules applied 144 place count 1231 transition count 2850
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 144 place count 1231 transition count 2846
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 152 place count 1227 transition count 2846
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 163 place count 1216 transition count 2772
Iterating global reduction 2 with 11 rules applied. Total rules applied 174 place count 1216 transition count 2772
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 176 place count 1214 transition count 2756
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 1214 transition count 2756
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 3 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 234 place count 1186 transition count 2728
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 240 place count 1180 transition count 2722
Iterating global reduction 2 with 6 rules applied. Total rules applied 246 place count 1180 transition count 2722
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 252 place count 1174 transition count 2674
Iterating global reduction 2 with 6 rules applied. Total rules applied 258 place count 1174 transition count 2674
Applied a total of 258 rules in 330 ms. Remains 1174 /1303 variables (removed 129) and now considering 2674/2971 (removed 297) transitions.
[2024-05-24 19:22:53] [INFO ] Flow matrix only has 2402 transitions (discarded 272 similar events)
// Phase 1: matrix 2402 rows 1174 cols
[2024-05-24 19:22:53] [INFO ] Computed 66 invariants in 30 ms
[2024-05-24 19:22:54] [INFO ] Implicit Places using invariants in 1008 ms returned [9, 94, 357, 468, 498, 509, 519, 544, 567, 666, 715, 749, 783, 828, 829, 930, 981]
[2024-05-24 19:22:54] [INFO ] Actually due to overlaps returned [498, 9, 94, 357, 468, 519, 544, 567, 666, 715, 749, 783, 828, 829, 930, 981]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1010 ms to find 16 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1158/1303 places, 2674/2971 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1148 transition count 2664
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1148 transition count 2664
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 1138 transition count 2654
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 1138 transition count 2654
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 1129 transition count 2582
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 1129 transition count 2582
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 1124 transition count 2577
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 1119 transition count 2572
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 1119 transition count 2572
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 1114 transition count 2532
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 1114 transition count 2532
Applied a total of 88 rules in 271 ms. Remains 1114 /1158 variables (removed 44) and now considering 2532/2674 (removed 142) transitions.
[2024-05-24 19:22:54] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
// Phase 1: matrix 2260 rows 1114 cols
[2024-05-24 19:22:54] [INFO ] Computed 50 invariants in 25 ms
[2024-05-24 19:22:55] [INFO ] Implicit Places using invariants in 934 ms returned [496]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 939 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1113/1303 places, 2532/2971 transitions.
Applied a total of 0 rules in 44 ms. Remains 1113 /1113 variables (removed 0) and now considering 2532/2532 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2594 ms. Remains : 1113/1303 places, 2532/2971 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14
Product exploration explored 100000 steps with 1712 reset in 483 ms.
Product exploration explored 100000 steps with 1712 reset in 591 ms.
Computed a total of 298 stabilizing places and 916 stable transitions
Computed a total of 298 stabilizing places and 916 stable transitions
Detected a total of 298/1113 stabilizing places and 916/2532 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 245 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (683 resets) in 727 ms. (54 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (148 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
[2024-05-24 19:22:57] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
// Phase 1: matrix 2260 rows 1113 cols
[2024-05-24 19:22:57] [INFO ] Computed 49 invariants in 17 ms
[2024-05-24 19:22:57] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1019 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1019 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1038 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:22:58] [INFO ] Deduced a trap composed of 154 places in 401 ms of which 6 ms to minimize.
[2024-05-24 19:22:58] [INFO ] Deduced a trap composed of 163 places in 413 ms of which 5 ms to minimize.
[2024-05-24 19:22:59] [INFO ] Deduced a trap composed of 153 places in 405 ms of which 6 ms to minimize.
[2024-05-24 19:22:59] [INFO ] Deduced a trap composed of 155 places in 405 ms of which 6 ms to minimize.
[2024-05-24 19:22:59] [INFO ] Deduced a trap composed of 207 places in 403 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1038 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/1071 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1071 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/1097 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1097 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/1113 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1113 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2260/3373 variables, 1113/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3373 variables, 846/2013 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3373 variables, 0/2013 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/3373 variables, 0/2013 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3373/3373 variables, and 2013 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3116 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1113/1113 constraints, ReadFeed: 846/846 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1019 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1019 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1038 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1038 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/1071 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:23:01] [INFO ] Deduced a trap composed of 47 places in 484 ms of which 6 ms to minimize.
[2024-05-24 19:23:01] [INFO ] Deduced a trap composed of 167 places in 465 ms of which 6 ms to minimize.
[2024-05-24 19:23:02] [INFO ] Deduced a trap composed of 206 places in 480 ms of which 7 ms to minimize.
[2024-05-24 19:23:02] [INFO ] Deduced a trap composed of 187 places in 428 ms of which 6 ms to minimize.
[2024-05-24 19:23:03] [INFO ] Deduced a trap composed of 157 places in 439 ms of which 6 ms to minimize.
[2024-05-24 19:23:03] [INFO ] Deduced a trap composed of 164 places in 441 ms of which 6 ms to minimize.
[2024-05-24 19:23:04] [INFO ] Deduced a trap composed of 199 places in 463 ms of which 6 ms to minimize.
[2024-05-24 19:23:04] [INFO ] Deduced a trap composed of 205 places in 469 ms of which 6 ms to minimize.
[2024-05-24 19:23:05] [INFO ] Deduced a trap composed of 189 places in 440 ms of which 6 ms to minimize.
[2024-05-24 19:23:05] [INFO ] Deduced a trap composed of 209 places in 453 ms of which 6 ms to minimize.
[2024-05-24 19:23:06] [INFO ] Deduced a trap composed of 225 places in 467 ms of which 7 ms to minimize.
SMT process timed out in 8563ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1112 transition count 2524
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1112 transition count 2524
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1111 transition count 2523
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1109 transition count 2514
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1109 transition count 2514
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 139 place count 1109 transition count 4273
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 270 place count 978 transition count 4273
Applied a total of 270 rules in 357 ms. Remains 978 /1113 variables (removed 135) and now considering 4273/2532 (removed -1741) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 357 ms. Remains : 978/1113 places, 4273/2532 transitions.
RANDOM walk for 40000 steps (839 resets) in 746 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (118 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 66208 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 66208 steps, saw 27917 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-24 19:23:09] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2024-05-24 19:23:09] [INFO ] Computed 49 invariants in 28 ms
[2024-05-24 19:23:09] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:23:10] [INFO ] Deduced a trap composed of 228 places in 582 ms of which 5 ms to minimize.
[2024-05-24 19:23:11] [INFO ] Deduced a trap composed of 447 places in 567 ms of which 6 ms to minimize.
[2024-05-24 19:23:11] [INFO ] Deduced a trap composed of 490 places in 566 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/962 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/978 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/978 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3875/4853 variables, 978/1030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4853 variables, 2722/3752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4853 variables, 0/3752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4853 variables, 0/3752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4853/4853 variables, and 3752 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3262 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 978/978 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:23:13] [INFO ] Deduced a trap composed of 27 places in 530 ms of which 6 ms to minimize.
[2024-05-24 19:23:14] [INFO ] Deduced a trap composed of 112 places in 522 ms of which 5 ms to minimize.
[2024-05-24 19:23:14] [INFO ] Deduced a trap composed of 46 places in 518 ms of which 6 ms to minimize.
[2024-05-24 19:23:15] [INFO ] Deduced a trap composed of 126 places in 515 ms of which 6 ms to minimize.
[2024-05-24 19:23:15] [INFO ] Deduced a trap composed of 122 places in 512 ms of which 6 ms to minimize.
[2024-05-24 19:23:16] [INFO ] Deduced a trap composed of 46 places in 510 ms of which 6 ms to minimize.
[2024-05-24 19:23:16] [INFO ] Deduced a trap composed of 57 places in 539 ms of which 6 ms to minimize.
[2024-05-24 19:23:17] [INFO ] Deduced a trap composed of 157 places in 529 ms of which 6 ms to minimize.
[2024-05-24 19:23:18] [INFO ] Deduced a trap composed of 88 places in 531 ms of which 5 ms to minimize.
[2024-05-24 19:23:18] [INFO ] Deduced a trap composed of 62 places in 526 ms of which 5 ms to minimize.
[2024-05-24 19:23:19] [INFO ] Deduced a trap composed of 143 places in 546 ms of which 6 ms to minimize.
[2024-05-24 19:23:19] [INFO ] Deduced a trap composed of 75 places in 518 ms of which 6 ms to minimize.
[2024-05-24 19:23:20] [INFO ] Deduced a trap composed of 149 places in 517 ms of which 6 ms to minimize.
[2024-05-24 19:23:20] [INFO ] Deduced a trap composed of 154 places in 510 ms of which 6 ms to minimize.
[2024-05-24 19:23:21] [INFO ] Deduced a trap composed of 152 places in 510 ms of which 5 ms to minimize.
[2024-05-24 19:23:21] [INFO ] Deduced a trap composed of 155 places in 512 ms of which 6 ms to minimize.
[2024-05-24 19:23:22] [INFO ] Deduced a trap composed of 139 places in 518 ms of which 5 ms to minimize.
[2024-05-24 19:23:22] [INFO ] Deduced a trap composed of 150 places in 530 ms of which 6 ms to minimize.
[2024-05-24 19:23:23] [INFO ] Deduced a trap composed of 155 places in 482 ms of which 6 ms to minimize.
[2024-05-24 19:23:23] [INFO ] Deduced a trap composed of 161 places in 494 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:23:24] [INFO ] Deduced a trap composed of 172 places in 500 ms of which 6 ms to minimize.
[2024-05-24 19:23:24] [INFO ] Deduced a trap composed of 75 places in 485 ms of which 6 ms to minimize.
[2024-05-24 19:23:25] [INFO ] Deduced a trap composed of 195 places in 502 ms of which 5 ms to minimize.
[2024-05-24 19:23:26] [INFO ] Deduced a trap composed of 169 places in 498 ms of which 6 ms to minimize.
[2024-05-24 19:23:26] [INFO ] Deduced a trap composed of 90 places in 491 ms of which 6 ms to minimize.
[2024-05-24 19:23:27] [INFO ] Deduced a trap composed of 94 places in 481 ms of which 5 ms to minimize.
[2024-05-24 19:23:27] [INFO ] Deduced a trap composed of 85 places in 492 ms of which 5 ms to minimize.
[2024-05-24 19:23:28] [INFO ] Deduced a trap composed of 71 places in 485 ms of which 5 ms to minimize.
[2024-05-24 19:23:28] [INFO ] Deduced a trap composed of 166 places in 496 ms of which 5 ms to minimize.
[2024-05-24 19:23:29] [INFO ] Deduced a trap composed of 97 places in 486 ms of which 6 ms to minimize.
[2024-05-24 19:23:29] [INFO ] Deduced a trap composed of 110 places in 487 ms of which 5 ms to minimize.
[2024-05-24 19:23:30] [INFO ] Deduced a trap composed of 104 places in 480 ms of which 5 ms to minimize.
[2024-05-24 19:23:30] [INFO ] Deduced a trap composed of 117 places in 487 ms of which 6 ms to minimize.
[2024-05-24 19:23:31] [INFO ] Deduced a trap composed of 5 places in 479 ms of which 6 ms to minimize.
[2024-05-24 19:23:31] [INFO ] Deduced a trap composed of 92 places in 471 ms of which 5 ms to minimize.
[2024-05-24 19:23:32] [INFO ] Deduced a trap composed of 115 places in 458 ms of which 6 ms to minimize.
[2024-05-24 19:23:32] [INFO ] Deduced a trap composed of 94 places in 461 ms of which 6 ms to minimize.
[2024-05-24 19:23:33] [INFO ] Deduced a trap composed of 92 places in 479 ms of which 6 ms to minimize.
[2024-05-24 19:23:33] [INFO ] Deduced a trap composed of 94 places in 471 ms of which 5 ms to minimize.
[2024-05-24 19:23:33] [INFO ] Deduced a trap composed of 94 places in 458 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:23:34] [INFO ] Deduced a trap composed of 101 places in 459 ms of which 6 ms to minimize.
[2024-05-24 19:23:34] [INFO ] Deduced a trap composed of 168 places in 473 ms of which 5 ms to minimize.
[2024-05-24 19:23:35] [INFO ] Deduced a trap composed of 94 places in 480 ms of which 5 ms to minimize.
[2024-05-24 19:23:35] [INFO ] Deduced a trap composed of 207 places in 466 ms of which 6 ms to minimize.
[2024-05-24 19:23:36] [INFO ] Deduced a trap composed of 209 places in 501 ms of which 5 ms to minimize.
[2024-05-24 19:23:37] [INFO ] Deduced a trap composed of 208 places in 510 ms of which 6 ms to minimize.
[2024-05-24 19:23:37] [INFO ] Deduced a trap composed of 207 places in 493 ms of which 5 ms to minimize.
[2024-05-24 19:23:38] [INFO ] Deduced a trap composed of 159 places in 507 ms of which 6 ms to minimize.
[2024-05-24 19:23:38] [INFO ] Deduced a trap composed of 94 places in 536 ms of which 6 ms to minimize.
[2024-05-24 19:23:39] [INFO ] Deduced a trap composed of 240 places in 466 ms of which 6 ms to minimize.
[2024-05-24 19:23:39] [INFO ] Deduced a trap composed of 215 places in 477 ms of which 5 ms to minimize.
[2024-05-24 19:23:40] [INFO ] Deduced a trap composed of 260 places in 488 ms of which 6 ms to minimize.
[2024-05-24 19:23:40] [INFO ] Deduced a trap composed of 219 places in 508 ms of which 5 ms to minimize.
[2024-05-24 19:23:41] [INFO ] Deduced a trap composed of 94 places in 467 ms of which 5 ms to minimize.
[2024-05-24 19:23:41] [INFO ] Deduced a trap composed of 126 places in 464 ms of which 5 ms to minimize.
[2024-05-24 19:23:42] [INFO ] Deduced a trap composed of 129 places in 467 ms of which 6 ms to minimize.
[2024-05-24 19:23:42] [INFO ] Deduced a trap composed of 101 places in 460 ms of which 5 ms to minimize.
[2024-05-24 19:23:43] [INFO ] Deduced a trap composed of 103 places in 489 ms of which 5 ms to minimize.
[2024-05-24 19:23:43] [INFO ] Deduced a trap composed of 101 places in 466 ms of which 6 ms to minimize.
[2024-05-24 19:23:44] [INFO ] Deduced a trap composed of 103 places in 467 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/936 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:23:44] [INFO ] Deduced a trap composed of 95 places in 488 ms of which 5 ms to minimize.
[2024-05-24 19:23:45] [INFO ] Deduced a trap composed of 106 places in 465 ms of which 5 ms to minimize.
[2024-05-24 19:23:45] [INFO ] Deduced a trap composed of 108 places in 458 ms of which 5 ms to minimize.
[2024-05-24 19:23:46] [INFO ] Deduced a trap composed of 85 places in 489 ms of which 6 ms to minimize.
[2024-05-24 19:23:46] [INFO ] Deduced a trap composed of 120 places in 471 ms of which 5 ms to minimize.
[2024-05-24 19:23:47] [INFO ] Deduced a trap composed of 168 places in 484 ms of which 6 ms to minimize.
[2024-05-24 19:23:47] [INFO ] Deduced a trap composed of 157 places in 483 ms of which 6 ms to minimize.
[2024-05-24 19:23:48] [INFO ] Deduced a trap composed of 206 places in 474 ms of which 5 ms to minimize.
[2024-05-24 19:23:48] [INFO ] Deduced a trap composed of 165 places in 500 ms of which 5 ms to minimize.
[2024-05-24 19:23:49] [INFO ] Deduced a trap composed of 173 places in 513 ms of which 6 ms to minimize.
[2024-05-24 19:23:49] [INFO ] Deduced a trap composed of 173 places in 496 ms of which 6 ms to minimize.
[2024-05-24 19:23:50] [INFO ] Deduced a trap composed of 158 places in 476 ms of which 6 ms to minimize.
[2024-05-24 19:23:50] [INFO ] Deduced a trap composed of 70 places in 597 ms of which 6 ms to minimize.
[2024-05-24 19:23:51] [INFO ] Deduced a trap composed of 85 places in 566 ms of which 6 ms to minimize.
[2024-05-24 19:23:51] [INFO ] Deduced a trap composed of 85 places in 485 ms of which 5 ms to minimize.
[2024-05-24 19:23:52] [INFO ] Deduced a trap composed of 191 places in 497 ms of which 5 ms to minimize.
[2024-05-24 19:23:52] [INFO ] Deduced a trap composed of 159 places in 520 ms of which 5 ms to minimize.
[2024-05-24 19:23:53] [INFO ] Deduced a trap composed of 113 places in 496 ms of which 5 ms to minimize.
[2024-05-24 19:23:54] [INFO ] Deduced a trap composed of 174 places in 473 ms of which 6 ms to minimize.
[2024-05-24 19:23:54] [INFO ] Deduced a trap composed of 212 places in 476 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/936 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:23:55] [INFO ] Deduced a trap composed of 183 places in 483 ms of which 5 ms to minimize.
[2024-05-24 19:23:55] [INFO ] Deduced a trap composed of 92 places in 455 ms of which 5 ms to minimize.
[2024-05-24 19:23:56] [INFO ] Deduced a trap composed of 94 places in 473 ms of which 5 ms to minimize.
[2024-05-24 19:23:56] [INFO ] Deduced a trap composed of 120 places in 493 ms of which 5 ms to minimize.
[2024-05-24 19:23:57] [INFO ] Deduced a trap composed of 127 places in 475 ms of which 6 ms to minimize.
[2024-05-24 19:23:57] [INFO ] Deduced a trap composed of 187 places in 473 ms of which 5 ms to minimize.
[2024-05-24 19:23:58] [INFO ] Deduced a trap composed of 91 places in 567 ms of which 6 ms to minimize.
SMT process timed out in 48490ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 111 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 978/978 places, 4273/4273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 107 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
[2024-05-24 19:23:58] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:23:58] [INFO ] Invariant cache hit.
[2024-05-24 19:23:59] [INFO ] Implicit Places using invariants in 1204 ms returned []
[2024-05-24 19:23:59] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:23:59] [INFO ] Invariant cache hit.
[2024-05-24 19:24:00] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:24:30] [INFO ] Performed 616/978 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:24:42] [INFO ] Implicit Places using invariants and state equation in 43177 ms returned []
Implicit Place search using SMT with State Equation took 44383 ms to find 0 implicit places.
[2024-05-24 19:24:43] [INFO ] Redundant transitions in 217 ms returned []
Running 4211 sub problems to find dead transitions.
[2024-05-24 19:24:43] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:24:43] [INFO ] Invariant cache hit.
[2024-05-24 19:24:43] [INFO ] State equation strengthened by 2722 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4211 unsolved
SMT process timed out in 60554ms, After SMT, problems are : Problem set: 0 solved, 4211 unsolved
Search for dead transitions found 0 dead transitions in 60594ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105321 ms. Remains : 978/978 places, 4273/4273 transitions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 17 factoid took 441 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 63 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Support contains 4 out of 1113 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Applied a total of 0 rules in 71 ms. Remains 1113 /1113 variables (removed 0) and now considering 2532/2532 (removed 0) transitions.
[2024-05-24 19:25:44] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
// Phase 1: matrix 2260 rows 1113 cols
[2024-05-24 19:25:44] [INFO ] Computed 49 invariants in 30 ms
[2024-05-24 19:25:45] [INFO ] Implicit Places using invariants in 916 ms returned []
[2024-05-24 19:25:45] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-24 19:25:45] [INFO ] Invariant cache hit.
[2024-05-24 19:25:45] [INFO ] State equation strengthened by 846 read => feed constraints.
[2024-05-24 19:25:55] [INFO ] Implicit Places using invariants and state equation in 10499 ms returned []
Implicit Place search using SMT with State Equation took 11418 ms to find 0 implicit places.
[2024-05-24 19:25:55] [INFO ] Redundant transitions in 72 ms returned []
Running 2515 sub problems to find dead transitions.
[2024-05-24 19:25:55] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-24 19:25:55] [INFO ] Invariant cache hit.
[2024-05-24 19:25:55] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1111 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2515 unsolved
SMT process timed out in 32713ms, After SMT, problems are : Problem set: 0 solved, 2515 unsolved
Search for dead transitions found 0 dead transitions in 32738ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44310 ms. Remains : 1113/1113 places, 2532/2532 transitions.
Computed a total of 298 stabilizing places and 916 stable transitions
Computed a total of 298 stabilizing places and 916 stable transitions
Detected a total of 298/1113 stabilizing places and 916/2532 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 140 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (683 resets) in 1052 ms. (37 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (148 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
[2024-05-24 19:26:29] [INFO ] Flow matrix only has 2260 transitions (discarded 272 similar events)
[2024-05-24 19:26:29] [INFO ] Invariant cache hit.
[2024-05-24 19:26:29] [INFO ] State equation strengthened by 846 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1019 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1019 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1038 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:26:29] [INFO ] Deduced a trap composed of 180 places in 435 ms of which 6 ms to minimize.
[2024-05-24 19:26:30] [INFO ] Deduced a trap composed of 167 places in 431 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1038 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/1071 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1071 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/1097 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1097 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/1113 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1113 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2260/3373 variables, 1113/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3373 variables, 846/2010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3373 variables, 0/2010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/3373 variables, 0/2010 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3373/3373 variables, and 2010 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1870 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 1113/1113 constraints, ReadFeed: 846/846 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1017/1019 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1019 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/1038 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:26:31] [INFO ] Deduced a trap composed of 163 places in 410 ms of which 5 ms to minimize.
[2024-05-24 19:26:31] [INFO ] Deduced a trap composed of 181 places in 406 ms of which 6 ms to minimize.
[2024-05-24 19:26:32] [INFO ] Deduced a trap composed of 207 places in 400 ms of which 6 ms to minimize.
[2024-05-24 19:26:32] [INFO ] Deduced a trap composed of 188 places in 405 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1038 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1038 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/1071 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:26:33] [INFO ] Deduced a trap composed of 103 places in 445 ms of which 6 ms to minimize.
[2024-05-24 19:26:33] [INFO ] Deduced a trap composed of 88 places in 431 ms of which 6 ms to minimize.
[2024-05-24 19:26:34] [INFO ] Deduced a trap composed of 47 places in 437 ms of which 6 ms to minimize.
[2024-05-24 19:26:34] [INFO ] Deduced a trap composed of 89 places in 441 ms of which 6 ms to minimize.
[2024-05-24 19:26:35] [INFO ] Deduced a trap composed of 87 places in 448 ms of which 7 ms to minimize.
[2024-05-24 19:26:35] [INFO ] Deduced a trap composed of 105 places in 432 ms of which 6 ms to minimize.
[2024-05-24 19:26:36] [INFO ] Deduced a trap composed of 93 places in 450 ms of which 7 ms to minimize.
SMT process timed out in 6974ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1112 transition count 2524
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1112 transition count 2524
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1111 transition count 2523
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1109 transition count 2514
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1109 transition count 2514
Free-agglomeration rule (complex) applied 131 times.
Iterating global reduction 0 with 131 rules applied. Total rules applied 139 place count 1109 transition count 4273
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 0 with 131 rules applied. Total rules applied 270 place count 978 transition count 4273
Applied a total of 270 rules in 342 ms. Remains 978 /1113 variables (removed 135) and now considering 4273/2532 (removed -1741) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 978/1113 places, 4273/2532 transitions.
RANDOM walk for 40000 steps (840 resets) in 863 ms. (46 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (120 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 69395 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 69395 steps, saw 29227 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 19:26:39] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2024-05-24 19:26:39] [INFO ] Computed 49 invariants in 25 ms
[2024-05-24 19:26:39] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:26:40] [INFO ] Deduced a trap composed of 228 places in 525 ms of which 6 ms to minimize.
[2024-05-24 19:26:41] [INFO ] Deduced a trap composed of 447 places in 513 ms of which 5 ms to minimize.
[2024-05-24 19:26:41] [INFO ] Deduced a trap composed of 490 places in 655 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/962 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/962 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/978 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/978 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3875/4853 variables, 978/1030 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4853 variables, 2722/3752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4853 variables, 0/3752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/4853 variables, 0/3752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4853/4853 variables, and 3752 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3132 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 978/978 constraints, ReadFeed: 2722/2722 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 882/884 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/903 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/903 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/936 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:26:43] [INFO ] Deduced a trap composed of 27 places in 480 ms of which 6 ms to minimize.
[2024-05-24 19:26:44] [INFO ] Deduced a trap composed of 112 places in 472 ms of which 5 ms to minimize.
[2024-05-24 19:26:44] [INFO ] Deduced a trap composed of 46 places in 458 ms of which 6 ms to minimize.
[2024-05-24 19:26:45] [INFO ] Deduced a trap composed of 126 places in 480 ms of which 5 ms to minimize.
[2024-05-24 19:26:45] [INFO ] Deduced a trap composed of 122 places in 480 ms of which 5 ms to minimize.
[2024-05-24 19:26:46] [INFO ] Deduced a trap composed of 46 places in 474 ms of which 6 ms to minimize.
[2024-05-24 19:26:46] [INFO ] Deduced a trap composed of 57 places in 485 ms of which 5 ms to minimize.
[2024-05-24 19:26:47] [INFO ] Deduced a trap composed of 157 places in 478 ms of which 5 ms to minimize.
[2024-05-24 19:26:47] [INFO ] Deduced a trap composed of 88 places in 498 ms of which 5 ms to minimize.
[2024-05-24 19:26:48] [INFO ] Deduced a trap composed of 62 places in 469 ms of which 5 ms to minimize.
[2024-05-24 19:26:48] [INFO ] Deduced a trap composed of 143 places in 493 ms of which 5 ms to minimize.
[2024-05-24 19:26:49] [INFO ] Deduced a trap composed of 75 places in 471 ms of which 5 ms to minimize.
[2024-05-24 19:26:49] [INFO ] Deduced a trap composed of 149 places in 470 ms of which 6 ms to minimize.
[2024-05-24 19:26:50] [INFO ] Deduced a trap composed of 154 places in 460 ms of which 6 ms to minimize.
[2024-05-24 19:26:50] [INFO ] Deduced a trap composed of 152 places in 466 ms of which 5 ms to minimize.
[2024-05-24 19:26:50] [INFO ] Deduced a trap composed of 155 places in 473 ms of which 6 ms to minimize.
[2024-05-24 19:26:51] [INFO ] Deduced a trap composed of 139 places in 472 ms of which 5 ms to minimize.
[2024-05-24 19:26:51] [INFO ] Deduced a trap composed of 150 places in 475 ms of which 6 ms to minimize.
[2024-05-24 19:26:52] [INFO ] Deduced a trap composed of 155 places in 468 ms of which 5 ms to minimize.
[2024-05-24 19:26:52] [INFO ] Deduced a trap composed of 161 places in 479 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/936 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:26:53] [INFO ] Deduced a trap composed of 172 places in 503 ms of which 5 ms to minimize.
[2024-05-24 19:26:53] [INFO ] Deduced a trap composed of 75 places in 467 ms of which 6 ms to minimize.
[2024-05-24 19:26:54] [INFO ] Deduced a trap composed of 195 places in 473 ms of which 5 ms to minimize.
[2024-05-24 19:26:54] [INFO ] Deduced a trap composed of 169 places in 487 ms of which 6 ms to minimize.
[2024-05-24 19:26:55] [INFO ] Deduced a trap composed of 90 places in 472 ms of which 5 ms to minimize.
[2024-05-24 19:26:55] [INFO ] Deduced a trap composed of 94 places in 465 ms of which 5 ms to minimize.
[2024-05-24 19:26:56] [INFO ] Deduced a trap composed of 85 places in 478 ms of which 5 ms to minimize.
[2024-05-24 19:26:56] [INFO ] Deduced a trap composed of 71 places in 464 ms of which 5 ms to minimize.
[2024-05-24 19:26:57] [INFO ] Deduced a trap composed of 166 places in 522 ms of which 6 ms to minimize.
[2024-05-24 19:26:57] [INFO ] Deduced a trap composed of 97 places in 483 ms of which 5 ms to minimize.
[2024-05-24 19:26:58] [INFO ] Deduced a trap composed of 110 places in 478 ms of which 5 ms to minimize.
[2024-05-24 19:26:58] [INFO ] Deduced a trap composed of 104 places in 477 ms of which 5 ms to minimize.
[2024-05-24 19:26:59] [INFO ] Deduced a trap composed of 117 places in 471 ms of which 5 ms to minimize.
[2024-05-24 19:26:59] [INFO ] Deduced a trap composed of 5 places in 479 ms of which 5 ms to minimize.
[2024-05-24 19:27:00] [INFO ] Deduced a trap composed of 92 places in 466 ms of which 5 ms to minimize.
[2024-05-24 19:27:00] [INFO ] Deduced a trap composed of 115 places in 462 ms of which 5 ms to minimize.
[2024-05-24 19:27:01] [INFO ] Deduced a trap composed of 94 places in 457 ms of which 5 ms to minimize.
[2024-05-24 19:27:01] [INFO ] Deduced a trap composed of 92 places in 491 ms of which 6 ms to minimize.
[2024-05-24 19:27:02] [INFO ] Deduced a trap composed of 94 places in 475 ms of which 5 ms to minimize.
[2024-05-24 19:27:02] [INFO ] Deduced a trap composed of 94 places in 454 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/936 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:27:03] [INFO ] Deduced a trap composed of 101 places in 454 ms of which 5 ms to minimize.
[2024-05-24 19:27:03] [INFO ] Deduced a trap composed of 168 places in 466 ms of which 5 ms to minimize.
[2024-05-24 19:27:04] [INFO ] Deduced a trap composed of 94 places in 478 ms of which 6 ms to minimize.
[2024-05-24 19:27:04] [INFO ] Deduced a trap composed of 207 places in 474 ms of which 6 ms to minimize.
[2024-05-24 19:27:05] [INFO ] Deduced a trap composed of 209 places in 501 ms of which 6 ms to minimize.
[2024-05-24 19:27:05] [INFO ] Deduced a trap composed of 208 places in 504 ms of which 6 ms to minimize.
[2024-05-24 19:27:06] [INFO ] Deduced a trap composed of 207 places in 495 ms of which 6 ms to minimize.
[2024-05-24 19:27:06] [INFO ] Deduced a trap composed of 159 places in 507 ms of which 6 ms to minimize.
[2024-05-24 19:27:07] [INFO ] Deduced a trap composed of 94 places in 478 ms of which 6 ms to minimize.
[2024-05-24 19:27:07] [INFO ] Deduced a trap composed of 240 places in 456 ms of which 5 ms to minimize.
[2024-05-24 19:27:08] [INFO ] Deduced a trap composed of 215 places in 515 ms of which 6 ms to minimize.
[2024-05-24 19:27:08] [INFO ] Deduced a trap composed of 260 places in 492 ms of which 6 ms to minimize.
[2024-05-24 19:27:09] [INFO ] Deduced a trap composed of 219 places in 501 ms of which 6 ms to minimize.
[2024-05-24 19:27:09] [INFO ] Deduced a trap composed of 94 places in 460 ms of which 5 ms to minimize.
[2024-05-24 19:27:10] [INFO ] Deduced a trap composed of 126 places in 461 ms of which 5 ms to minimize.
[2024-05-24 19:27:10] [INFO ] Deduced a trap composed of 129 places in 469 ms of which 6 ms to minimize.
[2024-05-24 19:27:11] [INFO ] Deduced a trap composed of 101 places in 451 ms of which 6 ms to minimize.
[2024-05-24 19:27:11] [INFO ] Deduced a trap composed of 103 places in 483 ms of which 5 ms to minimize.
[2024-05-24 19:27:12] [INFO ] Deduced a trap composed of 101 places in 479 ms of which 6 ms to minimize.
[2024-05-24 19:27:12] [INFO ] Deduced a trap composed of 103 places in 499 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/936 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:27:13] [INFO ] Deduced a trap composed of 95 places in 463 ms of which 6 ms to minimize.
[2024-05-24 19:27:13] [INFO ] Deduced a trap composed of 106 places in 457 ms of which 5 ms to minimize.
[2024-05-24 19:27:14] [INFO ] Deduced a trap composed of 108 places in 461 ms of which 6 ms to minimize.
[2024-05-24 19:27:14] [INFO ] Deduced a trap composed of 85 places in 489 ms of which 6 ms to minimize.
[2024-05-24 19:27:15] [INFO ] Deduced a trap composed of 120 places in 469 ms of which 5 ms to minimize.
[2024-05-24 19:27:15] [INFO ] Deduced a trap composed of 168 places in 479 ms of which 6 ms to minimize.
[2024-05-24 19:27:16] [INFO ] Deduced a trap composed of 157 places in 486 ms of which 6 ms to minimize.
[2024-05-24 19:27:16] [INFO ] Deduced a trap composed of 206 places in 463 ms of which 5 ms to minimize.
[2024-05-24 19:27:17] [INFO ] Deduced a trap composed of 165 places in 482 ms of which 6 ms to minimize.
[2024-05-24 19:27:17] [INFO ] Deduced a trap composed of 173 places in 484 ms of which 5 ms to minimize.
[2024-05-24 19:27:18] [INFO ] Deduced a trap composed of 173 places in 501 ms of which 6 ms to minimize.
[2024-05-24 19:27:18] [INFO ] Deduced a trap composed of 158 places in 487 ms of which 6 ms to minimize.
[2024-05-24 19:27:19] [INFO ] Deduced a trap composed of 70 places in 583 ms of which 5 ms to minimize.
[2024-05-24 19:27:20] [INFO ] Deduced a trap composed of 85 places in 549 ms of which 5 ms to minimize.
[2024-05-24 19:27:20] [INFO ] Deduced a trap composed of 85 places in 477 ms of which 5 ms to minimize.
[2024-05-24 19:27:21] [INFO ] Deduced a trap composed of 191 places in 482 ms of which 5 ms to minimize.
[2024-05-24 19:27:21] [INFO ] Deduced a trap composed of 159 places in 509 ms of which 6 ms to minimize.
[2024-05-24 19:27:22] [INFO ] Deduced a trap composed of 113 places in 479 ms of which 6 ms to minimize.
[2024-05-24 19:27:22] [INFO ] Deduced a trap composed of 174 places in 472 ms of which 5 ms to minimize.
[2024-05-24 19:27:23] [INFO ] Deduced a trap composed of 212 places in 460 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/936 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 19:27:23] [INFO ] Deduced a trap composed of 183 places in 524 ms of which 6 ms to minimize.
[2024-05-24 19:27:24] [INFO ] Deduced a trap composed of 92 places in 538 ms of which 6 ms to minimize.
[2024-05-24 19:27:24] [INFO ] Deduced a trap composed of 94 places in 476 ms of which 5 ms to minimize.
[2024-05-24 19:27:25] [INFO ] Deduced a trap composed of 120 places in 545 ms of which 6 ms to minimize.
[2024-05-24 19:27:25] [INFO ] Deduced a trap composed of 127 places in 474 ms of which 5 ms to minimize.
[2024-05-24 19:27:26] [INFO ] Deduced a trap composed of 187 places in 479 ms of which 6 ms to minimize.
[2024-05-24 19:27:27] [INFO ] Deduced a trap composed of 91 places in 565 ms of which 5 ms to minimize.
[2024-05-24 19:27:27] [INFO ] Deduced a trap composed of 198 places in 474 ms of which 5 ms to minimize.
[2024-05-24 19:27:28] [INFO ] Deduced a trap composed of 278 places in 481 ms of which 5 ms to minimize.
SMT process timed out in 48279ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 105 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 978/978 places, 4273/4273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 103 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
[2024-05-24 19:27:28] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:27:28] [INFO ] Invariant cache hit.
[2024-05-24 19:27:29] [INFO ] Implicit Places using invariants in 1229 ms returned []
[2024-05-24 19:27:29] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:27:29] [INFO ] Invariant cache hit.
[2024-05-24 19:27:30] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-24 19:28:01] [INFO ] Performed 603/978 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 19:28:14] [INFO ] Implicit Places using invariants and state equation in 44718 ms returned []
Implicit Place search using SMT with State Equation took 45965 ms to find 0 implicit places.
[2024-05-24 19:28:14] [INFO ] Redundant transitions in 213 ms returned []
Running 4211 sub problems to find dead transitions.
[2024-05-24 19:28:14] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-24 19:28:14] [INFO ] Invariant cache hit.
[2024-05-24 19:28:14] [INFO ] State equation strengthened by 2722 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4211 unsolved
SMT process timed out in 59206ms, After SMT, problems are : Problem set: 0 solved, 4211 unsolved
Search for dead transitions found 0 dead transitions in 59243ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105541 ms. Remains : 978/978 places, 4273/4273 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 10 factoid took 237 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 81 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1711 reset in 446 ms.
Product exploration explored 100000 steps with 1709 reset in 473 ms.
Built C files in :
/tmp/ltsmin12868952754925060153
[2024-05-24 19:29:15] [INFO ] Too many transitions (2532) to apply POR reductions. Disabling POR matrices.
[2024-05-24 19:29:15] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12868952754925060153
Running compilation step : cd /tmp/ltsmin12868952754925060153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12868952754925060153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12868952754925060153;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 1113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1113/1113 places, 2532/2532 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1112 transition count 2531
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1111 transition count 2530
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1111 transition count 2530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1110 transition count 2522
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1110 transition count 2522
Applied a total of 6 rules in 170 ms. Remains 1110 /1113 variables (removed 3) and now considering 2522/2532 (removed 10) transitions.
[2024-05-24 19:29:18] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
// Phase 1: matrix 2250 rows 1110 cols
[2024-05-24 19:29:18] [INFO ] Computed 49 invariants in 24 ms
[2024-05-24 19:29:19] [INFO ] Implicit Places using invariants in 991 ms returned []
[2024-05-24 19:29:19] [INFO ] Flow matrix only has 2250 transitions (discarded 272 similar events)
[2024-05-24 19:29:19] [INFO ] Invariant cache hit.
[2024-05-24 19:29:19] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 19:29:30] [INFO ] Implicit Places using invariants and state equation in 10766 ms returned [1103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11760 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1109/1113 places, 2522/2532 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1109 transition count 2521
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1108 transition count 2521
Applied a total of 2 rules in 74 ms. Remains 1108 /1109 variables (removed 1) and now considering 2521/2522 (removed 1) transitions.
[2024-05-24 19:29:30] [INFO ] Flow matrix only has 2249 transitions (discarded 272 similar events)
// Phase 1: matrix 2249 rows 1108 cols
[2024-05-24 19:29:30] [INFO ] Computed 48 invariants in 27 ms
[2024-05-24 19:29:31] [INFO ] Implicit Places using invariants in 909 ms returned []
[2024-05-24 19:29:31] [INFO ] Flow matrix only has 2249 transitions (discarded 272 similar events)
[2024-05-24 19:29:31] [INFO ] Invariant cache hit.
[2024-05-24 19:29:31] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 19:29:40] [INFO ] Implicit Places using invariants and state equation in 9107 ms returned []
Implicit Place search using SMT with State Equation took 10016 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1108/1113 places, 2521/2532 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22020 ms. Remains : 1108/1113 places, 2521/2532 transitions.
Built C files in :
/tmp/ltsmin115674617002097218
[2024-05-24 19:29:40] [INFO ] Too many transitions (2521) to apply POR reductions. Disabling POR matrices.
[2024-05-24 19:29:40] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin115674617002097218
Running compilation step : cd /tmp/ltsmin115674617002097218;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin115674617002097218;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin115674617002097218;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 19:29:43] [INFO ] Flatten gal took : 48 ms
[2024-05-24 19:29:43] [INFO ] Flatten gal took : 49 ms
[2024-05-24 19:29:43] [INFO ] Time to serialize gal into /tmp/LTL16877030627447171408.gal : 10 ms
[2024-05-24 19:29:43] [INFO ] Time to serialize properties into /tmp/LTL3201311824618368730.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16877030627447171408.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9131522815615241230.hoa' '-atoms' '/tmp/LTL3201311824618368730.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3201311824618368730.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9131522815615241230.hoa
Detected timeout of ITS tools.
[2024-05-24 19:29:58] [INFO ] Flatten gal took : 48 ms
[2024-05-24 19:29:58] [INFO ] Flatten gal took : 49 ms
[2024-05-24 19:29:58] [INFO ] Time to serialize gal into /tmp/LTL12497290724569966042.gal : 9 ms
[2024-05-24 19:29:58] [INFO ] Time to serialize properties into /tmp/LTL4156606286354351500.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12497290724569966042.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4156606286354351500.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtTheLeftExtremityOfTheLeafSet<1))"))||(((X((G("((Node15ManageTheCrashOfNode2<1)||(Lx...583
Formula 0 simplified : G(F!"((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtTheLeftExtremityOfTheLeafSet<1))" & (!"(((Node15ManageTheCrashOfNode2<1)||(Lx1IsAtThe...567
Detected timeout of ITS tools.
[2024-05-24 19:30:13] [INFO ] Flatten gal took : 48 ms
[2024-05-24 19:30:13] [INFO ] Applying decomposition
[2024-05-24 19:30:13] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15428033587008269203.txt' '-o' '/tmp/graph15428033587008269203.bin' '-w' '/tmp/graph15428033587008269203.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15428033587008269203.bin' '-l' '-1' '-v' '-w' '/tmp/graph15428033587008269203.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:30:13] [INFO ] Decomposing Gal with order
[2024-05-24 19:30:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:30:14] [INFO ] Removed a total of 2268 redundant transitions.
[2024-05-24 19:30:14] [INFO ] Flatten gal took : 243 ms
[2024-05-24 19:30:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 994 labels/synchronizations in 41 ms.
[2024-05-24 19:30:14] [INFO ] Time to serialize gal into /tmp/LTL14134033285350872602.gal : 12 ms
[2024-05-24 19:30:14] [INFO ] Time to serialize properties into /tmp/LTL18383139198132381912.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14134033285350872602.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18383139198132381912.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("((i14.i0.i1.u16.Node15ManageTheCrashOfNode2<1)||(i14.i0.i1.u154.Lx1IsAtTheLeftExtremityOfTheLeafSet<1))"))||(((X((G("((i14.i0...756
Formula 0 simplified : G(F!"((i14.i0.i1.u16.Node15ManageTheCrashOfNode2<1)||(i14.i0.i1.u154.Lx1IsAtTheLeftExtremityOfTheLeafSet<1))" & (!"(((i14.i0.i1.u16....740
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C08-LTLFireability-14 finished in 456281 ms.
[2024-05-24 19:30:29] [INFO ] Flatten gal took : 62 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1691788610828003166
[2024-05-24 19:30:29] [INFO ] Too many transitions (2971) to apply POR reductions. Disabling POR matrices.
[2024-05-24 19:30:29] [INFO ] Applying decomposition
[2024-05-24 19:30:29] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1691788610828003166
Running compilation step : cd /tmp/ltsmin1691788610828003166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 19:30:29] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14165226224682113616.txt' '-o' '/tmp/graph14165226224682113616.bin' '-w' '/tmp/graph14165226224682113616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14165226224682113616.bin' '-l' '-1' '-v' '-w' '/tmp/graph14165226224682113616.weights' '-q' '0' '-e' '0.001'
[2024-05-24 19:30:29] [INFO ] Decomposing Gal with order
[2024-05-24 19:30:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 19:30:29] [INFO ] Removed a total of 2488 redundant transitions.
[2024-05-24 19:30:29] [INFO ] Flatten gal took : 171 ms
[2024-05-24 19:30:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1533 labels/synchronizations in 62 ms.
[2024-05-24 19:30:29] [INFO ] Time to serialize gal into /tmp/LTLFireability10531026627611716871.gal : 23 ms
[2024-05-24 19:30:29] [INFO ] Time to serialize properties into /tmp/LTLFireability15359769301825334766.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10531026627611716871.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15359769301825334766.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((X(X((F(G("((i4.i5.u214.Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(i4.i5.u30.LeafSetOfRx3IsSentToNode0<1))")))||(G("((i9.i4.u8...245
Formula 0 simplified : XX(GF!"((i4.i5.u214.Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(i4.i5.u30.LeafSetOfRx3IsSentToNode0<1))" & F!"((i9.i4.u81.Node4...233
Compilation finished in 8257 ms.
Running link step : cd /tmp/ltsmin1691788610828003166;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin1691788610828003166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin1691788610828003166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>([]((LTLAPp0==true)))||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1691788610828003166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((<>(((LTLAPp3==true)||[](<>((LTLAPp4==true)))))||(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin1691788610828003166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((<>(((LTLAPp3==true)||[](<>((LTLAPp4==true)))))||(LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1691788610828003166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](!(LTLAPp5==true))||(!(LTLAPp6==true)&&X(([](!(LTLAPp5==true))||(!(LTLAPp5==true)&&[](<>((LTLAPp7==true)))))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-24 19:46:29] [INFO ] Flatten gal took : 175 ms
[2024-05-24 19:46:29] [INFO ] Time to serialize gal into /tmp/LTLFireability6922798896466137285.gal : 48 ms
[2024-05-24 19:46:29] [INFO ] Time to serialize properties into /tmp/LTLFireability8638295910534727464.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6922798896466137285.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8638295910534727464.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 3 LTL properties
Checking formula 0 : !((X(X((F(G("((Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(LeafSetOfRx3IsSentToNode0<1))")))||(G("((Node4ManageTheCrashOfNode3<1)...204
Formula 0 simplified : XX(GF!"((Node0HasAskedItsLeafSetToRx3ToReplaceNode11<1)||(LeafSetOfRx3IsSentToNode0<1))" & F!"((Node4ManageTheCrashOfNode3<1)||(Lx0I...192
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-S16C08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-5568"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C08, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654350800052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C08.tgz
mv MultiCrashLeafsetExtension-PT-S16C08 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;