About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFTFFFF?TTTFFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524300307.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524300307
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.1M
-rw-r--r-- 1 mcc users 16K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.6M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748930705072
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-03 06:05:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 06:05:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 06:05:08] [INFO ] Load time of PNML (sax parser for PT used): 546 ms
[2025-06-03 06:05:08] [INFO ] Transformed 4914 places.
[2025-06-03 06:05:08] [INFO ] Transformed 6913 transitions.
[2025-06-03 06:05:08] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 757 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 4914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 4884 transition count 6913
Discarding 1343 places :
Symmetric choice reduction at 1 with 1343 rule applications. Total rules 1373 place count 3541 transition count 5570
Iterating global reduction 1 with 1343 rules applied. Total rules applied 2716 place count 3541 transition count 5570
Discarding 1172 places :
Symmetric choice reduction at 1 with 1172 rule applications. Total rules 3888 place count 2369 transition count 4398
Iterating global reduction 1 with 1172 rules applied. Total rules applied 5060 place count 2369 transition count 4398
Discarding 219 places :
Symmetric choice reduction at 1 with 219 rule applications. Total rules 5279 place count 2150 transition count 3303
Iterating global reduction 1 with 219 rules applied. Total rules applied 5498 place count 2150 transition count 3303
Applied a total of 5498 rules in 1364 ms. Remains 2150 /4914 variables (removed 2764) and now considering 3303/6913 (removed 3610) transitions.
[2025-06-03 06:05:10] [INFO ] Flow matrix only has 3031 transitions (discarded 272 similar events)
// Phase 1: matrix 3031 rows 2150 cols
[2025-06-03 06:05:10] [INFO ] Computed 505 invariants in 292 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:05:16] [INFO ] Implicit Places using invariants in 6201 ms returned [4, 8, 14, 16, 18, 20, 22, 27, 34, 43, 57, 70, 85, 101, 117, 119, 121, 123, 125, 127, 140, 151, 160, 167, 172, 175, 198, 205, 208, 209, 210, 211, 212, 213, 216, 221, 228, 237, 248, 261, 275, 289, 290, 293, 294, 305, 314, 321, 326, 332, 336, 359, 366, 369, 370, 372, 373, 374, 379, 382, 387, 394, 403, 414, 426, 438, 439, 440, 441, 442, 443, 452, 459, 464, 467, 469, 471, 494, 501, 504, 505, 506, 509, 511, 513, 516, 524, 531, 542, 552, 562, 563, 564, 565, 566, 567, 574, 579, 582, 584, 586, 588, 611, 618, 621, 622, 623, 624, 625, 626, 628, 630, 632, 635, 640, 647, 655, 663, 664, 665, 666, 668, 673, 679, 681, 683, 685, 687, 710, 717, 720, 721, 722, 723, 724, 725, 727, 729, 731, 733, 736, 741, 747, 753, 754, 755, 756, 757, 758, 761, 763, 765, 767, 769, 771, 794, 801, 805, 806, 807, 808, 809, 813, 815, 817, 819, 821, 824, 828, 832, 833, 834, 835, 836, 837, 839, 841, 843, 845, 847, 849, 872, 879, 882, 883, 884, 885, 886, 887, 889, 891, 893, 895, 897, 899, 901, 904, 905, 907, 908, 909, 911, 913, 917, 919, 921, 923, 946, 948, 952, 955, 956, 957, 958, 959, 960, 962, 964, 966, 968, 970, 972, 974, 977, 978, 979, 980, 981, 982, 984, 986, 988, 990, 992, 994, 1017, 1024, 1027, 1028, 1029, 1030, 1032, 1034, 1036, 1041, 1043, 1045, 1047, 1049, 1052, 1054, 1055, 1056, 1057, 1059, 1061, 1063, 1065, 1067, 1071, 1094, 1101, 1104, 1105, 1106, 1107, 1108, 1109, 1111, 1113, 1115, 1117, 1119, 1121, 1124, 1130, 1131, 1132, 1133, 1134, 1137, 1142, 1144, 1146, 1148, 1150, 1173, 1180, 1183, 1184, 1185, 1186, 1187, 1188, 1190, 1192, 1194, 1196, 1198, 1201, 1206, 1213, 1215, 1216, 1217, 1218, 1225, 1228, 1230, 1232, 1234, 1236, 1259, 1266, 1269, 1270, 1271, 1272, 1273, 1274, 1276, 1278, 1280, 1282, 1285, 1290, 1297, 1306, 1307, 1308, 1309, 1310, 1311, 1318, 1323, 1326, 1328, 1330, 1332, 1355, 1362, 1365, 1368, 1369, 1370, 1372, 1374, 1376, 1379, 1384, 1393, 1404, 1415, 1416, 1417, 1418, 1419, 1420, 1429, 1436, 1441, 1444, 1446, 1448, 1471, 1478, 1481, 1482, 1483, 1484, 1485, 1486, 1488, 1490, 1493, 1498, 1505, 1514, 1525, 1538, 1539, 1540, 1541, 1542, 1543, 1554, 1563, 1570, 1575, 1578, 1580, 1603, 1610, 1613, 1615, 1616, 1617, 1618, 1620, 1623, 1628, 1637, 1646, 1657, 1670, 1685, 1687, 1688, 1689, 1690, 1703, 1714, 1723, 1732, 1737, 1740, 1763, 1765, 1769, 1772, 1773, 1774, 1775, 1776, 1777, 1780, 1785, 1792, 1801, 1812, 1825, 1840, 1857, 1858, 1859, 1861, 1862, 1877, 1890, 1903, 1912, 1919, 1925, 1949]
[2025-06-03 06:05:16] [INFO ] Actually due to overlaps returned [198, 359, 494, 611, 710, 794, 872, 946, 1017, 1094, 1173, 1259, 1355, 1471, 1603, 1763, 1949, 4, 14, 16, 18, 20, 117, 119, 121, 123, 125, 208, 209, 210, 211, 212, 289, 290, 293, 369, 370, 372, 373, 438, 439, 440, 441, 442, 504, 505, 506, 562, 563, 564, 565, 566, 621, 622, 623, 624, 625, 663, 664, 665, 666, 720, 721, 722, 723, 724, 753, 754, 755, 756, 757, 805, 806, 807, 808, 832, 833, 834, 835, 836, 882, 883, 884, 885, 886, 904, 905, 907, 908, 948, 955, 956, 957, 958, 959, 977, 978, 979, 980, 981, 1027, 1028, 1029, 1030, 1052, 1054, 1055, 1056, 1104, 1105, 1106, 1107, 1108, 1130, 1131, 1132, 1133, 1183, 1184, 1185, 1186, 1187, 1213, 1215, 1216, 1217, 1269, 1270, 1271, 1272, 1273, 1306, 1307, 1308, 1309, 1310, 1365, 1368, 1369, 1415, 1416, 1417, 1418, 1419, 1481, 1482, 1483, 1484, 1485, 1538, 1539, 1540, 1541, 1542, 1613, 1615, 1616, 1617, 1685, 1687, 1688, 1689, 1765, 1772, 1773, 1774, 1775, 1776, 1857, 1858, 1859, 1861]
Discarding 172 places :
Implicit Place search using SMT only with invariants took 6364 ms to find 172 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1978/4914 places, 3303/6913 transitions.
Discarding 140 places :
Symmetric choice reduction at 0 with 140 rule applications. Total rules 140 place count 1838 transition count 3163
Iterating global reduction 0 with 140 rules applied. Total rules applied 280 place count 1838 transition count 3163
Discarding 138 places :
Symmetric choice reduction at 0 with 138 rule applications. Total rules 418 place count 1700 transition count 3025
Iterating global reduction 0 with 138 rules applied. Total rules applied 556 place count 1700 transition count 3025
Discarding 138 places :
Symmetric choice reduction at 0 with 138 rule applications. Total rules 694 place count 1562 transition count 2887
Iterating global reduction 0 with 138 rules applied. Total rules applied 832 place count 1562 transition count 2887
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 846 place count 1548 transition count 2817
Iterating global reduction 0 with 14 rules applied. Total rules applied 860 place count 1548 transition count 2817
Applied a total of 860 rules in 472 ms. Remains 1548 /1978 variables (removed 430) and now considering 2817/3303 (removed 486) transitions.
[2025-06-03 06:05:16] [INFO ] Flow matrix only has 2545 transitions (discarded 272 similar events)
// Phase 1: matrix 2545 rows 1548 cols
[2025-06-03 06:05:16] [INFO ] Computed 333 invariants in 154 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:05:21] [INFO ] Implicit Places using invariants in 5162 ms returned [7, 17, 22, 29, 38, 52, 65, 80, 96, 117, 130, 141, 150, 157, 162, 165, 194, 197, 200, 205, 212, 221, 232, 245, 259, 275, 286, 295, 302, 307, 313, 317, 332, 336, 341, 344, 349, 356, 365, 376, 388, 400, 409, 416, 421, 424, 426, 428, 441, 446, 448, 450, 453, 461, 468, 479, 489, 498, 505, 510, 513, 515, 517, 519, 534, 537, 539, 541, 543, 546, 551, 558, 566, 575, 580, 586, 588, 590, 592, 594, 606, 608, 610, 612, 614, 616, 619, 624, 630, 635, 638, 640, 642, 644, 646, 648, 657, 661, 665, 667, 669, 671, 673, 676, 680, 683, 685, 687, 689, 691, 693, 695, 706, 708, 710, 712, 714, 716, 718, 720, 722, 726, 728, 730, 734, 736, 738, 740, 749, 752, 754, 756, 758, 760, 762, 764, 766, 768, 770, 772, 774, 776, 778, 780, 790, 794, 796, 798, 803, 805, 807, 809, 811, 815, 817, 819, 821, 823, 825, 829, 842, 844, 846, 848, 850, 852, 854, 856, 859, 865, 868, 873, 875, 877, 879, 881, 892, 894, 896, 898, 900, 902, 904, 907, 912, 920, 927, 930, 932, 934, 936, 938, 949, 951, 953, 955, 957, 959, 962, 967, 974, 982, 989, 994, 997, 999, 1001, 1003, 1012, 1017, 1019, 1021, 1023, 1026, 1031, 1040, 1051, 1061, 1070, 1077, 1082, 1085, 1087, 1089, 1102, 1104, 1106, 1108, 1111, 1116, 1123, 1132, 1143, 1155, 1166, 1175, 1182, 1187, 1190, 1192, 1201, 1205, 1207, 1210, 1215, 1224, 1233, 1244, 1257, 1273, 1286, 1297, 1306, 1315, 1320, 1323, 1334, 1336, 1339, 1344, 1351, 1360, 1371, 1384, 1399, 1417, 1432, 1445, 1458, 1467, 1474, 1480]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 5197 ms to find 272 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1276/4914 places, 2817/6913 transitions.
Applied a total of 0 rules in 125 ms. Remains 1276 /1276 variables (removed 0) and now considering 2817/2817 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13550 ms. Remains : 1276/4914 places, 2817/6913 transitions.
Support contains 36 out of 1276 places after structural reductions.
[2025-06-03 06:05:23] [INFO ] Flatten gal took : 489 ms
[2025-06-03 06:05:23] [INFO ] Flatten gal took : 267 ms
[2025-06-03 06:05:23] [INFO ] Input system was already deterministic with 2817 transitions.
Support contains 35 out of 1276 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (767 resets) in 2814 ms. (14 steps per ms) remains 14/24 properties
BEST_FIRST walk for 40003 steps (200 resets) in 429 ms. (93 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (200 resets) in 326 ms. (122 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (200 resets) in 356 ms. (112 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (200 resets) in 313 ms. (127 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (200 resets) in 335 ms. (119 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (200 resets) in 346 ms. (115 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (200 resets) in 273 ms. (145 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (200 resets) in 233 ms. (170 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (200 resets) in 177 ms. (224 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (200 resets) in 231 ms. (172 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (200 resets) in 144 ms. (275 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (200 resets) in 133 ms. (298 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (200 resets) in 289 ms. (137 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (200 resets) in 270 ms. (147 steps per ms) remains 14/14 properties
[2025-06-03 06:05:25] [INFO ] Flow matrix only has 2545 transitions (discarded 272 similar events)
// Phase 1: matrix 2545 rows 1276 cols
[2025-06-03 06:05:25] [INFO ] Computed 61 invariants in 46 ms
[2025-06-03 06:05:26] [INFO ] State equation strengthened by 974 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 1162/1181 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1181 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 8 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 3 (OVERLAPS) 57/1238 variables, 20/23 constraints. Problems are: Problem set: 9 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:05:28] [INFO ] Deduced a trap composed of 98 places in 1918 ms of which 290 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:05:30] [INFO ] Deduced a trap composed of 158 places in 1354 ms of which 249 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:05:32] [INFO ] Deduced a trap composed of 160 places in 1637 ms of which 244 ms to minimize.
SMT process timed out in 6160ms, After SMT, problems are : Problem set: 9 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 1276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1276/1276 places, 2817/2817 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 1276 transition count 2802
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 1261 transition count 2802
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 30 place count 1261 transition count 2780
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 74 place count 1239 transition count 2780
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 84 place count 1229 transition count 2766
Iterating global reduction 2 with 10 rules applied. Total rules applied 94 place count 1229 transition count 2766
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 94 place count 1229 transition count 2764
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 1227 transition count 2764
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 107 place count 1218 transition count 2727
Iterating global reduction 2 with 9 rules applied. Total rules applied 116 place count 1218 transition count 2727
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 1216 transition count 2717
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 1216 transition count 2717
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 3 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 186 place count 1183 transition count 2684
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 192 place count 1177 transition count 2678
Iterating global reduction 2 with 6 rules applied. Total rules applied 198 place count 1177 transition count 2678
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 204 place count 1171 transition count 2648
Iterating global reduction 2 with 6 rules applied. Total rules applied 210 place count 1171 transition count 2648
Free-agglomeration rule (complex) applied 152 times.
Iterating global reduction 2 with 152 rules applied. Total rules applied 362 place count 1171 transition count 3492
Reduce places removed 152 places and 0 transitions.
Iterating post reduction 2 with 152 rules applied. Total rules applied 514 place count 1019 transition count 3492
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 527 place count 1019 transition count 3492
Applied a total of 527 rules in 1476 ms. Remains 1019 /1276 variables (removed 257) and now considering 3492/2817 (removed -675) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1477 ms. Remains : 1019/1276 places, 3492/2817 transitions.
RANDOM walk for 40000 steps (1352 resets) in 1509 ms. (26 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (161 resets) in 251 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (158 resets) in 206 ms. (193 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (161 resets) in 197 ms. (202 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (161 resets) in 247 ms. (161 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (159 resets) in 261 ms. (152 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 46750 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :0 out of 5
Probabilistic random walk after 46750 steps, saw 19863 distinct states, run finished after 3010 ms. (steps per millisecond=15 ) properties seen :0
[2025-06-03 06:05:37] [INFO ] Flow matrix only has 3094 transitions (discarded 398 similar events)
// Phase 1: matrix 3094 rows 1019 cols
[2025-06-03 06:05:37] [INFO ] Computed 61 invariants in 43 ms
[2025-06-03 06:05:37] [INFO ] State equation strengthened by 1906 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 924/934 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/934 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 47/981 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/981 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 28/1009 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1009 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 10/1019 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1019 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 3094/4113 variables, 1019/1080 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/4113 variables, 1906/2986 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4113 variables, 0/2986 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/4113 variables, 0/2986 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4113/4113 variables, and 2986 constraints, problems are : Problem set: 1 solved, 4 unsolved in 4078 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1019/1019 constraints, ReadFeed: 1906/1906 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 925/934 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:05:43] [INFO ] Deduced a trap composed of 110 places in 1148 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:05:44] [INFO ] Deduced a trap composed of 159 places in 1578 ms of which 191 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:05:46] [INFO ] Deduced a trap composed of 141 places in 1340 ms of which 190 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:05:47] [INFO ] Deduced a trap composed of 111 places in 1222 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:05:48] [INFO ] Deduced a trap composed of 181 places in 1463 ms of which 206 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:05:49] [INFO ] Deduced a trap composed of 181 places in 1117 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:05:51] [INFO ] Deduced a trap composed of 110 places in 1077 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:05:52] [INFO ] Deduced a trap composed of 207 places in 1231 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:05:53] [INFO ] Deduced a trap composed of 117 places in 1192 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:05:54] [INFO ] Deduced a trap composed of 111 places in 1296 ms of which 97 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/934 variables, 10/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/934 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 4 (OVERLAPS) 47/981 variables, 20/33 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:05:56] [INFO ] Deduced a trap composed of 5 places in 1098 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:05:57] [INFO ] Deduced a trap composed of 116 places in 1161 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:05:58] [INFO ] Deduced a trap composed of 118 places in 1240 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:05:59] [INFO ] Deduced a trap composed of 118 places in 1071 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:00] [INFO ] Deduced a trap composed of 120 places in 980 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:02] [INFO ] Deduced a trap composed of 119 places in 1269 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:03] [INFO ] Deduced a trap composed of 118 places in 1127 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:04] [INFO ] Deduced a trap composed of 118 places in 1158 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:05] [INFO ] Deduced a trap composed of 119 places in 1199 ms of which 251 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:06] [INFO ] Deduced a trap composed of 119 places in 1223 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:08] [INFO ] Deduced a trap composed of 118 places in 1158 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:09] [INFO ] Deduced a trap composed of 116 places in 1175 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:10] [INFO ] Deduced a trap composed of 116 places in 1506 ms of which 193 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:12] [INFO ] Deduced a trap composed of 116 places in 1185 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:13] [INFO ] Deduced a trap composed of 116 places in 1026 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:14] [INFO ] Deduced a trap composed of 116 places in 1022 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:15] [INFO ] Deduced a trap composed of 116 places in 1180 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:16] [INFO ] Deduced a trap composed of 116 places in 1067 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:17] [INFO ] Deduced a trap composed of 116 places in 1041 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:18] [INFO ] Deduced a trap composed of 116 places in 1037 ms of which 139 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/981 variables, 20/53 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:19] [INFO ] Deduced a trap composed of 116 places in 1039 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:20] [INFO ] Deduced a trap composed of 27 places in 1007 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:22] [INFO ] Deduced a trap composed of 46 places in 1316 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:23] [INFO ] Deduced a trap composed of 27 places in 1206 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:24] [INFO ] Deduced a trap composed of 57 places in 1351 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:25] [INFO ] Deduced a trap composed of 46 places in 1190 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:27] [INFO ] Deduced a trap composed of 62 places in 1176 ms of which 115 ms to minimize.
SMT process timed out in 49618ms, After SMT, problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1019 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1019/1019 places, 3492/3492 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1019 transition count 3491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1018 transition count 3491
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 1017 transition count 3490
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 1017 transition count 3490
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1016 transition count 3489
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1016 transition count 3489
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1015 transition count 3488
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 1014 transition count 3487
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 1014 transition count 3487
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1014 transition count 3487
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 1012 transition count 3485
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 1012 transition count 3485
Applied a total of 16 rules in 933 ms. Remains 1012 /1019 variables (removed 7) and now considering 3485/3492 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 933 ms. Remains : 1012/1019 places, 3485/3492 transitions.
RANDOM walk for 40000 steps (1362 resets) in 1246 ms. (32 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (158 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (158 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (161 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 50986 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 3
Probabilistic random walk after 50986 steps, saw 21642 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-03 06:06:31] [INFO ] Flow matrix only has 3087 transitions (discarded 398 similar events)
// Phase 1: matrix 3087 rows 1012 cols
[2025-06-03 06:06:31] [INFO ] Computed 61 invariants in 36 ms
[2025-06-03 06:06:31] [INFO ] State equation strengthened by 1906 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 922/927 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/927 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 47/974 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/974 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 28/1002 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 10/1012 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1012 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3087/4099 variables, 1012/1073 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4099 variables, 1906/2979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4099 variables, 0/2979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/4099 variables, 0/2979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4099/4099 variables, and 2979 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2921 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1012/1012 constraints, ReadFeed: 1906/1906 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 922/927 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:36] [INFO ] Deduced a trap composed of 202 places in 1311 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:37] [INFO ] Deduced a trap composed of 176 places in 1360 ms of which 177 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:38] [INFO ] Deduced a trap composed of 122 places in 1341 ms of which 154 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/927 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/927 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 47/974 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:40] [INFO ] Deduced a trap composed of 5 places in 1465 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:42] [INFO ] Deduced a trap composed of 53 places in 1544 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:43] [INFO ] Deduced a trap composed of 53 places in 1459 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:45] [INFO ] Deduced a trap composed of 53 places in 1559 ms of which 127 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:47] [INFO ] Deduced a trap composed of 53 places in 1648 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:48] [INFO ] Deduced a trap composed of 53 places in 1409 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:49] [INFO ] Deduced a trap composed of 53 places in 1358 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:51] [INFO ] Deduced a trap composed of 53 places in 1580 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:52] [INFO ] Deduced a trap composed of 53 places in 1278 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:54] [INFO ] Deduced a trap composed of 53 places in 1378 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:55] [INFO ] Deduced a trap composed of 53 places in 1138 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:56] [INFO ] Deduced a trap composed of 55 places in 1432 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:57] [INFO ] Deduced a trap composed of 95 places in 1005 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:06:59] [INFO ] Deduced a trap composed of 55 places in 1199 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:00] [INFO ] Deduced a trap composed of 56 places in 1314 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:01] [INFO ] Deduced a trap composed of 56 places in 1262 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:03] [INFO ] Deduced a trap composed of 57 places in 1352 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:04] [INFO ] Deduced a trap composed of 56 places in 1266 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:05] [INFO ] Deduced a trap composed of 55 places in 1253 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:06] [INFO ] Deduced a trap composed of 56 places in 1371 ms of which 103 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/974 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:08] [INFO ] Deduced a trap composed of 57 places in 1218 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:09] [INFO ] Deduced a trap composed of 55 places in 1265 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:10] [INFO ] Deduced a trap composed of 124 places in 1211 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:12] [INFO ] Deduced a trap composed of 55 places in 1271 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:13] [INFO ] Deduced a trap composed of 56 places in 1376 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:14] [INFO ] Deduced a trap composed of 129 places in 1074 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:15] [INFO ] Deduced a trap composed of 53 places in 1240 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:17] [INFO ] Deduced a trap composed of 56 places in 1414 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:18] [INFO ] Deduced a trap composed of 56 places in 1350 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:20] [INFO ] Deduced a trap composed of 53 places in 1326 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:21] [INFO ] Deduced a trap composed of 56 places in 1199 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:22] [INFO ] Deduced a trap composed of 56 places in 1496 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:24] [INFO ] Deduced a trap composed of 56 places in 1438 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:25] [INFO ] Deduced a trap composed of 56 places in 1468 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:27] [INFO ] Deduced a trap composed of 56 places in 1397 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:28] [INFO ] Deduced a trap composed of 56 places in 1342 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:29] [INFO ] Deduced a trap composed of 56 places in 1399 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:31] [INFO ] Deduced a trap composed of 56 places in 1199 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:32] [INFO ] Deduced a trap composed of 56 places in 1277 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:33] [INFO ] Deduced a trap composed of 56 places in 1348 ms of which 106 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/974 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:35] [INFO ] Deduced a trap composed of 56 places in 1291 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:36] [INFO ] Deduced a trap composed of 56 places in 1335 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:37] [INFO ] Deduced a trap composed of 56 places in 1188 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:39] [INFO ] Deduced a trap composed of 56 places in 1459 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:40] [INFO ] Deduced a trap composed of 56 places in 1432 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:42] [INFO ] Deduced a trap composed of 56 places in 1304 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:43] [INFO ] Deduced a trap composed of 53 places in 1121 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:44] [INFO ] Deduced a trap composed of 56 places in 1182 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:45] [INFO ] Deduced a trap composed of 56 places in 1381 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:46] [INFO ] Deduced a trap composed of 56 places in 1145 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:48] [INFO ] Deduced a trap composed of 53 places in 1285 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:49] [INFO ] Deduced a trap composed of 53 places in 1179 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:07:51] [INFO ] Deduced a trap composed of 56 places in 1597 ms of which 159 ms to minimize.
SMT process timed out in 79593ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1012 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1012/1012 places, 3485/3485 transitions.
Applied a total of 0 rules in 190 ms. Remains 1012 /1012 variables (removed 0) and now considering 3485/3485 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 1012/1012 places, 3485/3485 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1012/1012 places, 3485/3485 transitions.
Applied a total of 0 rules in 168 ms. Remains 1012 /1012 variables (removed 0) and now considering 3485/3485 (removed 0) transitions.
[2025-06-03 06:07:51] [INFO ] Flow matrix only has 3087 transitions (discarded 398 similar events)
[2025-06-03 06:07:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:07:54] [INFO ] Implicit Places using invariants in 2914 ms returned [7, 196, 236, 309, 390, 437, 470, 516, 542, 571, 628, 629, 756, 806, 914]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 2928 ms to find 15 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 997/1012 places, 3485/3485 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 988 transition count 3476
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 988 transition count 3476
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 979 transition count 3467
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 979 transition count 3467
Applied a total of 36 rules in 304 ms. Remains 979 /997 variables (removed 18) and now considering 3467/3485 (removed 18) transitions.
[2025-06-03 06:07:54] [INFO ] Flow matrix only has 3069 transitions (discarded 398 similar events)
// Phase 1: matrix 3069 rows 979 cols
[2025-06-03 06:07:54] [INFO ] Computed 46 invariants in 58 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:07:57] [INFO ] Implicit Places using invariants in 2700 ms returned []
[2025-06-03 06:07:57] [INFO ] Flow matrix only has 3069 transitions (discarded 398 similar events)
[2025-06-03 06:07:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:07:58] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2025-06-03 06:08:29] [INFO ] Performed 441/979 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 06:08:59] [INFO ] Performed 734/979 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 06:09:15] [INFO ] Implicit Places using invariants and state equation in 78557 ms returned []
Implicit Place search using SMT with State Equation took 81273 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 979/1012 places, 3467/3485 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 84674 ms. Remains : 979/1012 places, 3467/3485 transitions.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 11 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 444 stabilizing places and 1184 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)&&X(X(X(G(p1)))))))))'
Support contains 3 out of 1276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1276/1276 places, 2817/2817 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1255 transition count 2792
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1255 transition count 2792
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 62 place count 1235 transition count 2728
Iterating global reduction 0 with 20 rules applied. Total rules applied 82 place count 1235 transition count 2728
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 91 place count 1226 transition count 2687
Iterating global reduction 0 with 9 rules applied. Total rules applied 100 place count 1226 transition count 2687
Applied a total of 100 rules in 477 ms. Remains 1226 /1276 variables (removed 50) and now considering 2687/2817 (removed 130) transitions.
[2025-06-03 06:09:16] [INFO ] Flow matrix only has 2415 transitions (discarded 272 similar events)
// Phase 1: matrix 2415 rows 1226 cols
[2025-06-03 06:09:16] [INFO ] Computed 61 invariants in 55 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:09:19] [INFO ] Implicit Places using invariants in 2905 ms returned [248, 249, 297, 387, 388, 485, 543, 582, 622, 632, 664, 700, 770, 771, 923, 981, 1107]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 2908 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1209/1276 places, 2687/2817 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1192 transition count 2670
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1192 transition count 2670
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1175 transition count 2653
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1175 transition count 2653
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 85 place count 1158 transition count 2636
Iterating global reduction 0 with 17 rules applied. Total rules applied 102 place count 1158 transition count 2636
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 116 place count 1144 transition count 2566
Iterating global reduction 0 with 14 rules applied. Total rules applied 130 place count 1144 transition count 2566
Applied a total of 130 rules in 586 ms. Remains 1144 /1209 variables (removed 65) and now considering 2566/2687 (removed 121) transitions.
[2025-06-03 06:09:20] [INFO ] Flow matrix only has 2294 transitions (discarded 272 similar events)
// Phase 1: matrix 2294 rows 1144 cols
[2025-06-03 06:09:20] [INFO ] Computed 44 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:09:22] [INFO ] Implicit Places using invariants in 2292 ms returned []
[2025-06-03 06:09:22] [INFO ] Flow matrix only has 2294 transitions (discarded 272 similar events)
[2025-06-03 06:09:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:09:24] [INFO ] State equation strengthened by 838 read => feed constraints.
[2025-06-03 06:09:54] [INFO ] Performed 1094/1144 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 06:09:55] [INFO ] Implicit Places using invariants and state equation in 33172 ms returned []
Implicit Place search using SMT with State Equation took 35468 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1144/1276 places, 2566/2817 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39441 ms. Remains : 1144/1276 places, 2566/2817 transitions.
Stuttering acceptance computed with spot in 573 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-00 finished in 40133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&F(p1))))'
Support contains 3 out of 1276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1276/1276 places, 2817/2817 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1255 transition count 2792
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1255 transition count 2792
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 62 place count 1235 transition count 2732
Iterating global reduction 0 with 20 rules applied. Total rules applied 82 place count 1235 transition count 2732
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 1225 transition count 2690
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 1225 transition count 2690
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 1224 transition count 2685
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 1224 transition count 2685
Applied a total of 104 rules in 368 ms. Remains 1224 /1276 variables (removed 52) and now considering 2685/2817 (removed 132) transitions.
[2025-06-03 06:09:56] [INFO ] Flow matrix only has 2413 transitions (discarded 272 similar events)
// Phase 1: matrix 2413 rows 1224 cols
[2025-06-03 06:09:56] [INFO ] Computed 61 invariants in 65 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:09:59] [INFO ] Implicit Places using invariants in 2821 ms returned [10, 246, 297, 384, 385, 482, 540, 621, 631, 663, 699, 769, 770, 922, 980, 1106]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 2824 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1208/1276 places, 2685/2817 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1192 transition count 2669
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1192 transition count 2669
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 48 place count 1176 transition count 2653
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 1176 transition count 2653
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 80 place count 1160 transition count 2637
Iterating global reduction 0 with 16 rules applied. Total rules applied 96 place count 1160 transition count 2637
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 109 place count 1147 transition count 2572
Iterating global reduction 0 with 13 rules applied. Total rules applied 122 place count 1147 transition count 2572
Applied a total of 122 rules in 353 ms. Remains 1147 /1208 variables (removed 61) and now considering 2572/2685 (removed 113) transitions.
[2025-06-03 06:09:59] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1147 cols
[2025-06-03 06:09:59] [INFO ] Computed 45 invariants in 50 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:10:02] [INFO ] Implicit Places using invariants in 2225 ms returned []
[2025-06-03 06:10:02] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
[2025-06-03 06:10:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:10:03] [INFO ] State equation strengthened by 842 read => feed constraints.
[2025-06-03 06:10:33] [INFO ] Performed 1062/1147 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 06:10:35] [INFO ] Implicit Places using invariants and state equation in 33259 ms returned [1117]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 35489 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1146/1276 places, 2572/2817 transitions.
Applied a total of 0 rules in 94 ms. Remains 1146 /1146 variables (removed 0) and now considering 2572/2572 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 39129 ms. Remains : 1146/1276 places, 2572/2817 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-04
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-04 finished in 39329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&G(p1))))))'
Support contains 3 out of 1276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1276/1276 places, 2817/2817 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1256 transition count 2797
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1256 transition count 2797
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 1236 transition count 2737
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 1236 transition count 2737
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 90 place count 1226 transition count 2695
Iterating global reduction 0 with 10 rules applied. Total rules applied 100 place count 1226 transition count 2695
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 1225 transition count 2690
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 1225 transition count 2690
Applied a total of 102 rules in 578 ms. Remains 1225 /1276 variables (removed 51) and now considering 2690/2817 (removed 127) transitions.
[2025-06-03 06:10:36] [INFO ] Flow matrix only has 2418 transitions (discarded 272 similar events)
// Phase 1: matrix 2418 rows 1225 cols
[2025-06-03 06:10:36] [INFO ] Computed 61 invariants in 43 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:10:38] [INFO ] Implicit Places using invariants in 2699 ms returned [10, 245, 246, 294, 381, 382, 479, 537, 576, 663, 699, 769, 770, 922, 980, 1106]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 2702 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1209/1276 places, 2690/2817 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1193 transition count 2674
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1193 transition count 2674
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 48 place count 1177 transition count 2658
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 1177 transition count 2658
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 80 place count 1161 transition count 2642
Iterating global reduction 0 with 16 rules applied. Total rules applied 96 place count 1161 transition count 2642
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 109 place count 1148 transition count 2577
Iterating global reduction 0 with 13 rules applied. Total rules applied 122 place count 1148 transition count 2577
Applied a total of 122 rules in 580 ms. Remains 1148 /1209 variables (removed 61) and now considering 2577/2690 (removed 113) transitions.
[2025-06-03 06:10:39] [INFO ] Flow matrix only has 2305 transitions (discarded 272 similar events)
// Phase 1: matrix 2305 rows 1148 cols
[2025-06-03 06:10:39] [INFO ] Computed 45 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:10:41] [INFO ] Implicit Places using invariants in 2287 ms returned []
[2025-06-03 06:10:41] [INFO ] Flow matrix only has 2305 transitions (discarded 272 similar events)
[2025-06-03 06:10:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:10:43] [INFO ] State equation strengthened by 846 read => feed constraints.
[2025-06-03 06:11:13] [INFO ] Performed 690/1148 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 06:11:26] [INFO ] Implicit Places using invariants and state equation in 44682 ms returned []
Implicit Place search using SMT with State Equation took 46972 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1148/1276 places, 2577/2817 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50835 ms. Remains : 1148/1276 places, 2577/2817 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-05
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-05 finished in 51045 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 1276 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1276/1276 places, 2817/2817 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1276 transition count 2801
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 1260 transition count 2801
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 32 place count 1260 transition count 2778
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 78 place count 1237 transition count 2778
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 93 place count 1222 transition count 2759
Iterating global reduction 2 with 15 rules applied. Total rules applied 108 place count 1222 transition count 2759
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 108 place count 1222 transition count 2757
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 1220 transition count 2757
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 126 place count 1206 transition count 2703
Iterating global reduction 2 with 14 rules applied. Total rules applied 140 place count 1206 transition count 2703
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 143 place count 1203 transition count 2688
Iterating global reduction 2 with 3 rules applied. Total rules applied 146 place count 1203 transition count 2688
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 210 place count 1171 transition count 2656
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 216 place count 1165 transition count 2650
Iterating global reduction 2 with 6 rules applied. Total rules applied 222 place count 1165 transition count 2650
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 228 place count 1159 transition count 2620
Iterating global reduction 2 with 6 rules applied. Total rules applied 234 place count 1159 transition count 2620
Applied a total of 234 rules in 717 ms. Remains 1159 /1276 variables (removed 117) and now considering 2620/2817 (removed 197) transitions.
[2025-06-03 06:11:27] [INFO ] Flow matrix only has 2348 transitions (discarded 272 similar events)
// Phase 1: matrix 2348 rows 1159 cols
[2025-06-03 06:11:27] [INFO ] Computed 61 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:11:30] [INFO ] Implicit Places using invariants in 2824 ms returned [9, 224, 271, 357, 454, 509, 546, 583, 593, 622, 656, 723, 724, 872, 930, 1053]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 2828 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1143/1276 places, 2620/2817 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1134 transition count 2611
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1134 transition count 2611
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 1125 transition count 2602
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 1125 transition count 2602
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 1119 transition count 2572
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 1119 transition count 2572
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 62 place count 1112 transition count 2565
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 1105 transition count 2558
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 1105 transition count 2558
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 83 place count 1098 transition count 2523
Iterating global reduction 0 with 7 rules applied. Total rules applied 90 place count 1098 transition count 2523
Applied a total of 90 rules in 568 ms. Remains 1098 /1143 variables (removed 45) and now considering 2523/2620 (removed 97) transitions.
[2025-06-03 06:11:30] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
// Phase 1: matrix 2251 rows 1098 cols
[2025-06-03 06:11:30] [INFO ] Computed 45 invariants in 50 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:11:33] [INFO ] Implicit Places using invariants in 2195 ms returned []
[2025-06-03 06:11:33] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
[2025-06-03 06:11:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:11:34] [INFO ] State equation strengthened by 842 read => feed constraints.
[2025-06-03 06:12:03] [INFO ] Implicit Places using invariants and state equation in 30570 ms returned []
Implicit Place search using SMT with State Equation took 32769 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1098/1276 places, 2523/2817 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36884 ms. Remains : 1098/1276 places, 2523/2817 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-07
Product exploration explored 100000 steps with 2723 reset in 1131 ms.
Product exploration explored 100000 steps with 2723 reset in 759 ms.
Computed a total of 283 stabilizing places and 907 stable transitions
Computed a total of 283 stabilizing places and 907 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 202 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1089 resets) in 365 ms. (109 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (220 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (219 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
[2025-06-03 06:12:06] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
[2025-06-03 06:12:06] [INFO ] Invariant cache hit.
[2025-06-03 06:12:06] [INFO ] State equation strengthened by 842 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1025/1029 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1029 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/1060 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1060 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 28/1088 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/1098 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1098 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2251/3349 variables, 1098/1143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3349 variables, 842/1985 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3349 variables, 0/1985 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3349 variables, 0/1985 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3349/3349 variables, and 1985 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1663 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 1098/1098 constraints, ReadFeed: 842/842 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1025/1029 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:09] [INFO ] Deduced a trap composed of 94 places in 1118 ms of which 94 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1029 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1029 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 31/1060 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:10] [INFO ] Deduced a trap composed of 47 places in 1134 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:11] [INFO ] Deduced a trap composed of 93 places in 1200 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:13] [INFO ] Deduced a trap composed of 132 places in 1254 ms of which 213 ms to minimize.
SMT process timed out in 6996ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1098 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1098/1098 places, 2523/2523 transitions.
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 0 with 133 rules applied. Total rules applied 133 place count 1098 transition count 2946
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 0 with 133 rules applied. Total rules applied 266 place count 965 transition count 2946
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 268 place count 965 transition count 2946
Applied a total of 268 rules in 530 ms. Remains 965 /1098 variables (removed 133) and now considering 2946/2523 (removed -423) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 533 ms. Remains : 965/1098 places, 2946/2523 transitions.
RANDOM walk for 40000 steps (1261 resets) in 959 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (158 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (160 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 53754 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 2
Probabilistic random walk after 53754 steps, saw 22570 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
[2025-06-03 06:12:17] [INFO ] Flow matrix only has 2549 transitions (discarded 397 similar events)
// Phase 1: matrix 2549 rows 965 cols
[2025-06-03 06:12:17] [INFO ] Computed 45 invariants in 50 ms
[2025-06-03 06:12:17] [INFO ] State equation strengthened by 1398 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 892/896 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/896 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/927 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/927 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 28/955 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/955 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/965 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/965 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2549/3514 variables, 965/1010 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3514 variables, 1398/2408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3514 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3514 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3514/3514 variables, and 2408 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1964 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 965/965 constraints, ReadFeed: 1398/1398 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 892/896 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:20] [INFO ] Deduced a trap composed of 82 places in 1126 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:21] [INFO ] Deduced a trap composed of 91 places in 985 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:22] [INFO ] Deduced a trap composed of 75 places in 1117 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:23] [INFO ] Deduced a trap composed of 171 places in 1148 ms of which 124 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/896 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/896 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 31/927 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:25] [INFO ] Deduced a trap composed of 5 places in 1035 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:26] [INFO ] Deduced a trap composed of 28 places in 1111 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:27] [INFO ] Deduced a trap composed of 47 places in 893 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:28] [INFO ] Deduced a trap composed of 47 places in 1085 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:29] [INFO ] Deduced a trap composed of 72 places in 1081 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:30] [INFO ] Deduced a trap composed of 63 places in 1067 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:31] [INFO ] Deduced a trap composed of 63 places in 1195 ms of which 161 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:32] [INFO ] Deduced a trap composed of 76 places in 1266 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:34] [INFO ] Deduced a trap composed of 86 places in 1143 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:35] [INFO ] Deduced a trap composed of 93 places in 1001 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:36] [INFO ] Deduced a trap composed of 95 places in 1132 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:37] [INFO ] Deduced a trap composed of 95 places in 1252 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:38] [INFO ] Deduced a trap composed of 93 places in 1255 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:39] [INFO ] Deduced a trap composed of 95 places in 904 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:40] [INFO ] Deduced a trap composed of 98 places in 896 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:41] [INFO ] Deduced a trap composed of 102 places in 1167 ms of which 154 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:42] [INFO ] Deduced a trap composed of 102 places in 1090 ms of which 156 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:44] [INFO ] Deduced a trap composed of 104 places in 1171 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:45] [INFO ] Deduced a trap composed of 86 places in 1095 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:46] [INFO ] Deduced a trap composed of 96 places in 1080 ms of which 169 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/927 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:47] [INFO ] Deduced a trap composed of 93 places in 1013 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:48] [INFO ] Deduced a trap composed of 107 places in 923 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:49] [INFO ] Deduced a trap composed of 95 places in 1216 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:50] [INFO ] Deduced a trap composed of 109 places in 1171 ms of which 163 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:51] [INFO ] Deduced a trap composed of 93 places in 981 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:52] [INFO ] Deduced a trap composed of 107 places in 974 ms of which 161 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:54] [INFO ] Deduced a trap composed of 98 places in 1178 ms of which 232 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:55] [INFO ] Deduced a trap composed of 120 places in 1294 ms of which 183 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:56] [INFO ] Deduced a trap composed of 95 places in 1202 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:57] [INFO ] Deduced a trap composed of 109 places in 974 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:58] [INFO ] Deduced a trap composed of 109 places in 1176 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:12:59] [INFO ] Deduced a trap composed of 109 places in 1173 ms of which 164 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:13:01] [INFO ] Deduced a trap composed of 102 places in 1175 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:13:02] [INFO ] Deduced a trap composed of 104 places in 1172 ms of which 160 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:13:03] [INFO ] Deduced a trap composed of 126 places in 1006 ms of which 185 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:13:04] [INFO ] Deduced a trap composed of 130 places in 1177 ms of which 195 ms to minimize.
SMT process timed out in 47524ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 965/965 places, 2946/2946 transitions.
Applied a total of 0 rules in 157 ms. Remains 965 /965 variables (removed 0) and now considering 2946/2946 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 965/965 places, 2946/2946 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 965/965 places, 2946/2946 transitions.
Applied a total of 0 rules in 95 ms. Remains 965 /965 variables (removed 0) and now considering 2946/2946 (removed 0) transitions.
[2025-06-03 06:13:04] [INFO ] Flow matrix only has 2549 transitions (discarded 397 similar events)
[2025-06-03 06:13:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:13:06] [INFO ] Implicit Places using invariants in 1840 ms returned []
[2025-06-03 06:13:06] [INFO ] Flow matrix only has 2549 transitions (discarded 397 similar events)
[2025-06-03 06:13:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:13:08] [INFO ] State equation strengthened by 1398 read => feed constraints.
[2025-06-03 06:13:38] [INFO ] Performed 499/965 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 06:14:02] [INFO ] Implicit Places using invariants and state equation in 56156 ms returned []
Implicit Place search using SMT with State Equation took 57999 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:14:03] [INFO ] Redundant transitions in 257 ms returned []
Running 2884 sub problems to find dead transitions.
[2025-06-03 06:14:03] [INFO ] Flow matrix only has 2549 transitions (discarded 397 similar events)
[2025-06-03 06:14:03] [INFO ] Invariant cache hit.
[2025-06-03 06:14:03] [INFO ] State equation strengthened by 1398 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/963 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2884 unsolved
SMT process timed out in 33843ms, After SMT, problems are : Problem set: 0 solved, 2884 unsolved
Search for dead transitions found 0 dead transitions in 33877ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92260 ms. Remains : 965/965 places, 2946/2946 transitions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 7 factoid took 367 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 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1098 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1098/1098 places, 2523/2523 transitions.
Applied a total of 0 rules in 105 ms. Remains 1098 /1098 variables (removed 0) and now considering 2523/2523 (removed 0) transitions.
[2025-06-03 06:14:37] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
// Phase 1: matrix 2251 rows 1098 cols
[2025-06-03 06:14:37] [INFO ] Computed 45 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:14:40] [INFO ] Implicit Places using invariants in 2438 ms returned []
[2025-06-03 06:14:40] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
[2025-06-03 06:14:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:14:41] [INFO ] State equation strengthened by 842 read => feed constraints.
[2025-06-03 06:15:08] [INFO ] Implicit Places using invariants and state equation in 28698 ms returned []
Implicit Place search using SMT with State Equation took 31139 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:15:09] [INFO ] Redundant transitions in 307 ms returned []
Running 2506 sub problems to find dead transitions.
[2025-06-03 06:15:09] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
[2025-06-03 06:15:09] [INFO ] Invariant cache hit.
[2025-06-03 06:15:09] [INFO ] State equation strengthened by 842 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1096 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2506 unsolved
SMT process timed out in 31881ms, After SMT, problems are : Problem set: 0 solved, 2506 unsolved
Search for dead transitions found 0 dead transitions in 31902ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63472 ms. Remains : 1098/1098 places, 2523/2523 transitions.
Computed a total of 283 stabilizing places and 907 stable transitions
Computed a total of 283 stabilizing places and 907 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 259 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 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1088 resets) in 415 ms. (96 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (220 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (220 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
[2025-06-03 06:15:41] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
[2025-06-03 06:15:41] [INFO ] Invariant cache hit.
[2025-06-03 06:15:41] [INFO ] State equation strengthened by 842 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1025/1029 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1029 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/1060 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1060 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 28/1088 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1088 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/1098 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1098 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2251/3349 variables, 1098/1143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3349 variables, 842/1985 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3349 variables, 0/1985 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3349 variables, 0/1985 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3349/3349 variables, and 1985 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2007 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 1098/1098 constraints, ReadFeed: 842/842 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1025/1029 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:45] [INFO ] Deduced a trap composed of 94 places in 1091 ms of which 95 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1029 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1029 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 31/1060 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:46] [INFO ] Deduced a trap composed of 47 places in 1175 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:47] [INFO ] Deduced a trap composed of 93 places in 1163 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:48] [INFO ] Deduced a trap composed of 132 places in 1186 ms of which 210 ms to minimize.
SMT process timed out in 7252ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 1098 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1098/1098 places, 2523/2523 transitions.
Free-agglomeration rule (complex) applied 133 times.
Iterating global reduction 0 with 133 rules applied. Total rules applied 133 place count 1098 transition count 2946
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 0 with 133 rules applied. Total rules applied 266 place count 965 transition count 2946
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 268 place count 965 transition count 2946
Applied a total of 268 rules in 313 ms. Remains 965 /1098 variables (removed 133) and now considering 2946/2523 (removed -423) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 965/1098 places, 2946/2523 transitions.
RANDOM walk for 40000 steps (1256 resets) in 795 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (157 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (158 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 56165 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 2
Probabilistic random walk after 56165 steps, saw 23571 distinct states, run finished after 3003 ms. (steps per millisecond=18 ) properties seen :0
[2025-06-03 06:15:52] [INFO ] Flow matrix only has 2549 transitions (discarded 397 similar events)
// Phase 1: matrix 2549 rows 965 cols
[2025-06-03 06:15:52] [INFO ] Computed 45 invariants in 80 ms
[2025-06-03 06:15:52] [INFO ] State equation strengthened by 1398 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 892/896 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/896 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/927 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/927 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 28/955 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/955 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 10/965 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/965 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2549/3514 variables, 965/1010 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3514 variables, 1398/2408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3514 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3514 variables, 0/2408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3514/3514 variables, and 2408 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2107 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 965/965 constraints, ReadFeed: 1398/1398 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 892/896 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:56] [INFO ] Deduced a trap composed of 82 places in 1151 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:57] [INFO ] Deduced a trap composed of 91 places in 1133 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:58] [INFO ] Deduced a trap composed of 75 places in 1122 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:15:59] [INFO ] Deduced a trap composed of 171 places in 1233 ms of which 128 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/896 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/896 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 31/927 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:00] [INFO ] Deduced a trap composed of 5 places in 1036 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:02] [INFO ] Deduced a trap composed of 28 places in 1071 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:03] [INFO ] Deduced a trap composed of 28 places in 1223 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:04] [INFO ] Deduced a trap composed of 58 places in 1252 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:05] [INFO ] Deduced a trap composed of 47 places in 1045 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:06] [INFO ] Deduced a trap composed of 63 places in 1067 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:07] [INFO ] Deduced a trap composed of 63 places in 997 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:08] [INFO ] Deduced a trap composed of 76 places in 1080 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:09] [INFO ] Deduced a trap composed of 86 places in 957 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:10] [INFO ] Deduced a trap composed of 93 places in 978 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:11] [INFO ] Deduced a trap composed of 95 places in 1079 ms of which 144 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:13] [INFO ] Deduced a trap composed of 95 places in 1252 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:14] [INFO ] Deduced a trap composed of 95 places in 1059 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:15] [INFO ] Deduced a trap composed of 93 places in 1129 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:16] [INFO ] Deduced a trap composed of 98 places in 1160 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:17] [INFO ] Deduced a trap composed of 102 places in 1111 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:18] [INFO ] Deduced a trap composed of 104 places in 1087 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:19] [INFO ] Deduced a trap composed of 109 places in 1116 ms of which 159 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:20] [INFO ] Deduced a trap composed of 95 places in 963 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:22] [INFO ] Deduced a trap composed of 123 places in 1129 ms of which 188 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/927 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:23] [INFO ] Deduced a trap composed of 95 places in 1198 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:24] [INFO ] Deduced a trap composed of 116 places in 985 ms of which 169 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:25] [INFO ] Deduced a trap composed of 130 places in 1007 ms of which 184 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:26] [INFO ] Deduced a trap composed of 121 places in 1335 ms of which 208 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:27] [INFO ] Deduced a trap composed of 57 places in 1014 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:29] [INFO ] Deduced a trap composed of 56 places in 1277 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:30] [INFO ] Deduced a trap composed of 56 places in 1106 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:31] [INFO ] Deduced a trap composed of 56 places in 992 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:32] [INFO ] Deduced a trap composed of 57 places in 1027 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:33] [INFO ] Deduced a trap composed of 57 places in 1107 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:34] [INFO ] Deduced a trap composed of 57 places in 1391 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:36] [INFO ] Deduced a trap composed of 58 places in 1201 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:37] [INFO ] Deduced a trap composed of 56 places in 1047 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:38] [INFO ] Deduced a trap composed of 57 places in 1218 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:39] [INFO ] Deduced a trap composed of 56 places in 1059 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 06:16:40] [INFO ] Deduced a trap composed of 57 places in 1065 ms of which 90 ms to minimize.
SMT process timed out in 47940ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 965/965 places, 2946/2946 transitions.
Applied a total of 0 rules in 96 ms. Remains 965 /965 variables (removed 0) and now considering 2946/2946 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 965/965 places, 2946/2946 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 965/965 places, 2946/2946 transitions.
Applied a total of 0 rules in 101 ms. Remains 965 /965 variables (removed 0) and now considering 2946/2946 (removed 0) transitions.
[2025-06-03 06:16:40] [INFO ] Flow matrix only has 2549 transitions (discarded 397 similar events)
[2025-06-03 06:16:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:16:42] [INFO ] Implicit Places using invariants in 2084 ms returned []
[2025-06-03 06:16:42] [INFO ] Flow matrix only has 2549 transitions (discarded 397 similar events)
[2025-06-03 06:16:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:16:44] [INFO ] State equation strengthened by 1398 read => feed constraints.
[2025-06-03 06:17:14] [INFO ] Performed 494/965 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 06:17:38] [INFO ] Implicit Places using invariants and state equation in 55926 ms returned []
Implicit Place search using SMT with State Equation took 58013 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:17:38] [INFO ] Redundant transitions in 148 ms returned []
Running 2884 sub problems to find dead transitions.
[2025-06-03 06:17:38] [INFO ] Flow matrix only has 2549 transitions (discarded 397 similar events)
[2025-06-03 06:17:38] [INFO ] Invariant cache hit.
[2025-06-03 06:17:38] [INFO ] State equation strengthened by 1398 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/963 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2884 unsolved
SMT process timed out in 33242ms, After SMT, problems are : Problem set: 0 solved, 2884 unsolved
Search for dead transitions found 0 dead transitions in 33260ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91558 ms. Remains : 965/965 places, 2946/2946 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 7 factoid took 317 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 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2724 reset in 966 ms.
Product exploration explored 100000 steps with 2724 reset in 678 ms.
Built C files in :
/tmp/ltsmin5602950039817533788
[2025-06-03 06:18:14] [INFO ] Too many transitions (2523) to apply POR reductions. Disabling POR matrices.
[2025-06-03 06:18:14] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5602950039817533788
Running compilation step : cd /tmp/ltsmin5602950039817533788;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin5602950039817533788;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin5602950039817533788;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:1583)
Support contains 4 out of 1098 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1098/1098 places, 2523/2523 transitions.
Applied a total of 0 rules in 112 ms. Remains 1098 /1098 variables (removed 0) and now considering 2523/2523 (removed 0) transitions.
[2025-06-03 06:18:17] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
// Phase 1: matrix 2251 rows 1098 cols
[2025-06-03 06:18:17] [INFO ] Computed 45 invariants in 51 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:18:19] [INFO ] Implicit Places using invariants in 2195 ms returned []
[2025-06-03 06:18:19] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
[2025-06-03 06:18:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:18:21] [INFO ] State equation strengthened by 842 read => feed constraints.
[2025-06-03 06:18:49] [INFO ] Implicit Places using invariants and state equation in 29966 ms returned []
Implicit Place search using SMT with State Equation took 32164 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:18:49] [INFO ] Redundant transitions in 111 ms returned []
Running 2506 sub problems to find dead transitions.
[2025-06-03 06:18:49] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
[2025-06-03 06:18:49] [INFO ] Invariant cache hit.
[2025-06-03 06:18:49] [INFO ] State equation strengthened by 842 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1096 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2506 unsolved
SMT process timed out in 32319ms, After SMT, problems are : Problem set: 0 solved, 2506 unsolved
Search for dead transitions found 0 dead transitions in 32326ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64726 ms. Remains : 1098/1098 places, 2523/2523 transitions.
Built C files in :
/tmp/ltsmin14897021078240400087
[2025-06-03 06:19:22] [INFO ] Too many transitions (2523) to apply POR reductions. Disabling POR matrices.
[2025-06-03 06:19:22] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14897021078240400087
Running compilation step : cd /tmp/ltsmin14897021078240400087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin14897021078240400087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin14897021078240400087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:1583)
[2025-06-03 06:19:25] [INFO ] Flatten gal took : 160 ms
[2025-06-03 06:19:25] [INFO ] Flatten gal took : 143 ms
[2025-06-03 06:19:26] [INFO ] Time to serialize gal into /tmp/LTL790027975425159394.gal : 57 ms
[2025-06-03 06:19:26] [INFO ] Time to serialize properties into /tmp/LTL2535601653343847351.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL790027975425159394.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7603773516462219628.hoa' '-atoms' '/tmp/LTL2535601653343847351.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL2535601653343847351.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7603773516462219628.hoa
Detected timeout of ITS tools.
[2025-06-03 06:19:41] [INFO ] Flatten gal took : 97 ms
[2025-06-03 06:19:41] [INFO ] Flatten gal took : 75 ms
[2025-06-03 06:19:41] [INFO ] Time to serialize gal into /tmp/LTL11952243082753773220.gal : 23 ms
[2025-06-03 06:19:41] [INFO ] Time to serialize properties into /tmp/LTL16608261485209924787.ltl : 18 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11952243082753773220.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16608261485209924787.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(Node5HasDetectedCrashOfNode10>Node3HasTheLeafSetOfLx3ToReplaceNode5)")||(G("(Node14ThinksNode4ShouldBeNodeMasterToReplaceNod...210
Formula 0 simplified : G(F!"(Node14ThinksNode4ShouldBeNodeMasterToReplaceNode9<=Node1HasAskedItsLeafSetToRx3ToReplaceNode15)" & FG!"(Node5HasDetectedCrashO...203
Detected timeout of ITS tools.
[2025-06-03 06:19:56] [INFO ] Flatten gal took : 80 ms
[2025-06-03 06:19:56] [INFO ] Applying decomposition
[2025-06-03 06:19:56] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11972332576858120933.txt' '-o' '/tmp/graph11972332576858120933.bin' '-w' '/tmp/graph11972332576858120933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11972332576858120933.bin' '-l' '-1' '-v' '-w' '/tmp/graph11972332576858120933.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:19:57] [INFO ] Decomposing Gal with order
[2025-06-03 06:19:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:19:57] [INFO ] Removed a total of 59 redundant transitions.
[2025-06-03 06:19:57] [INFO ] Flatten gal took : 206 ms
[2025-06-03 06:19:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 15 ms.
[2025-06-03 06:19:57] [INFO ] Time to serialize gal into /tmp/LTL11640462321199222597.gal : 22 ms
[2025-06-03 06:19:57] [INFO ] Time to serialize properties into /tmp/LTL10110741610070721741.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11640462321199222597.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10110741610070721741.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(gu14.Node5HasDetectedCrashOfNode10>gu14.Node3HasTheLeafSetOfLx3ToReplaceNode5)")||(G("(gu12.Node14ThinksNode4ShouldBeNodeMas...230
Formula 0 simplified : G(F!"(gu12.Node14ThinksNode4ShouldBeNodeMasterToReplaceNode9<=gu12.Node1HasAskedItsLeafSetToRx3ToReplaceNode15)" & FG!"(gu14.Node5Ha...223
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-07 finished in 526265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||F(G(p0)))))'
Support contains 2 out of 1276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1276/1276 places, 2817/2817 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1255 transition count 2792
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1255 transition count 2792
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 62 place count 1235 transition count 2732
Iterating global reduction 0 with 20 rules applied. Total rules applied 82 place count 1235 transition count 2732
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 1225 transition count 2690
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 1225 transition count 2690
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 1224 transition count 2685
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 1224 transition count 2685
Applied a total of 104 rules in 362 ms. Remains 1224 /1276 variables (removed 52) and now considering 2685/2817 (removed 132) transitions.
[2025-06-03 06:20:13] [INFO ] Flow matrix only has 2413 transitions (discarded 272 similar events)
// Phase 1: matrix 2413 rows 1224 cols
[2025-06-03 06:20:13] [INFO ] Computed 61 invariants in 32 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:20:16] [INFO ] Implicit Places using invariants in 2642 ms returned [10, 245, 246, 294, 381, 382, 479, 537, 576, 616, 626, 697, 767, 922, 980, 1106]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 2648 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1208/1276 places, 2685/2817 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1192 transition count 2669
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1192 transition count 2669
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 48 place count 1176 transition count 2653
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 1176 transition count 2653
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 80 place count 1160 transition count 2637
Iterating global reduction 0 with 16 rules applied. Total rules applied 96 place count 1160 transition count 2637
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 109 place count 1147 transition count 2572
Iterating global reduction 0 with 13 rules applied. Total rules applied 122 place count 1147 transition count 2572
Applied a total of 122 rules in 336 ms. Remains 1147 /1208 variables (removed 61) and now considering 2572/2685 (removed 113) transitions.
[2025-06-03 06:20:16] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
// Phase 1: matrix 2300 rows 1147 cols
[2025-06-03 06:20:16] [INFO ] Computed 45 invariants in 50 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:20:18] [INFO ] Implicit Places using invariants in 2070 ms returned []
[2025-06-03 06:20:18] [INFO ] Flow matrix only has 2300 transitions (discarded 272 similar events)
[2025-06-03 06:20:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:20:20] [INFO ] State equation strengthened by 842 read => feed constraints.
[2025-06-03 06:20:50] [INFO ] Performed 905/1147 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 06:20:55] [INFO ] Implicit Places using invariants and state equation in 37136 ms returned []
Implicit Place search using SMT with State Equation took 39209 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1147/1276 places, 2572/2817 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42556 ms. Remains : 1147/1276 places, 2572/2817 transitions.
Stuttering acceptance computed with spot in 106 ms :[false, (NOT p0), false]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-10
Product exploration explored 100000 steps with 1922 reset in 627 ms.
Product exploration explored 100000 steps with 1921 reset in 698 ms.
Computed a total of 315 stabilizing places and 939 stable transitions
Computed a total of 315 stabilizing places and 939 stable transitions
Detected a total of 315/1147 stabilizing places and 939/2572 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 28303 steps (541 resets) in 304 ms. (92 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 2 out of 1147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1147/1147 places, 2572/2572 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 1147 transition count 2554
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 1129 transition count 2554
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 36 place count 1129 transition count 2543
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 58 place count 1118 transition count 2543
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 98 place count 1098 transition count 2523
Applied a total of 98 rules in 234 ms. Remains 1098 /1147 variables (removed 49) and now considering 2523/2572 (removed 49) transitions.
[2025-06-03 06:20:57] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
// Phase 1: matrix 2251 rows 1098 cols
[2025-06-03 06:20:57] [INFO ] Computed 45 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:20:59] [INFO ] Implicit Places using invariants in 2042 ms returned []
[2025-06-03 06:20:59] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
[2025-06-03 06:20:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:21:01] [INFO ] State equation strengthened by 842 read => feed constraints.
[2025-06-03 06:21:31] [INFO ] Performed 1001/1098 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 06:21:34] [INFO ] Implicit Places using invariants and state equation in 34548 ms returned []
Implicit Place search using SMT with State Equation took 36595 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:21:34] [INFO ] Redundant transitions in 128 ms returned []
Running 2506 sub problems to find dead transitions.
[2025-06-03 06:21:34] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
[2025-06-03 06:21:34] [INFO ] Invariant cache hit.
[2025-06-03 06:21:34] [INFO ] State equation strengthened by 842 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1096 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2506 unsolved
SMT process timed out in 31745ms, After SMT, problems are : Problem set: 0 solved, 2506 unsolved
Search for dead transitions found 0 dead transitions in 31755ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1098/1147 places, 2523/2572 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68728 ms. Remains : 1098/1147 places, 2523/2572 transitions.
Computed a total of 283 stabilizing places and 907 stable transitions
Computed a total of 283 stabilizing places and 907 stable transitions
Detected a total of 283/1098 stabilizing places and 907/2523 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 24748 steps (671 resets) in 256 ms. (96 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2719 reset in 914 ms.
Product exploration explored 100000 steps with 2719 reset in 652 ms.
Built C files in :
/tmp/ltsmin8510747879083195845
[2025-06-03 06:22:08] [INFO ] Too many transitions (2523) to apply POR reductions. Disabling POR matrices.
[2025-06-03 06:22:08] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8510747879083195845
Running compilation step : cd /tmp/ltsmin8510747879083195845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin8510747879083195845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin8510747879083195845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:1583)
Support contains 2 out of 1098 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1098/1098 places, 2523/2523 transitions.
Applied a total of 0 rules in 104 ms. Remains 1098 /1098 variables (removed 0) and now considering 2523/2523 (removed 0) transitions.
[2025-06-03 06:22:11] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
[2025-06-03 06:22:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:22:14] [INFO ] Implicit Places using invariants in 2361 ms returned []
[2025-06-03 06:22:14] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
[2025-06-03 06:22:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:22:15] [INFO ] State equation strengthened by 842 read => feed constraints.
[2025-06-03 06:22:45] [INFO ] Performed 1013/1098 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 06:22:48] [INFO ] Implicit Places using invariants and state equation in 33988 ms returned []
Implicit Place search using SMT with State Equation took 36354 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 06:22:48] [INFO ] Redundant transitions in 112 ms returned []
Running 2506 sub problems to find dead transitions.
[2025-06-03 06:22:48] [INFO ] Flow matrix only has 2251 transitions (discarded 272 similar events)
[2025-06-03 06:22:48] [INFO ] Invariant cache hit.
[2025-06-03 06:22:48] [INFO ] State equation strengthened by 842 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1096 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2506 unsolved
SMT process timed out in 31748ms, After SMT, problems are : Problem set: 0 solved, 2506 unsolved
Search for dead transitions found 0 dead transitions in 31754ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68343 ms. Remains : 1098/1098 places, 2523/2523 transitions.
Built C files in :
/tmp/ltsmin11828737305335214380
[2025-06-03 06:23:19] [INFO ] Too many transitions (2523) to apply POR reductions. Disabling POR matrices.
[2025-06-03 06:23:19] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11828737305335214380
Running compilation step : cd /tmp/ltsmin11828737305335214380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin11828737305335214380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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/ltsmin11828737305335214380;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/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:1583)
[2025-06-03 06:23:23] [INFO ] Flatten gal took : 138 ms
[2025-06-03 06:23:23] [INFO ] Flatten gal took : 133 ms
[2025-06-03 06:23:23] [INFO ] Time to serialize gal into /tmp/LTL9884897711596223405.gal : 15 ms
[2025-06-03 06:23:23] [INFO ] Time to serialize properties into /tmp/LTL5931591560097482903.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9884897711596223405.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9609635473220081309.hoa' '-atoms' '/tmp/LTL5931591560097482903.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5931591560097482903.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9609635473220081309.hoa
Detected timeout of ITS tools.
[2025-06-03 06:23:38] [INFO ] Flatten gal took : 90 ms
[2025-06-03 06:23:38] [INFO ] Flatten gal took : 96 ms
[2025-06-03 06:23:38] [INFO ] Time to serialize gal into /tmp/LTL14180738071733276897.gal : 14 ms
[2025-06-03 06:23:38] [INFO ] Time to serialize properties into /tmp/LTL11345495467962793461.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14180738071733276897.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11345495467962793461.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(("(Node13HasAskedItsLeafSetToLx2ToReplaceNode7>Node10HasTheLeafSetOfRx0ToReplaceNode11)")||(F(G("(Node13HasAskedItsLeafSetToLx2To...216
Formula 0 simplified : X(!"(Node13HasAskedItsLeafSetToLx2ToReplaceNode7>Node10HasTheLeafSetOfRx0ToReplaceNode11)" & GF!"(Node13HasAskedItsLeafSetToLx2ToRep...208
Detected timeout of ITS tools.
[2025-06-03 06:23:53] [INFO ] Flatten gal took : 105 ms
[2025-06-03 06:23:53] [INFO ] Applying decomposition
[2025-06-03 06:23:53] [INFO ] Flatten gal took : 121 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10346329741054636146.txt' '-o' '/tmp/graph10346329741054636146.bin' '-w' '/tmp/graph10346329741054636146.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10346329741054636146.bin' '-l' '-1' '-v' '-w' '/tmp/graph10346329741054636146.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:23:54] [INFO ] Decomposing Gal with order
[2025-06-03 06:23:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:23:54] [INFO ] Removed a total of 51 redundant transitions.
[2025-06-03 06:23:54] [INFO ] Flatten gal took : 121 ms
[2025-06-03 06:23:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2025-06-03 06:23:54] [INFO ] Time to serialize gal into /tmp/LTL9639866400250860475.gal : 14 ms
[2025-06-03 06:23:54] [INFO ] Time to serialize properties into /tmp/LTL4574589374894221001.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9639866400250860475.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4574589374894221001.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(("(gu4.Node13HasAskedItsLeafSetToLx2ToReplaceNode7>gu4.Node10HasTheLeafSetOfRx0ToReplaceNode11)")||(F(G("(gu4.Node13HasAskedItsLe...232
Formula 0 simplified : X(!"(gu4.Node13HasAskedItsLeafSetToLx2ToReplaceNode7>gu4.Node10HasTheLeafSetOfRx0ToReplaceNode11)" & GF!"(gu4.Node13HasAskedItsLeafS...224
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-10 finished in 236546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1276 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1276/1276 places, 2817/2817 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1255 transition count 2792
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1255 transition count 2792
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 62 place count 1235 transition count 2732
Iterating global reduction 0 with 20 rules applied. Total rules applied 82 place count 1235 transition count 2732
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 1225 transition count 2686
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 1225 transition count 2686
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 1224 transition count 2681
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 1224 transition count 2681
Applied a total of 104 rules in 354 ms. Remains 1224 /1276 variables (removed 52) and now considering 2681/2817 (removed 136) transitions.
[2025-06-03 06:24:09] [INFO ] Flow matrix only has 2409 transitions (discarded 272 similar events)
// Phase 1: matrix 2409 rows 1224 cols
[2025-06-03 06:24:09] [INFO ] Computed 61 invariants in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:24:12] [INFO ] Implicit Places using invariants in 2788 ms returned [10, 245, 246, 294, 381, 382, 481, 580, 620, 630, 662, 698, 768, 769, 921, 979, 1105]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 2791 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1207/1276 places, 2681/2817 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1190 transition count 2664
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1190 transition count 2664
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1173 transition count 2647
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1173 transition count 2647
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 85 place count 1156 transition count 2630
Iterating global reduction 0 with 17 rules applied. Total rules applied 102 place count 1156 transition count 2630
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 115 place count 1143 transition count 2565
Iterating global reduction 0 with 13 rules applied. Total rules applied 128 place count 1143 transition count 2565
Applied a total of 128 rules in 338 ms. Remains 1143 /1207 variables (removed 64) and now considering 2565/2681 (removed 116) transitions.
[2025-06-03 06:24:13] [INFO ] Flow matrix only has 2293 transitions (discarded 272 similar events)
// Phase 1: matrix 2293 rows 1143 cols
[2025-06-03 06:24:13] [INFO ] Computed 44 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:24:15] [INFO ] Implicit Places using invariants in 2316 ms returned []
[2025-06-03 06:24:15] [INFO ] Flow matrix only has 2293 transitions (discarded 272 similar events)
[2025-06-03 06:24:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 06:24:16] [INFO ] State equation strengthened by 838 read => feed constraints.
[2025-06-03 06:24:44] [INFO ] Implicit Places using invariants and state equation in 29566 ms returned [1130]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31897 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1142/1276 places, 2565/2817 transitions.
Applied a total of 0 rules in 111 ms. Remains 1142 /1142 variables (removed 0) and now considering 2565/2565 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 35493 ms. Remains : 1142/1276 places, 2565/2817 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 894 steps with 17 reset in 8 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-14 finished in 35669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||F(G(p0)))))'
[2025-06-03 06:24:45] [INFO ] Flatten gal took : 149 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14984735003675801627
[2025-06-03 06:24:45] [INFO ] Too many transitions (2817) to apply POR reductions. Disabling POR matrices.
[2025-06-03 06:24:46] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14984735003675801627
Running compilation step : cd /tmp/ltsmin14984735003675801627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-03 06:24:46] [INFO ] Applying decomposition
[2025-06-03 06:24:46] [INFO ] Flatten gal took : 156 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4976548532862161755.txt' '-o' '/tmp/graph4976548532862161755.bin' '-w' '/tmp/graph4976548532862161755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4976548532862161755.bin' '-l' '-1' '-v' '-w' '/tmp/graph4976548532862161755.weights' '-q' '0' '-e' '0.001'
[2025-06-03 06:24:46] [INFO ] Decomposing Gal with order
[2025-06-03 06:24:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 06:24:46] [INFO ] Removed a total of 2090 redundant transitions.
[2025-06-03 06:24:46] [INFO ] Flatten gal took : 370 ms
[2025-06-03 06:24:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 115 labels/synchronizations in 94 ms.
[2025-06-03 06:24:47] [INFO ] Time to serialize gal into /tmp/LTLCardinality5986242934968056478.gal : 25 ms
[2025-06-03 06:24:47] [INFO ] Time to serialize properties into /tmp/LTLCardinality4358431769688089113.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5986242934968056478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4358431769688089113.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((G(F(("(gu92.Node5HasDetectedCrashOfNode10>gu92.Node3HasTheLeafSetOfLx3ToReplaceNode5)")||(G("(gu134.Node14ThinksNode4ShouldBeNodeMa...232
Formula 0 simplified : G(F!"(gu134.Node14ThinksNode4ShouldBeNodeMasterToReplaceNode9<=gu134.Node1HasAskedItsLeafSetToRx3ToReplaceNode15)" & FG!"(gu92.Node5...225
Compilation finished in 11338 ms.
Running link step : cd /tmp/ltsmin14984735003675801627;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin14984735003675801627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin14984735003675801627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14984735003675801627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((!(LTLAPp2==true)||<>([]((LTLAPp2==true)))))' '--buchi-type=spotba'
LTSmin run took 382049 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin14984735003675801627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-03 06:51:21] [INFO ] Flatten gal took : 301 ms
[2025-06-03 06:51:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality15748085092322749379.gal : 49 ms
[2025-06-03 06:51:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality654704956599680731.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15748085092322749379.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality654704956599680731.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(F(("(Node5HasDetectedCrashOfNode10>Node3HasTheLeafSetOfLx3ToReplaceNode5)")||(G("(Node14ThinksNode4ShouldBeNodeMasterToReplaceNod...210
Formula 0 simplified : G(F!"(Node14ThinksNode4ShouldBeNodeMasterToReplaceNode9<=Node1HasAskedItsLeafSetToRx3ToReplaceNode15)" & FG!"(Node5HasDetectedCrashO...203
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-S16C05"
export BK_EXAMINATION="LTLCardinality"
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-5832"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524300307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C05.tgz
mv MultiCrashLeafsetExtension-PT-S16C05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;