About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16204.044 | 3600000.00 | 7799602.00 | 5758.50 | F?T?FF?T???TFF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r246-tall-171654350700035.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654350700035
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 12 06:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 06:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.2M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716570587179
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-S16C06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-24 17:09:48] [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]
[2024-05-24 17:09:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 17:09:48] [INFO ] Load time of PNML (sax parser for PT used): 380 ms
[2024-05-24 17:09:48] [INFO ] Transformed 5568 places.
[2024-05-24 17:09:48] [INFO ] Transformed 7799 transitions.
[2024-05-24 17:09:48] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 516 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 5568 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 5536 transition count 7799
Discarding 1601 places :
Symmetric choice reduction at 1 with 1601 rule applications. Total rules 1633 place count 3935 transition count 6198
Iterating global reduction 1 with 1601 rules applied. Total rules applied 3234 place count 3935 transition count 6198
Discarding 1395 places :
Symmetric choice reduction at 1 with 1395 rule applications. Total rules 4629 place count 2540 transition count 4803
Iterating global reduction 1 with 1395 rules applied. Total rules applied 6024 place count 2540 transition count 4803
Discarding 206 places :
Symmetric choice reduction at 1 with 206 rule applications. Total rules 6230 place count 2334 transition count 3567
Iterating global reduction 1 with 206 rules applied. Total rules applied 6436 place count 2334 transition count 3567
Applied a total of 6436 rules in 1019 ms. Remains 2334 /5568 variables (removed 3234) and now considering 3567/7799 (removed 4232) transitions.
[2024-05-24 17:09:50] [INFO ] Flow matrix only has 3295 transitions (discarded 272 similar events)
// Phase 1: matrix 3295 rows 2334 cols
[2024-05-24 17:09:50] [INFO ] Computed 541 invariants in 167 ms
[2024-05-24 17:09:53] [INFO ] Implicit Places using invariants in 3062 ms returned [4, 8, 14, 16, 18, 20, 22, 24, 29, 36, 45, 56, 72, 87, 103, 119, 121, 123, 125, 127, 129, 131, 145, 156, 165, 172, 177, 180, 207, 214, 217, 220, 221, 222, 223, 229, 234, 241, 250, 261, 274, 288, 302, 303, 304, 305, 306, 307, 308, 319, 328, 335, 340, 343, 345, 372, 379, 382, 383, 384, 385, 386, 387, 388, 390, 393, 398, 405, 414, 425, 437, 449, 450, 451, 452, 454, 455, 464, 471, 476, 479, 484, 486, 520, 523, 525, 526, 527, 530, 534, 536, 542, 547, 554, 563, 573, 584, 585, 586, 587, 588, 599, 604, 607, 609, 611, 613, 640, 647, 650, 651, 652, 653, 654, 655, 656, 658, 660, 662, 665, 670, 677, 685, 693, 694, 695, 696, 697, 698, 699, 704, 707, 709, 711, 713, 715, 742, 749, 752, 755, 756, 757, 758, 759, 763, 765, 767, 769, 772, 777, 783, 789, 790, 791, 792, 793, 795, 798, 800, 802, 806, 808, 810, 837, 844, 847, 848, 849, 851, 852, 853, 855, 857, 859, 861, 863, 868, 872, 876, 877, 878, 879, 880, 882, 884, 886, 888, 890, 892, 894, 923, 930, 933, 934, 935, 937, 938, 939, 946, 948, 950, 952, 954, 956, 959, 960, 964, 965, 967, 969, 971, 977, 979, 983, 1010, 1012, 1016, 1019, 1021, 1022, 1023, 1024, 1025, 1027, 1029, 1031, 1036, 1038, 1040, 1042, 1045, 1047, 1048, 1049, 1050, 1051, 1053, 1055, 1057, 1061, 1063, 1065, 1095, 1102, 1105, 1106, 1107, 1109, 1110, 1111, 1113, 1115, 1117, 1119, 1121, 1125, 1127, 1130, 1131, 1132, 1133, 1134, 1135, 1136, 1138, 1140, 1142, 1144, 1146, 1148, 1175, 1182, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1193, 1195, 1197, 1199, 1201, 1203, 1206, 1211, 1212, 1213, 1214, 1216, 1217, 1220, 1222, 1224, 1226, 1228, 1230, 1260, 1267, 1271, 1273, 1274, 1275, 1276, 1278, 1280, 1284, 1286, 1288, 1291, 1299, 1306, 1307, 1308, 1309, 1312, 1313, 1320, 1323, 1325, 1327, 1329, 1331, 1358, 1365, 1368, 1369, 1370, 1371, 1372, 1373, 1374, 1376, 1378, 1380, 1382, 1385, 1390, 1397, 1406, 1407, 1409, 1410, 1411, 1412, 1419, 1424, 1430, 1432, 1434, 1436, 1463, 1470, 1473, 1474, 1475, 1476, 1477, 1478, 1481, 1483, 1485, 1488, 1493, 1500, 1509, 1520, 1521, 1523, 1524, 1525, 1526, 1535, 1542, 1547, 1550, 1552, 1557, 1584, 1594, 1596, 1597, 1598, 1599, 1600, 1602, 1607, 1610, 1615, 1622, 1631, 1644, 1657, 1658, 1659, 1661, 1662, 1663, 1674, 1683, 1692, 1697, 1700, 1702, 1729, 1736, 1739, 1741, 1742, 1743, 1744, 1745, 1747, 1750, 1755, 1764, 1773, 1784, 1797, 1812, 1813, 1814, 1815, 1816, 1817, 1818, 1831, 1842, 1851, 1858, 1863, 1866, 1893, 1895, 1899, 1902, 1903, 1904, 1905, 1907, 1908, 1911, 1916, 1923, 1932, 1943, 1956, 1974, 1991, 1992, 1994, 1995, 1997, 2012, 2025, 2039, 2048, 2058, 2065, 2093]
[2024-05-24 17:09:53] [INFO ] Actually due to overlaps returned [207, 372, 640, 742, 837, 923, 1010, 1095, 1175, 1260, 1358, 1463, 1584, 1729, 1893, 2093, 4, 14, 16, 18, 20, 22, 24, 119, 121, 123, 125, 127, 129, 217, 220, 221, 222, 223, 302, 303, 304, 305, 306, 307, 382, 383, 384, 385, 386, 387, 449, 450, 451, 452, 454, 523, 525, 526, 527, 534, 584, 585, 586, 587, 588, 650, 651, 652, 653, 654, 655, 658, 693, 694, 695, 696, 697, 698, 752, 755, 756, 757, 758, 763, 789, 790, 791, 792, 793, 847, 848, 849, 851, 852, 855, 876, 877, 878, 879, 880, 933, 934, 935, 937, 938, 959, 960, 964, 1012, 1019, 1021, 1022, 1023, 1024, 1027, 1045, 1047, 1048, 1049, 1050, 1105, 1106, 1107, 1109, 1110, 1113, 1130, 1131, 1132, 1133, 1134, 1135, 1185, 1186, 1187, 1188, 1189, 1190, 1193, 1211, 1212, 1213, 1214, 1216, 1271, 1273, 1274, 1275, 1278, 1306, 1307, 1308, 1309, 1312, 1368, 1369, 1370, 1371, 1372, 1373, 1376, 1406, 1407, 1409, 1410, 1411, 1473, 1474, 1475, 1476, 1477, 1478, 1481, 1520, 1521, 1523, 1524, 1525, 1594, 1596, 1597, 1598, 1599, 1602, 1657, 1658, 1659, 1661, 1662, 1739, 1741, 1742, 1743, 1744, 1747, 1812, 1813, 1814, 1815, 1816, 1817, 1895, 1902, 1903, 1904, 1905, 1907, 1911, 1991, 1992, 1994, 1995]
Discarding 208 places :
Implicit Place search using SMT only with invariants took 3160 ms to find 208 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2126/5568 places, 3567/7799 transitions.
Discarding 159 places :
Symmetric choice reduction at 0 with 159 rule applications. Total rules 159 place count 1967 transition count 3408
Iterating global reduction 0 with 159 rules applied. Total rules applied 318 place count 1967 transition count 3408
Discarding 158 places :
Symmetric choice reduction at 0 with 158 rule applications. Total rules 476 place count 1809 transition count 3250
Iterating global reduction 0 with 158 rules applied. Total rules applied 634 place count 1809 transition count 3250
Discarding 156 places :
Symmetric choice reduction at 0 with 156 rule applications. Total rules 790 place count 1653 transition count 3094
Iterating global reduction 0 with 156 rules applied. Total rules applied 946 place count 1653 transition count 3094
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 950 place count 1649 transition count 3070
Iterating global reduction 0 with 4 rules applied. Total rules applied 954 place count 1649 transition count 3070
Applied a total of 954 rules in 262 ms. Remains 1649 /2126 variables (removed 477) and now considering 3070/3567 (removed 497) transitions.
[2024-05-24 17:09:53] [INFO ] Flow matrix only has 2798 transitions (discarded 272 similar events)
// Phase 1: matrix 2798 rows 1649 cols
[2024-05-24 17:09:53] [INFO ] Computed 333 invariants in 68 ms
[2024-05-24 17:09:55] [INFO ] Implicit Places using invariants in 1794 ms returned [7, 22, 29, 38, 49, 65, 80, 96, 118, 132, 143, 152, 159, 164, 167, 200, 210, 215, 222, 231, 242, 255, 269, 283, 294, 303, 310, 315, 318, 320, 336, 339, 341, 344, 349, 356, 365, 376, 388, 401, 410, 417, 422, 425, 430, 432, 445, 451, 456, 462, 467, 474, 483, 493, 514, 519, 522, 524, 526, 528, 543, 546, 549, 551, 554, 559, 566, 574, 582, 587, 590, 592, 594, 596, 598, 609, 614, 619, 621, 623, 626, 631, 637, 644, 647, 649, 651, 655, 657, 659, 672, 676, 679, 681, 683, 685, 690, 694, 699, 701, 703, 705, 707, 709, 711, 727, 731, 738, 740, 742, 744, 746, 748, 754, 756, 758, 760, 766, 768, 772, 787, 791, 794, 796, 801, 803, 805, 807, 811, 813, 815, 817, 821, 823, 825, 841, 845, 848, 850, 852, 854, 858, 860, 863, 865, 867, 869, 871, 873, 875, 890, 892, 895, 897, 899, 901, 903, 906, 912, 915, 917, 919, 921, 923, 925, 939, 944, 947, 951, 953, 955, 958, 966, 975, 982, 985, 987, 989, 991, 993, 1008, 1010, 1013, 1015, 1017, 1020, 1025, 1032, 1042, 1049, 1054, 1060, 1062, 1064, 1066, 1077, 1082, 1084, 1087, 1092, 1099, 1108, 1120, 1129, 1136, 1141, 1144, 1146, 1151, 1166, 1172, 1175, 1180, 1187, 1196, 1209, 1223, 1234, 1243, 1252, 1257, 1260, 1262, 1275, 1279, 1283, 1288, 1297, 1306, 1317, 1330, 1344, 1357, 1368, 1377, 1384, 1389, 1392, 1401, 1405, 1412, 1419, 1428, 1439, 1452, 1470, 1489, 1504, 1517, 1531, 1540, 1550, 1557]
Discarding 253 places :
Implicit Place search using SMT only with invariants took 1800 ms to find 253 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1396/5568 places, 3070/7799 transitions.
Applied a total of 0 rules in 42 ms. Remains 1396 /1396 variables (removed 0) and now considering 3070/3070 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 6298 ms. Remains : 1396/5568 places, 3070/7799 transitions.
Support contains 56 out of 1396 places after structural reductions.
[2024-05-24 17:09:55] [INFO ] Flatten gal took : 248 ms
[2024-05-24 17:09:55] [INFO ] Flatten gal took : 147 ms
[2024-05-24 17:09:56] [INFO ] Input system was already deterministic with 3070 transitions.
Support contains 49 out of 1396 places (down from 56) after GAL structural reductions.
RANDOM walk for 40000 steps (640 resets) in 3462 ms. (11 steps per ms) remains 12/27 properties
BEST_FIRST walk for 40002 steps (172 resets) in 364 ms. (109 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (172 resets) in 160 ms. (248 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (172 resets) in 208 ms. (191 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (172 resets) in 217 ms. (183 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (172 resets) in 235 ms. (169 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (172 resets) in 164 ms. (242 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (172 resets) in 222 ms. (179 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (172 resets) in 215 ms. (185 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (172 resets) in 203 ms. (196 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (172 resets) in 218 ms. (182 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (172 resets) in 191 ms. (208 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (172 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
[2024-05-24 17:09:58] [INFO ] Flow matrix only has 2798 transitions (discarded 272 similar events)
// Phase 1: matrix 2798 rows 1396 cols
[2024-05-24 17:09:58] [INFO ] Computed 80 invariants in 36 ms
[2024-05-24 17:09:58] [INFO ] State equation strengthened by 1128 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 1246/1270 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1270 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1270 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 4 (OVERLAPS) 86/1356 variables, 34/40 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1356 variables, 0/40 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 28/1384 variables, 28/68 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1384 variables, 0/68 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 12/1396 variables, 12/80 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1396 variables, 0/80 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 2798/4194 variables, 1396/1476 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4194 variables, 1128/2604 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4194 variables, 0/2604 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/4194 variables, 0/2604 constraints. Problems are: Problem set: 7 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4194/4194 variables, and 2604 constraints, problems are : Problem set: 7 solved, 5 unsolved in 2439 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 1396/1396 constraints, ReadFeed: 1128/1128 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 5 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 1 (OVERLAPS) 1250/1264 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1264 variables, 1/6 constraints. Problems are: Problem set: 8 solved, 4 unsolved
[2024-05-24 17:10:01] [INFO ] Deduced a trap composed of 443 places in 723 ms of which 72 ms to minimize.
[2024-05-24 17:10:02] [INFO ] Deduced a trap composed of 330 places in 711 ms of which 10 ms to minimize.
[2024-05-24 17:10:03] [INFO ] Deduced a trap composed of 432 places in 635 ms of which 9 ms to minimize.
[2024-05-24 17:10:03] [INFO ] Deduced a trap composed of 682 places in 670 ms of which 9 ms to minimize.
[2024-05-24 17:10:04] [INFO ] Deduced a trap composed of 422 places in 619 ms of which 8 ms to minimize.
[2024-05-24 17:10:05] [INFO ] Deduced a trap composed of 379 places in 615 ms of which 8 ms to minimize.
[2024-05-24 17:10:05] [INFO ] Deduced a trap composed of 319 places in 679 ms of which 8 ms to minimize.
SMT process timed out in 7640ms, After SMT, problems are : Problem set: 8 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 1396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1396 transition count 3040
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1366 transition count 3040
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 60 place count 1366 transition count 3008
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 124 place count 1334 transition count 3008
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 141 place count 1317 transition count 2986
Iterating global reduction 2 with 17 rules applied. Total rules applied 158 place count 1317 transition count 2986
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 171 place count 1304 transition count 2923
Iterating global reduction 2 with 13 rules applied. Total rules applied 184 place count 1304 transition count 2923
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 186 place count 1302 transition count 2911
Iterating global reduction 2 with 2 rules applied. Total rules applied 188 place count 1302 transition count 2911
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 268 place count 1262 transition count 2871
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 285 place count 1245 transition count 2854
Iterating global reduction 2 with 17 rules applied. Total rules applied 302 place count 1245 transition count 2854
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 319 place count 1228 transition count 2752
Iterating global reduction 2 with 17 rules applied. Total rules applied 336 place count 1228 transition count 2752
Free-agglomeration rule (complex) applied 161 times.
Iterating global reduction 2 with 161 rules applied. Total rules applied 497 place count 1228 transition count 3791
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 2 with 161 rules applied. Total rules applied 658 place count 1067 transition count 3791
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 688 place count 1067 transition count 3791
Applied a total of 688 rules in 921 ms. Remains 1067 /1396 variables (removed 329) and now considering 3791/3070 (removed -721) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 922 ms. Remains : 1067/1396 places, 3791/3070 transitions.
RANDOM walk for 40000 steps (1125 resets) in 1157 ms. (34 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (141 resets) in 218 ms. (182 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (144 resets) in 210 ms. (189 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (143 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (142 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 58981 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 4
Probabilistic random walk after 58981 steps, saw 25184 distinct states, run finished after 3004 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-24 17:10:10] [INFO ] Flow matrix only has 3393 transitions (discarded 398 similar events)
// Phase 1: matrix 3393 rows 1067 cols
[2024-05-24 17:10:10] [INFO ] Computed 80 invariants in 39 ms
[2024-05-24 17:10:10] [INFO ] State equation strengthened by 2178 read => feed constraints.
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 952/962 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/962 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 65/1027 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1027 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 28/1055 variables, 28/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1055 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 12/1067 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1067 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3393/4460 variables, 1067/1147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4460 variables, 2178/3325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4460 variables, 0/3325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/4460 variables, 0/3325 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4460/4460 variables, and 3325 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1741 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 1067/1067 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 952/962 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:10:12] [INFO ] Deduced a trap composed of 137 places in 507 ms of which 6 ms to minimize.
[2024-05-24 17:10:13] [INFO ] Deduced a trap composed of 167 places in 531 ms of which 6 ms to minimize.
[2024-05-24 17:10:13] [INFO ] Deduced a trap composed of 238 places in 508 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/962 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/962 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 65/1027 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:10:14] [INFO ] Deduced a trap composed of 5 places in 611 ms of which 6 ms to minimize.
[2024-05-24 17:10:15] [INFO ] Deduced a trap composed of 27 places in 646 ms of which 6 ms to minimize.
[2024-05-24 17:10:16] [INFO ] Deduced a trap composed of 103 places in 608 ms of which 6 ms to minimize.
[2024-05-24 17:10:16] [INFO ] Deduced a trap composed of 107 places in 593 ms of which 6 ms to minimize.
[2024-05-24 17:10:17] [INFO ] Deduced a trap composed of 62 places in 587 ms of which 7 ms to minimize.
[2024-05-24 17:10:17] [INFO ] Deduced a trap composed of 62 places in 580 ms of which 7 ms to minimize.
[2024-05-24 17:10:18] [INFO ] Deduced a trap composed of 46 places in 597 ms of which 6 ms to minimize.
[2024-05-24 17:10:19] [INFO ] Deduced a trap composed of 97 places in 606 ms of which 7 ms to minimize.
[2024-05-24 17:10:19] [INFO ] Deduced a trap composed of 95 places in 584 ms of which 6 ms to minimize.
[2024-05-24 17:10:20] [INFO ] Deduced a trap composed of 46 places in 607 ms of which 6 ms to minimize.
[2024-05-24 17:10:21] [INFO ] Deduced a trap composed of 114 places in 600 ms of which 6 ms to minimize.
[2024-05-24 17:10:21] [INFO ] Deduced a trap composed of 115 places in 585 ms of which 6 ms to minimize.
[2024-05-24 17:10:22] [INFO ] Deduced a trap composed of 111 places in 583 ms of which 6 ms to minimize.
[2024-05-24 17:10:22] [INFO ] Deduced a trap composed of 97 places in 564 ms of which 7 ms to minimize.
[2024-05-24 17:10:23] [INFO ] Deduced a trap composed of 112 places in 570 ms of which 6 ms to minimize.
[2024-05-24 17:10:23] [INFO ] Deduced a trap composed of 71 places in 550 ms of which 6 ms to minimize.
[2024-05-24 17:10:24] [INFO ] Deduced a trap composed of 102 places in 602 ms of which 6 ms to minimize.
[2024-05-24 17:10:25] [INFO ] Deduced a trap composed of 104 places in 601 ms of which 6 ms to minimize.
[2024-05-24 17:10:25] [INFO ] Deduced a trap composed of 108 places in 571 ms of which 6 ms to minimize.
[2024-05-24 17:10:26] [INFO ] Deduced a trap composed of 113 places in 562 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1027 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:10:27] [INFO ] Deduced a trap composed of 110 places in 581 ms of which 6 ms to minimize.
[2024-05-24 17:10:27] [INFO ] Deduced a trap composed of 124 places in 563 ms of which 6 ms to minimize.
[2024-05-24 17:10:28] [INFO ] Deduced a trap composed of 111 places in 579 ms of which 6 ms to minimize.
[2024-05-24 17:10:28] [INFO ] Deduced a trap composed of 128 places in 609 ms of which 6 ms to minimize.
[2024-05-24 17:10:29] [INFO ] Deduced a trap composed of 57 places in 539 ms of which 6 ms to minimize.
[2024-05-24 17:10:30] [INFO ] Deduced a trap composed of 135 places in 615 ms of which 7 ms to minimize.
[2024-05-24 17:10:30] [INFO ] Deduced a trap composed of 122 places in 637 ms of which 6 ms to minimize.
[2024-05-24 17:10:31] [INFO ] Deduced a trap composed of 106 places in 603 ms of which 6 ms to minimize.
[2024-05-24 17:10:31] [INFO ] Deduced a trap composed of 88 places in 589 ms of which 7 ms to minimize.
[2024-05-24 17:10:32] [INFO ] Deduced a trap composed of 121 places in 603 ms of which 7 ms to minimize.
[2024-05-24 17:10:33] [INFO ] Deduced a trap composed of 113 places in 610 ms of which 6 ms to minimize.
[2024-05-24 17:10:33] [INFO ] Deduced a trap composed of 147 places in 634 ms of which 7 ms to minimize.
[2024-05-24 17:10:34] [INFO ] Deduced a trap composed of 127 places in 681 ms of which 7 ms to minimize.
[2024-05-24 17:10:35] [INFO ] Deduced a trap composed of 109 places in 687 ms of which 7 ms to minimize.
[2024-05-24 17:10:35] [INFO ] Deduced a trap composed of 128 places in 697 ms of which 7 ms to minimize.
[2024-05-24 17:10:36] [INFO ] Deduced a trap composed of 130 places in 600 ms of which 6 ms to minimize.
[2024-05-24 17:10:37] [INFO ] Deduced a trap composed of 125 places in 693 ms of which 7 ms to minimize.
[2024-05-24 17:10:37] [INFO ] Deduced a trap composed of 99 places in 596 ms of which 6 ms to minimize.
[2024-05-24 17:10:38] [INFO ] Deduced a trap composed of 212 places in 695 ms of which 6 ms to minimize.
[2024-05-24 17:10:39] [INFO ] Deduced a trap composed of 131 places in 700 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1027 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:10:40] [INFO ] Deduced a trap composed of 94 places in 592 ms of which 7 ms to minimize.
[2024-05-24 17:10:40] [INFO ] Deduced a trap composed of 75 places in 589 ms of which 6 ms to minimize.
[2024-05-24 17:10:41] [INFO ] Deduced a trap composed of 113 places in 701 ms of which 7 ms to minimize.
[2024-05-24 17:10:42] [INFO ] Deduced a trap composed of 97 places in 698 ms of which 7 ms to minimize.
[2024-05-24 17:10:42] [INFO ] Deduced a trap composed of 105 places in 619 ms of which 7 ms to minimize.
[2024-05-24 17:10:43] [INFO ] Deduced a trap composed of 136 places in 599 ms of which 6 ms to minimize.
[2024-05-24 17:10:44] [INFO ] Deduced a trap composed of 75 places in 695 ms of which 7 ms to minimize.
[2024-05-24 17:10:44] [INFO ] Deduced a trap composed of 75 places in 703 ms of which 7 ms to minimize.
[2024-05-24 17:10:45] [INFO ] Deduced a trap composed of 108 places in 703 ms of which 6 ms to minimize.
[2024-05-24 17:10:46] [INFO ] Deduced a trap composed of 117 places in 697 ms of which 7 ms to minimize.
[2024-05-24 17:10:46] [INFO ] Deduced a trap composed of 90 places in 690 ms of which 6 ms to minimize.
[2024-05-24 17:10:47] [INFO ] Deduced a trap composed of 123 places in 695 ms of which 7 ms to minimize.
[2024-05-24 17:10:48] [INFO ] Deduced a trap composed of 109 places in 706 ms of which 7 ms to minimize.
[2024-05-24 17:10:49] [INFO ] Deduced a trap composed of 110 places in 700 ms of which 7 ms to minimize.
[2024-05-24 17:10:49] [INFO ] Deduced a trap composed of 121 places in 694 ms of which 7 ms to minimize.
[2024-05-24 17:10:50] [INFO ] Deduced a trap composed of 94 places in 587 ms of which 6 ms to minimize.
[2024-05-24 17:10:51] [INFO ] Deduced a trap composed of 110 places in 592 ms of which 6 ms to minimize.
[2024-05-24 17:10:51] [INFO ] Deduced a trap composed of 108 places in 685 ms of which 7 ms to minimize.
[2024-05-24 17:10:52] [INFO ] Deduced a trap composed of 82 places in 649 ms of which 7 ms to minimize.
[2024-05-24 17:10:53] [INFO ] Deduced a trap composed of 111 places in 696 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1027 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:10:53] [INFO ] Deduced a trap composed of 103 places in 702 ms of which 8 ms to minimize.
[2024-05-24 17:10:54] [INFO ] Deduced a trap composed of 142 places in 707 ms of which 6 ms to minimize.
[2024-05-24 17:10:55] [INFO ] Deduced a trap composed of 119 places in 644 ms of which 7 ms to minimize.
[2024-05-24 17:10:56] [INFO ] Deduced a trap composed of 62 places in 695 ms of which 7 ms to minimize.
[2024-05-24 17:10:56] [INFO ] Deduced a trap composed of 104 places in 681 ms of which 7 ms to minimize.
[2024-05-24 17:10:57] [INFO ] Deduced a trap composed of 107 places in 658 ms of which 6 ms to minimize.
SMT process timed out in 47094ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 1067 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1067/1067 places, 3791/3791 transitions.
Applied a total of 0 rules in 108 ms. Remains 1067 /1067 variables (removed 0) and now considering 3791/3791 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 1067/1067 places, 3791/3791 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1067/1067 places, 3791/3791 transitions.
Applied a total of 0 rules in 104 ms. Remains 1067 /1067 variables (removed 0) and now considering 3791/3791 (removed 0) transitions.
[2024-05-24 17:10:57] [INFO ] Flow matrix only has 3393 transitions (discarded 398 similar events)
[2024-05-24 17:10:57] [INFO ] Invariant cache hit.
[2024-05-24 17:10:58] [INFO ] Implicit Places using invariants in 1292 ms returned [7, 139, 283, 305, 312, 313, 347, 348, 411, 456, 473, 475, 483, 484, 485, 502, 511, 527, 580, 581, 595, 634, 656, 684, 711, 713, 751, 788, 947, 948]
[2024-05-24 17:10:58] [INFO ] Actually due to overlaps returned [305, 348, 656, 711, 7, 139, 283, 312, 313, 347, 411, 456, 473, 483, 484, 485, 502, 511, 527, 580, 581, 595, 634, 684, 713, 751, 788, 947, 948]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 1297 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1038/1067 places, 3791/3791 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1023 transition count 3776
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1023 transition count 3776
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1008 transition count 3761
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1008 transition count 3761
Applied a total of 60 rules in 154 ms. Remains 1008 /1038 variables (removed 30) and now considering 3761/3791 (removed 30) transitions.
[2024-05-24 17:10:59] [INFO ] Flow matrix only has 3363 transitions (discarded 398 similar events)
// Phase 1: matrix 3363 rows 1008 cols
[2024-05-24 17:10:59] [INFO ] Computed 51 invariants in 31 ms
[2024-05-24 17:11:00] [INFO ] Implicit Places using invariants in 1273 ms returned [462]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1275 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1007/1067 places, 3761/3791 transitions.
Applied a total of 0 rules in 100 ms. Remains 1007 /1007 variables (removed 0) and now considering 3761/3761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2931 ms. Remains : 1007/1067 places, 3761/3791 transitions.
RANDOM walk for 40000 steps (1125 resets) in 785 ms. (50 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (141 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (143 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (142 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (143 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 62266 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 4
Probabilistic random walk after 62266 steps, saw 26279 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-24 17:11:03] [INFO ] Flow matrix only has 3363 transitions (discarded 398 similar events)
// Phase 1: matrix 3363 rows 1007 cols
[2024-05-24 17:11:03] [INFO ] Computed 50 invariants in 38 ms
[2024-05-24 17:11:03] [INFO ] State equation strengthened by 2178 read => feed constraints.
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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 920/930 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/930 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 37/967 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/967 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 28/995 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/995 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 12/1007 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1007 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3363/4370 variables, 1007/1057 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4370 variables, 2178/3235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4370 variables, 0/3235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/4370 variables, 0/3235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4370/4370 variables, and 3235 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1962 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 1007/1007 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 920/930 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:11:06] [INFO ] Deduced a trap composed of 178 places in 561 ms of which 6 ms to minimize.
[2024-05-24 17:11:07] [INFO ] Deduced a trap composed of 108 places in 585 ms of which 6 ms to minimize.
[2024-05-24 17:11:07] [INFO ] Deduced a trap composed of 138 places in 570 ms of which 6 ms to minimize.
[2024-05-24 17:11:08] [INFO ] Deduced a trap composed of 156 places in 605 ms of which 6 ms to minimize.
[2024-05-24 17:11:09] [INFO ] Deduced a trap composed of 204 places in 615 ms of which 6 ms to minimize.
[2024-05-24 17:11:09] [INFO ] Deduced a trap composed of 107 places in 612 ms of which 6 ms to minimize.
[2024-05-24 17:11:10] [INFO ] Deduced a trap composed of 116 places in 608 ms of which 6 ms to minimize.
[2024-05-24 17:11:11] [INFO ] Deduced a trap composed of 178 places in 602 ms of which 6 ms to minimize.
[2024-05-24 17:11:11] [INFO ] Deduced a trap composed of 114 places in 592 ms of which 6 ms to minimize.
[2024-05-24 17:11:12] [INFO ] Deduced a trap composed of 124 places in 590 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/930 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/930 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 37/967 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:11:12] [INFO ] Deduced a trap composed of 5 places in 559 ms of which 6 ms to minimize.
[2024-05-24 17:11:13] [INFO ] Deduced a trap composed of 83 places in 554 ms of which 6 ms to minimize.
[2024-05-24 17:11:14] [INFO ] Deduced a trap composed of 85 places in 648 ms of which 7 ms to minimize.
[2024-05-24 17:11:14] [INFO ] Deduced a trap composed of 27 places in 642 ms of which 7 ms to minimize.
[2024-05-24 17:11:15] [INFO ] Deduced a trap composed of 91 places in 639 ms of which 6 ms to minimize.
[2024-05-24 17:11:16] [INFO ] Deduced a trap composed of 97 places in 643 ms of which 6 ms to minimize.
[2024-05-24 17:11:16] [INFO ] Deduced a trap composed of 82 places in 644 ms of which 6 ms to minimize.
[2024-05-24 17:11:17] [INFO ] Deduced a trap composed of 46 places in 638 ms of which 6 ms to minimize.
[2024-05-24 17:11:18] [INFO ] Deduced a trap composed of 87 places in 549 ms of which 6 ms to minimize.
[2024-05-24 17:11:18] [INFO ] Deduced a trap composed of 89 places in 645 ms of which 6 ms to minimize.
[2024-05-24 17:11:19] [INFO ] Deduced a trap composed of 73 places in 640 ms of which 7 ms to minimize.
[2024-05-24 17:11:19] [INFO ] Deduced a trap composed of 99 places in 552 ms of which 6 ms to minimize.
[2024-05-24 17:11:20] [INFO ] Deduced a trap composed of 62 places in 563 ms of which 6 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 76 places in 646 ms of which 6 ms to minimize.
[2024-05-24 17:11:21] [INFO ] Deduced a trap composed of 93 places in 647 ms of which 7 ms to minimize.
[2024-05-24 17:11:22] [INFO ] Deduced a trap composed of 173 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:11:22] [INFO ] Deduced a trap composed of 95 places in 541 ms of which 6 ms to minimize.
[2024-05-24 17:11:23] [INFO ] Deduced a trap composed of 182 places in 554 ms of which 6 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 176 places in 643 ms of which 7 ms to minimize.
[2024-05-24 17:11:24] [INFO ] Deduced a trap composed of 182 places in 543 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/967 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 72 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:11:25] [INFO ] Deduced a trap composed of 75 places in 532 ms of which 6 ms to minimize.
[2024-05-24 17:11:26] [INFO ] Deduced a trap composed of 168 places in 625 ms of which 7 ms to minimize.
[2024-05-24 17:11:27] [INFO ] Deduced a trap composed of 62 places in 635 ms of which 6 ms to minimize.
[2024-05-24 17:11:27] [INFO ] Deduced a trap composed of 127 places in 641 ms of which 6 ms to minimize.
[2024-05-24 17:11:28] [INFO ] Deduced a trap composed of 75 places in 572 ms of which 6 ms to minimize.
[2024-05-24 17:11:29] [INFO ] Deduced a trap composed of 80 places in 592 ms of which 6 ms to minimize.
[2024-05-24 17:11:29] [INFO ] Deduced a trap composed of 96 places in 532 ms of which 5 ms to minimize.
[2024-05-24 17:11:30] [INFO ] Deduced a trap composed of 103 places in 632 ms of which 6 ms to minimize.
[2024-05-24 17:11:30] [INFO ] Deduced a trap composed of 27 places in 526 ms of which 6 ms to minimize.
[2024-05-24 17:11:31] [INFO ] Deduced a trap composed of 57 places in 635 ms of which 6 ms to minimize.
[2024-05-24 17:11:32] [INFO ] Deduced a trap composed of 72 places in 636 ms of which 6 ms to minimize.
[2024-05-24 17:11:32] [INFO ] Deduced a trap composed of 89 places in 637 ms of which 6 ms to minimize.
[2024-05-24 17:11:33] [INFO ] Deduced a trap composed of 78 places in 631 ms of which 7 ms to minimize.
[2024-05-24 17:11:34] [INFO ] Deduced a trap composed of 79 places in 636 ms of which 8 ms to minimize.
[2024-05-24 17:11:34] [INFO ] Deduced a trap composed of 90 places in 639 ms of which 7 ms to minimize.
[2024-05-24 17:11:35] [INFO ] Deduced a trap composed of 95 places in 630 ms of which 6 ms to minimize.
[2024-05-24 17:11:36] [INFO ] Deduced a trap composed of 104 places in 533 ms of which 6 ms to minimize.
[2024-05-24 17:11:36] [INFO ] Deduced a trap composed of 205 places in 545 ms of which 5 ms to minimize.
[2024-05-24 17:11:37] [INFO ] Deduced a trap composed of 86 places in 531 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/967 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:11:37] [INFO ] Deduced a trap composed of 108 places in 514 ms of which 5 ms to minimize.
[2024-05-24 17:11:38] [INFO ] Deduced a trap composed of 94 places in 533 ms of which 6 ms to minimize.
[2024-05-24 17:11:38] [INFO ] Deduced a trap composed of 82 places in 545 ms of which 6 ms to minimize.
[2024-05-24 17:11:39] [INFO ] Deduced a trap composed of 94 places in 547 ms of which 6 ms to minimize.
[2024-05-24 17:11:39] [INFO ] Deduced a trap composed of 242 places in 543 ms of which 6 ms to minimize.
[2024-05-24 17:11:40] [INFO ] Deduced a trap composed of 114 places in 546 ms of which 5 ms to minimize.
[2024-05-24 17:11:41] [INFO ] Deduced a trap composed of 108 places in 531 ms of which 5 ms to minimize.
[2024-05-24 17:11:41] [INFO ] Deduced a trap composed of 77 places in 541 ms of which 6 ms to minimize.
[2024-05-24 17:11:42] [INFO ] Deduced a trap composed of 122 places in 549 ms of which 6 ms to minimize.
[2024-05-24 17:11:42] [INFO ] Deduced a trap composed of 87 places in 531 ms of which 6 ms to minimize.
[2024-05-24 17:11:43] [INFO ] Deduced a trap composed of 132 places in 544 ms of which 6 ms to minimize.
[2024-05-24 17:11:43] [INFO ] Deduced a trap composed of 85 places in 539 ms of which 6 ms to minimize.
[2024-05-24 17:11:44] [INFO ] Deduced a trap composed of 94 places in 540 ms of which 6 ms to minimize.
[2024-05-24 17:11:45] [INFO ] Deduced a trap composed of 100 places in 545 ms of which 6 ms to minimize.
[2024-05-24 17:11:45] [INFO ] Deduced a trap composed of 123 places in 534 ms of which 6 ms to minimize.
[2024-05-24 17:11:46] [INFO ] Deduced a trap composed of 233 places in 460 ms of which 5 ms to minimize.
[2024-05-24 17:11:46] [INFO ] Deduced a trap composed of 193 places in 490 ms of which 6 ms to minimize.
[2024-05-24 17:11:47] [INFO ] Deduced a trap composed of 78 places in 538 ms of which 6 ms to minimize.
[2024-05-24 17:11:47] [INFO ] Deduced a trap composed of 165 places in 528 ms of which 5 ms to minimize.
[2024-05-24 17:11:48] [INFO ] Deduced a trap composed of 220 places in 470 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/967 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:11:48] [INFO ] Deduced a trap composed of 62 places in 504 ms of which 6 ms to minimize.
[2024-05-24 17:11:49] [INFO ] Deduced a trap composed of 200 places in 490 ms of which 6 ms to minimize.
[2024-05-24 17:11:49] [INFO ] Deduced a trap composed of 86 places in 491 ms of which 6 ms to minimize.
[2024-05-24 17:11:50] [INFO ] Deduced a trap composed of 216 places in 485 ms of which 5 ms to minimize.
[2024-05-24 17:11:50] [INFO ] Deduced a trap composed of 238 places in 476 ms of which 6 ms to minimize.
[2024-05-24 17:11:51] [INFO ] Deduced a trap composed of 231 places in 485 ms of which 6 ms to minimize.
[2024-05-24 17:11:51] [INFO ] Deduced a trap composed of 69 places in 540 ms of which 6 ms to minimize.
[2024-05-24 17:11:52] [INFO ] Deduced a trap composed of 117 places in 538 ms of which 6 ms to minimize.
[2024-05-24 17:11:52] [INFO ] Deduced a trap composed of 113 places in 537 ms of which 5 ms to minimize.
[2024-05-24 17:11:53] [INFO ] Deduced a trap composed of 198 places in 485 ms of which 6 ms to minimize.
[2024-05-24 17:11:53] [INFO ] Deduced a trap composed of 123 places in 474 ms of which 5 ms to minimize.
[2024-05-24 17:11:54] [INFO ] Deduced a trap composed of 123 places in 535 ms of which 6 ms to minimize.
[2024-05-24 17:11:55] [INFO ] Deduced a trap composed of 109 places in 529 ms of which 6 ms to minimize.
[2024-05-24 17:11:55] [INFO ] Deduced a trap composed of 80 places in 534 ms of which 7 ms to minimize.
[2024-05-24 17:11:56] [INFO ] Deduced a trap composed of 132 places in 514 ms of which 6 ms to minimize.
[2024-05-24 17:11:56] [INFO ] Deduced a trap composed of 135 places in 531 ms of which 7 ms to minimize.
[2024-05-24 17:11:57] [INFO ] Deduced a trap composed of 128 places in 548 ms of which 6 ms to minimize.
[2024-05-24 17:11:57] [INFO ] Deduced a trap composed of 126 places in 547 ms of which 5 ms to minimize.
[2024-05-24 17:11:58] [INFO ] Deduced a trap composed of 116 places in 560 ms of which 6 ms to minimize.
[2024-05-24 17:11:59] [INFO ] Deduced a trap composed of 144 places in 526 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/967 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:11:59] [INFO ] Deduced a trap composed of 91 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:12:00] [INFO ] Deduced a trap composed of 79 places in 550 ms of which 6 ms to minimize.
[2024-05-24 17:12:01] [INFO ] Deduced a trap composed of 88 places in 535 ms of which 6 ms to minimize.
[2024-05-24 17:12:01] [INFO ] Deduced a trap composed of 90 places in 549 ms of which 6 ms to minimize.
[2024-05-24 17:12:02] [INFO ] Deduced a trap composed of 108 places in 527 ms of which 6 ms to minimize.
[2024-05-24 17:12:02] [INFO ] Deduced a trap composed of 125 places in 527 ms of which 6 ms to minimize.
[2024-05-24 17:12:03] [INFO ] Deduced a trap composed of 96 places in 526 ms of which 5 ms to minimize.
[2024-05-24 17:12:03] [INFO ] Deduced a trap composed of 167 places in 530 ms of which 6 ms to minimize.
[2024-05-24 17:12:04] [INFO ] Deduced a trap composed of 113 places in 553 ms of which 6 ms to minimize.
[2024-05-24 17:12:04] [INFO ] Deduced a trap composed of 155 places in 555 ms of which 6 ms to minimize.
[2024-05-24 17:12:05] [INFO ] Deduced a trap composed of 84 places in 534 ms of which 5 ms to minimize.
[2024-05-24 17:12:06] [INFO ] Deduced a trap composed of 124 places in 551 ms of which 6 ms to minimize.
[2024-05-24 17:12:06] [INFO ] Deduced a trap composed of 130 places in 561 ms of which 6 ms to minimize.
[2024-05-24 17:12:07] [INFO ] Deduced a trap composed of 87 places in 536 ms of which 5 ms to minimize.
[2024-05-24 17:12:07] [INFO ] Deduced a trap composed of 97 places in 584 ms of which 6 ms to minimize.
[2024-05-24 17:12:08] [INFO ] Deduced a trap composed of 133 places in 539 ms of which 6 ms to minimize.
[2024-05-24 17:12:08] [INFO ] Deduced a trap composed of 89 places in 520 ms of which 5 ms to minimize.
[2024-05-24 17:12:09] [INFO ] Deduced a trap composed of 81 places in 521 ms of which 5 ms to minimize.
[2024-05-24 17:12:09] [INFO ] Deduced a trap composed of 169 places in 547 ms of which 6 ms to minimize.
[2024-05-24 17:12:10] [INFO ] Deduced a trap composed of 200 places in 530 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/967 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 17:12:11] [INFO ] Deduced a trap composed of 80 places in 525 ms of which 6 ms to minimize.
[2024-05-24 17:12:11] [INFO ] Deduced a trap composed of 89 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:12:12] [INFO ] Deduced a trap composed of 89 places in 562 ms of which 6 ms to minimize.
[2024-05-24 17:12:12] [INFO ] Deduced a trap composed of 108 places in 571 ms of which 6 ms to minimize.
[2024-05-24 17:12:13] [INFO ] Deduced a trap composed of 108 places in 461 ms of which 6 ms to minimize.
[2024-05-24 17:12:13] [INFO ] Deduced a trap composed of 134 places in 559 ms of which 6 ms to minimize.
[2024-05-24 17:12:14] [INFO ] Deduced a trap composed of 88 places in 555 ms of which 6 ms to minimize.
[2024-05-24 17:12:15] [INFO ] Deduced a trap composed of 111 places in 636 ms of which 6 ms to minimize.
[2024-05-24 17:12:15] [INFO ] Deduced a trap composed of 90 places in 642 ms of which 6 ms to minimize.
[2024-05-24 17:12:16] [INFO ] Deduced a trap composed of 84 places in 532 ms of which 5 ms to minimize.
[2024-05-24 17:12:16] [INFO ] Deduced a trap composed of 74 places in 547 ms of which 7 ms to minimize.
[2024-05-24 17:12:17] [INFO ] Deduced a trap composed of 184 places in 554 ms of which 6 ms to minimize.
[2024-05-24 17:12:18] [INFO ] Deduced a trap composed of 129 places in 546 ms of which 6 ms to minimize.
[2024-05-24 17:12:18] [INFO ] Deduced a trap composed of 76 places in 548 ms of which 6 ms to minimize.
[2024-05-24 17:12:19] [INFO ] Deduced a trap composed of 102 places in 557 ms of which 7 ms to minimize.
[2024-05-24 17:12:19] [INFO ] Deduced a trap composed of 75 places in 638 ms of which 7 ms to minimize.
[2024-05-24 17:12:20] [INFO ] Deduced a trap composed of 117 places in 531 ms of which 6 ms to minimize.
[2024-05-24 17:12:20] [INFO ] Deduced a trap composed of 89 places in 531 ms of which 6 ms to minimize.
SMT process timed out in 77070ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 1007 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1007/1007 places, 3761/3761 transitions.
Applied a total of 0 rules in 97 ms. Remains 1007 /1007 variables (removed 0) and now considering 3761/3761 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 1007/1007 places, 3761/3761 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1007/1007 places, 3761/3761 transitions.
Applied a total of 0 rules in 118 ms. Remains 1007 /1007 variables (removed 0) and now considering 3761/3761 (removed 0) transitions.
[2024-05-24 17:12:21] [INFO ] Flow matrix only has 3363 transitions (discarded 398 similar events)
[2024-05-24 17:12:21] [INFO ] Invariant cache hit.
[2024-05-24 17:12:22] [INFO ] Implicit Places using invariants in 1150 ms returned []
[2024-05-24 17:12:22] [INFO ] Flow matrix only has 3363 transitions (discarded 398 similar events)
[2024-05-24 17:12:22] [INFO ] Invariant cache hit.
[2024-05-24 17:12:23] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:12:53] [INFO ] Performed 840/1007 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 17:12:59] [INFO ] Implicit Places using invariants and state equation in 36676 ms returned []
Implicit Place search using SMT with State Equation took 37830 ms to find 0 implicit places.
[2024-05-24 17:12:59] [INFO ] Redundant transitions in 241 ms returned []
Running 3699 sub problems to find dead transitions.
[2024-05-24 17:12:59] [INFO ] Flow matrix only has 3363 transitions (discarded 398 similar events)
[2024-05-24 17:12:59] [INFO ] Invariant cache hit.
[2024-05-24 17:12:59] [INFO ] State equation strengthened by 2178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1005 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3699 unsolved
SMT process timed out in 52461ms, After SMT, problems are : Problem set: 0 solved, 3699 unsolved
Search for dead transitions found 0 dead transitions in 52500ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90723 ms. Remains : 1007/1007 places, 3761/3761 transitions.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 8 atomic propositions for a total of 13 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 564 stabilizing places and 1437 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 1396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1396 transition count 3039
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1365 transition count 3039
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 62 place count 1365 transition count 3007
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 126 place count 1333 transition count 3007
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 146 place count 1313 transition count 2982
Iterating global reduction 2 with 20 rules applied. Total rules applied 166 place count 1313 transition count 2982
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 166 place count 1313 transition count 2981
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 168 place count 1312 transition count 2981
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 184 place count 1296 transition count 2905
Iterating global reduction 2 with 16 rules applied. Total rules applied 200 place count 1296 transition count 2905
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 203 place count 1293 transition count 2887
Iterating global reduction 2 with 3 rules applied. Total rules applied 206 place count 1293 transition count 2887
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 284 place count 1254 transition count 2848
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 301 place count 1237 transition count 2831
Iterating global reduction 2 with 17 rules applied. Total rules applied 318 place count 1237 transition count 2831
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 335 place count 1220 transition count 2729
Iterating global reduction 2 with 17 rules applied. Total rules applied 352 place count 1220 transition count 2729
Applied a total of 352 rules in 480 ms. Remains 1220 /1396 variables (removed 176) and now considering 2729/3070 (removed 341) transitions.
[2024-05-24 17:13:52] [INFO ] Flow matrix only has 2457 transitions (discarded 272 similar events)
// Phase 1: matrix 2457 rows 1220 cols
[2024-05-24 17:13:52] [INFO ] Computed 80 invariants in 59 ms
[2024-05-24 17:13:53] [INFO ] Implicit Places using invariants in 1103 ms returned [160, 161, 325, 352, 360, 361, 402, 403, 478, 499, 518, 532, 550, 552, 561, 562, 563, 581, 591, 609, 645, 663, 664, 682, 728, 753, 787, 818, 821, 866, 909, 1092, 1093]
[2024-05-24 17:13:53] [INFO ] Actually due to overlaps returned [352, 160, 161, 325, 360, 361, 402, 403, 478, 499, 518, 532, 550, 561, 562, 563, 581, 591, 609, 645, 663, 664, 682, 728, 753, 787, 818, 821, 866, 909, 1092, 1093]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 1109 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1188/1396 places, 2729/3070 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1170 transition count 2711
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1170 transition count 2711
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 1152 transition count 2693
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 1152 transition count 2693
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 1142 transition count 2633
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 1142 transition count 2633
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 112 place count 1132 transition count 2623
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 122 place count 1122 transition count 2613
Iterating global reduction 0 with 10 rules applied. Total rules applied 132 place count 1122 transition count 2613
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 144 place count 1110 transition count 2541
Iterating global reduction 0 with 12 rules applied. Total rules applied 156 place count 1110 transition count 2541
Applied a total of 156 rules in 369 ms. Remains 1110 /1188 variables (removed 78) and now considering 2541/2729 (removed 188) transitions.
[2024-05-24 17:13:54] [INFO ] Flow matrix only has 2269 transitions (discarded 272 similar events)
// Phase 1: matrix 2269 rows 1110 cols
[2024-05-24 17:13:54] [INFO ] Computed 48 invariants in 22 ms
[2024-05-24 17:13:54] [INFO ] Implicit Places using invariants in 941 ms returned [520]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 947 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1109/1396 places, 2541/3070 transitions.
Applied a total of 0 rules in 73 ms. Remains 1109 /1109 variables (removed 0) and now considering 2541/2541 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2979 ms. Remains : 1109/1396 places, 2541/3070 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-00
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-00 finished in 3255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1396 transition count 3039
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1365 transition count 3039
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 62 place count 1365 transition count 3007
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 126 place count 1333 transition count 3007
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 147 place count 1312 transition count 2981
Iterating global reduction 2 with 21 rules applied. Total rules applied 168 place count 1312 transition count 2981
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 168 place count 1312 transition count 2980
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 1311 transition count 2980
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 187 place count 1294 transition count 2898
Iterating global reduction 2 with 17 rules applied. Total rules applied 204 place count 1294 transition count 2898
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 207 place count 1291 transition count 2880
Iterating global reduction 2 with 3 rules applied. Total rules applied 210 place count 1291 transition count 2880
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 288 place count 1252 transition count 2841
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 305 place count 1235 transition count 2824
Iterating global reduction 2 with 17 rules applied. Total rules applied 322 place count 1235 transition count 2824
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 339 place count 1218 transition count 2722
Iterating global reduction 2 with 17 rules applied. Total rules applied 356 place count 1218 transition count 2722
Applied a total of 356 rules in 414 ms. Remains 1218 /1396 variables (removed 178) and now considering 2722/3070 (removed 348) transitions.
[2024-05-24 17:13:55] [INFO ] Flow matrix only has 2450 transitions (discarded 272 similar events)
// Phase 1: matrix 2450 rows 1218 cols
[2024-05-24 17:13:55] [INFO ] Computed 80 invariants in 34 ms
[2024-05-24 17:13:56] [INFO ] Implicit Places using invariants in 1119 ms returned [9, 157, 158, 322, 348, 356, 357, 398, 399, 473, 494, 513, 527, 547, 559, 560, 561, 579, 589, 607, 643, 661, 662, 729, 754, 788, 819, 822, 867, 910, 1017, 1090, 1091]
[2024-05-24 17:13:56] [INFO ] Actually due to overlaps returned [348, 9, 157, 158, 322, 356, 357, 398, 399, 473, 494, 513, 527, 559, 560, 561, 579, 589, 607, 643, 661, 662, 729, 754, 788, 819, 822, 867, 910, 1017, 1090, 1091]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 1121 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1186/1396 places, 2722/3070 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1169 transition count 2705
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1169 transition count 2705
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1152 transition count 2688
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1152 transition count 2688
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 1143 transition count 2634
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 1143 transition count 2634
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 108 place count 1132 transition count 2623
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 119 place count 1121 transition count 2612
Iterating global reduction 0 with 11 rules applied. Total rules applied 130 place count 1121 transition count 2612
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 143 place count 1108 transition count 2534
Iterating global reduction 0 with 13 rules applied. Total rules applied 156 place count 1108 transition count 2534
Applied a total of 156 rules in 363 ms. Remains 1108 /1186 variables (removed 78) and now considering 2534/2722 (removed 188) transitions.
[2024-05-24 17:13:57] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1108 cols
[2024-05-24 17:13:57] [INFO ] Computed 48 invariants in 24 ms
[2024-05-24 17:13:58] [INFO ] Implicit Places using invariants in 944 ms returned [514]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 946 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1107/1396 places, 2534/3070 transitions.
Applied a total of 0 rules in 71 ms. Remains 1107 /1107 variables (removed 0) and now considering 2534/2534 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2915 ms. Remains : 1107/1396 places, 2534/3070 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-01
Product exploration explored 100000 steps with 2280 reset in 626 ms.
Product exploration explored 100000 steps with 2277 reset in 521 ms.
Computed a total of 292 stabilizing places and 918 stable transitions
Computed a total of 292 stabilizing places and 918 stable transitions
Detected a total of 292/1107 stabilizing places and 918/2534 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 86 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 29 ms :[(NOT p0)]
RANDOM walk for 40000 steps (909 resets) in 237 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (188 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4616 steps, run visited all 1 properties in 178 ms. (steps per millisecond=25 )
Probabilistic random walk after 4616 steps, saw 2050 distinct states, run finished after 182 ms. (steps per millisecond=25 ) properties seen :1
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 122 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)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 1107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1107/1107 places, 2534/2534 transitions.
Applied a total of 0 rules in 75 ms. Remains 1107 /1107 variables (removed 0) and now considering 2534/2534 (removed 0) transitions.
[2024-05-24 17:14:00] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
// Phase 1: matrix 2262 rows 1107 cols
[2024-05-24 17:14:00] [INFO ] Computed 47 invariants in 26 ms
[2024-05-24 17:14:01] [INFO ] Implicit Places using invariants in 928 ms returned []
[2024-05-24 17:14:01] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2024-05-24 17:14:01] [INFO ] Invariant cache hit.
[2024-05-24 17:14:01] [INFO ] State equation strengthened by 848 read => feed constraints.
[2024-05-24 17:14:11] [INFO ] Implicit Places using invariants and state equation in 10384 ms returned []
Implicit Place search using SMT with State Equation took 11314 ms to find 0 implicit places.
[2024-05-24 17:14:11] [INFO ] Redundant transitions in 57 ms returned []
Running 2517 sub problems to find dead transitions.
[2024-05-24 17:14:11] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2024-05-24 17:14:11] [INFO ] Invariant cache hit.
[2024-05-24 17:14:11] [INFO ] State equation strengthened by 848 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1105 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2517 unsolved
SMT process timed out in 32629ms, After SMT, problems are : Problem set: 0 solved, 2517 unsolved
Search for dead transitions found 0 dead transitions in 32652ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44120 ms. Remains : 1107/1107 places, 2534/2534 transitions.
Computed a total of 292 stabilizing places and 918 stable transitions
Computed a total of 292 stabilizing places and 918 stable transitions
Detected a total of 292/1107 stabilizing places and 918/2534 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 76 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 40000 steps (909 resets) in 333 ms. (119 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (188 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4616 steps, run visited all 1 properties in 181 ms. (steps per millisecond=25 )
Probabilistic random walk after 4616 steps, saw 2050 distinct states, run finished after 181 ms. (steps per millisecond=25 ) properties seen :1
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 97 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2281 reset in 490 ms.
Product exploration explored 100000 steps with 2277 reset in 537 ms.
Built C files in :
/tmp/ltsmin4572955579821385604
[2024-05-24 17:14:45] [INFO ] Too many transitions (2534) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:14:45] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4572955579821385604
Running compilation step : cd /tmp/ltsmin4572955579821385604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4572955579821385604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4572955579821385604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 1107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1107/1107 places, 2534/2534 transitions.
Applied a total of 0 rules in 79 ms. Remains 1107 /1107 variables (removed 0) and now considering 2534/2534 (removed 0) transitions.
[2024-05-24 17:14:49] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2024-05-24 17:14:49] [INFO ] Invariant cache hit.
[2024-05-24 17:14:49] [INFO ] Implicit Places using invariants in 909 ms returned []
[2024-05-24 17:14:49] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2024-05-24 17:14:49] [INFO ] Invariant cache hit.
[2024-05-24 17:14:50] [INFO ] State equation strengthened by 848 read => feed constraints.
[2024-05-24 17:15:00] [INFO ] Implicit Places using invariants and state equation in 10367 ms returned []
Implicit Place search using SMT with State Equation took 11279 ms to find 0 implicit places.
[2024-05-24 17:15:00] [INFO ] Redundant transitions in 135 ms returned []
Running 2517 sub problems to find dead transitions.
[2024-05-24 17:15:00] [INFO ] Flow matrix only has 2262 transitions (discarded 272 similar events)
[2024-05-24 17:15:00] [INFO ] Invariant cache hit.
[2024-05-24 17:15:00] [INFO ] State equation strengthened by 848 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1105 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2517 unsolved
SMT process timed out in 32828ms, After SMT, problems are : Problem set: 0 solved, 2517 unsolved
Search for dead transitions found 0 dead transitions in 32852ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44366 ms. Remains : 1107/1107 places, 2534/2534 transitions.
Built C files in :
/tmp/ltsmin1847817825083424886
[2024-05-24 17:15:33] [INFO ] Too many transitions (2534) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:15:33] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1847817825083424886
Running compilation step : cd /tmp/ltsmin1847817825083424886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1847817825083424886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1847817825083424886;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 17:15:36] [INFO ] Flatten gal took : 120 ms
[2024-05-24 17:15:36] [INFO ] Flatten gal took : 72 ms
[2024-05-24 17:15:36] [INFO ] Time to serialize gal into /tmp/LTL18117607772753920898.gal : 68 ms
[2024-05-24 17:15:36] [INFO ] Time to serialize properties into /tmp/LTL13890458377157079079.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18117607772753920898.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4517055360884128388.hoa' '-atoms' '/tmp/LTL13890458377157079079.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13890458377157079079.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4517055360884128388.hoa
Detected timeout of ITS tools.
[2024-05-24 17:15:52] [INFO ] Flatten gal took : 66 ms
[2024-05-24 17:15:52] [INFO ] Flatten gal took : 83 ms
[2024-05-24 17:15:52] [INFO ] Time to serialize gal into /tmp/LTL3637228632220916076.gal : 58 ms
[2024-05-24 17:15:52] [INFO ] Time to serialize properties into /tmp/LTL13331810691500988251.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3637228632220916076.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13331810691500988251.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(Node11HasTheLeafSetOfRx4ToReplaceNode8<=Node7HasTheLeafSetOfLx3ToReplaceNode2)"))))
Formula 0 simplified : GF!"(Node11HasTheLeafSetOfRx4ToReplaceNode8<=Node7HasTheLeafSetOfLx3ToReplaceNode2)"
Detected timeout of ITS tools.
[2024-05-24 17:16:07] [INFO ] Flatten gal took : 59 ms
[2024-05-24 17:16:07] [INFO ] Applying decomposition
[2024-05-24 17:16:07] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6285676184059669221.txt' '-o' '/tmp/graph6285676184059669221.bin' '-w' '/tmp/graph6285676184059669221.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6285676184059669221.bin' '-l' '-1' '-v' '-w' '/tmp/graph6285676184059669221.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:16:07] [INFO ] Decomposing Gal with order
[2024-05-24 17:16:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:16:07] [INFO ] Removed a total of 351 redundant transitions.
[2024-05-24 17:16:07] [INFO ] Flatten gal took : 175 ms
[2024-05-24 17:16:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-24 17:16:08] [INFO ] Time to serialize gal into /tmp/LTL17569013332181362875.gal : 16 ms
[2024-05-24 17:16:08] [INFO ] Time to serialize properties into /tmp/LTL7282054734697739913.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17569013332181362875.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7282054734697739913.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu11.Node11HasTheLeafSetOfRx4ToReplaceNode8<=gu11.Node7HasTheLeafSetOfLx3ToReplaceNode2)"))))
Formula 0 simplified : GF!"(gu11.Node11HasTheLeafSetOfRx4ToReplaceNode8<=gu11.Node7HasTheLeafSetOfLx3ToReplaceNode2)"
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-01 finished in 148162 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1396 transition count 3038
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1364 transition count 3038
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1364 transition count 3006
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 128 place count 1332 transition count 3006
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 149 place count 1311 transition count 2980
Iterating global reduction 2 with 21 rules applied. Total rules applied 170 place count 1311 transition count 2980
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 170 place count 1311 transition count 2979
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 172 place count 1310 transition count 2979
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 189 place count 1293 transition count 2897
Iterating global reduction 2 with 17 rules applied. Total rules applied 206 place count 1293 transition count 2897
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 209 place count 1290 transition count 2879
Iterating global reduction 2 with 3 rules applied. Total rules applied 212 place count 1290 transition count 2879
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 290 place count 1251 transition count 2840
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 308 place count 1233 transition count 2822
Iterating global reduction 2 with 18 rules applied. Total rules applied 326 place count 1233 transition count 2822
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 344 place count 1215 transition count 2714
Iterating global reduction 2 with 18 rules applied. Total rules applied 362 place count 1215 transition count 2714
Applied a total of 362 rules in 473 ms. Remains 1215 /1396 variables (removed 181) and now considering 2714/3070 (removed 356) transitions.
[2024-05-24 17:16:23] [INFO ] Flow matrix only has 2442 transitions (discarded 272 similar events)
// Phase 1: matrix 2442 rows 1215 cols
[2024-05-24 17:16:23] [INFO ] Computed 80 invariants in 32 ms
[2024-05-24 17:16:24] [INFO ] Implicit Places using invariants in 1071 ms returned [9, 157, 158, 322, 348, 356, 357, 398, 399, 473, 494, 513, 527, 545, 547, 556, 557, 558, 576, 607, 643, 661, 662, 680, 726, 785, 816, 819, 864, 907, 1014, 1087, 1088]
[2024-05-24 17:16:24] [INFO ] Actually due to overlaps returned [348, 9, 157, 158, 322, 356, 357, 398, 399, 473, 494, 513, 527, 545, 556, 557, 558, 576, 607, 643, 661, 662, 680, 726, 785, 816, 819, 864, 907, 1014, 1087, 1088]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 1073 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1183/1396 places, 2714/3070 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1164 transition count 2695
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1164 transition count 2695
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 1145 transition count 2676
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 1145 transition count 2676
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 87 place count 1134 transition count 2610
Iterating global reduction 0 with 11 rules applied. Total rules applied 98 place count 1134 transition count 2610
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 118 place count 1124 transition count 2600
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 128 place count 1114 transition count 2590
Iterating global reduction 0 with 10 rules applied. Total rules applied 138 place count 1114 transition count 2590
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 150 place count 1102 transition count 2518
Iterating global reduction 0 with 12 rules applied. Total rules applied 162 place count 1102 transition count 2518
Applied a total of 162 rules in 356 ms. Remains 1102 /1183 variables (removed 81) and now considering 2518/2714 (removed 196) transitions.
[2024-05-24 17:16:25] [INFO ] Flow matrix only has 2246 transitions (discarded 272 similar events)
// Phase 1: matrix 2246 rows 1102 cols
[2024-05-24 17:16:25] [INFO ] Computed 48 invariants in 25 ms
[2024-05-24 17:16:26] [INFO ] Implicit Places using invariants in 922 ms returned [512]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 924 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1101/1396 places, 2518/3070 transitions.
Applied a total of 0 rules in 70 ms. Remains 1101 /1101 variables (removed 0) and now considering 2518/2518 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2901 ms. Remains : 1101/1396 places, 2518/3070 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-03
Product exploration explored 100000 steps with 2279 reset in 511 ms.
Product exploration explored 100000 steps with 2281 reset in 552 ms.
Computed a total of 286 stabilizing places and 902 stable transitions
Computed a total of 286 stabilizing places and 902 stable transitions
Detected a total of 286/1101 stabilizing places and 902/2518 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 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24125 steps (548 resets) in 148 ms. (161 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 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1101/1101 places, 2518/2518 transitions.
Applied a total of 0 rules in 78 ms. Remains 1101 /1101 variables (removed 0) and now considering 2518/2518 (removed 0) transitions.
[2024-05-24 17:16:28] [INFO ] Flow matrix only has 2246 transitions (discarded 272 similar events)
// Phase 1: matrix 2246 rows 1101 cols
[2024-05-24 17:16:28] [INFO ] Computed 47 invariants in 26 ms
[2024-05-24 17:16:28] [INFO ] Implicit Places using invariants in 918 ms returned []
[2024-05-24 17:16:28] [INFO ] Flow matrix only has 2246 transitions (discarded 272 similar events)
[2024-05-24 17:16:28] [INFO ] Invariant cache hit.
[2024-05-24 17:16:29] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-24 17:16:38] [INFO ] Implicit Places using invariants and state equation in 9297 ms returned [1075]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10217 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1100/1101 places, 2518/2518 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1100 transition count 2517
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1099 transition count 2517
Applied a total of 2 rules in 78 ms. Remains 1099 /1100 variables (removed 1) and now considering 2517/2518 (removed 1) transitions.
[2024-05-24 17:16:38] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
// Phase 1: matrix 2245 rows 1099 cols
[2024-05-24 17:16:38] [INFO ] Computed 46 invariants in 27 ms
[2024-05-24 17:16:39] [INFO ] Implicit Places using invariants in 935 ms returned []
[2024-05-24 17:16:39] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2024-05-24 17:16:39] [INFO ] Invariant cache hit.
[2024-05-24 17:16:39] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-24 17:16:49] [INFO ] Implicit Places using invariants and state equation in 9774 ms returned []
Implicit Place search using SMT with State Equation took 10710 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1099/1101 places, 2517/2518 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21085 ms. Remains : 1099/1101 places, 2517/2518 transitions.
Computed a total of 284 stabilizing places and 901 stable transitions
Computed a total of 284 stabilizing places and 901 stable transitions
Detected a total of 284/1099 stabilizing places and 901/2517 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 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 18685 steps (424 resets) in 166 ms. (111 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 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2279 reset in 473 ms.
Product exploration explored 100000 steps with 2281 reset in 530 ms.
Built C files in :
/tmp/ltsmin7347575378701907013
[2024-05-24 17:16:50] [INFO ] Too many transitions (2517) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:16:50] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7347575378701907013
Running compilation step : cd /tmp/ltsmin7347575378701907013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7347575378701907013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7347575378701907013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 1099 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1099/1099 places, 2517/2517 transitions.
Applied a total of 0 rules in 73 ms. Remains 1099 /1099 variables (removed 0) and now considering 2517/2517 (removed 0) transitions.
[2024-05-24 17:16:53] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2024-05-24 17:16:53] [INFO ] Invariant cache hit.
[2024-05-24 17:16:54] [INFO ] Implicit Places using invariants in 911 ms returned []
[2024-05-24 17:16:54] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2024-05-24 17:16:54] [INFO ] Invariant cache hit.
[2024-05-24 17:16:55] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-24 17:17:04] [INFO ] Implicit Places using invariants and state equation in 10098 ms returned []
Implicit Place search using SMT with State Equation took 11012 ms to find 0 implicit places.
[2024-05-24 17:17:04] [INFO ] Redundant transitions in 79 ms returned []
Running 2500 sub problems to find dead transitions.
[2024-05-24 17:17:04] [INFO ] Flow matrix only has 2245 transitions (discarded 272 similar events)
[2024-05-24 17:17:04] [INFO ] Invariant cache hit.
[2024-05-24 17:17:04] [INFO ] State equation strengthened by 838 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1097 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2500 unsolved
SMT process timed out in 32883ms, After SMT, problems are : Problem set: 0 solved, 2500 unsolved
Search for dead transitions found 0 dead transitions in 32914ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44086 ms. Remains : 1099/1099 places, 2517/2517 transitions.
Built C files in :
/tmp/ltsmin2204284894687862975
[2024-05-24 17:17:37] [INFO ] Too many transitions (2517) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:17:37] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2204284894687862975
Running compilation step : cd /tmp/ltsmin2204284894687862975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2204284894687862975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2204284894687862975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 17:17:40] [INFO ] Flatten gal took : 80 ms
[2024-05-24 17:17:41] [INFO ] Flatten gal took : 65 ms
[2024-05-24 17:17:41] [INFO ] Time to serialize gal into /tmp/LTL11358480589054743358.gal : 16 ms
[2024-05-24 17:17:41] [INFO ] Time to serialize properties into /tmp/LTL10983123443753860660.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11358480589054743358.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7062609519317787117.hoa' '-atoms' '/tmp/LTL10983123443753860660.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10983123443753860660.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7062609519317787117.hoa
Detected timeout of ITS tools.
[2024-05-24 17:17:56] [INFO ] Flatten gal took : 55 ms
[2024-05-24 17:17:56] [INFO ] Flatten gal took : 57 ms
[2024-05-24 17:17:56] [INFO ] Time to serialize gal into /tmp/LTL14147626375748144063.gal : 11 ms
[2024-05-24 17:17:56] [INFO ] Time to serialize properties into /tmp/LTL9439018748040928994.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14147626375748144063.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9439018748040928994.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(Node8HasTheLeafSetOfRx1ToReplaceNode16<=Node13WantsToManageTheCrashOfNode1)"))))
Formula 0 simplified : FG!"(Node8HasTheLeafSetOfRx1ToReplaceNode16<=Node13WantsToManageTheCrashOfNode1)"
Detected timeout of ITS tools.
[2024-05-24 17:18:11] [INFO ] Flatten gal took : 53 ms
[2024-05-24 17:18:11] [INFO ] Applying decomposition
[2024-05-24 17:18:11] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12144831594329331975.txt' '-o' '/tmp/graph12144831594329331975.bin' '-w' '/tmp/graph12144831594329331975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12144831594329331975.bin' '-l' '-1' '-v' '-w' '/tmp/graph12144831594329331975.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:18:11] [INFO ] Decomposing Gal with order
[2024-05-24 17:18:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:18:11] [INFO ] Removed a total of 398 redundant transitions.
[2024-05-24 17:18:11] [INFO ] Flatten gal took : 107 ms
[2024-05-24 17:18:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-24 17:18:12] [INFO ] Time to serialize gal into /tmp/LTL983913945629577258.gal : 11 ms
[2024-05-24 17:18:12] [INFO ] Time to serialize properties into /tmp/LTL10956810122640474346.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL983913945629577258.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10956810122640474346.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu10.Node8HasTheLeafSetOfRx1ToReplaceNode16<=gu10.Node13WantsToManageTheCrashOfNode1)"))))
Formula 0 simplified : FG!"(gu10.Node8HasTheLeafSetOfRx1ToReplaceNode16<=gu10.Node13WantsToManageTheCrashOfNode1)"
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-03 finished in 123622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p0)&&(p1 U X(X(G(p1))))))))'
Support contains 3 out of 1396 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1358 transition count 3027
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1358 transition count 3027
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 110 place count 1324 transition count 2928
Iterating global reduction 0 with 34 rules applied. Total rules applied 144 place count 1324 transition count 2928
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 165 place count 1303 transition count 2817
Iterating global reduction 0 with 21 rules applied. Total rules applied 186 place count 1303 transition count 2817
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 188 place count 1301 transition count 2805
Iterating global reduction 0 with 2 rules applied. Total rules applied 190 place count 1301 transition count 2805
Applied a total of 190 rules in 243 ms. Remains 1301 /1396 variables (removed 95) and now considering 2805/3070 (removed 265) transitions.
[2024-05-24 17:18:27] [INFO ] Flow matrix only has 2533 transitions (discarded 272 similar events)
// Phase 1: matrix 2533 rows 1301 cols
[2024-05-24 17:18:27] [INFO ] Computed 80 invariants in 26 ms
[2024-05-24 17:18:28] [INFO ] Implicit Places using invariants in 1187 ms returned [10, 183, 184, 352, 379, 389, 434, 516, 537, 559, 573, 594, 596, 605, 606, 607, 630, 640, 661, 699, 719, 720, 738, 788, 815, 849, 882, 885, 930, 976, 1085, 1158, 1159]
[2024-05-24 17:18:28] [INFO ] Actually due to overlaps returned [379, 10, 183, 184, 352, 389, 434, 516, 537, 559, 573, 594, 605, 606, 607, 630, 640, 661, 699, 719, 720, 738, 788, 815, 849, 882, 885, 930, 976, 1085, 1158, 1159]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 1190 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1269/1396 places, 2805/3070 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1241 transition count 2777
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1241 transition count 2777
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 84 place count 1213 transition count 2749
Iterating global reduction 0 with 28 rules applied. Total rules applied 112 place count 1213 transition count 2749
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 140 place count 1185 transition count 2721
Iterating global reduction 0 with 28 rules applied. Total rules applied 168 place count 1185 transition count 2721
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 190 place count 1163 transition count 2589
Iterating global reduction 0 with 22 rules applied. Total rules applied 212 place count 1163 transition count 2589
Applied a total of 212 rules in 227 ms. Remains 1163 /1269 variables (removed 106) and now considering 2589/2805 (removed 216) transitions.
[2024-05-24 17:18:28] [INFO ] Flow matrix only has 2317 transitions (discarded 272 similar events)
// Phase 1: matrix 2317 rows 1163 cols
[2024-05-24 17:18:28] [INFO ] Computed 48 invariants in 28 ms
[2024-05-24 17:18:29] [INFO ] Implicit Places using invariants in 969 ms returned [558]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 971 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1162/1396 places, 2589/3070 transitions.
Applied a total of 0 rules in 43 ms. Remains 1162 /1162 variables (removed 0) and now considering 2589/2589 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2676 ms. Remains : 1162/1396 places, 2589/3070 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-05
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-05 finished in 3060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Support contains 4 out of 1396 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1360 transition count 3034
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1360 transition count 3034
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 105 place count 1327 transition count 2936
Iterating global reduction 0 with 33 rules applied. Total rules applied 138 place count 1327 transition count 2936
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 158 place count 1307 transition count 2821
Iterating global reduction 0 with 20 rules applied. Total rules applied 178 place count 1307 transition count 2821
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 179 place count 1306 transition count 2815
Iterating global reduction 0 with 1 rules applied. Total rules applied 180 place count 1306 transition count 2815
Applied a total of 180 rules in 285 ms. Remains 1306 /1396 variables (removed 90) and now considering 2815/3070 (removed 255) transitions.
[2024-05-24 17:18:30] [INFO ] Flow matrix only has 2543 transitions (discarded 272 similar events)
// Phase 1: matrix 2543 rows 1306 cols
[2024-05-24 17:18:30] [INFO ] Computed 80 invariants in 32 ms
[2024-05-24 17:18:31] [INFO ] Implicit Places using invariants in 1158 ms returned [10, 184, 185, 353, 380, 389, 390, 431, 432, 514, 535, 557, 571, 592, 594, 603, 604, 605, 628, 638, 659, 699, 719, 720, 738, 788, 815, 849, 882, 885, 930, 976, 1085, 1158]
[2024-05-24 17:18:31] [INFO ] Actually due to overlaps returned [380, 10, 184, 185, 353, 389, 390, 431, 432, 514, 535, 557, 571, 592, 603, 604, 605, 628, 638, 659, 699, 719, 720, 738, 788, 815, 849, 882, 885, 930, 976, 1085, 1158]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 1161 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1273/1396 places, 2815/3070 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1244 transition count 2786
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1244 transition count 2786
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 87 place count 1215 transition count 2757
Iterating global reduction 0 with 29 rules applied. Total rules applied 116 place count 1215 transition count 2757
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 145 place count 1186 transition count 2728
Iterating global reduction 0 with 29 rules applied. Total rules applied 174 place count 1186 transition count 2728
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 196 place count 1164 transition count 2596
Iterating global reduction 0 with 22 rules applied. Total rules applied 218 place count 1164 transition count 2596
Applied a total of 218 rules in 228 ms. Remains 1164 /1273 variables (removed 109) and now considering 2596/2815 (removed 219) transitions.
[2024-05-24 17:18:31] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
// Phase 1: matrix 2324 rows 1164 cols
[2024-05-24 17:18:31] [INFO ] Computed 47 invariants in 18 ms
[2024-05-24 17:18:32] [INFO ] Implicit Places using invariants in 975 ms returned [548]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 977 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1163/1396 places, 2596/3070 transitions.
Applied a total of 0 rules in 44 ms. Remains 1163 /1163 variables (removed 0) and now considering 2596/2596 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2697 ms. Remains : 1163/1396 places, 2596/3070 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-06
Product exploration explored 100000 steps with 1608 reset in 449 ms.
Product exploration explored 100000 steps with 1604 reset in 480 ms.
Computed a total of 331 stabilizing places and 963 stable transitions
Computed a total of 331 stabilizing places and 963 stable transitions
Detected a total of 331/1163 stabilizing places and 963/2596 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 158 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (642 resets) in 240 ms. (165 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (172 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
[2024-05-24 17:18:34] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
// Phase 1: matrix 2324 rows 1163 cols
[2024-05-24 17:18:34] [INFO ] Computed 46 invariants in 16 ms
[2024-05-24 17:18:34] [INFO ] State equation strengthened by 853 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1053/1057 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1057 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/1091 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/1123 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/1151 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1151 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/1163 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1163 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2324/3487 variables, 1163/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3487 variables, 853/2062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3487 variables, 0/2062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/3487 variables, 0/2062 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3487/3487 variables, and 2062 constraints, problems are : Problem set: 0 solved, 1 unsolved in 846 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 1163/1163 constraints, ReadFeed: 853/853 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 1057/3487 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 2/31 constraints, Generalized P Invariants (flows): 0/15 constraints, State Equation: 0/1163 constraints, ReadFeed: 0/853 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1006ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 288 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 1163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1163/1163 places, 2596/2596 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1163 transition count 2575
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1142 transition count 2575
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 42 place count 1142 transition count 2563
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 66 place count 1130 transition count 2563
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 108 place count 1109 transition count 2542
Applied a total of 108 rules in 158 ms. Remains 1109 /1163 variables (removed 54) and now considering 2542/2596 (removed 54) transitions.
[2024-05-24 17:18:36] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1109 cols
[2024-05-24 17:18:36] [INFO ] Computed 46 invariants in 25 ms
[2024-05-24 17:18:37] [INFO ] Implicit Places using invariants in 947 ms returned []
[2024-05-24 17:18:37] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 17:18:37] [INFO ] Invariant cache hit.
[2024-05-24 17:18:37] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-24 17:18:46] [INFO ] Implicit Places using invariants and state equation in 9556 ms returned []
Implicit Place search using SMT with State Equation took 10505 ms to find 0 implicit places.
[2024-05-24 17:18:46] [INFO ] Redundant transitions in 75 ms returned []
Running 2525 sub problems to find dead transitions.
[2024-05-24 17:18:46] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 17:18:46] [INFO ] Invariant cache hit.
[2024-05-24 17:18:46] [INFO ] State equation strengthened by 853 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1107 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2525 unsolved
SMT process timed out in 32767ms, After SMT, problems are : Problem set: 0 solved, 2525 unsolved
Search for dead transitions found 0 dead transitions in 32790ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1109/1163 places, 2542/2596 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43551 ms. Remains : 1109/1163 places, 2542/2596 transitions.
Computed a total of 294 stabilizing places and 926 stable transitions
Computed a total of 294 stabilizing places and 926 stable transitions
Detected a total of 294/1109 stabilizing places and 926/2542 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 167 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (908 resets) in 482 ms. (82 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (188 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
[2024-05-24 17:19:19] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 17:19:19] [INFO ] Invariant cache hit.
[2024-05-24 17:19:19] [INFO ] State equation strengthened by 853 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1016/1020 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/1037 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1037 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/1069 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1069 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/1097 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1097 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/1109 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2270/3379 variables, 1109/1155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3379 variables, 853/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3379 variables, 0/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/3379 variables, 0/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3379/3379 variables, and 2008 constraints, problems are : Problem set: 0 solved, 1 unsolved in 904 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 1109/1109 constraints, ReadFeed: 853/853 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 1020/3379 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 2/31 constraints, Generalized P Invariants (flows): 0/15 constraints, State Equation: 0/1109 constraints, ReadFeed: 0/853 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1032ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 291 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2271 reset in 495 ms.
Product exploration explored 100000 steps with 2269 reset in 576 ms.
Built C files in :
/tmp/ltsmin5138047515789311645
[2024-05-24 17:19:22] [INFO ] Too many transitions (2542) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:19:22] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5138047515789311645
Running compilation step : cd /tmp/ltsmin5138047515789311645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5138047515789311645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5138047515789311645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 1109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1109/1109 places, 2542/2542 transitions.
Applied a total of 0 rules in 76 ms. Remains 1109 /1109 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2024-05-24 17:19:25] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 17:19:25] [INFO ] Invariant cache hit.
[2024-05-24 17:19:26] [INFO ] Implicit Places using invariants in 917 ms returned []
[2024-05-24 17:19:26] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 17:19:26] [INFO ] Invariant cache hit.
[2024-05-24 17:19:27] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-24 17:19:36] [INFO ] Implicit Places using invariants and state equation in 9834 ms returned []
Implicit Place search using SMT with State Equation took 10753 ms to find 0 implicit places.
[2024-05-24 17:19:36] [INFO ] Redundant transitions in 84 ms returned []
Running 2525 sub problems to find dead transitions.
[2024-05-24 17:19:36] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 17:19:36] [INFO ] Invariant cache hit.
[2024-05-24 17:19:36] [INFO ] State equation strengthened by 853 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 1.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 timeout
0.0)
(s377 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1107 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2525 unsolved
SMT process timed out in 32771ms, After SMT, problems are : Problem set: 0 solved, 2525 unsolved
Search for dead transitions found 0 dead transitions in 32793ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43718 ms. Remains : 1109/1109 places, 2542/2542 transitions.
Built C files in :
/tmp/ltsmin11184355287275913875
[2024-05-24 17:20:09] [INFO ] Too many transitions (2542) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:20:09] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11184355287275913875
Running compilation step : cd /tmp/ltsmin11184355287275913875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11184355287275913875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11184355287275913875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 17:20:12] [INFO ] Flatten gal took : 53 ms
[2024-05-24 17:20:12] [INFO ] Flatten gal took : 54 ms
[2024-05-24 17:20:12] [INFO ] Time to serialize gal into /tmp/LTL4868161990536847713.gal : 10 ms
[2024-05-24 17:20:12] [INFO ] Time to serialize properties into /tmp/LTL16284609441455491489.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4868161990536847713.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5109678212915974728.hoa' '-atoms' '/tmp/LTL16284609441455491489.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16284609441455491489.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5109678212915974728.hoa
Detected timeout of ITS tools.
[2024-05-24 17:20:27] [INFO ] Flatten gal took : 53 ms
[2024-05-24 17:20:27] [INFO ] Flatten gal took : 52 ms
[2024-05-24 17:20:27] [INFO ] Time to serialize gal into /tmp/LTL15793462519691286454.gal : 11 ms
[2024-05-24 17:20:27] [INFO ] Time to serialize properties into /tmp/LTL17777863144258101489.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15793462519691286454.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17777863144258101489.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(LeafSetOfRx0IsSentToNode4<=Node0ManageTheCrashOfNode10)")))||(G("(LeafSetOfLx2IsSentToNode9<=Node16HasTheLeafSetOfRx5ToRep...172
Formula 0 simplified : X(FG!"(LeafSetOfRx0IsSentToNode4<=Node0ManageTheCrashOfNode10)" & F!"(LeafSetOfLx2IsSentToNode9<=Node16HasTheLeafSetOfRx5ToReplaceNo...162
Detected timeout of ITS tools.
[2024-05-24 17:20:43] [INFO ] Flatten gal took : 52 ms
[2024-05-24 17:20:43] [INFO ] Applying decomposition
[2024-05-24 17:20:43] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph538464836640666085.txt' '-o' '/tmp/graph538464836640666085.bin' '-w' '/tmp/graph538464836640666085.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph538464836640666085.bin' '-l' '-1' '-v' '-w' '/tmp/graph538464836640666085.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:20:43] [INFO ] Decomposing Gal with order
[2024-05-24 17:20:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:20:43] [INFO ] Removed a total of 77 redundant transitions.
[2024-05-24 17:20:43] [INFO ] Flatten gal took : 87 ms
[2024-05-24 17:20:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 3 ms.
[2024-05-24 17:20:43] [INFO ] Time to serialize gal into /tmp/LTL9060446869023641197.gal : 134 ms
[2024-05-24 17:20:43] [INFO ] Time to serialize properties into /tmp/LTL12842647916472121025.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9060446869023641197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12842647916472121025.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(gu8.LeafSetOfRx0IsSentToNode4<=gu8.Node0ManageTheCrashOfNode10)")))||(G("(gu9.LeafSetOfLx2IsSentToNode9<=gu9.Node16HasTheL...188
Formula 0 simplified : X(FG!"(gu8.LeafSetOfRx0IsSentToNode4<=gu8.Node0ManageTheCrashOfNode10)" & F!"(gu9.LeafSetOfLx2IsSentToNode9<=gu9.Node16HasTheLeafSet...178
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-06 finished in 148578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 1396 transition count 3037
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 1363 transition count 3037
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 66 place count 1363 transition count 3005
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 130 place count 1331 transition count 3005
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 151 place count 1310 transition count 2979
Iterating global reduction 2 with 21 rules applied. Total rules applied 172 place count 1310 transition count 2979
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 172 place count 1310 transition count 2978
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 174 place count 1309 transition count 2978
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 191 place count 1292 transition count 2896
Iterating global reduction 2 with 17 rules applied. Total rules applied 208 place count 1292 transition count 2896
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 211 place count 1289 transition count 2878
Iterating global reduction 2 with 3 rules applied. Total rules applied 214 place count 1289 transition count 2878
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 292 place count 1250 transition count 2839
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 311 place count 1231 transition count 2820
Iterating global reduction 2 with 19 rules applied. Total rules applied 330 place count 1231 transition count 2820
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 349 place count 1212 transition count 2706
Iterating global reduction 2 with 19 rules applied. Total rules applied 368 place count 1212 transition count 2706
Applied a total of 368 rules in 466 ms. Remains 1212 /1396 variables (removed 184) and now considering 2706/3070 (removed 364) transitions.
[2024-05-24 17:20:59] [INFO ] Flow matrix only has 2434 transitions (discarded 272 similar events)
// Phase 1: matrix 2434 rows 1212 cols
[2024-05-24 17:20:59] [INFO ] Computed 80 invariants in 33 ms
[2024-05-24 17:21:00] [INFO ] Implicit Places using invariants in 1112 ms returned [9, 157, 158, 322, 356, 357, 398, 399, 473, 494, 513, 527, 545, 547, 556, 557, 558, 576, 586, 604, 640, 658, 659, 677, 723, 748, 782, 813, 816, 861, 904, 1011, 1084, 1085]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 1114 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1178/1396 places, 2706/3070 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1159 transition count 2687
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1159 transition count 2687
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 56 place count 1141 transition count 2669
Iterating global reduction 0 with 18 rules applied. Total rules applied 74 place count 1141 transition count 2669
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 84 place count 1131 transition count 2609
Iterating global reduction 0 with 10 rules applied. Total rules applied 94 place count 1131 transition count 2609
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 116 place count 1120 transition count 2598
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 127 place count 1109 transition count 2587
Iterating global reduction 0 with 11 rules applied. Total rules applied 138 place count 1109 transition count 2587
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 151 place count 1096 transition count 2509
Iterating global reduction 0 with 13 rules applied. Total rules applied 164 place count 1096 transition count 2509
Applied a total of 164 rules in 356 ms. Remains 1096 /1178 variables (removed 82) and now considering 2509/2706 (removed 197) transitions.
[2024-05-24 17:21:00] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1096 cols
[2024-05-24 17:21:00] [INFO ] Computed 46 invariants in 26 ms
[2024-05-24 17:21:01] [INFO ] Implicit Places using invariants in 931 ms returned []
[2024-05-24 17:21:01] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-24 17:21:01] [INFO ] Invariant cache hit.
[2024-05-24 17:21:02] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-24 17:21:11] [INFO ] Implicit Places using invariants and state equation in 9944 ms returned [1083]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10880 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1095/1396 places, 2509/3070 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1095 transition count 2508
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1094 transition count 2508
Applied a total of 2 rules in 84 ms. Remains 1094 /1095 variables (removed 1) and now considering 2508/2509 (removed 1) transitions.
[2024-05-24 17:21:11] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
// Phase 1: matrix 2236 rows 1094 cols
[2024-05-24 17:21:11] [INFO ] Computed 45 invariants in 26 ms
[2024-05-24 17:21:12] [INFO ] Implicit Places using invariants in 905 ms returned []
[2024-05-24 17:21:12] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-24 17:21:12] [INFO ] Invariant cache hit.
[2024-05-24 17:21:13] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-24 17:21:22] [INFO ] Implicit Places using invariants and state equation in 9908 ms returned []
Implicit Place search using SMT with State Equation took 10817 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1094/1396 places, 2508/3070 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 23720 ms. Remains : 1094/1396 places, 2508/3070 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-08
Product exploration explored 100000 steps with 2279 reset in 538 ms.
Product exploration explored 100000 steps with 2278 reset in 514 ms.
Computed a total of 279 stabilizing places and 892 stable transitions
Computed a total of 279 stabilizing places and 892 stable transitions
Detected a total of 279/1094 stabilizing places and 892/2508 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 76 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 27 ms :[(NOT p0)]
RANDOM walk for 9777 steps (220 resets) in 67 ms. (143 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 104 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 1094 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1094/1094 places, 2508/2508 transitions.
Applied a total of 0 rules in 76 ms. Remains 1094 /1094 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
[2024-05-24 17:21:23] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-24 17:21:23] [INFO ] Invariant cache hit.
[2024-05-24 17:21:24] [INFO ] Implicit Places using invariants in 894 ms returned []
[2024-05-24 17:21:24] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-24 17:21:24] [INFO ] Invariant cache hit.
[2024-05-24 17:21:25] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-24 17:21:34] [INFO ] Implicit Places using invariants and state equation in 9750 ms returned []
Implicit Place search using SMT with State Equation took 10656 ms to find 0 implicit places.
[2024-05-24 17:21:34] [INFO ] Redundant transitions in 80 ms returned []
Running 2491 sub problems to find dead transitions.
[2024-05-24 17:21:34] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-24 17:21:34] [INFO ] Invariant cache hit.
[2024-05-24 17:21:34] [INFO ] State equation strengthened by 833 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 0.0)
(s403 0.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 timeout
0.0)
(s417 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1092 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2491 unsolved
SMT process timed out in 32903ms, After SMT, problems are : Problem set: 0 solved, 2491 unsolved
Search for dead transitions found 0 dead transitions in 32924ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43752 ms. Remains : 1094/1094 places, 2508/2508 transitions.
Computed a total of 279 stabilizing places and 892 stable transitions
Computed a total of 279 stabilizing places and 892 stable transitions
Detected a total of 279/1094 stabilizing places and 892/2508 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 86 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 30 ms :[(NOT p0)]
RANDOM walk for 4890 steps (107 resets) in 43 ms. (111 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 206 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2280 reset in 553 ms.
Product exploration explored 100000 steps with 2278 reset in 562 ms.
Built C files in :
/tmp/ltsmin16677777188109232540
[2024-05-24 17:22:09] [INFO ] Too many transitions (2508) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:22:09] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16677777188109232540
Running compilation step : cd /tmp/ltsmin16677777188109232540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16677777188109232540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16677777188109232540;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 1094 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1094/1094 places, 2508/2508 transitions.
Applied a total of 0 rules in 77 ms. Remains 1094 /1094 variables (removed 0) and now considering 2508/2508 (removed 0) transitions.
[2024-05-24 17:22:12] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-24 17:22:12] [INFO ] Invariant cache hit.
[2024-05-24 17:22:13] [INFO ] Implicit Places using invariants in 944 ms returned []
[2024-05-24 17:22:13] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-24 17:22:13] [INFO ] Invariant cache hit.
[2024-05-24 17:22:13] [INFO ] State equation strengthened by 833 read => feed constraints.
[2024-05-24 17:22:22] [INFO ] Implicit Places using invariants and state equation in 9439 ms returned []
Implicit Place search using SMT with State Equation took 10385 ms to find 0 implicit places.
[2024-05-24 17:22:22] [INFO ] Redundant transitions in 72 ms returned []
Running 2491 sub problems to find dead transitions.
[2024-05-24 17:22:22] [INFO ] Flow matrix only has 2236 transitions (discarded 272 similar events)
[2024-05-24 17:22:22] [INFO ] Invariant cache hit.
[2024-05-24 17:22:22] [INFO ] State equation strengthened by 833 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1092 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2491 unsolved
SMT process timed out in 32903ms, After SMT, problems are : Problem set: 0 solved, 2491 unsolved
Search for dead transitions found 0 dead transitions in 32928ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43476 ms. Remains : 1094/1094 places, 2508/2508 transitions.
Built C files in :
/tmp/ltsmin8253612689057053746
[2024-05-24 17:22:55] [INFO ] Too many transitions (2508) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:22:55] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8253612689057053746
Running compilation step : cd /tmp/ltsmin8253612689057053746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8253612689057053746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8253612689057053746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 17:22:58] [INFO ] Flatten gal took : 51 ms
[2024-05-24 17:22:58] [INFO ] Flatten gal took : 52 ms
[2024-05-24 17:22:59] [INFO ] Time to serialize gal into /tmp/LTL9778243013719936757.gal : 16 ms
[2024-05-24 17:22:59] [INFO ] Time to serialize properties into /tmp/LTL1379435994829827190.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9778243013719936757.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1191985130229569018.hoa' '-atoms' '/tmp/LTL1379435994829827190.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1379435994829827190.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1191985130229569018.hoa
Detected timeout of ITS tools.
[2024-05-24 17:23:14] [INFO ] Flatten gal took : 53 ms
[2024-05-24 17:23:14] [INFO ] Flatten gal took : 52 ms
[2024-05-24 17:23:14] [INFO ] Time to serialize gal into /tmp/LTL7293026384353074822.gal : 10 ms
[2024-05-24 17:23:14] [INFO ] Time to serialize properties into /tmp/LTL13785898405063230136.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7293026384353074822.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13785898405063230136.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(RequestOfNode6IsSentToLx3<=NoNodeManageTheCrashOfNode2)"))))
Formula 0 simplified : GF!"(RequestOfNode6IsSentToLx3<=NoNodeManageTheCrashOfNode2)"
Detected timeout of ITS tools.
[2024-05-24 17:23:29] [INFO ] Flatten gal took : 51 ms
[2024-05-24 17:23:29] [INFO ] Applying decomposition
[2024-05-24 17:23:29] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11475882291257525326.txt' '-o' '/tmp/graph11475882291257525326.bin' '-w' '/tmp/graph11475882291257525326.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11475882291257525326.bin' '-l' '-1' '-v' '-w' '/tmp/graph11475882291257525326.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:23:29] [INFO ] Decomposing Gal with order
[2024-05-24 17:23:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:23:29] [INFO ] Removed a total of 1259 redundant transitions.
[2024-05-24 17:23:29] [INFO ] Flatten gal took : 386 ms
[2024-05-24 17:23:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 340 labels/synchronizations in 46 ms.
[2024-05-24 17:23:30] [INFO ] Time to serialize gal into /tmp/LTL6142592974597731076.gal : 11 ms
[2024-05-24 17:23:30] [INFO ] Time to serialize properties into /tmp/LTL1879313510360197247.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6142592974597731076.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1879313510360197247.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu28.RequestOfNode6IsSentToLx3<=gu28.NoNodeManageTheCrashOfNode2)"))))
Formula 0 simplified : GF!"(gu28.RequestOfNode6IsSentToLx3<=gu28.NoNodeManageTheCrashOfNode2)"
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-08 finished in 166532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 4 out of 1396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1396 transition count 3038
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1364 transition count 3038
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1364 transition count 3006
Deduced a syphon composed of 32 places in 3 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 1332 transition count 3006
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 148 place count 1312 transition count 2981
Iterating global reduction 2 with 20 rules applied. Total rules applied 168 place count 1312 transition count 2981
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 168 place count 1312 transition count 2980
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 1311 transition count 2980
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 186 place count 1295 transition count 2904
Iterating global reduction 2 with 16 rules applied. Total rules applied 202 place count 1295 transition count 2904
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 205 place count 1292 transition count 2886
Iterating global reduction 2 with 3 rules applied. Total rules applied 208 place count 1292 transition count 2886
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 286 place count 1253 transition count 2847
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 304 place count 1235 transition count 2829
Iterating global reduction 2 with 18 rules applied. Total rules applied 322 place count 1235 transition count 2829
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 340 place count 1217 transition count 2721
Iterating global reduction 2 with 18 rules applied. Total rules applied 358 place count 1217 transition count 2721
Applied a total of 358 rules in 437 ms. Remains 1217 /1396 variables (removed 179) and now considering 2721/3070 (removed 349) transitions.
[2024-05-24 17:23:45] [INFO ] Flow matrix only has 2449 transitions (discarded 272 similar events)
// Phase 1: matrix 2449 rows 1217 cols
[2024-05-24 17:23:45] [INFO ] Computed 80 invariants in 36 ms
[2024-05-24 17:23:46] [INFO ] Implicit Places using invariants in 1083 ms returned [9, 157, 158, 322, 348, 356, 357, 398, 399, 473, 494, 513, 527, 545, 547, 556, 557, 558, 576, 586, 604, 640, 658, 659, 677, 723, 748, 782, 813, 816, 861, 904, 1011]
[2024-05-24 17:23:46] [INFO ] Actually due to overlaps returned [348, 9, 157, 158, 322, 356, 357, 398, 399, 473, 494, 513, 527, 545, 556, 557, 558, 576, 586, 604, 640, 658, 659, 677, 723, 748, 782, 813, 816, 861, 904, 1011]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 1087 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1185/1396 places, 2721/3070 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1168 transition count 2704
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1168 transition count 2704
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1151 transition count 2687
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1151 transition count 2687
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 1140 transition count 2621
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 1140 transition count 2621
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 112 place count 1129 transition count 2610
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 123 place count 1118 transition count 2599
Iterating global reduction 0 with 11 rules applied. Total rules applied 134 place count 1118 transition count 2599
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 146 place count 1106 transition count 2527
Iterating global reduction 0 with 12 rules applied. Total rules applied 158 place count 1106 transition count 2527
Applied a total of 158 rules in 387 ms. Remains 1106 /1185 variables (removed 79) and now considering 2527/2721 (removed 194) transitions.
[2024-05-24 17:23:47] [INFO ] Flow matrix only has 2255 transitions (discarded 272 similar events)
// Phase 1: matrix 2255 rows 1106 cols
[2024-05-24 17:23:47] [INFO ] Computed 48 invariants in 22 ms
[2024-05-24 17:23:48] [INFO ] Implicit Places using invariants in 935 ms returned [512]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 937 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1105/1396 places, 2527/3070 transitions.
Applied a total of 0 rules in 71 ms. Remains 1105 /1105 variables (removed 0) and now considering 2527/2527 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2921 ms. Remains : 1105/1396 places, 2527/3070 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-09
Product exploration explored 100000 steps with 2274 reset in 492 ms.
Product exploration explored 100000 steps with 2278 reset in 509 ms.
Computed a total of 290 stabilizing places and 911 stable transitions
Computed a total of 290 stabilizing places and 911 stable transitions
Detected a total of 290/1105 stabilizing places and 911/2527 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 101 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 75 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (907 resets) in 324 ms. (123 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (188 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (188 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
[2024-05-24 17:23:49] [INFO ] Flow matrix only has 2255 transitions (discarded 272 similar events)
// Phase 1: matrix 2255 rows 1105 cols
[2024-05-24 17:23:49] [INFO ] Computed 47 invariants in 21 ms
[2024-05-24 17:23:49] [INFO ] State equation strengthened by 843 read => feed constraints.
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) 1028/1032 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1032 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/1065 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1065 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 28/1093 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1093 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/1105 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1105 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2255/3360 variables, 1105/1152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3360 variables, 843/1995 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3360 variables, 0/1995 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3360 variables, 0/1995 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3360/3360 variables, and 1995 constraints, problems are : Problem set: 0 solved, 2 unsolved in 997 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 1105/1105 constraints, ReadFeed: 843/843 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 1028/1032 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 17:23:51] [INFO ] Deduced a trap composed of 151 places in 417 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1032 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1032 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 33/1065 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-24 17:23:51] [INFO ] Deduced a trap composed of 47 places in 427 ms of which 7 ms to minimize.
[2024-05-24 17:23:52] [INFO ] Deduced a trap composed of 93 places in 456 ms of which 7 ms to minimize.
[2024-05-24 17:23:52] [INFO ] Deduced a trap composed of 99 places in 441 ms of which 6 ms to minimize.
[2024-05-24 17:23:53] [INFO ] Deduced a trap composed of 84 places in 440 ms of which 7 ms to minimize.
[2024-05-24 17:23:53] [INFO ] Deduced a trap composed of 97 places in 438 ms of which 7 ms to minimize.
[2024-05-24 17:23:54] [INFO ] Deduced a trap composed of 105 places in 446 ms of which 7 ms to minimize.
[2024-05-24 17:23:54] [INFO ] Deduced a trap composed of 164 places in 446 ms of which 6 ms to minimize.
[2024-05-24 17:23:54] [INFO ] Deduced a trap composed of 81 places in 440 ms of which 6 ms to minimize.
[2024-05-24 17:23:55] [INFO ] Deduced a trap composed of 100 places in 444 ms of which 7 ms to minimize.
[2024-05-24 17:23:55] [INFO ] Deduced a trap composed of 104 places in 421 ms of which 7 ms to minimize.
SMT process timed out in 6222ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1105/1105 places, 2527/2527 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 1105 transition count 2526
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1104 transition count 2526
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 1102 transition count 2524
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1102 transition count 2524
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 1100 transition count 2512
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 1100 transition count 2512
Free-agglomeration rule (complex) applied 132 times.
Iterating global reduction 2 with 132 rules applied. Total rules applied 142 place count 1100 transition count 3725
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 274 place count 968 transition count 3725
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 276 place count 968 transition count 3725
Applied a total of 276 rules in 401 ms. Remains 968 /1105 variables (removed 137) and now considering 3725/2527 (removed -1198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 968/1105 places, 3725/2527 transitions.
RANDOM walk for 40000 steps (1130 resets) in 751 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (140 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 72206 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 1
Probabilistic random walk after 72206 steps, saw 30146 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-24 17:23:59] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
// Phase 1: matrix 3327 rows 968 cols
[2024-05-24 17:23:59] [INFO ] Computed 47 invariants in 24 ms
[2024-05-24 17:23:59] [INFO ] State equation strengthened by 2178 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 876/878 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/878 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/896 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/928 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/928 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/956 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/956 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/968 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/968 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3327/4295 variables, 968/1015 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4295 variables, 2178/3193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4295 variables, 0/3193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4295 variables, 0/3193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4295/4295 variables, and 3193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1277 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 968/968 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 876/878 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/878 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/896 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:24:01] [INFO ] Deduced a trap composed of 185 places in 492 ms of which 5 ms to minimize.
[2024-05-24 17:24:02] [INFO ] Deduced a trap composed of 158 places in 482 ms of which 5 ms to minimize.
[2024-05-24 17:24:02] [INFO ] Deduced a trap composed of 150 places in 491 ms of which 5 ms to minimize.
[2024-05-24 17:24:03] [INFO ] Deduced a trap composed of 151 places in 477 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 32/928 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:24:03] [INFO ] Deduced a trap composed of 5 places in 499 ms of which 5 ms to minimize.
[2024-05-24 17:24:04] [INFO ] Deduced a trap composed of 80 places in 500 ms of which 6 ms to minimize.
[2024-05-24 17:24:04] [INFO ] Deduced a trap composed of 46 places in 619 ms of which 6 ms to minimize.
[2024-05-24 17:24:05] [INFO ] Deduced a trap composed of 46 places in 589 ms of which 6 ms to minimize.
[2024-05-24 17:24:06] [INFO ] Deduced a trap composed of 72 places in 619 ms of which 6 ms to minimize.
[2024-05-24 17:24:06] [INFO ] Deduced a trap composed of 68 places in 616 ms of which 6 ms to minimize.
[2024-05-24 17:24:07] [INFO ] Deduced a trap composed of 69 places in 580 ms of which 7 ms to minimize.
[2024-05-24 17:24:07] [INFO ] Deduced a trap composed of 85 places in 602 ms of which 5 ms to minimize.
[2024-05-24 17:24:08] [INFO ] Deduced a trap composed of 71 places in 592 ms of which 6 ms to minimize.
[2024-05-24 17:24:09] [INFO ] Deduced a trap composed of 82 places in 611 ms of which 6 ms to minimize.
[2024-05-24 17:24:09] [INFO ] Deduced a trap composed of 75 places in 590 ms of which 7 ms to minimize.
[2024-05-24 17:24:10] [INFO ] Deduced a trap composed of 57 places in 591 ms of which 6 ms to minimize.
[2024-05-24 17:24:10] [INFO ] Deduced a trap composed of 46 places in 592 ms of which 6 ms to minimize.
[2024-05-24 17:24:11] [INFO ] Deduced a trap composed of 72 places in 546 ms of which 6 ms to minimize.
[2024-05-24 17:24:12] [INFO ] Deduced a trap composed of 73 places in 586 ms of which 6 ms to minimize.
[2024-05-24 17:24:12] [INFO ] Deduced a trap composed of 88 places in 585 ms of which 5 ms to minimize.
[2024-05-24 17:24:13] [INFO ] Deduced a trap composed of 88 places in 570 ms of which 5 ms to minimize.
[2024-05-24 17:24:13] [INFO ] Deduced a trap composed of 145 places in 498 ms of which 5 ms to minimize.
[2024-05-24 17:24:14] [INFO ] Deduced a trap composed of 85 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:24:14] [INFO ] Deduced a trap composed of 70 places in 492 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/928 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:24:15] [INFO ] Deduced a trap composed of 70 places in 506 ms of which 6 ms to minimize.
[2024-05-24 17:24:15] [INFO ] Deduced a trap composed of 87 places in 508 ms of which 6 ms to minimize.
[2024-05-24 17:24:16] [INFO ] Deduced a trap composed of 79 places in 504 ms of which 6 ms to minimize.
[2024-05-24 17:24:16] [INFO ] Deduced a trap composed of 65 places in 505 ms of which 5 ms to minimize.
[2024-05-24 17:24:17] [INFO ] Deduced a trap composed of 67 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:24:18] [INFO ] Deduced a trap composed of 66 places in 504 ms of which 5 ms to minimize.
[2024-05-24 17:24:18] [INFO ] Deduced a trap composed of 65 places in 502 ms of which 6 ms to minimize.
[2024-05-24 17:24:19] [INFO ] Deduced a trap composed of 62 places in 506 ms of which 5 ms to minimize.
[2024-05-24 17:24:19] [INFO ] Deduced a trap composed of 104 places in 496 ms of which 6 ms to minimize.
[2024-05-24 17:24:20] [INFO ] Deduced a trap composed of 63 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:24:20] [INFO ] Deduced a trap composed of 95 places in 499 ms of which 5 ms to minimize.
[2024-05-24 17:24:21] [INFO ] Deduced a trap composed of 106 places in 496 ms of which 5 ms to minimize.
[2024-05-24 17:24:21] [INFO ] Deduced a trap composed of 108 places in 495 ms of which 5 ms to minimize.
[2024-05-24 17:24:22] [INFO ] Deduced a trap composed of 137 places in 500 ms of which 5 ms to minimize.
[2024-05-24 17:24:22] [INFO ] Deduced a trap composed of 148 places in 492 ms of which 5 ms to minimize.
[2024-05-24 17:24:23] [INFO ] Deduced a trap composed of 83 places in 493 ms of which 6 ms to minimize.
[2024-05-24 17:24:23] [INFO ] Deduced a trap composed of 88 places in 485 ms of which 5 ms to minimize.
[2024-05-24 17:24:24] [INFO ] Deduced a trap composed of 181 places in 487 ms of which 5 ms to minimize.
[2024-05-24 17:24:24] [INFO ] Deduced a trap composed of 130 places in 516 ms of which 6 ms to minimize.
[2024-05-24 17:24:25] [INFO ] Deduced a trap composed of 141 places in 590 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/928 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:24:25] [INFO ] Deduced a trap composed of 96 places in 590 ms of which 5 ms to minimize.
[2024-05-24 17:24:26] [INFO ] Deduced a trap composed of 129 places in 544 ms of which 5 ms to minimize.
[2024-05-24 17:24:27] [INFO ] Deduced a trap composed of 72 places in 611 ms of which 5 ms to minimize.
[2024-05-24 17:24:27] [INFO ] Deduced a trap composed of 90 places in 514 ms of which 6 ms to minimize.
[2024-05-24 17:24:28] [INFO ] Deduced a trap composed of 108 places in 607 ms of which 5 ms to minimize.
[2024-05-24 17:24:28] [INFO ] Deduced a trap composed of 68 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:24:29] [INFO ] Deduced a trap composed of 80 places in 498 ms of which 6 ms to minimize.
[2024-05-24 17:24:29] [INFO ] Deduced a trap composed of 73 places in 501 ms of which 5 ms to minimize.
[2024-05-24 17:24:30] [INFO ] Deduced a trap composed of 65 places in 485 ms of which 6 ms to minimize.
[2024-05-24 17:24:30] [INFO ] Deduced a trap composed of 65 places in 498 ms of which 5 ms to minimize.
[2024-05-24 17:24:31] [INFO ] Deduced a trap composed of 191 places in 434 ms of which 5 ms to minimize.
[2024-05-24 17:24:31] [INFO ] Deduced a trap composed of 106 places in 480 ms of which 5 ms to minimize.
[2024-05-24 17:24:32] [INFO ] Deduced a trap composed of 94 places in 483 ms of which 6 ms to minimize.
[2024-05-24 17:24:32] [INFO ] Deduced a trap composed of 108 places in 481 ms of which 5 ms to minimize.
[2024-05-24 17:24:33] [INFO ] Deduced a trap composed of 101 places in 494 ms of which 5 ms to minimize.
[2024-05-24 17:24:33] [INFO ] Deduced a trap composed of 80 places in 492 ms of which 5 ms to minimize.
[2024-05-24 17:24:34] [INFO ] Deduced a trap composed of 76 places in 492 ms of which 6 ms to minimize.
[2024-05-24 17:24:34] [INFO ] Deduced a trap composed of 87 places in 493 ms of which 5 ms to minimize.
[2024-05-24 17:24:35] [INFO ] Deduced a trap composed of 125 places in 438 ms of which 5 ms to minimize.
[2024-05-24 17:24:35] [INFO ] Deduced a trap composed of 94 places in 486 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/928 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:24:36] [INFO ] Deduced a trap composed of 108 places in 493 ms of which 5 ms to minimize.
[2024-05-24 17:24:36] [INFO ] Deduced a trap composed of 101 places in 500 ms of which 6 ms to minimize.
[2024-05-24 17:24:37] [INFO ] Deduced a trap composed of 88 places in 483 ms of which 5 ms to minimize.
[2024-05-24 17:24:37] [INFO ] Deduced a trap composed of 75 places in 490 ms of which 5 ms to minimize.
[2024-05-24 17:24:38] [INFO ] Deduced a trap composed of 74 places in 500 ms of which 5 ms to minimize.
[2024-05-24 17:24:38] [INFO ] Deduced a trap composed of 69 places in 500 ms of which 5 ms to minimize.
[2024-05-24 17:24:39] [INFO ] Deduced a trap composed of 68 places in 517 ms of which 6 ms to minimize.
[2024-05-24 17:24:40] [INFO ] Deduced a trap composed of 89 places in 506 ms of which 5 ms to minimize.
[2024-05-24 17:24:40] [INFO ] Deduced a trap composed of 305 places in 428 ms of which 5 ms to minimize.
[2024-05-24 17:24:40] [INFO ] Deduced a trap composed of 304 places in 426 ms of which 6 ms to minimize.
[2024-05-24 17:24:41] [INFO ] Deduced a trap composed of 166 places in 432 ms of which 5 ms to minimize.
[2024-05-24 17:24:41] [INFO ] Deduced a trap composed of 83 places in 479 ms of which 5 ms to minimize.
[2024-05-24 17:24:42] [INFO ] Deduced a trap composed of 74 places in 490 ms of which 6 ms to minimize.
[2024-05-24 17:24:42] [INFO ] Deduced a trap composed of 265 places in 412 ms of which 5 ms to minimize.
[2024-05-24 17:24:43] [INFO ] Deduced a trap composed of 267 places in 427 ms of which 5 ms to minimize.
[2024-05-24 17:24:43] [INFO ] Deduced a trap composed of 71 places in 493 ms of which 5 ms to minimize.
[2024-05-24 17:24:44] [INFO ] Deduced a trap composed of 76 places in 515 ms of which 5 ms to minimize.
[2024-05-24 17:24:44] [INFO ] Deduced a trap composed of 329 places in 428 ms of which 6 ms to minimize.
[2024-05-24 17:24:45] [INFO ] Deduced a trap composed of 174 places in 424 ms of which 5 ms to minimize.
[2024-05-24 17:24:45] [INFO ] Deduced a trap composed of 73 places in 503 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/928 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:24:46] [INFO ] Deduced a trap composed of 161 places in 449 ms of which 5 ms to minimize.
SMT process timed out in 46604ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 968 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 3725/3725 transitions.
Applied a total of 0 rules in 103 ms. Remains 968 /968 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 968/968 places, 3725/3725 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 3725/3725 transitions.
Applied a total of 0 rules in 92 ms. Remains 968 /968 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
[2024-05-24 17:24:46] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
[2024-05-24 17:24:46] [INFO ] Invariant cache hit.
[2024-05-24 17:24:47] [INFO ] Implicit Places using invariants in 1215 ms returned [877, 878]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1219 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 966/968 places, 3725/3725 transitions.
Applied a total of 0 rules in 93 ms. Remains 966 /966 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1404 ms. Remains : 966/968 places, 3725/3725 transitions.
RANDOM walk for 40000 steps (1131 resets) in 620 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (140 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 72245 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 1
Probabilistic random walk after 72245 steps, saw 30166 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-24 17:24:50] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
// Phase 1: matrix 3327 rows 966 cols
[2024-05-24 17:24:50] [INFO ] Computed 45 invariants in 27 ms
[2024-05-24 17:24:50] [INFO ] State equation strengthened by 2178 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 876/878 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/878 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/896 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/926 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/926 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/954 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/954 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/966 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3327/4293 variables, 966/1011 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4293 variables, 2178/3189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4293 variables, 0/3189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4293 variables, 0/3189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4293/4293 variables, and 3189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1207 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 966/966 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 876/878 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/878 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/896 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:24:52] [INFO ] Deduced a trap composed of 135 places in 491 ms of which 5 ms to minimize.
[2024-05-24 17:24:53] [INFO ] Deduced a trap composed of 173 places in 480 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/896 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/926 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:24:53] [INFO ] Deduced a trap composed of 5 places in 451 ms of which 5 ms to minimize.
[2024-05-24 17:24:54] [INFO ] Deduced a trap composed of 27 places in 446 ms of which 6 ms to minimize.
[2024-05-24 17:24:54] [INFO ] Deduced a trap composed of 46 places in 445 ms of which 5 ms to minimize.
[2024-05-24 17:24:55] [INFO ] Deduced a trap composed of 62 places in 441 ms of which 6 ms to minimize.
[2024-05-24 17:24:55] [INFO ] Deduced a trap composed of 75 places in 461 ms of which 5 ms to minimize.
[2024-05-24 17:24:56] [INFO ] Deduced a trap composed of 85 places in 440 ms of which 5 ms to minimize.
[2024-05-24 17:24:56] [INFO ] Deduced a trap composed of 85 places in 462 ms of which 6 ms to minimize.
[2024-05-24 17:24:57] [INFO ] Deduced a trap composed of 75 places in 461 ms of which 6 ms to minimize.
[2024-05-24 17:24:57] [INFO ] Deduced a trap composed of 117 places in 544 ms of which 6 ms to minimize.
[2024-05-24 17:24:58] [INFO ] Deduced a trap composed of 127 places in 501 ms of which 5 ms to minimize.
[2024-05-24 17:24:58] [INFO ] Deduced a trap composed of 137 places in 508 ms of which 5 ms to minimize.
[2024-05-24 17:24:59] [INFO ] Deduced a trap composed of 171 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:24:59] [INFO ] Deduced a trap composed of 251 places in 522 ms of which 6 ms to minimize.
[2024-05-24 17:25:00] [INFO ] Deduced a trap composed of 252 places in 506 ms of which 5 ms to minimize.
[2024-05-24 17:25:00] [INFO ] Deduced a trap composed of 267 places in 510 ms of which 6 ms to minimize.
[2024-05-24 17:25:01] [INFO ] Deduced a trap composed of 269 places in 507 ms of which 6 ms to minimize.
[2024-05-24 17:25:01] [INFO ] Deduced a trap composed of 267 places in 495 ms of which 6 ms to minimize.
[2024-05-24 17:25:02] [INFO ] Deduced a trap composed of 269 places in 472 ms of which 6 ms to minimize.
[2024-05-24 17:25:02] [INFO ] Deduced a trap composed of 136 places in 436 ms of which 6 ms to minimize.
[2024-05-24 17:25:03] [INFO ] Deduced a trap composed of 283 places in 440 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/926 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:25:03] [INFO ] Deduced a trap composed of 285 places in 437 ms of which 5 ms to minimize.
[2024-05-24 17:25:04] [INFO ] Deduced a trap composed of 136 places in 428 ms of which 6 ms to minimize.
[2024-05-24 17:25:04] [INFO ] Deduced a trap composed of 136 places in 442 ms of which 6 ms to minimize.
[2024-05-24 17:25:05] [INFO ] Deduced a trap composed of 282 places in 432 ms of which 6 ms to minimize.
[2024-05-24 17:25:05] [INFO ] Deduced a trap composed of 285 places in 430 ms of which 5 ms to minimize.
[2024-05-24 17:25:06] [INFO ] Deduced a trap composed of 283 places in 508 ms of which 6 ms to minimize.
[2024-05-24 17:25:06] [INFO ] Deduced a trap composed of 284 places in 436 ms of which 6 ms to minimize.
[2024-05-24 17:25:06] [INFO ] Deduced a trap composed of 172 places in 426 ms of which 5 ms to minimize.
[2024-05-24 17:25:07] [INFO ] Deduced a trap composed of 264 places in 436 ms of which 6 ms to minimize.
[2024-05-24 17:25:07] [INFO ] Deduced a trap composed of 263 places in 438 ms of which 6 ms to minimize.
[2024-05-24 17:25:08] [INFO ] Deduced a trap composed of 283 places in 442 ms of which 5 ms to minimize.
[2024-05-24 17:25:08] [INFO ] Deduced a trap composed of 265 places in 444 ms of which 5 ms to minimize.
[2024-05-24 17:25:09] [INFO ] Deduced a trap composed of 136 places in 455 ms of which 5 ms to minimize.
[2024-05-24 17:25:09] [INFO ] Deduced a trap composed of 310 places in 433 ms of which 6 ms to minimize.
[2024-05-24 17:25:10] [INFO ] Deduced a trap composed of 150 places in 443 ms of which 5 ms to minimize.
[2024-05-24 17:25:10] [INFO ] Deduced a trap composed of 143 places in 433 ms of which 5 ms to minimize.
[2024-05-24 17:25:11] [INFO ] Deduced a trap composed of 186 places in 438 ms of which 5 ms to minimize.
[2024-05-24 17:25:11] [INFO ] Deduced a trap composed of 319 places in 428 ms of which 5 ms to minimize.
[2024-05-24 17:25:12] [INFO ] Deduced a trap composed of 161 places in 435 ms of which 6 ms to minimize.
[2024-05-24 17:25:12] [INFO ] Deduced a trap composed of 279 places in 440 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/926 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:25:12] [INFO ] Deduced a trap composed of 286 places in 433 ms of which 5 ms to minimize.
[2024-05-24 17:25:13] [INFO ] Deduced a trap composed of 347 places in 438 ms of which 5 ms to minimize.
[2024-05-24 17:25:13] [INFO ] Deduced a trap composed of 75 places in 509 ms of which 5 ms to minimize.
[2024-05-24 17:25:14] [INFO ] Deduced a trap composed of 74 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:25:14] [INFO ] Deduced a trap composed of 64 places in 499 ms of which 6 ms to minimize.
[2024-05-24 17:25:15] [INFO ] Deduced a trap composed of 46 places in 508 ms of which 5 ms to minimize.
[2024-05-24 17:25:15] [INFO ] Deduced a trap composed of 75 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:25:16] [INFO ] Deduced a trap composed of 71 places in 509 ms of which 5 ms to minimize.
[2024-05-24 17:25:17] [INFO ] Deduced a trap composed of 70 places in 513 ms of which 5 ms to minimize.
[2024-05-24 17:25:17] [INFO ] Deduced a trap composed of 75 places in 509 ms of which 5 ms to minimize.
[2024-05-24 17:25:18] [INFO ] Deduced a trap composed of 77 places in 497 ms of which 6 ms to minimize.
[2024-05-24 17:25:18] [INFO ] Deduced a trap composed of 82 places in 506 ms of which 6 ms to minimize.
[2024-05-24 17:25:19] [INFO ] Deduced a trap composed of 66 places in 504 ms of which 6 ms to minimize.
[2024-05-24 17:25:19] [INFO ] Deduced a trap composed of 64 places in 504 ms of which 6 ms to minimize.
[2024-05-24 17:25:20] [INFO ] Deduced a trap composed of 97 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:25:20] [INFO ] Deduced a trap composed of 66 places in 486 ms of which 5 ms to minimize.
[2024-05-24 17:25:21] [INFO ] Deduced a trap composed of 71 places in 498 ms of which 6 ms to minimize.
[2024-05-24 17:25:21] [INFO ] Deduced a trap composed of 110 places in 505 ms of which 5 ms to minimize.
[2024-05-24 17:25:22] [INFO ] Deduced a trap composed of 87 places in 507 ms of which 6 ms to minimize.
[2024-05-24 17:25:22] [INFO ] Deduced a trap composed of 84 places in 506 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/926 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:25:23] [INFO ] Deduced a trap composed of 65 places in 511 ms of which 5 ms to minimize.
[2024-05-24 17:25:23] [INFO ] Deduced a trap composed of 90 places in 498 ms of which 6 ms to minimize.
[2024-05-24 17:25:24] [INFO ] Deduced a trap composed of 27 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:25:24] [INFO ] Deduced a trap composed of 66 places in 493 ms of which 6 ms to minimize.
[2024-05-24 17:25:25] [INFO ] Deduced a trap composed of 79 places in 500 ms of which 5 ms to minimize.
[2024-05-24 17:25:25] [INFO ] Deduced a trap composed of 87 places in 499 ms of which 5 ms to minimize.
[2024-05-24 17:25:26] [INFO ] Deduced a trap composed of 83 places in 504 ms of which 6 ms to minimize.
[2024-05-24 17:25:26] [INFO ] Deduced a trap composed of 57 places in 509 ms of which 5 ms to minimize.
[2024-05-24 17:25:27] [INFO ] Deduced a trap composed of 77 places in 523 ms of which 5 ms to minimize.
[2024-05-24 17:25:28] [INFO ] Deduced a trap composed of 84 places in 501 ms of which 5 ms to minimize.
[2024-05-24 17:25:28] [INFO ] Deduced a trap composed of 65 places in 489 ms of which 5 ms to minimize.
[2024-05-24 17:25:29] [INFO ] Deduced a trap composed of 63 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:25:29] [INFO ] Deduced a trap composed of 117 places in 506 ms of which 6 ms to minimize.
[2024-05-24 17:25:30] [INFO ] Deduced a trap composed of 170 places in 516 ms of which 5 ms to minimize.
[2024-05-24 17:25:30] [INFO ] Deduced a trap composed of 80 places in 502 ms of which 6 ms to minimize.
[2024-05-24 17:25:31] [INFO ] Deduced a trap composed of 110 places in 497 ms of which 5 ms to minimize.
[2024-05-24 17:25:31] [INFO ] Deduced a trap composed of 106 places in 498 ms of which 5 ms to minimize.
[2024-05-24 17:25:32] [INFO ] Deduced a trap composed of 67 places in 497 ms of which 6 ms to minimize.
[2024-05-24 17:25:32] [INFO ] Deduced a trap composed of 81 places in 517 ms of which 6 ms to minimize.
[2024-05-24 17:25:33] [INFO ] Deduced a trap composed of 66 places in 504 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/926 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:25:33] [INFO ] Deduced a trap composed of 84 places in 496 ms of which 5 ms to minimize.
[2024-05-24 17:25:34] [INFO ] Deduced a trap composed of 63 places in 525 ms of which 5 ms to minimize.
[2024-05-24 17:25:34] [INFO ] Deduced a trap composed of 135 places in 500 ms of which 5 ms to minimize.
[2024-05-24 17:25:35] [INFO ] Deduced a trap composed of 82 places in 518 ms of which 5 ms to minimize.
[2024-05-24 17:25:35] [INFO ] Deduced a trap composed of 62 places in 503 ms of which 5 ms to minimize.
[2024-05-24 17:25:36] [INFO ] Deduced a trap composed of 63 places in 518 ms of which 5 ms to minimize.
[2024-05-24 17:25:36] [INFO ] Deduced a trap composed of 69 places in 502 ms of which 6 ms to minimize.
[2024-05-24 17:25:37] [INFO ] Deduced a trap composed of 63 places in 517 ms of which 5 ms to minimize.
[2024-05-24 17:25:37] [INFO ] Deduced a trap composed of 75 places in 486 ms of which 5 ms to minimize.
[2024-05-24 17:25:38] [INFO ] Deduced a trap composed of 76 places in 509 ms of which 6 ms to minimize.
[2024-05-24 17:25:39] [INFO ] Deduced a trap composed of 80 places in 508 ms of which 6 ms to minimize.
[2024-05-24 17:25:39] [INFO ] Deduced a trap composed of 219 places in 441 ms of which 5 ms to minimize.
[2024-05-24 17:25:40] [INFO ] Deduced a trap composed of 74 places in 506 ms of which 6 ms to minimize.
[2024-05-24 17:25:40] [INFO ] Deduced a trap composed of 71 places in 522 ms of which 6 ms to minimize.
[2024-05-24 17:25:41] [INFO ] Deduced a trap composed of 66 places in 522 ms of which 5 ms to minimize.
[2024-05-24 17:25:41] [INFO ] Deduced a trap composed of 224 places in 512 ms of which 5 ms to minimize.
[2024-05-24 17:25:42] [INFO ] Deduced a trap composed of 89 places in 525 ms of which 5 ms to minimize.
[2024-05-24 17:25:42] [INFO ] Deduced a trap composed of 88 places in 498 ms of which 5 ms to minimize.
[2024-05-24 17:25:43] [INFO ] Deduced a trap composed of 117 places in 494 ms of which 5 ms to minimize.
[2024-05-24 17:25:43] [INFO ] Deduced a trap composed of 65 places in 508 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/926 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:25:44] [INFO ] Deduced a trap composed of 90 places in 516 ms of which 5 ms to minimize.
[2024-05-24 17:25:44] [INFO ] Deduced a trap composed of 68 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:25:45] [INFO ] Deduced a trap composed of 67 places in 513 ms of which 5 ms to minimize.
[2024-05-24 17:25:45] [INFO ] Deduced a trap composed of 67 places in 509 ms of which 5 ms to minimize.
[2024-05-24 17:25:46] [INFO ] Deduced a trap composed of 75 places in 503 ms of which 6 ms to minimize.
[2024-05-24 17:25:46] [INFO ] Deduced a trap composed of 85 places in 526 ms of which 5 ms to minimize.
[2024-05-24 17:25:47] [INFO ] Deduced a trap composed of 106 places in 527 ms of which 5 ms to minimize.
[2024-05-24 17:25:48] [INFO ] Deduced a trap composed of 64 places in 518 ms of which 6 ms to minimize.
[2024-05-24 17:25:48] [INFO ] Deduced a trap composed of 92 places in 510 ms of which 5 ms to minimize.
[2024-05-24 17:25:49] [INFO ] Deduced a trap composed of 69 places in 537 ms of which 5 ms to minimize.
[2024-05-24 17:25:49] [INFO ] Deduced a trap composed of 66 places in 516 ms of which 5 ms to minimize.
[2024-05-24 17:25:50] [INFO ] Deduced a trap composed of 70 places in 522 ms of which 5 ms to minimize.
[2024-05-24 17:25:50] [INFO ] Deduced a trap composed of 81 places in 518 ms of which 6 ms to minimize.
[2024-05-24 17:25:51] [INFO ] Deduced a trap composed of 68 places in 511 ms of which 5 ms to minimize.
[2024-05-24 17:25:51] [INFO ] Deduced a trap composed of 70 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:25:52] [INFO ] Deduced a trap composed of 82 places in 530 ms of which 5 ms to minimize.
[2024-05-24 17:25:52] [INFO ] Deduced a trap composed of 72 places in 536 ms of which 5 ms to minimize.
[2024-05-24 17:25:53] [INFO ] Deduced a trap composed of 70 places in 530 ms of which 5 ms to minimize.
[2024-05-24 17:25:54] [INFO ] Deduced a trap composed of 70 places in 547 ms of which 6 ms to minimize.
[2024-05-24 17:25:54] [INFO ] Deduced a trap composed of 78 places in 528 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/926 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:25:55] [INFO ] Deduced a trap composed of 67 places in 545 ms of which 6 ms to minimize.
[2024-05-24 17:25:55] [INFO ] Deduced a trap composed of 68 places in 533 ms of which 5 ms to minimize.
[2024-05-24 17:25:56] [INFO ] Deduced a trap composed of 72 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:25:56] [INFO ] Deduced a trap composed of 74 places in 534 ms of which 5 ms to minimize.
[2024-05-24 17:25:57] [INFO ] Deduced a trap composed of 73 places in 539 ms of which 5 ms to minimize.
[2024-05-24 17:25:57] [INFO ] Deduced a trap composed of 66 places in 522 ms of which 5 ms to minimize.
[2024-05-24 17:25:58] [INFO ] Deduced a trap composed of 73 places in 525 ms of which 6 ms to minimize.
[2024-05-24 17:25:58] [INFO ] Deduced a trap composed of 72 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:25:59] [INFO ] Deduced a trap composed of 132 places in 524 ms of which 6 ms to minimize.
[2024-05-24 17:26:00] [INFO ] Deduced a trap composed of 72 places in 516 ms of which 6 ms to minimize.
[2024-05-24 17:26:00] [INFO ] Deduced a trap composed of 55 places in 525 ms of which 6 ms to minimize.
[2024-05-24 17:26:01] [INFO ] Deduced a trap composed of 115 places in 514 ms of which 5 ms to minimize.
[2024-05-24 17:26:01] [INFO ] Deduced a trap composed of 71 places in 527 ms of which 5 ms to minimize.
[2024-05-24 17:26:02] [INFO ] Deduced a trap composed of 71 places in 497 ms of which 5 ms to minimize.
[2024-05-24 17:26:02] [INFO ] Deduced a trap composed of 73 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:26:03] [INFO ] Deduced a trap composed of 69 places in 501 ms of which 5 ms to minimize.
[2024-05-24 17:26:03] [INFO ] Deduced a trap composed of 68 places in 479 ms of which 5 ms to minimize.
[2024-05-24 17:26:04] [INFO ] Deduced a trap composed of 78 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:26:04] [INFO ] Deduced a trap composed of 90 places in 515 ms of which 5 ms to minimize.
[2024-05-24 17:26:05] [INFO ] Deduced a trap composed of 67 places in 507 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/926 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:26:05] [INFO ] Deduced a trap composed of 86 places in 494 ms of which 5 ms to minimize.
[2024-05-24 17:26:06] [INFO ] Deduced a trap composed of 68 places in 504 ms of which 6 ms to minimize.
[2024-05-24 17:26:06] [INFO ] Deduced a trap composed of 65 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:26:07] [INFO ] Deduced a trap composed of 80 places in 513 ms of which 5 ms to minimize.
SMT process timed out in 76508ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 3725/3725 transitions.
Applied a total of 0 rules in 99 ms. Remains 966 /966 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 966/966 places, 3725/3725 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 3725/3725 transitions.
Applied a total of 0 rules in 96 ms. Remains 966 /966 variables (removed 0) and now considering 3725/3725 (removed 0) transitions.
[2024-05-24 17:26:07] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
[2024-05-24 17:26:07] [INFO ] Invariant cache hit.
[2024-05-24 17:26:08] [INFO ] Implicit Places using invariants in 1127 ms returned []
[2024-05-24 17:26:08] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
[2024-05-24 17:26:08] [INFO ] Invariant cache hit.
[2024-05-24 17:26:09] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:26:39] [INFO ] Performed 815/966 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 17:26:44] [INFO ] Implicit Places using invariants and state equation in 35486 ms returned []
Implicit Place search using SMT with State Equation took 36615 ms to find 0 implicit places.
[2024-05-24 17:26:44] [INFO ] Redundant transitions in 156 ms returned []
Running 3663 sub problems to find dead transitions.
[2024-05-24 17:26:44] [INFO ] Flow matrix only has 3327 transitions (discarded 398 similar events)
[2024-05-24 17:26:44] [INFO ] Invariant cache hit.
[2024-05-24 17:26:44] [INFO ] State equation strengthened by 2178 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/964 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3663 unsolved
SMT process timed out in 52434ms, After SMT, problems are : Problem set: 0 solved, 3663 unsolved
Search for dead transitions found 0 dead transitions in 52466ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89350 ms. Remains : 966/966 places, 3725/3725 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 181 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Support contains 2 out of 1105 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1105/1105 places, 2527/2527 transitions.
Applied a total of 0 rules in 76 ms. Remains 1105 /1105 variables (removed 0) and now considering 2527/2527 (removed 0) transitions.
[2024-05-24 17:27:37] [INFO ] Flow matrix only has 2255 transitions (discarded 272 similar events)
// Phase 1: matrix 2255 rows 1105 cols
[2024-05-24 17:27:37] [INFO ] Computed 47 invariants in 21 ms
[2024-05-24 17:27:38] [INFO ] Implicit Places using invariants in 946 ms returned []
[2024-05-24 17:27:38] [INFO ] Flow matrix only has 2255 transitions (discarded 272 similar events)
[2024-05-24 17:27:38] [INFO ] Invariant cache hit.
[2024-05-24 17:27:38] [INFO ] State equation strengthened by 843 read => feed constraints.
[2024-05-24 17:27:48] [INFO ] Implicit Places using invariants and state equation in 10170 ms returned [1078]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11120 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1104/1105 places, 2527/2527 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1104 transition count 2526
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1103 transition count 2526
Applied a total of 2 rules in 86 ms. Remains 1103 /1104 variables (removed 1) and now considering 2526/2527 (removed 1) transitions.
[2024-05-24 17:27:48] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
// Phase 1: matrix 2254 rows 1103 cols
[2024-05-24 17:27:48] [INFO ] Computed 46 invariants in 25 ms
[2024-05-24 17:27:49] [INFO ] Implicit Places using invariants in 914 ms returned []
[2024-05-24 17:27:49] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
[2024-05-24 17:27:49] [INFO ] Invariant cache hit.
[2024-05-24 17:27:49] [INFO ] State equation strengthened by 843 read => feed constraints.
[2024-05-24 17:27:59] [INFO ] Implicit Places using invariants and state equation in 10388 ms returned []
Implicit Place search using SMT with State Equation took 11304 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1103/1105 places, 2526/2527 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22587 ms. Remains : 1103/1105 places, 2526/2527 transitions.
Computed a total of 288 stabilizing places and 910 stable transitions
Computed a total of 288 stabilizing places and 910 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 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 37 ms :[(NOT p1)]
RANDOM walk for 40000 steps (910 resets) in 260 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (188 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 81676 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 1
Probabilistic random walk after 81676 steps, saw 34385 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-24 17:28:02] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
[2024-05-24 17:28:02] [INFO ] Invariant cache hit.
[2024-05-24 17:28:02] [INFO ] State equation strengthened by 843 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1010/1012 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1012 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/1030 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1030 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 34/1064 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1064 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/1092 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1092 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/1103 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1103 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2254/3357 variables, 1103/1149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3357 variables, 843/1992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3357 variables, 0/1992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/3357 variables, 0/1992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3357/3357 variables, and 1992 constraints, problems are : Problem set: 0 solved, 1 unsolved in 856 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 1103/1103 constraints, ReadFeed: 843/843 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1010/1012 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1012 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/1030 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:28:04] [INFO ] Deduced a trap composed of 166 places in 432 ms of which 7 ms to minimize.
[2024-05-24 17:28:04] [INFO ] Deduced a trap composed of 331 places in 432 ms of which 6 ms to minimize.
[2024-05-24 17:28:05] [INFO ] Deduced a trap composed of 242 places in 428 ms of which 7 ms to minimize.
[2024-05-24 17:28:05] [INFO ] Deduced a trap composed of 151 places in 433 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1030 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1030 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 34/1064 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:28:06] [INFO ] Deduced a trap composed of 84 places in 464 ms of which 7 ms to minimize.
[2024-05-24 17:28:06] [INFO ] Deduced a trap composed of 222 places in 448 ms of which 7 ms to minimize.
[2024-05-24 17:28:07] [INFO ] Deduced a trap composed of 86 places in 436 ms of which 7 ms to minimize.
[2024-05-24 17:28:07] [INFO ] Deduced a trap composed of 89 places in 469 ms of which 6 ms to minimize.
[2024-05-24 17:28:08] [INFO ] Deduced a trap composed of 98 places in 443 ms of which 7 ms to minimize.
[2024-05-24 17:28:08] [INFO ] Deduced a trap composed of 76 places in 438 ms of which 7 ms to minimize.
[2024-05-24 17:28:09] [INFO ] Deduced a trap composed of 109 places in 440 ms of which 6 ms to minimize.
SMT process timed out in 6141ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1103/1103 places, 2526/2526 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 1103 transition count 2525
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1102 transition count 2525
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 1100 transition count 2523
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1100 transition count 2523
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 1098 transition count 2511
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 1098 transition count 2511
Free-agglomeration rule (complex) applied 132 times.
Iterating global reduction 2 with 132 rules applied. Total rules applied 142 place count 1098 transition count 3724
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 2 with 132 rules applied. Total rules applied 274 place count 966 transition count 3724
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 276 place count 966 transition count 3724
Applied a total of 276 rules in 415 ms. Remains 966 /1103 variables (removed 137) and now considering 3724/2526 (removed -1198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 415 ms. Remains : 966/1103 places, 3724/2526 transitions.
RANDOM walk for 40000 steps (1130 resets) in 769 ms. (51 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (142 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 70575 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 70575 steps, saw 29469 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 17:28:12] [INFO ] Flow matrix only has 3326 transitions (discarded 398 similar events)
// Phase 1: matrix 3326 rows 966 cols
[2024-05-24 17:28:12] [INFO ] Computed 46 invariants in 42 ms
[2024-05-24 17:28:12] [INFO ] State equation strengthened by 2178 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 875/877 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/877 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/895 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/895 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/927 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/927 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/955 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/955 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/966 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3326/4292 variables, 966/1012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4292 variables, 2178/3190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4292 variables, 0/3190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4292 variables, 0/3190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4292/4292 variables, and 3190 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1238 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 966/966 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 875/877 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/877 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/895 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:28:14] [INFO ] Deduced a trap composed of 146 places in 494 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/895 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/895 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 32/927 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:28:15] [INFO ] Deduced a trap composed of 5 places in 470 ms of which 7 ms to minimize.
[2024-05-24 17:28:15] [INFO ] Deduced a trap composed of 27 places in 465 ms of which 6 ms to minimize.
[2024-05-24 17:28:16] [INFO ] Deduced a trap composed of 27 places in 462 ms of which 6 ms to minimize.
[2024-05-24 17:28:16] [INFO ] Deduced a trap composed of 57 places in 470 ms of which 6 ms to minimize.
[2024-05-24 17:28:17] [INFO ] Deduced a trap composed of 122 places in 460 ms of which 6 ms to minimize.
[2024-05-24 17:28:17] [INFO ] Deduced a trap composed of 46 places in 457 ms of which 5 ms to minimize.
[2024-05-24 17:28:18] [INFO ] Deduced a trap composed of 148 places in 470 ms of which 6 ms to minimize.
[2024-05-24 17:28:18] [INFO ] Deduced a trap composed of 62 places in 455 ms of which 6 ms to minimize.
[2024-05-24 17:28:19] [INFO ] Deduced a trap composed of 174 places in 434 ms of which 6 ms to minimize.
[2024-05-24 17:28:19] [INFO ] Deduced a trap composed of 103 places in 441 ms of which 5 ms to minimize.
[2024-05-24 17:28:20] [INFO ] Deduced a trap composed of 199 places in 452 ms of which 6 ms to minimize.
[2024-05-24 17:28:20] [INFO ] Deduced a trap composed of 241 places in 451 ms of which 6 ms to minimize.
[2024-05-24 17:28:20] [INFO ] Deduced a trap composed of 243 places in 434 ms of which 5 ms to minimize.
[2024-05-24 17:28:21] [INFO ] Deduced a trap composed of 138 places in 451 ms of which 5 ms to minimize.
[2024-05-24 17:28:21] [INFO ] Deduced a trap composed of 268 places in 447 ms of which 6 ms to minimize.
[2024-05-24 17:28:22] [INFO ] Deduced a trap composed of 269 places in 446 ms of which 5 ms to minimize.
[2024-05-24 17:28:22] [INFO ] Deduced a trap composed of 160 places in 448 ms of which 5 ms to minimize.
[2024-05-24 17:28:23] [INFO ] Deduced a trap composed of 271 places in 438 ms of which 5 ms to minimize.
[2024-05-24 17:28:23] [INFO ] Deduced a trap composed of 270 places in 449 ms of which 6 ms to minimize.
[2024-05-24 17:28:24] [INFO ] Deduced a trap composed of 333 places in 438 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/927 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:28:24] [INFO ] Deduced a trap composed of 160 places in 419 ms of which 6 ms to minimize.
[2024-05-24 17:28:25] [INFO ] Deduced a trap composed of 138 places in 431 ms of which 5 ms to minimize.
[2024-05-24 17:28:25] [INFO ] Deduced a trap composed of 322 places in 463 ms of which 6 ms to minimize.
[2024-05-24 17:28:26] [INFO ] Deduced a trap composed of 180 places in 444 ms of which 5 ms to minimize.
[2024-05-24 17:28:26] [INFO ] Deduced a trap composed of 369 places in 455 ms of which 6 ms to minimize.
[2024-05-24 17:28:26] [INFO ] Deduced a trap composed of 284 places in 433 ms of which 5 ms to minimize.
[2024-05-24 17:28:27] [INFO ] Deduced a trap composed of 289 places in 430 ms of which 5 ms to minimize.
[2024-05-24 17:28:27] [INFO ] Deduced a trap composed of 77 places in 511 ms of which 5 ms to minimize.
[2024-05-24 17:28:28] [INFO ] Deduced a trap composed of 90 places in 511 ms of which 5 ms to minimize.
[2024-05-24 17:28:28] [INFO ] Deduced a trap composed of 84 places in 509 ms of which 6 ms to minimize.
[2024-05-24 17:28:29] [INFO ] Deduced a trap composed of 68 places in 504 ms of which 6 ms to minimize.
[2024-05-24 17:28:30] [INFO ] Deduced a trap composed of 66 places in 507 ms of which 6 ms to minimize.
[2024-05-24 17:28:30] [INFO ] Deduced a trap composed of 77 places in 545 ms of which 6 ms to minimize.
[2024-05-24 17:28:31] [INFO ] Deduced a trap composed of 71 places in 541 ms of which 5 ms to minimize.
[2024-05-24 17:28:31] [INFO ] Deduced a trap composed of 97 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:28:32] [INFO ] Deduced a trap composed of 97 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:28:32] [INFO ] Deduced a trap composed of 143 places in 511 ms of which 5 ms to minimize.
[2024-05-24 17:28:33] [INFO ] Deduced a trap composed of 110 places in 511 ms of which 6 ms to minimize.
[2024-05-24 17:28:33] [INFO ] Deduced a trap composed of 63 places in 522 ms of which 6 ms to minimize.
[2024-05-24 17:28:34] [INFO ] Deduced a trap composed of 67 places in 505 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/927 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:28:34] [INFO ] Deduced a trap composed of 67 places in 518 ms of which 6 ms to minimize.
[2024-05-24 17:28:35] [INFO ] Deduced a trap composed of 63 places in 532 ms of which 5 ms to minimize.
[2024-05-24 17:28:35] [INFO ] Deduced a trap composed of 61 places in 525 ms of which 6 ms to minimize.
[2024-05-24 17:28:36] [INFO ] Deduced a trap composed of 59 places in 523 ms of which 5 ms to minimize.
[2024-05-24 17:28:37] [INFO ] Deduced a trap composed of 68 places in 521 ms of which 6 ms to minimize.
[2024-05-24 17:28:37] [INFO ] Deduced a trap composed of 75 places in 517 ms of which 5 ms to minimize.
[2024-05-24 17:28:38] [INFO ] Deduced a trap composed of 236 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:28:38] [INFO ] Deduced a trap composed of 72 places in 533 ms of which 6 ms to minimize.
[2024-05-24 17:28:39] [INFO ] Deduced a trap composed of 94 places in 529 ms of which 6 ms to minimize.
[2024-05-24 17:28:39] [INFO ] Deduced a trap composed of 234 places in 477 ms of which 5 ms to minimize.
[2024-05-24 17:28:40] [INFO ] Deduced a trap composed of 300 places in 467 ms of which 6 ms to minimize.
[2024-05-24 17:28:40] [INFO ] Deduced a trap composed of 264 places in 452 ms of which 5 ms to minimize.
[2024-05-24 17:28:41] [INFO ] Deduced a trap composed of 172 places in 467 ms of which 6 ms to minimize.
[2024-05-24 17:28:41] [INFO ] Deduced a trap composed of 108 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:28:42] [INFO ] Deduced a trap composed of 125 places in 526 ms of which 6 ms to minimize.
[2024-05-24 17:28:42] [INFO ] Deduced a trap composed of 59 places in 535 ms of which 6 ms to minimize.
[2024-05-24 17:28:43] [INFO ] Deduced a trap composed of 59 places in 527 ms of which 5 ms to minimize.
[2024-05-24 17:28:43] [INFO ] Deduced a trap composed of 63 places in 527 ms of which 6 ms to minimize.
[2024-05-24 17:28:44] [INFO ] Deduced a trap composed of 227 places in 510 ms of which 5 ms to minimize.
[2024-05-24 17:28:44] [INFO ] Deduced a trap composed of 113 places in 511 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/927 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:28:45] [INFO ] Deduced a trap composed of 74 places in 530 ms of which 5 ms to minimize.
[2024-05-24 17:28:46] [INFO ] Deduced a trap composed of 68 places in 529 ms of which 6 ms to minimize.
[2024-05-24 17:28:46] [INFO ] Deduced a trap composed of 95 places in 537 ms of which 6 ms to minimize.
[2024-05-24 17:28:47] [INFO ] Deduced a trap composed of 97 places in 525 ms of which 5 ms to minimize.
[2024-05-24 17:28:47] [INFO ] Deduced a trap composed of 167 places in 511 ms of which 6 ms to minimize.
[2024-05-24 17:28:48] [INFO ] Deduced a trap composed of 86 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:28:48] [INFO ] Deduced a trap composed of 94 places in 517 ms of which 6 ms to minimize.
[2024-05-24 17:28:49] [INFO ] Deduced a trap composed of 63 places in 533 ms of which 5 ms to minimize.
[2024-05-24 17:28:49] [INFO ] Deduced a trap composed of 158 places in 470 ms of which 5 ms to minimize.
[2024-05-24 17:28:50] [INFO ] Deduced a trap composed of 73 places in 549 ms of which 5 ms to minimize.
[2024-05-24 17:28:50] [INFO ] Deduced a trap composed of 71 places in 523 ms of which 6 ms to minimize.
[2024-05-24 17:28:51] [INFO ] Deduced a trap composed of 94 places in 525 ms of which 6 ms to minimize.
[2024-05-24 17:28:51] [INFO ] Deduced a trap composed of 120 places in 518 ms of which 6 ms to minimize.
[2024-05-24 17:28:52] [INFO ] Deduced a trap composed of 67 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:28:53] [INFO ] Deduced a trap composed of 63 places in 522 ms of which 6 ms to minimize.
[2024-05-24 17:28:53] [INFO ] Deduced a trap composed of 61 places in 536 ms of which 5 ms to minimize.
[2024-05-24 17:28:54] [INFO ] Deduced a trap composed of 94 places in 529 ms of which 6 ms to minimize.
[2024-05-24 17:28:54] [INFO ] Deduced a trap composed of 87 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:28:55] [INFO ] Deduced a trap composed of 78 places in 533 ms of which 6 ms to minimize.
[2024-05-24 17:28:55] [INFO ] Deduced a trap composed of 79 places in 523 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/927 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:28:56] [INFO ] Deduced a trap composed of 120 places in 544 ms of which 5 ms to minimize.
[2024-05-24 17:28:56] [INFO ] Deduced a trap composed of 91 places in 514 ms of which 5 ms to minimize.
[2024-05-24 17:28:57] [INFO ] Deduced a trap composed of 94 places in 520 ms of which 6 ms to minimize.
[2024-05-24 17:28:58] [INFO ] Deduced a trap composed of 81 places in 524 ms of which 6 ms to minimize.
[2024-05-24 17:28:58] [INFO ] Deduced a trap composed of 67 places in 516 ms of which 6 ms to minimize.
[2024-05-24 17:28:59] [INFO ] Deduced a trap composed of 93 places in 532 ms of which 5 ms to minimize.
SMT process timed out in 46319ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 3724/3724 transitions.
Applied a total of 0 rules in 93 ms. Remains 966 /966 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 966/966 places, 3724/3724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 3724/3724 transitions.
Applied a total of 0 rules in 93 ms. Remains 966 /966 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
[2024-05-24 17:28:59] [INFO ] Flow matrix only has 3326 transitions (discarded 398 similar events)
[2024-05-24 17:28:59] [INFO ] Invariant cache hit.
[2024-05-24 17:29:00] [INFO ] Implicit Places using invariants in 1068 ms returned [877, 878]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1070 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 964/966 places, 3724/3724 transitions.
Applied a total of 0 rules in 93 ms. Remains 964 /964 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1257 ms. Remains : 964/966 places, 3724/3724 transitions.
RANDOM walk for 40000 steps (1130 resets) in 762 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (144 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 72332 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 1
Probabilistic random walk after 72332 steps, saw 30198 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-24 17:29:03] [INFO ] Flow matrix only has 3326 transitions (discarded 398 similar events)
// Phase 1: matrix 3326 rows 964 cols
[2024-05-24 17:29:03] [INFO ] Computed 44 invariants in 46 ms
[2024-05-24 17:29:03] [INFO ] State equation strengthened by 2178 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 875/877 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/877 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/895 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/895 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/925 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/925 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/953 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/953 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/964 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/964 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3326/4290 variables, 964/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4290 variables, 2178/3186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4290 variables, 0/3186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4290 variables, 0/3186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4290/4290 variables, and 3186 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1146 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 964/964 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 875/877 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/877 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/895 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:29:05] [INFO ] Deduced a trap composed of 92 places in 471 ms of which 5 ms to minimize.
[2024-05-24 17:29:06] [INFO ] Deduced a trap composed of 82 places in 488 ms of which 5 ms to minimize.
[2024-05-24 17:29:06] [INFO ] Deduced a trap composed of 146 places in 491 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/895 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/895 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 30/925 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:29:07] [INFO ] Deduced a trap composed of 5 places in 443 ms of which 6 ms to minimize.
[2024-05-24 17:29:07] [INFO ] Deduced a trap composed of 27 places in 440 ms of which 5 ms to minimize.
[2024-05-24 17:29:08] [INFO ] Deduced a trap composed of 126 places in 448 ms of which 5 ms to minimize.
[2024-05-24 17:29:08] [INFO ] Deduced a trap composed of 27 places in 451 ms of which 6 ms to minimize.
[2024-05-24 17:29:08] [INFO ] Deduced a trap composed of 57 places in 436 ms of which 6 ms to minimize.
[2024-05-24 17:29:09] [INFO ] Deduced a trap composed of 46 places in 451 ms of which 5 ms to minimize.
[2024-05-24 17:29:09] [INFO ] Deduced a trap composed of 151 places in 448 ms of which 5 ms to minimize.
[2024-05-24 17:29:10] [INFO ] Deduced a trap composed of 140 places in 437 ms of which 6 ms to minimize.
[2024-05-24 17:29:10] [INFO ] Deduced a trap composed of 153 places in 440 ms of which 6 ms to minimize.
[2024-05-24 17:29:11] [INFO ] Deduced a trap composed of 153 places in 437 ms of which 6 ms to minimize.
[2024-05-24 17:29:11] [INFO ] Deduced a trap composed of 137 places in 450 ms of which 5 ms to minimize.
[2024-05-24 17:29:12] [INFO ] Deduced a trap composed of 157 places in 428 ms of which 6 ms to minimize.
[2024-05-24 17:29:12] [INFO ] Deduced a trap composed of 75 places in 423 ms of which 6 ms to minimize.
[2024-05-24 17:29:13] [INFO ] Deduced a trap composed of 90 places in 436 ms of which 5 ms to minimize.
[2024-05-24 17:29:13] [INFO ] Deduced a trap composed of 186 places in 461 ms of which 6 ms to minimize.
[2024-05-24 17:29:13] [INFO ] Deduced a trap composed of 90 places in 445 ms of which 6 ms to minimize.
[2024-05-24 17:29:14] [INFO ] Deduced a trap composed of 209 places in 463 ms of which 5 ms to minimize.
[2024-05-24 17:29:14] [INFO ] Deduced a trap composed of 209 places in 425 ms of which 5 ms to minimize.
[2024-05-24 17:29:15] [INFO ] Deduced a trap composed of 208 places in 428 ms of which 5 ms to minimize.
[2024-05-24 17:29:15] [INFO ] Deduced a trap composed of 212 places in 427 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/925 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:29:16] [INFO ] Deduced a trap composed of 224 places in 422 ms of which 5 ms to minimize.
[2024-05-24 17:29:16] [INFO ] Deduced a trap composed of 224 places in 431 ms of which 6 ms to minimize.
[2024-05-24 17:29:17] [INFO ] Deduced a trap composed of 113 places in 414 ms of which 6 ms to minimize.
[2024-05-24 17:29:17] [INFO ] Deduced a trap composed of 224 places in 419 ms of which 5 ms to minimize.
[2024-05-24 17:29:17] [INFO ] Deduced a trap composed of 226 places in 421 ms of which 6 ms to minimize.
[2024-05-24 17:29:18] [INFO ] Deduced a trap composed of 224 places in 428 ms of which 6 ms to minimize.
[2024-05-24 17:29:18] [INFO ] Deduced a trap composed of 225 places in 424 ms of which 6 ms to minimize.
[2024-05-24 17:29:19] [INFO ] Deduced a trap composed of 94 places in 446 ms of which 6 ms to minimize.
[2024-05-24 17:29:19] [INFO ] Deduced a trap composed of 62 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:29:20] [INFO ] Deduced a trap composed of 68 places in 509 ms of which 6 ms to minimize.
[2024-05-24 17:29:20] [INFO ] Deduced a trap composed of 89 places in 496 ms of which 6 ms to minimize.
[2024-05-24 17:29:21] [INFO ] Deduced a trap composed of 110 places in 503 ms of which 6 ms to minimize.
[2024-05-24 17:29:21] [INFO ] Deduced a trap composed of 73 places in 509 ms of which 5 ms to minimize.
[2024-05-24 17:29:22] [INFO ] Deduced a trap composed of 75 places in 491 ms of which 5 ms to minimize.
[2024-05-24 17:29:22] [INFO ] Deduced a trap composed of 94 places in 493 ms of which 6 ms to minimize.
[2024-05-24 17:29:23] [INFO ] Deduced a trap composed of 73 places in 516 ms of which 5 ms to minimize.
[2024-05-24 17:29:24] [INFO ] Deduced a trap composed of 91 places in 512 ms of which 5 ms to minimize.
[2024-05-24 17:29:24] [INFO ] Deduced a trap composed of 76 places in 508 ms of which 6 ms to minimize.
[2024-05-24 17:29:25] [INFO ] Deduced a trap composed of 84 places in 489 ms of which 5 ms to minimize.
[2024-05-24 17:29:25] [INFO ] Deduced a trap composed of 81 places in 516 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/925 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:29:26] [INFO ] Deduced a trap composed of 105 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:29:26] [INFO ] Deduced a trap composed of 90 places in 439 ms of which 6 ms to minimize.
[2024-05-24 17:29:27] [INFO ] Deduced a trap composed of 138 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:29:27] [INFO ] Deduced a trap composed of 88 places in 506 ms of which 5 ms to minimize.
[2024-05-24 17:29:28] [INFO ] Deduced a trap composed of 76 places in 508 ms of which 6 ms to minimize.
[2024-05-24 17:29:28] [INFO ] Deduced a trap composed of 113 places in 502 ms of which 5 ms to minimize.
[2024-05-24 17:29:29] [INFO ] Deduced a trap composed of 66 places in 494 ms of which 6 ms to minimize.
[2024-05-24 17:29:29] [INFO ] Deduced a trap composed of 68 places in 486 ms of which 5 ms to minimize.
[2024-05-24 17:29:30] [INFO ] Deduced a trap composed of 160 places in 544 ms of which 6 ms to minimize.
[2024-05-24 17:29:30] [INFO ] Deduced a trap composed of 72 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:29:31] [INFO ] Deduced a trap composed of 125 places in 494 ms of which 5 ms to minimize.
[2024-05-24 17:29:31] [INFO ] Deduced a trap composed of 86 places in 509 ms of which 6 ms to minimize.
[2024-05-24 17:29:32] [INFO ] Deduced a trap composed of 85 places in 502 ms of which 6 ms to minimize.
[2024-05-24 17:29:32] [INFO ] Deduced a trap composed of 66 places in 506 ms of which 6 ms to minimize.
[2024-05-24 17:29:33] [INFO ] Deduced a trap composed of 77 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:29:33] [INFO ] Deduced a trap composed of 67 places in 508 ms of which 6 ms to minimize.
[2024-05-24 17:29:34] [INFO ] Deduced a trap composed of 67 places in 533 ms of which 5 ms to minimize.
[2024-05-24 17:29:35] [INFO ] Deduced a trap composed of 113 places in 511 ms of which 6 ms to minimize.
[2024-05-24 17:29:35] [INFO ] Deduced a trap composed of 66 places in 522 ms of which 6 ms to minimize.
[2024-05-24 17:29:36] [INFO ] Deduced a trap composed of 78 places in 510 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/925 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:29:36] [INFO ] Deduced a trap composed of 83 places in 517 ms of which 6 ms to minimize.
[2024-05-24 17:29:37] [INFO ] Deduced a trap composed of 80 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:29:37] [INFO ] Deduced a trap composed of 95 places in 520 ms of which 6 ms to minimize.
[2024-05-24 17:29:38] [INFO ] Deduced a trap composed of 74 places in 535 ms of which 6 ms to minimize.
[2024-05-24 17:29:38] [INFO ] Deduced a trap composed of 83 places in 525 ms of which 5 ms to minimize.
[2024-05-24 17:29:39] [INFO ] Deduced a trap composed of 72 places in 503 ms of which 5 ms to minimize.
[2024-05-24 17:29:39] [INFO ] Deduced a trap composed of 65 places in 503 ms of which 6 ms to minimize.
[2024-05-24 17:29:40] [INFO ] Deduced a trap composed of 63 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:29:40] [INFO ] Deduced a trap composed of 72 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:29:41] [INFO ] Deduced a trap composed of 94 places in 499 ms of which 6 ms to minimize.
[2024-05-24 17:29:41] [INFO ] Deduced a trap composed of 70 places in 499 ms of which 5 ms to minimize.
[2024-05-24 17:29:42] [INFO ] Deduced a trap composed of 123 places in 439 ms of which 5 ms to minimize.
[2024-05-24 17:29:42] [INFO ] Deduced a trap composed of 90 places in 523 ms of which 5 ms to minimize.
[2024-05-24 17:29:43] [INFO ] Deduced a trap composed of 72 places in 516 ms of which 6 ms to minimize.
[2024-05-24 17:29:44] [INFO ] Deduced a trap composed of 106 places in 511 ms of which 5 ms to minimize.
[2024-05-24 17:29:44] [INFO ] Deduced a trap composed of 160 places in 499 ms of which 6 ms to minimize.
[2024-05-24 17:29:45] [INFO ] Deduced a trap composed of 78 places in 524 ms of which 6 ms to minimize.
[2024-05-24 17:29:45] [INFO ] Deduced a trap composed of 84 places in 523 ms of which 6 ms to minimize.
[2024-05-24 17:29:46] [INFO ] Deduced a trap composed of 66 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:29:46] [INFO ] Deduced a trap composed of 90 places in 532 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/925 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:29:47] [INFO ] Deduced a trap composed of 76 places in 523 ms of which 6 ms to minimize.
[2024-05-24 17:29:47] [INFO ] Deduced a trap composed of 76 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:29:48] [INFO ] Deduced a trap composed of 68 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:29:48] [INFO ] Deduced a trap composed of 107 places in 528 ms of which 6 ms to minimize.
[2024-05-24 17:29:49] [INFO ] Deduced a trap composed of 200 places in 534 ms of which 6 ms to minimize.
[2024-05-24 17:29:50] [INFO ] Deduced a trap composed of 78 places in 517 ms of which 6 ms to minimize.
[2024-05-24 17:29:50] [INFO ] Deduced a trap composed of 120 places in 513 ms of which 5 ms to minimize.
[2024-05-24 17:29:51] [INFO ] Deduced a trap composed of 78 places in 517 ms of which 5 ms to minimize.
[2024-05-24 17:29:51] [INFO ] Deduced a trap composed of 87 places in 522 ms of which 6 ms to minimize.
[2024-05-24 17:29:52] [INFO ] Deduced a trap composed of 145 places in 455 ms of which 6 ms to minimize.
[2024-05-24 17:29:52] [INFO ] Deduced a trap composed of 98 places in 529 ms of which 6 ms to minimize.
[2024-05-24 17:29:53] [INFO ] Deduced a trap composed of 88 places in 510 ms of which 5 ms to minimize.
[2024-05-24 17:29:53] [INFO ] Deduced a trap composed of 93 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:29:54] [INFO ] Deduced a trap composed of 103 places in 522 ms of which 6 ms to minimize.
[2024-05-24 17:29:54] [INFO ] Deduced a trap composed of 180 places in 505 ms of which 5 ms to minimize.
[2024-05-24 17:29:55] [INFO ] Deduced a trap composed of 72 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:29:55] [INFO ] Deduced a trap composed of 91 places in 509 ms of which 5 ms to minimize.
[2024-05-24 17:29:56] [INFO ] Deduced a trap composed of 91 places in 500 ms of which 6 ms to minimize.
[2024-05-24 17:29:57] [INFO ] Deduced a trap composed of 97 places in 526 ms of which 6 ms to minimize.
[2024-05-24 17:29:57] [INFO ] Deduced a trap composed of 85 places in 511 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/925 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:29:58] [INFO ] Deduced a trap composed of 101 places in 505 ms of which 5 ms to minimize.
[2024-05-24 17:29:58] [INFO ] Deduced a trap composed of 74 places in 517 ms of which 5 ms to minimize.
[2024-05-24 17:29:59] [INFO ] Deduced a trap composed of 103 places in 504 ms of which 6 ms to minimize.
[2024-05-24 17:29:59] [INFO ] Deduced a trap composed of 79 places in 487 ms of which 5 ms to minimize.
[2024-05-24 17:30:00] [INFO ] Deduced a trap composed of 93 places in 502 ms of which 6 ms to minimize.
[2024-05-24 17:30:00] [INFO ] Deduced a trap composed of 133 places in 497 ms of which 6 ms to minimize.
[2024-05-24 17:30:01] [INFO ] Deduced a trap composed of 106 places in 505 ms of which 5 ms to minimize.
[2024-05-24 17:30:01] [INFO ] Deduced a trap composed of 99 places in 510 ms of which 6 ms to minimize.
[2024-05-24 17:30:02] [INFO ] Deduced a trap composed of 280 places in 503 ms of which 5 ms to minimize.
[2024-05-24 17:30:02] [INFO ] Deduced a trap composed of 135 places in 517 ms of which 6 ms to minimize.
[2024-05-24 17:30:03] [INFO ] Deduced a trap composed of 88 places in 491 ms of which 5 ms to minimize.
[2024-05-24 17:30:03] [INFO ] Deduced a trap composed of 89 places in 516 ms of which 5 ms to minimize.
[2024-05-24 17:30:04] [INFO ] Deduced a trap composed of 121 places in 517 ms of which 6 ms to minimize.
[2024-05-24 17:30:04] [INFO ] Deduced a trap composed of 104 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:30:05] [INFO ] Deduced a trap composed of 172 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:30:06] [INFO ] Deduced a trap composed of 70 places in 496 ms of which 5 ms to minimize.
[2024-05-24 17:30:06] [INFO ] Deduced a trap composed of 96 places in 501 ms of which 5 ms to minimize.
[2024-05-24 17:30:07] [INFO ] Deduced a trap composed of 83 places in 518 ms of which 6 ms to minimize.
[2024-05-24 17:30:07] [INFO ] Deduced a trap composed of 87 places in 522 ms of which 6 ms to minimize.
[2024-05-24 17:30:08] [INFO ] Deduced a trap composed of 90 places in 511 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/925 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:08] [INFO ] Deduced a trap composed of 357 places in 497 ms of which 6 ms to minimize.
[2024-05-24 17:30:09] [INFO ] Deduced a trap composed of 180 places in 536 ms of which 5 ms to minimize.
[2024-05-24 17:30:09] [INFO ] Deduced a trap composed of 174 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:30:10] [INFO ] Deduced a trap composed of 101 places in 521 ms of which 9 ms to minimize.
[2024-05-24 17:30:10] [INFO ] Deduced a trap composed of 114 places in 513 ms of which 5 ms to minimize.
[2024-05-24 17:30:11] [INFO ] Deduced a trap composed of 106 places in 496 ms of which 6 ms to minimize.
[2024-05-24 17:30:11] [INFO ] Deduced a trap composed of 86 places in 523 ms of which 6 ms to minimize.
[2024-05-24 17:30:12] [INFO ] Deduced a trap composed of 94 places in 514 ms of which 6 ms to minimize.
[2024-05-24 17:30:12] [INFO ] Deduced a trap composed of 87 places in 508 ms of which 6 ms to minimize.
[2024-05-24 17:30:13] [INFO ] Deduced a trap composed of 227 places in 488 ms of which 5 ms to minimize.
[2024-05-24 17:30:14] [INFO ] Deduced a trap composed of 81 places in 509 ms of which 5 ms to minimize.
[2024-05-24 17:30:14] [INFO ] Deduced a trap composed of 75 places in 507 ms of which 6 ms to minimize.
[2024-05-24 17:30:15] [INFO ] Deduced a trap composed of 95 places in 501 ms of which 5 ms to minimize.
[2024-05-24 17:30:15] [INFO ] Deduced a trap composed of 157 places in 495 ms of which 5 ms to minimize.
[2024-05-24 17:30:16] [INFO ] Deduced a trap composed of 109 places in 499 ms of which 5 ms to minimize.
[2024-05-24 17:30:16] [INFO ] Deduced a trap composed of 115 places in 489 ms of which 6 ms to minimize.
[2024-05-24 17:30:17] [INFO ] Deduced a trap composed of 145 places in 520 ms of which 5 ms to minimize.
[2024-05-24 17:30:17] [INFO ] Deduced a trap composed of 77 places in 511 ms of which 6 ms to minimize.
[2024-05-24 17:30:18] [INFO ] Deduced a trap composed of 113 places in 520 ms of which 5 ms to minimize.
[2024-05-24 17:30:18] [INFO ] Deduced a trap composed of 101 places in 492 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/925 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:30:19] [INFO ] Deduced a trap composed of 97 places in 508 ms of which 6 ms to minimize.
[2024-05-24 17:30:19] [INFO ] Deduced a trap composed of 366 places in 527 ms of which 6 ms to minimize.
[2024-05-24 17:30:20] [INFO ] Deduced a trap composed of 95 places in 509 ms of which 6 ms to minimize.
SMT process timed out in 76618ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 3724/3724 transitions.
Applied a total of 0 rules in 98 ms. Remains 964 /964 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 964/964 places, 3724/3724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 3724/3724 transitions.
Applied a total of 0 rules in 96 ms. Remains 964 /964 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
[2024-05-24 17:30:20] [INFO ] Flow matrix only has 3326 transitions (discarded 398 similar events)
[2024-05-24 17:30:20] [INFO ] Invariant cache hit.
[2024-05-24 17:30:21] [INFO ] Implicit Places using invariants in 1084 ms returned []
[2024-05-24 17:30:21] [INFO ] Flow matrix only has 3326 transitions (discarded 398 similar events)
[2024-05-24 17:30:21] [INFO ] Invariant cache hit.
[2024-05-24 17:30:22] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:30:42] [INFO ] Implicit Places using invariants and state equation in 21313 ms returned []
Implicit Place search using SMT with State Equation took 22397 ms to find 0 implicit places.
[2024-05-24 17:30:43] [INFO ] Redundant transitions in 163 ms returned []
Running 3662 sub problems to find dead transitions.
[2024-05-24 17:30:43] [INFO ] Flow matrix only has 3326 transitions (discarded 398 similar events)
[2024-05-24 17:30:43] [INFO ] Invariant cache hit.
[2024-05-24 17:30:43] [INFO ] State equation strengthened by 2178 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/962 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3662 unsolved
SMT process timed out in 52101ms, After SMT, problems are : Problem set: 0 solved, 3662 unsolved
Search for dead transitions found 0 dead transitions in 52134ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74813 ms. Remains : 964/964 places, 3724/3724 transitions.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Product exploration explored 100000 steps with 2278 reset in 492 ms.
Product exploration explored 100000 steps with 2277 reset in 493 ms.
Built C files in :
/tmp/ltsmin13161381062850049946
[2024-05-24 17:31:36] [INFO ] Too many transitions (2526) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:31:36] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13161381062850049946
Running compilation step : cd /tmp/ltsmin13161381062850049946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13161381062850049946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13161381062850049946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 1103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1103/1103 places, 2526/2526 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 1103 transition count 2525
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1102 transition count 2525
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 1100 transition count 2523
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1100 transition count 2523
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 1098 transition count 2511
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 1098 transition count 2511
Applied a total of 10 rules in 175 ms. Remains 1098 /1103 variables (removed 5) and now considering 2511/2526 (removed 15) transitions.
[2024-05-24 17:31:39] [INFO ] Flow matrix only has 2239 transitions (discarded 272 similar events)
// Phase 1: matrix 2239 rows 1098 cols
[2024-05-24 17:31:39] [INFO ] Computed 46 invariants in 26 ms
[2024-05-24 17:31:40] [INFO ] Implicit Places using invariants in 925 ms returned [1001, 1002]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 927 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1096/1103 places, 2511/2526 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1094 transition count 2509
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1092 transition count 2507
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1092 transition count 2507
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1091 transition count 2501
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1091 transition count 2501
Applied a total of 10 rules in 211 ms. Remains 1091 /1096 variables (removed 5) and now considering 2501/2511 (removed 10) transitions.
[2024-05-24 17:31:40] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
// Phase 1: matrix 2229 rows 1091 cols
[2024-05-24 17:31:40] [INFO ] Computed 44 invariants in 27 ms
[2024-05-24 17:31:41] [INFO ] Implicit Places using invariants in 906 ms returned []
[2024-05-24 17:31:41] [INFO ] Flow matrix only has 2229 transitions (discarded 272 similar events)
[2024-05-24 17:31:41] [INFO ] Invariant cache hit.
[2024-05-24 17:31:42] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-24 17:31:51] [INFO ] Implicit Places using invariants and state equation in 9676 ms returned [1079]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10589 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1090/1103 places, 2501/2526 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1090 transition count 2500
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1089 transition count 2500
Applied a total of 2 rules in 78 ms. Remains 1089 /1090 variables (removed 1) and now considering 2500/2501 (removed 1) transitions.
[2024-05-24 17:31:51] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
// Phase 1: matrix 2228 rows 1089 cols
[2024-05-24 17:31:51] [INFO ] Computed 43 invariants in 22 ms
[2024-05-24 17:31:52] [INFO ] Implicit Places using invariants in 921 ms returned []
[2024-05-24 17:31:52] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2024-05-24 17:31:52] [INFO ] Invariant cache hit.
[2024-05-24 17:31:53] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-24 17:32:01] [INFO ] Implicit Places using invariants and state equation in 8894 ms returned []
Implicit Place search using SMT with State Equation took 9817 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1089/1103 places, 2500/2526 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 21799 ms. Remains : 1089/1103 places, 2500/2526 transitions.
Built C files in :
/tmp/ltsmin6404566921168930521
[2024-05-24 17:32:01] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:32:01] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6404566921168930521
Running compilation step : cd /tmp/ltsmin6404566921168930521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6404566921168930521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6404566921168930521;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 17:32:04] [INFO ] Flatten gal took : 51 ms
[2024-05-24 17:32:04] [INFO ] Flatten gal took : 50 ms
[2024-05-24 17:32:04] [INFO ] Time to serialize gal into /tmp/LTL216818495830145264.gal : 15 ms
[2024-05-24 17:32:04] [INFO ] Time to serialize properties into /tmp/LTL3728303502922184295.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL216818495830145264.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8867382812358723458.hoa' '-atoms' '/tmp/LTL3728303502922184295.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL3728303502922184295.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8867382812358723458.hoa
Detected timeout of ITS tools.
[2024-05-24 17:32:19] [INFO ] Flatten gal took : 49 ms
[2024-05-24 17:32:19] [INFO ] Flatten gal took : 51 ms
[2024-05-24 17:32:19] [INFO ] Time to serialize gal into /tmp/LTL3804932489602975168.gal : 10 ms
[2024-05-24 17:32:19] [INFO ] Time to serialize properties into /tmp/LTL8183219754179617720.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3804932489602975168.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8183219754179617720.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("(Node16HasTheLeafSetOfRx2ToReplaceNode13<=Node16HasAskedItsLeafSetToRx5ToReplaceNode14)"))U(G("(Node2ThinksNode3ShouldBeNodeMas...231
Formula 0 simplified : G!"(Node16HasTheLeafSetOfRx2ToReplaceNode13<=Node16HasAskedItsLeafSetToRx5ToReplaceNode14)" R F!"(Node2ThinksNode3ShouldBeNodeMaster...224
Detected timeout of ITS tools.
[2024-05-24 17:32:34] [INFO ] Flatten gal took : 50 ms
[2024-05-24 17:32:34] [INFO ] Applying decomposition
[2024-05-24 17:32:34] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6063087009997634776.txt' '-o' '/tmp/graph6063087009997634776.bin' '-w' '/tmp/graph6063087009997634776.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6063087009997634776.bin' '-l' '-1' '-v' '-w' '/tmp/graph6063087009997634776.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:32:35] [INFO ] Decomposing Gal with order
[2024-05-24 17:32:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:32:35] [INFO ] Removed a total of 58 redundant transitions.
[2024-05-24 17:32:35] [INFO ] Flatten gal took : 74 ms
[2024-05-24 17:32:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 3 ms.
[2024-05-24 17:32:35] [INFO ] Time to serialize gal into /tmp/LTL15200606329616142805.gal : 11 ms
[2024-05-24 17:32:35] [INFO ] Time to serialize properties into /tmp/LTL2028930026241144757.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15200606329616142805.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2028930026241144757.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(gu9.Node16HasTheLeafSetOfRx2ToReplaceNode13<=gu9.Node16HasAskedItsLeafSetToRx5ToReplaceNode14)"))U(G("(gu6.Node2ThinksNode3Sho...247
Formula 0 simplified : G!"(gu9.Node16HasTheLeafSetOfRx2ToReplaceNode13<=gu9.Node16HasAskedItsLeafSetToRx5ToReplaceNode14)" R F!"(gu6.Node2ThinksNode3Should...240
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-09 finished in 545106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 1396 transition count 3037
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 1363 transition count 3037
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 66 place count 1363 transition count 3005
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 130 place count 1331 transition count 3005
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 151 place count 1310 transition count 2979
Iterating global reduction 2 with 21 rules applied. Total rules applied 172 place count 1310 transition count 2979
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 172 place count 1310 transition count 2978
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 174 place count 1309 transition count 2978
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 191 place count 1292 transition count 2896
Iterating global reduction 2 with 17 rules applied. Total rules applied 208 place count 1292 transition count 2896
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 211 place count 1289 transition count 2878
Iterating global reduction 2 with 3 rules applied. Total rules applied 214 place count 1289 transition count 2878
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 292 place count 1250 transition count 2839
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 311 place count 1231 transition count 2820
Iterating global reduction 2 with 19 rules applied. Total rules applied 330 place count 1231 transition count 2820
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 349 place count 1212 transition count 2706
Iterating global reduction 2 with 19 rules applied. Total rules applied 368 place count 1212 transition count 2706
Applied a total of 368 rules in 447 ms. Remains 1212 /1396 variables (removed 184) and now considering 2706/3070 (removed 364) transitions.
[2024-05-24 17:32:50] [INFO ] Flow matrix only has 2434 transitions (discarded 272 similar events)
// Phase 1: matrix 2434 rows 1212 cols
[2024-05-24 17:32:50] [INFO ] Computed 80 invariants in 33 ms
[2024-05-24 17:32:51] [INFO ] Implicit Places using invariants in 1147 ms returned [9, 157, 158, 322, 348, 356, 357, 398, 399, 473, 494, 513, 527, 545, 547, 556, 557, 558, 576, 586, 604, 640, 658, 659, 677, 723, 748, 782, 816, 861, 904, 1011, 1084, 1085]
[2024-05-24 17:32:51] [INFO ] Actually due to overlaps returned [348, 9, 157, 158, 322, 356, 357, 398, 399, 473, 494, 513, 527, 545, 556, 557, 558, 576, 586, 604, 640, 658, 659, 677, 723, 748, 782, 816, 861, 904, 1011, 1084, 1085]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 1149 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1179/1396 places, 2706/3070 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1160 transition count 2687
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1160 transition count 2687
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 1141 transition count 2668
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 1141 transition count 2668
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 87 place count 1130 transition count 2602
Iterating global reduction 0 with 11 rules applied. Total rules applied 98 place count 1130 transition count 2602
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 120 place count 1119 transition count 2591
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 131 place count 1108 transition count 2580
Iterating global reduction 0 with 11 rules applied. Total rules applied 142 place count 1108 transition count 2580
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 155 place count 1095 transition count 2502
Iterating global reduction 0 with 13 rules applied. Total rules applied 168 place count 1095 transition count 2502
Applied a total of 168 rules in 376 ms. Remains 1095 /1179 variables (removed 84) and now considering 2502/2706 (removed 204) transitions.
[2024-05-24 17:32:52] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1095 cols
[2024-05-24 17:32:52] [INFO ] Computed 47 invariants in 29 ms
[2024-05-24 17:32:53] [INFO ] Implicit Places using invariants in 989 ms returned [512]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 993 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1094/1396 places, 2502/3070 transitions.
Applied a total of 0 rules in 77 ms. Remains 1094 /1094 variables (removed 0) and now considering 2502/2502 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3043 ms. Remains : 1094/1396 places, 2502/3070 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-10
Product exploration explored 100000 steps with 2279 reset in 473 ms.
Product exploration explored 100000 steps with 2278 reset in 498 ms.
Computed a total of 279 stabilizing places and 886 stable transitions
Computed a total of 279 stabilizing places and 886 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 139 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 46 ms :[(NOT p0)]
RANDOM walk for 4564 steps (101 resets) in 43 ms. (103 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 155 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 40 ms :[(NOT p0)]
Support contains 2 out of 1094 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1094/1094 places, 2502/2502 transitions.
Applied a total of 0 rules in 74 ms. Remains 1094 /1094 variables (removed 0) and now considering 2502/2502 (removed 0) transitions.
[2024-05-24 17:32:54] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1094 cols
[2024-05-24 17:32:55] [INFO ] Computed 46 invariants in 26 ms
[2024-05-24 17:32:55] [INFO ] Implicit Places using invariants in 923 ms returned []
[2024-05-24 17:32:55] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
[2024-05-24 17:32:55] [INFO ] Invariant cache hit.
[2024-05-24 17:32:56] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-24 17:33:05] [INFO ] Implicit Places using invariants and state equation in 9971 ms returned [1069, 1081]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10899 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1092/1094 places, 2502/2502 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1092 transition count 2500
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1090 transition count 2500
Applied a total of 4 rules in 84 ms. Remains 1090 /1092 variables (removed 2) and now considering 2500/2502 (removed 2) transitions.
[2024-05-24 17:33:05] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
// Phase 1: matrix 2228 rows 1090 cols
[2024-05-24 17:33:05] [INFO ] Computed 44 invariants in 21 ms
[2024-05-24 17:33:06] [INFO ] Implicit Places using invariants in 894 ms returned []
[2024-05-24 17:33:06] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2024-05-24 17:33:06] [INFO ] Invariant cache hit.
[2024-05-24 17:33:07] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-24 17:33:17] [INFO ] Implicit Places using invariants and state equation in 10220 ms returned []
Implicit Place search using SMT with State Equation took 11116 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1090/1094 places, 2500/2502 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22174 ms. Remains : 1090/1094 places, 2500/2502 transitions.
Computed a total of 275 stabilizing places and 884 stable transitions
Computed a total of 275 stabilizing places and 884 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 138 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 34 ms :[(NOT p0)]
RANDOM walk for 5218 steps (116 resets) in 48 ms. (106 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 142 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2279 reset in 486 ms.
Product exploration explored 100000 steps with 2280 reset in 492 ms.
Built C files in :
/tmp/ltsmin13908744213822958212
[2024-05-24 17:33:18] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:33:18] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13908744213822958212
Running compilation step : cd /tmp/ltsmin13908744213822958212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13908744213822958212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13908744213822958212;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1090/1090 places, 2500/2500 transitions.
Applied a total of 0 rules in 101 ms. Remains 1090 /1090 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2024-05-24 17:33:21] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2024-05-24 17:33:21] [INFO ] Invariant cache hit.
[2024-05-24 17:33:22] [INFO ] Implicit Places using invariants in 952 ms returned []
[2024-05-24 17:33:22] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2024-05-24 17:33:22] [INFO ] Invariant cache hit.
[2024-05-24 17:33:23] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-24 17:33:33] [INFO ] Implicit Places using invariants and state equation in 10929 ms returned []
Implicit Place search using SMT with State Equation took 11883 ms to find 0 implicit places.
[2024-05-24 17:33:33] [INFO ] Redundant transitions in 79 ms returned []
Running 2483 sub problems to find dead transitions.
[2024-05-24 17:33:33] [INFO ] Flow matrix only has 2228 transitions (discarded 272 similar events)
[2024-05-24 17:33:33] [INFO ] Invariant cache hit.
[2024-05-24 17:33:33] [INFO ] State equation strengthened by 828 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2483 unsolved
SMT process timed out in 32588ms, After SMT, problems are : Problem set: 0 solved, 2483 unsolved
Search for dead transitions found 0 dead transitions in 32610ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44690 ms. Remains : 1090/1090 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin18193064701810561325
[2024-05-24 17:34:06] [INFO ] Too many transitions (2500) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:34:06] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18193064701810561325
Running compilation step : cd /tmp/ltsmin18193064701810561325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18193064701810561325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18193064701810561325;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 17:34:09] [INFO ] Flatten gal took : 48 ms
[2024-05-24 17:34:09] [INFO ] Flatten gal took : 50 ms
[2024-05-24 17:34:09] [INFO ] Time to serialize gal into /tmp/LTL11740511747515115279.gal : 22 ms
[2024-05-24 17:34:09] [INFO ] Time to serialize properties into /tmp/LTL17737655993702108584.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11740511747515115279.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13028708628747293561.hoa' '-atoms' '/tmp/LTL17737655993702108584.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17737655993702108584.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13028708628747293561.hoa
Detected timeout of ITS tools.
[2024-05-24 17:34:24] [INFO ] Flatten gal took : 49 ms
[2024-05-24 17:34:24] [INFO ] Flatten gal took : 50 ms
[2024-05-24 17:34:24] [INFO ] Time to serialize gal into /tmp/LTL760620173826384881.gal : 10 ms
[2024-05-24 17:34:24] [INFO ] Time to serialize properties into /tmp/LTL15905054559679744553.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL760620173826384881.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15905054559679744553.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(Node14WantsToManageTheCrashOfNode0<=Node1ThinksNode5ShouldBeNodeMasterToReplaceNode9)"))))
Formula 0 simplified : GF!"(Node14WantsToManageTheCrashOfNode0<=Node1ThinksNode5ShouldBeNodeMasterToReplaceNode9)"
Detected timeout of ITS tools.
[2024-05-24 17:34:39] [INFO ] Flatten gal took : 50 ms
[2024-05-24 17:34:39] [INFO ] Applying decomposition
[2024-05-24 17:34:39] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4324330988071637853.txt' '-o' '/tmp/graph4324330988071637853.bin' '-w' '/tmp/graph4324330988071637853.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4324330988071637853.bin' '-l' '-1' '-v' '-w' '/tmp/graph4324330988071637853.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:34:39] [INFO ] Decomposing Gal with order
[2024-05-24 17:34:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:34:40] [INFO ] Removed a total of 1156 redundant transitions.
[2024-05-24 17:34:40] [INFO ] Flatten gal took : 145 ms
[2024-05-24 17:34:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 219 labels/synchronizations in 12 ms.
[2024-05-24 17:34:40] [INFO ] Time to serialize gal into /tmp/LTL11576576065676189401.gal : 13 ms
[2024-05-24 17:34:40] [INFO ] Time to serialize properties into /tmp/LTL16193351311902876343.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11576576065676189401.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16193351311902876343.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu12.Node14WantsToManageTheCrashOfNode0<=gu12.Node1ThinksNode5ShouldBeNodeMasterToReplaceNode9)"))))
Formula 0 simplified : GF!"(gu12.Node14WantsToManageTheCrashOfNode0<=gu12.Node1ThinksNode5ShouldBeNodeMasterToReplaceNode9)"
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-10 finished in 125027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 1396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1396 transition count 3038
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1364 transition count 3038
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1364 transition count 3006
Deduced a syphon composed of 32 places in 3 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 1332 transition count 3006
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 146 place count 1314 transition count 2983
Iterating global reduction 2 with 18 rules applied. Total rules applied 164 place count 1314 transition count 2983
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 164 place count 1314 transition count 2982
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 1313 transition count 2982
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 180 place count 1299 transition count 2913
Iterating global reduction 2 with 14 rules applied. Total rules applied 194 place count 1299 transition count 2913
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 196 place count 1297 transition count 2901
Iterating global reduction 2 with 2 rules applied. Total rules applied 198 place count 1297 transition count 2901
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 276 place count 1258 transition count 2862
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 295 place count 1239 transition count 2843
Iterating global reduction 2 with 19 rules applied. Total rules applied 314 place count 1239 transition count 2843
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 333 place count 1220 transition count 2729
Iterating global reduction 2 with 19 rules applied. Total rules applied 352 place count 1220 transition count 2729
Applied a total of 352 rules in 516 ms. Remains 1220 /1396 variables (removed 176) and now considering 2729/3070 (removed 341) transitions.
[2024-05-24 17:34:55] [INFO ] Flow matrix only has 2457 transitions (discarded 272 similar events)
// Phase 1: matrix 2457 rows 1220 cols
[2024-05-24 17:34:55] [INFO ] Computed 80 invariants in 35 ms
[2024-05-24 17:34:57] [INFO ] Implicit Places using invariants in 1163 ms returned [9, 157, 158, 322, 348, 356, 357, 398, 399, 473, 531, 549, 551, 560, 561, 562, 580, 590, 608, 647, 665, 666, 684, 730, 755, 789, 820, 823, 868, 911, 1018, 1091, 1092]
[2024-05-24 17:34:57] [INFO ] Actually due to overlaps returned [348, 9, 157, 158, 322, 356, 357, 398, 399, 473, 531, 549, 560, 561, 562, 580, 590, 608, 647, 665, 666, 684, 730, 755, 789, 820, 823, 868, 911, 1018, 1091, 1092]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 1167 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1188/1396 places, 2729/3070 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1171 transition count 2712
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1171 transition count 2712
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1154 transition count 2695
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1154 transition count 2695
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 1145 transition count 2641
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 1145 transition count 2641
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 108 place count 1134 transition count 2630
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 119 place count 1123 transition count 2619
Iterating global reduction 0 with 11 rules applied. Total rules applied 130 place count 1123 transition count 2619
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 143 place count 1110 transition count 2541
Iterating global reduction 0 with 13 rules applied. Total rules applied 156 place count 1110 transition count 2541
Applied a total of 156 rules in 370 ms. Remains 1110 /1188 variables (removed 78) and now considering 2541/2729 (removed 188) transitions.
[2024-05-24 17:34:57] [INFO ] Flow matrix only has 2269 transitions (discarded 272 similar events)
// Phase 1: matrix 2269 rows 1110 cols
[2024-05-24 17:34:57] [INFO ] Computed 48 invariants in 28 ms
[2024-05-24 17:34:58] [INFO ] Implicit Places using invariants in 1044 ms returned [522]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1046 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1109/1396 places, 2541/3070 transitions.
Applied a total of 0 rules in 70 ms. Remains 1109 /1109 variables (removed 0) and now considering 2541/2541 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3172 ms. Remains : 1109/1396 places, 2541/3070 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-12
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-12 finished in 3250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((p1||X(G(p2)))))))'
Support contains 6 out of 1396 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1362 transition count 3031
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1362 transition count 3031
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 98 place count 1332 transition count 2946
Iterating global reduction 0 with 30 rules applied. Total rules applied 128 place count 1332 transition count 2946
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 147 place count 1313 transition count 2847
Iterating global reduction 0 with 19 rules applied. Total rules applied 166 place count 1313 transition count 2847
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 168 place count 1311 transition count 2835
Iterating global reduction 0 with 2 rules applied. Total rules applied 170 place count 1311 transition count 2835
Applied a total of 170 rules in 235 ms. Remains 1311 /1396 variables (removed 85) and now considering 2835/3070 (removed 235) transitions.
[2024-05-24 17:34:58] [INFO ] Flow matrix only has 2563 transitions (discarded 272 similar events)
// Phase 1: matrix 2563 rows 1311 cols
[2024-05-24 17:34:58] [INFO ] Computed 80 invariants in 31 ms
[2024-05-24 17:35:00] [INFO ] Implicit Places using invariants in 1292 ms returned [10, 183, 354, 381, 390, 391, 432, 433, 512, 533, 555, 569, 590, 592, 601, 602, 603, 662, 724, 745, 795, 822, 892, 895, 940, 986, 1095, 1168, 1169]
[2024-05-24 17:35:00] [INFO ] Actually due to overlaps returned [381, 10, 183, 354, 390, 391, 432, 433, 512, 533, 555, 569, 590, 601, 602, 603, 662, 724, 745, 795, 822, 892, 895, 940, 986, 1095, 1168, 1169]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 1296 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1283/1396 places, 2835/3070 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1259 transition count 2811
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1259 transition count 2811
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 72 place count 1235 transition count 2787
Iterating global reduction 0 with 24 rules applied. Total rules applied 96 place count 1235 transition count 2787
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 120 place count 1211 transition count 2763
Iterating global reduction 0 with 24 rules applied. Total rules applied 144 place count 1211 transition count 2763
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 162 place count 1193 transition count 2655
Iterating global reduction 0 with 18 rules applied. Total rules applied 180 place count 1193 transition count 2655
Applied a total of 180 rules in 243 ms. Remains 1193 /1283 variables (removed 90) and now considering 2655/2835 (removed 180) transitions.
[2024-05-24 17:35:00] [INFO ] Flow matrix only has 2383 transitions (discarded 272 similar events)
// Phase 1: matrix 2383 rows 1193 cols
[2024-05-24 17:35:00] [INFO ] Computed 52 invariants in 30 ms
[2024-05-24 17:35:01] [INFO ] Implicit Places using invariants in 1012 ms returned [550]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1014 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1192/1396 places, 2655/3070 transitions.
Applied a total of 0 rules in 44 ms. Remains 1192 /1192 variables (removed 0) and now considering 2655/2655 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2833 ms. Remains : 1192/1396 places, 2655/3070 transitions.
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-14
Product exploration explored 100000 steps with 1606 reset in 465 ms.
Product exploration explored 100000 steps with 1605 reset in 484 ms.
Computed a total of 360 stabilizing places and 1022 stable transitions
Computed a total of 360 stabilizing places and 1022 stable transitions
Detected a total of 360/1192 stabilizing places and 1022/2655 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 469 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 11 to 9
RANDOM walk for 40000 steps (640 resets) in 628 ms. (63 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40003 steps (172 resets) in 340 ms. (117 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (172 resets) in 396 ms. (100 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (172 resets) in 354 ms. (112 steps per ms) remains 3/3 properties
[2024-05-24 17:35:04] [INFO ] Flow matrix only has 2383 transitions (discarded 272 similar events)
// Phase 1: matrix 2383 rows 1192 cols
[2024-05-24 17:35:04] [INFO ] Computed 51 invariants in 26 ms
[2024-05-24 17:35:04] [INFO ] State equation strengthened by 888 read => feed constraints.
Problem apf7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/136 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 982/1118 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1118 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/1180 variables, 29/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1180 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/1192 variables, 12/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1192 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2383/3575 variables, 1192/1243 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3575 variables, 888/2131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3575 variables, 0/2131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3575 variables, 0/2131 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3575/3575 variables, and 2131 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1082 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1192/1192 constraints, ReadFeed: 888/888 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 130/136 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem apf5 is UNSAT
At refinement iteration 3 (OVERLAPS) 982/1118 variables, 8/10 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-24 17:35:05] [INFO ] Deduced a trap composed of 200 places in 459 ms of which 7 ms to minimize.
[2024-05-24 17:35:06] [INFO ] Deduced a trap composed of 121 places in 423 ms of which 6 ms to minimize.
[2024-05-24 17:35:06] [INFO ] Deduced a trap composed of 201 places in 441 ms of which 6 ms to minimize.
[2024-05-24 17:35:07] [INFO ] Deduced a trap composed of 197 places in 484 ms of which 7 ms to minimize.
[2024-05-24 17:35:07] [INFO ] Deduced a trap composed of 127 places in 480 ms of which 7 ms to minimize.
[2024-05-24 17:35:08] [INFO ] Deduced a trap composed of 199 places in 436 ms of which 7 ms to minimize.
[2024-05-24 17:35:08] [INFO ] Deduced a trap composed of 199 places in 433 ms of which 7 ms to minimize.
[2024-05-24 17:35:09] [INFO ] Deduced a trap composed of 205 places in 433 ms of which 7 ms to minimize.
[2024-05-24 17:35:09] [INFO ] Deduced a trap composed of 202 places in 436 ms of which 6 ms to minimize.
[2024-05-24 17:35:10] [INFO ] Deduced a trap composed of 198 places in 435 ms of which 7 ms to minimize.
[2024-05-24 17:35:10] [INFO ] Deduced a trap composed of 124 places in 437 ms of which 7 ms to minimize.
SMT process timed out in 6472ms, After SMT, problems are : Problem set: 2 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1192/1192 places, 2655/2655 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1192 transition count 2634
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1171 transition count 2634
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 42 place count 1171 transition count 2620
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 70 place count 1157 transition count 2620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 1156 transition count 2619
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 1156 transition count 2619
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 72 place count 1156 transition count 2618
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 74 place count 1155 transition count 2618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 1154 transition count 2612
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 1154 transition count 2612
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 128 place count 1128 transition count 2586
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 131 place count 1125 transition count 2583
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 1125 transition count 2583
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 137 place count 1122 transition count 2565
Iterating global reduction 2 with 3 rules applied. Total rules applied 140 place count 1122 transition count 2565
Free-agglomeration rule (complex) applied 139 times.
Iterating global reduction 2 with 139 rules applied. Total rules applied 279 place count 1122 transition count 3736
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 2 with 139 rules applied. Total rules applied 418 place count 983 transition count 3736
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 423 place count 983 transition count 3736
Applied a total of 423 rules in 556 ms. Remains 983 /1192 variables (removed 209) and now considering 3736/2655 (removed -1081) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 557 ms. Remains : 983/1192 places, 3736/2655 transitions.
RANDOM walk for 40000 steps (1129 resets) in 771 ms. (51 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (141 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 71675 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 71675 steps, saw 29963 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 17:35:14] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
// Phase 1: matrix 3338 rows 983 cols
[2024-05-24 17:35:14] [INFO ] Computed 51 invariants in 36 ms
[2024-05-24 17:35:14] [INFO ] State equation strengthened by 2178 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 887/889 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/889 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/906 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/943 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/943 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/971 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/971 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/983 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/983 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3338/4321 variables, 983/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4321 variables, 2178/3212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4321 variables, 0/3212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4321 variables, 0/3212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4321/4321 variables, and 3212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1195 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 983/983 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 887/889 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/889 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/906 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/943 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:35:16] [INFO ] Deduced a trap composed of 76 places in 549 ms of which 6 ms to minimize.
[2024-05-24 17:35:16] [INFO ] Deduced a trap composed of 72 places in 579 ms of which 6 ms to minimize.
[2024-05-24 17:35:17] [INFO ] Deduced a trap composed of 77 places in 530 ms of which 6 ms to minimize.
[2024-05-24 17:35:18] [INFO ] Deduced a trap composed of 77 places in 529 ms of which 6 ms to minimize.
[2024-05-24 17:35:18] [INFO ] Deduced a trap composed of 71 places in 521 ms of which 5 ms to minimize.
[2024-05-24 17:35:19] [INFO ] Deduced a trap composed of 79 places in 532 ms of which 5 ms to minimize.
[2024-05-24 17:35:19] [INFO ] Deduced a trap composed of 27 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:35:20] [INFO ] Deduced a trap composed of 62 places in 516 ms of which 6 ms to minimize.
[2024-05-24 17:35:20] [INFO ] Deduced a trap composed of 67 places in 522 ms of which 6 ms to minimize.
[2024-05-24 17:35:21] [INFO ] Deduced a trap composed of 62 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:35:21] [INFO ] Deduced a trap composed of 91 places in 626 ms of which 6 ms to minimize.
[2024-05-24 17:35:22] [INFO ] Deduced a trap composed of 87 places in 629 ms of which 5 ms to minimize.
[2024-05-24 17:35:23] [INFO ] Deduced a trap composed of 89 places in 622 ms of which 6 ms to minimize.
[2024-05-24 17:35:23] [INFO ] Deduced a trap composed of 88 places in 615 ms of which 6 ms to minimize.
[2024-05-24 17:35:24] [INFO ] Deduced a trap composed of 94 places in 599 ms of which 6 ms to minimize.
[2024-05-24 17:35:25] [INFO ] Deduced a trap composed of 82 places in 627 ms of which 6 ms to minimize.
[2024-05-24 17:35:25] [INFO ] Deduced a trap composed of 77 places in 609 ms of which 6 ms to minimize.
[2024-05-24 17:35:26] [INFO ] Deduced a trap composed of 5 places in 614 ms of which 5 ms to minimize.
[2024-05-24 17:35:27] [INFO ] Deduced a trap composed of 77 places in 630 ms of which 6 ms to minimize.
[2024-05-24 17:35:27] [INFO ] Deduced a trap composed of 75 places in 635 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/943 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/943 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/971 variables, 28/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:35:28] [INFO ] Deduced a trap composed of 135 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:35:28] [INFO ] Deduced a trap composed of 105 places in 537 ms of which 6 ms to minimize.
[2024-05-24 17:35:29] [INFO ] Deduced a trap composed of 106 places in 516 ms of which 6 ms to minimize.
[2024-05-24 17:35:29] [INFO ] Deduced a trap composed of 136 places in 552 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/971 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/971 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/983 variables, 12/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3338/4321 variables, 983/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4321 variables, 2178/3236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4321 variables, 1/3237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:35:31] [INFO ] Deduced a trap composed of 151 places in 456 ms of which 6 ms to minimize.
[2024-05-24 17:35:32] [INFO ] Deduced a trap composed of 151 places in 427 ms of which 5 ms to minimize.
[2024-05-24 17:35:33] [INFO ] Deduced a trap composed of 170 places in 439 ms of which 5 ms to minimize.
[2024-05-24 17:35:34] [INFO ] Deduced a trap composed of 171 places in 456 ms of which 6 ms to minimize.
[2024-05-24 17:35:35] [INFO ] Deduced a trap composed of 160 places in 441 ms of which 5 ms to minimize.
[2024-05-24 17:35:35] [INFO ] Deduced a trap composed of 166 places in 432 ms of which 6 ms to minimize.
[2024-05-24 17:35:40] [INFO ] Deduced a trap composed of 166 places in 425 ms of which 6 ms to minimize.
[2024-05-24 17:35:41] [INFO ] Deduced a trap composed of 175 places in 452 ms of which 6 ms to minimize.
[2024-05-24 17:35:42] [INFO ] Deduced a trap composed of 173 places in 464 ms of which 6 ms to minimize.
[2024-05-24 17:35:43] [INFO ] Deduced a trap composed of 171 places in 454 ms of which 5 ms to minimize.
[2024-05-24 17:35:44] [INFO ] Deduced a trap composed of 163 places in 425 ms of which 6 ms to minimize.
[2024-05-24 17:35:46] [INFO ] Deduced a trap composed of 173 places in 431 ms of which 5 ms to minimize.
[2024-05-24 17:35:47] [INFO ] Deduced a trap composed of 177 places in 447 ms of which 5 ms to minimize.
[2024-05-24 17:35:48] [INFO ] Deduced a trap composed of 154 places in 464 ms of which 6 ms to minimize.
[2024-05-24 17:35:49] [INFO ] Deduced a trap composed of 149 places in 439 ms of which 5 ms to minimize.
[2024-05-24 17:35:50] [INFO ] Deduced a trap composed of 175 places in 459 ms of which 5 ms to minimize.
[2024-05-24 17:35:50] [INFO ] Deduced a trap composed of 163 places in 448 ms of which 6 ms to minimize.
[2024-05-24 17:35:51] [INFO ] Deduced a trap composed of 168 places in 453 ms of which 5 ms to minimize.
[2024-05-24 17:35:52] [INFO ] Deduced a trap composed of 183 places in 450 ms of which 6 ms to minimize.
[2024-05-24 17:35:53] [INFO ] Deduced a trap composed of 154 places in 429 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/4321 variables, 20/3257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:35:54] [INFO ] Deduced a trap composed of 152 places in 435 ms of which 5 ms to minimize.
[2024-05-24 17:35:55] [INFO ] Deduced a trap composed of 183 places in 452 ms of which 6 ms to minimize.
[2024-05-24 17:35:56] [INFO ] Deduced a trap composed of 107 places in 461 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4321 variables, 3/3260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4321 variables, 0/3260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/4321 variables, 0/3260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4321/4321 variables, and 3260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 42036 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 983/983 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 47/47 constraints]
After SMT, in 43300ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 2 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 3736/3736 transitions.
Applied a total of 0 rules in 93 ms. Remains 983 /983 variables (removed 0) and now considering 3736/3736 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 983/983 places, 3736/3736 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 3736/3736 transitions.
Applied a total of 0 rules in 93 ms. Remains 983 /983 variables (removed 0) and now considering 3736/3736 (removed 0) transitions.
[2024-05-24 17:35:57] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
[2024-05-24 17:35:57] [INFO ] Invariant cache hit.
[2024-05-24 17:35:59] [INFO ] Implicit Places using invariants in 1108 ms returned [469, 478, 543, 640]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1112 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 979/983 places, 3736/3736 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 978 transition count 3735
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 978 transition count 3735
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 977 transition count 3734
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 977 transition count 3734
Applied a total of 4 rules in 152 ms. Remains 977 /979 variables (removed 2) and now considering 3734/3736 (removed 2) transitions.
[2024-05-24 17:35:59] [INFO ] Flow matrix only has 3336 transitions (discarded 398 similar events)
// Phase 1: matrix 3336 rows 977 cols
[2024-05-24 17:35:59] [INFO ] Computed 47 invariants in 27 ms
[2024-05-24 17:36:00] [INFO ] Implicit Places using invariants in 1127 ms returned []
[2024-05-24 17:36:00] [INFO ] Flow matrix only has 3336 transitions (discarded 398 similar events)
[2024-05-24 17:36:00] [INFO ] Invariant cache hit.
[2024-05-24 17:36:01] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:36:32] [INFO ] Performed 963/977 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2024-05-24 17:36:34] [INFO ] Implicit Places using invariants and state equation in 34372 ms returned []
Implicit Place search using SMT with State Equation took 35499 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 977/983 places, 3734/3736 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 36859 ms. Remains : 977/983 places, 3734/3736 transitions.
RANDOM walk for 40000 steps (1131 resets) in 906 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (143 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 69042 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 69042 steps, saw 28869 distinct states, run finished after 3003 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-24 17:36:37] [INFO ] Flow matrix only has 3336 transitions (discarded 398 similar events)
[2024-05-24 17:36:37] [INFO ] Invariant cache hit.
[2024-05-24 17:36:37] [INFO ] State equation strengthened by 2178 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 885/887 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/904 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/904 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/937 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/937 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/965 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/965 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/977 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/977 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3336/4313 variables, 977/1024 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4313 variables, 2178/3202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4313 variables, 0/3202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4313 variables, 0/3202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4313/4313 variables, and 3202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1210 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 977/977 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 885/887 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/887 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/904 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/904 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/937 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:36:39] [INFO ] Deduced a trap composed of 5 places in 543 ms of which 6 ms to minimize.
[2024-05-24 17:36:40] [INFO ] Deduced a trap composed of 77 places in 540 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/937 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/937 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/965 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/965 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/977 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:36:41] [INFO ] Deduced a trap composed of 68 places in 544 ms of which 5 ms to minimize.
[2024-05-24 17:36:41] [INFO ] Deduced a trap composed of 71 places in 548 ms of which 6 ms to minimize.
[2024-05-24 17:36:42] [INFO ] Deduced a trap composed of 80 places in 551 ms of which 5 ms to minimize.
[2024-05-24 17:36:42] [INFO ] Deduced a trap composed of 80 places in 534 ms of which 5 ms to minimize.
[2024-05-24 17:36:43] [INFO ] Deduced a trap composed of 76 places in 539 ms of which 6 ms to minimize.
[2024-05-24 17:36:43] [INFO ] Deduced a trap composed of 71 places in 572 ms of which 6 ms to minimize.
[2024-05-24 17:36:44] [INFO ] Deduced a trap composed of 86 places in 571 ms of which 5 ms to minimize.
[2024-05-24 17:36:45] [INFO ] Deduced a trap composed of 66 places in 559 ms of which 6 ms to minimize.
[2024-05-24 17:36:45] [INFO ] Deduced a trap composed of 85 places in 559 ms of which 6 ms to minimize.
[2024-05-24 17:36:46] [INFO ] Deduced a trap composed of 154 places in 563 ms of which 6 ms to minimize.
[2024-05-24 17:36:46] [INFO ] Deduced a trap composed of 68 places in 640 ms of which 6 ms to minimize.
[2024-05-24 17:36:47] [INFO ] Deduced a trap composed of 62 places in 560 ms of which 6 ms to minimize.
[2024-05-24 17:36:48] [INFO ] Deduced a trap composed of 83 places in 543 ms of which 6 ms to minimize.
[2024-05-24 17:36:48] [INFO ] Deduced a trap composed of 70 places in 524 ms of which 6 ms to minimize.
[2024-05-24 17:36:49] [INFO ] Deduced a trap composed of 73 places in 536 ms of which 6 ms to minimize.
[2024-05-24 17:36:49] [INFO ] Deduced a trap composed of 74 places in 619 ms of which 7 ms to minimize.
[2024-05-24 17:36:50] [INFO ] Deduced a trap composed of 80 places in 620 ms of which 7 ms to minimize.
[2024-05-24 17:36:51] [INFO ] Deduced a trap composed of 71 places in 625 ms of which 7 ms to minimize.
[2024-05-24 17:36:51] [INFO ] Deduced a trap composed of 93 places in 634 ms of which 7 ms to minimize.
[2024-05-24 17:36:52] [INFO ] Deduced a trap composed of 71 places in 621 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/977 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3336/4313 variables, 977/1046 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4313 variables, 2178/3224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4313 variables, 1/3225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4313 variables, 0/3225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4313 variables, 0/3225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4313/4313 variables, and 3225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15779 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 977/977 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints]
After SMT, in 17025ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 2 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 3734/3734 transitions.
Applied a total of 0 rules in 93 ms. Remains 977 /977 variables (removed 0) and now considering 3734/3734 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 977/977 places, 3734/3734 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 3734/3734 transitions.
Applied a total of 0 rules in 93 ms. Remains 977 /977 variables (removed 0) and now considering 3734/3734 (removed 0) transitions.
[2024-05-24 17:36:55] [INFO ] Flow matrix only has 3336 transitions (discarded 398 similar events)
[2024-05-24 17:36:55] [INFO ] Invariant cache hit.
[2024-05-24 17:36:56] [INFO ] Implicit Places using invariants in 1094 ms returned []
[2024-05-24 17:36:56] [INFO ] Flow matrix only has 3336 transitions (discarded 398 similar events)
[2024-05-24 17:36:56] [INFO ] Invariant cache hit.
[2024-05-24 17:36:57] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:37:28] [INFO ] Performed 963/977 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2024-05-24 17:37:30] [INFO ] Implicit Places using invariants and state equation in 34235 ms returned []
Implicit Place search using SMT with State Equation took 35331 ms to find 0 implicit places.
[2024-05-24 17:37:30] [INFO ] Redundant transitions in 162 ms returned []
Running 3672 sub problems to find dead transitions.
[2024-05-24 17:37:30] [INFO ] Flow matrix only has 3336 transitions (discarded 398 similar events)
[2024-05-24 17:37:30] [INFO ] Invariant cache hit.
[2024-05-24 17:37:30] [INFO ] State equation strengthened by 2178 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/975 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3672 unsolved
SMT process timed out in 56297ms, After SMT, problems are : Problem set: 0 solved, 3672 unsolved
Search for dead transitions found 0 dead transitions in 56329ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91940 ms. Remains : 977/977 places, 3734/3734 transitions.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p2)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p2)), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 1195 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 1192 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1192/1192 places, 2655/2655 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 1192 transition count 2637
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 1174 transition count 2637
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 36 place count 1174 transition count 2623
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 64 place count 1160 transition count 2623
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 118 place count 1133 transition count 2596
Applied a total of 118 rules in 159 ms. Remains 1133 /1192 variables (removed 59) and now considering 2596/2655 (removed 59) transitions.
[2024-05-24 17:38:28] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
// Phase 1: matrix 2324 rows 1133 cols
[2024-05-24 17:38:28] [INFO ] Computed 51 invariants in 23 ms
[2024-05-24 17:38:29] [INFO ] Implicit Places using invariants in 1053 ms returned []
[2024-05-24 17:38:29] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
[2024-05-24 17:38:29] [INFO ] Invariant cache hit.
[2024-05-24 17:38:30] [INFO ] State equation strengthened by 888 read => feed constraints.
[2024-05-24 17:38:43] [INFO ] Implicit Places using invariants and state equation in 13360 ms returned []
Implicit Place search using SMT with State Equation took 14414 ms to find 0 implicit places.
[2024-05-24 17:38:43] [INFO ] Redundant transitions in 79 ms returned []
Running 2579 sub problems to find dead transitions.
[2024-05-24 17:38:43] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
[2024-05-24 17:38:43] [INFO ] Invariant cache hit.
[2024-05-24 17:38:43] [INFO ] State equation strengthened by 888 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1131 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2579 unsolved
SMT process timed out in 32636ms, After SMT, problems are : Problem set: 0 solved, 2579 unsolved
Search for dead transitions found 0 dead transitions in 32659ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1133/1192 places, 2596/2655 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47328 ms. Remains : 1133/1192 places, 2596/2655 transitions.
Computed a total of 318 stabilizing places and 980 stable transitions
Computed a total of 318 stabilizing places and 980 stable transitions
Detected a total of 318/1133 stabilizing places and 980/2596 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p2 p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 197 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (905 resets) in 1265 ms. (31 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (188 resets) in 290 ms. (137 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (188 resets) in 285 ms. (139 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (188 resets) in 299 ms. (133 steps per ms) remains 3/3 properties
[2024-05-24 17:39:16] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
[2024-05-24 17:39:16] [INFO ] Invariant cache hit.
[2024-05-24 17:39:16] [INFO ] State equation strengthened by 888 read => feed constraints.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1032/1036 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1036 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 17/1053 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1053 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 40/1093 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1093 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 28/1121 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1121 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 12/1133 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1133 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2324/3457 variables, 1133/1184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3457 variables, 888/2072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3457 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/3457 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3457/3457 variables, and 2072 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1241 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1133/1133 constraints, ReadFeed: 888/888 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1032/1036 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1036 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 17/1053 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1053 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 5 (OVERLAPS) 40/1093 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-24 17:39:18] [INFO ] Deduced a trap composed of 85 places in 485 ms of which 7 ms to minimize.
[2024-05-24 17:39:19] [INFO ] Deduced a trap composed of 93 places in 449 ms of which 7 ms to minimize.
[2024-05-24 17:39:19] [INFO ] Deduced a trap composed of 95 places in 486 ms of which 6 ms to minimize.
[2024-05-24 17:39:20] [INFO ] Deduced a trap composed of 110 places in 464 ms of which 7 ms to minimize.
[2024-05-24 17:39:20] [INFO ] Deduced a trap composed of 87 places in 450 ms of which 7 ms to minimize.
[2024-05-24 17:39:21] [INFO ] Deduced a trap composed of 93 places in 476 ms of which 8 ms to minimize.
[2024-05-24 17:39:21] [INFO ] Deduced a trap composed of 96 places in 471 ms of which 7 ms to minimize.
[2024-05-24 17:39:22] [INFO ] Deduced a trap composed of 99 places in 461 ms of which 7 ms to minimize.
[2024-05-24 17:39:22] [INFO ] Deduced a trap composed of 96 places in 467 ms of which 7 ms to minimize.
[2024-05-24 17:39:23] [INFO ] Deduced a trap composed of 98 places in 452 ms of which 6 ms to minimize.
SMT process timed out in 6392ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1133/1133 places, 2596/2596 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1133 transition count 2594
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1131 transition count 2594
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 1129 transition count 2592
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1129 transition count 2592
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 1127 transition count 2580
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1127 transition count 2580
Free-agglomeration rule (complex) applied 141 times.
Iterating global reduction 2 with 141 rules applied. Total rules applied 153 place count 1127 transition count 3739
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 2 with 141 rules applied. Total rules applied 294 place count 986 transition count 3739
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 300 place count 986 transition count 3739
Applied a total of 300 rules in 387 ms. Remains 986 /1133 variables (removed 147) and now considering 3739/2596 (removed -1143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 387 ms. Remains : 986/1133 places, 3739/2596 transitions.
RANDOM walk for 40000 steps (1131 resets) in 1690 ms. (23 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (142 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (141 resets) in 213 ms. (186 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 64545 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 64545 steps, saw 27040 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-24 17:39:27] [INFO ] Flow matrix only has 3341 transitions (discarded 398 similar events)
// Phase 1: matrix 3341 rows 986 cols
[2024-05-24 17:39:27] [INFO ] Computed 51 invariants in 37 ms
[2024-05-24 17:39:27] [INFO ] State equation strengthened by 2178 read => feed constraints.
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) 887/891 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/891 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/908 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/908 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/946 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/974 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/974 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/986 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/986 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3341/4327 variables, 986/1037 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4327 variables, 2178/3215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4327 variables, 0/3215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4327 variables, 0/3215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4327/4327 variables, and 3215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1758 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 986/986 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 887/891 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/891 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/908 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/908 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/946 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:39:29] [INFO ] Deduced a trap composed of 5 places in 563 ms of which 6 ms to minimize.
[2024-05-24 17:39:30] [INFO ] Deduced a trap composed of 27 places in 562 ms of which 6 ms to minimize.
[2024-05-24 17:39:30] [INFO ] Deduced a trap composed of 60 places in 553 ms of which 6 ms to minimize.
[2024-05-24 17:39:31] [INFO ] Deduced a trap composed of 68 places in 523 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/946 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/974 variables, 28/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/974 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 12/986 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/986 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3341/4327 variables, 986/1041 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4327 variables, 2178/3219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4327 variables, 2/3221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4327 variables, 0/3221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4327 variables, 0/3221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4327/4327 variables, and 3221 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5358 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 986/986 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 7183ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 85 ms.
Support contains 4 out of 986 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 986/986 places, 3739/3739 transitions.
Applied a total of 0 rules in 95 ms. Remains 986 /986 variables (removed 0) and now considering 3739/3739 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 986/986 places, 3739/3739 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 986/986 places, 3739/3739 transitions.
Applied a total of 0 rules in 98 ms. Remains 986 /986 variables (removed 0) and now considering 3739/3739 (removed 0) transitions.
[2024-05-24 17:39:34] [INFO ] Flow matrix only has 3341 transitions (discarded 398 similar events)
[2024-05-24 17:39:34] [INFO ] Invariant cache hit.
[2024-05-24 17:39:35] [INFO ] Implicit Places using invariants in 1159 ms returned [470, 644]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1163 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 984/986 places, 3739/3739 transitions.
Applied a total of 0 rules in 105 ms. Remains 984 /984 variables (removed 0) and now considering 3739/3739 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1366 ms. Remains : 984/986 places, 3739/3739 transitions.
RANDOM walk for 40000 steps (1130 resets) in 1276 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (143 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (142 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 64451 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 64451 steps, saw 27001 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-24 17:39:39] [INFO ] Flow matrix only has 3341 transitions (discarded 398 similar events)
// Phase 1: matrix 3341 rows 984 cols
[2024-05-24 17:39:39] [INFO ] Computed 49 invariants in 28 ms
[2024-05-24 17:39:39] [INFO ] State equation strengthened by 2178 read => feed constraints.
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) 887/891 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/891 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/908 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/908 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/944 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/944 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/972 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/972 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/984 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/984 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3341/4325 variables, 984/1033 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4325 variables, 2178/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4325 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4325 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4325/4325 variables, and 3211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1299 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 984/984 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 887/891 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/891 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/908 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/908 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/944 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 17:39:40] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/944 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/944 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/972 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 12/984 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/984 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3341/4325 variables, 984/1034 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4325 variables, 2178/3212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4325 variables, 2/3214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4325 variables, 0/3214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/4325 variables, 0/3214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4325/4325 variables, and 3214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2222 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 984/984 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 3586ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 4 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 3739/3739 transitions.
Applied a total of 0 rules in 93 ms. Remains 984 /984 variables (removed 0) and now considering 3739/3739 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 984/984 places, 3739/3739 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 3739/3739 transitions.
Applied a total of 0 rules in 93 ms. Remains 984 /984 variables (removed 0) and now considering 3739/3739 (removed 0) transitions.
[2024-05-24 17:39:43] [INFO ] Flow matrix only has 3341 transitions (discarded 398 similar events)
[2024-05-24 17:39:43] [INFO ] Invariant cache hit.
[2024-05-24 17:39:44] [INFO ] Implicit Places using invariants in 1149 ms returned []
[2024-05-24 17:39:44] [INFO ] Flow matrix only has 3341 transitions (discarded 398 similar events)
[2024-05-24 17:39:44] [INFO ] Invariant cache hit.
[2024-05-24 17:39:45] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2024-05-24 17:40:15] [INFO ] Performed 958/984 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 17:40:18] [INFO ] Implicit Places using invariants and state equation in 34213 ms returned []
Implicit Place search using SMT with State Equation took 35364 ms to find 0 implicit places.
[2024-05-24 17:40:18] [INFO ] Redundant transitions in 162 ms returned []
Running 3677 sub problems to find dead transitions.
[2024-05-24 17:40:18] [INFO ] Flow matrix only has 3341 transitions (discarded 398 similar events)
[2024-05-24 17:40:18] [INFO ] Invariant cache hit.
[2024-05-24 17:40:18] [INFO ] State equation strengthened by 2178 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/982 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3677 unsolved
SMT process timed out in 52683ms, After SMT, problems are : Problem set: 0 solved, 3677 unsolved
Search for dead transitions found 0 dead transitions in 52715ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88353 ms. Remains : 984/984 places, 3739/3739 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 12 factoid took 293 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 2263 reset in 517 ms.
Product exploration explored 100000 steps with 2266 reset in 543 ms.
Built C files in :
/tmp/ltsmin4782335414718994817
[2024-05-24 17:41:13] [INFO ] Too many transitions (2596) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:41:13] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4782335414718994817
Running compilation step : cd /tmp/ltsmin4782335414718994817;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4782335414718994817;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4782335414718994817;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 1133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1133/1133 places, 2596/2596 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1133 transition count 2594
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1131 transition count 2594
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 1129 transition count 2592
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1129 transition count 2592
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 1127 transition count 2580
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1127 transition count 2580
Applied a total of 12 rules in 181 ms. Remains 1127 /1133 variables (removed 6) and now considering 2580/2596 (removed 16) transitions.
[2024-05-24 17:41:16] [INFO ] Flow matrix only has 2308 transitions (discarded 272 similar events)
// Phase 1: matrix 2308 rows 1127 cols
[2024-05-24 17:41:16] [INFO ] Computed 51 invariants in 22 ms
[2024-05-24 17:41:17] [INFO ] Implicit Places using invariants in 962 ms returned [539, 741]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 969 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1125/1133 places, 2580/2596 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1123 transition count 2578
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1121 transition count 2576
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1121 transition count 2576
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1119 transition count 2564
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1119 transition count 2564
Applied a total of 12 rules in 211 ms. Remains 1119 /1125 variables (removed 6) and now considering 2564/2580 (removed 16) transitions.
[2024-05-24 17:41:17] [INFO ] Flow matrix only has 2292 transitions (discarded 272 similar events)
// Phase 1: matrix 2292 rows 1119 cols
[2024-05-24 17:41:17] [INFO ] Computed 49 invariants in 24 ms
[2024-05-24 17:41:18] [INFO ] Implicit Places using invariants in 947 ms returned []
[2024-05-24 17:41:18] [INFO ] Flow matrix only has 2292 transitions (discarded 272 similar events)
[2024-05-24 17:41:18] [INFO ] Invariant cache hit.
[2024-05-24 17:41:19] [INFO ] State equation strengthened by 868 read => feed constraints.
[2024-05-24 17:41:29] [INFO ] Implicit Places using invariants and state equation in 11215 ms returned []
Implicit Place search using SMT with State Equation took 12164 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1119/1133 places, 2564/2596 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13526 ms. Remains : 1119/1133 places, 2564/2596 transitions.
Built C files in :
/tmp/ltsmin5105719872765827704
[2024-05-24 17:41:29] [INFO ] Too many transitions (2564) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:41:29] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5105719872765827704
Running compilation step : cd /tmp/ltsmin5105719872765827704;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5105719872765827704;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5105719872765827704;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 17:41:32] [INFO ] Flatten gal took : 51 ms
[2024-05-24 17:41:32] [INFO ] Flatten gal took : 52 ms
[2024-05-24 17:41:32] [INFO ] Time to serialize gal into /tmp/LTL12093676075319003051.gal : 11 ms
[2024-05-24 17:41:32] [INFO ] Time to serialize properties into /tmp/LTL10331062761309887062.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12093676075319003051.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17902738927272331221.hoa' '-atoms' '/tmp/LTL10331062761309887062.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10331062761309887062.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17902738927272331221.hoa
Detected timeout of ITS tools.
[2024-05-24 17:41:48] [INFO ] Flatten gal took : 52 ms
[2024-05-24 17:41:48] [INFO ] Flatten gal took : 51 ms
[2024-05-24 17:41:48] [INFO ] Time to serialize gal into /tmp/LTL14107696612028871222.gal : 10 ms
[2024-05-24 17:41:48] [INFO ] Time to serialize properties into /tmp/LTL11516461998672518746.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14107696612028871222.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11516461998672518746.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G("((Node8HasTheLeafSetOfLx1ToReplaceNode4<=Node13HasTheLeafSetOfRx2ToReplaceNode15)&&(Node10HasTheLeafSetOfRx4ToReplaceNode16<=...398
Formula 0 simplified : X(F!"((Node8HasTheLeafSetOfLx1ToReplaceNode4<=Node13HasTheLeafSetOfRx2ToReplaceNode15)&&(Node10HasTheLeafSetOfRx4ToReplaceNode16<=No...386
Detected timeout of ITS tools.
[2024-05-24 17:42:03] [INFO ] Flatten gal took : 57 ms
[2024-05-24 17:42:03] [INFO ] Applying decomposition
[2024-05-24 17:42:03] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17971182190731509408.txt' '-o' '/tmp/graph17971182190731509408.bin' '-w' '/tmp/graph17971182190731509408.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17971182190731509408.bin' '-l' '-1' '-v' '-w' '/tmp/graph17971182190731509408.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:42:03] [INFO ] Decomposing Gal with order
[2024-05-24 17:42:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:42:03] [INFO ] Removed a total of 159 redundant transitions.
[2024-05-24 17:42:03] [INFO ] Flatten gal took : 82 ms
[2024-05-24 17:42:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 1 ms.
[2024-05-24 17:42:03] [INFO ] Time to serialize gal into /tmp/LTL15787126891081597846.gal : 11 ms
[2024-05-24 17:42:03] [INFO ] Time to serialize properties into /tmp/LTL15028267409007691986.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15787126891081597846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15028267409007691986.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G("((gu16.Node8HasTheLeafSetOfLx1ToReplaceNode4<=gu16.Node13HasTheLeafSetOfRx2ToReplaceNode15)&&(gu14.Node10HasTheLeafSetOfRx4To...438
Formula 0 simplified : X(F!"((gu16.Node8HasTheLeafSetOfLx1ToReplaceNode4<=gu16.Node13HasTheLeafSetOfRx2ToReplaceNode15)&&(gu14.Node10HasTheLeafSetOfRx4ToRe...426
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-14 finished in 440015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 3 out of 1396 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1396 transition count 3038
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1364 transition count 3038
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1364 transition count 3006
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 128 place count 1332 transition count 3006
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 147 place count 1313 transition count 2982
Iterating global reduction 2 with 19 rules applied. Total rules applied 166 place count 1313 transition count 2982
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 166 place count 1313 transition count 2981
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 168 place count 1312 transition count 2981
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 184 place count 1296 transition count 2905
Iterating global reduction 2 with 16 rules applied. Total rules applied 200 place count 1296 transition count 2905
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 203 place count 1293 transition count 2887
Iterating global reduction 2 with 3 rules applied. Total rules applied 206 place count 1293 transition count 2887
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 284 place count 1254 transition count 2848
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 302 place count 1236 transition count 2830
Iterating global reduction 2 with 18 rules applied. Total rules applied 320 place count 1236 transition count 2830
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 338 place count 1218 transition count 2722
Iterating global reduction 2 with 18 rules applied. Total rules applied 356 place count 1218 transition count 2722
Applied a total of 356 rules in 423 ms. Remains 1218 /1396 variables (removed 178) and now considering 2722/3070 (removed 348) transitions.
[2024-05-24 17:42:19] [INFO ] Flow matrix only has 2450 transitions (discarded 272 similar events)
// Phase 1: matrix 2450 rows 1218 cols
[2024-05-24 17:42:19] [INFO ] Computed 80 invariants in 26 ms
[2024-05-24 17:42:20] [INFO ] Implicit Places using invariants in 1082 ms returned [9, 157, 158, 351, 359, 360, 401, 402, 476, 497, 516, 530, 549, 551, 560, 561, 562, 580, 590, 646, 664, 665, 683, 729, 754, 788, 819, 822, 867, 910, 1017, 1090, 1091]
[2024-05-24 17:42:20] [INFO ] Actually due to overlaps returned [351, 9, 157, 158, 359, 360, 401, 402, 476, 497, 516, 530, 549, 560, 561, 562, 580, 590, 646, 664, 665, 683, 729, 754, 788, 819, 822, 867, 910, 1017, 1090, 1091]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 1091 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1186/1396 places, 2722/3070 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1169 transition count 2705
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1169 transition count 2705
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1152 transition count 2688
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1152 transition count 2688
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 76 place count 1144 transition count 2640
Iterating global reduction 0 with 8 rules applied. Total rules applied 84 place count 1144 transition count 2640
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 106 place count 1133 transition count 2629
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 117 place count 1122 transition count 2618
Iterating global reduction 0 with 11 rules applied. Total rules applied 128 place count 1122 transition count 2618
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 141 place count 1109 transition count 2540
Iterating global reduction 0 with 13 rules applied. Total rules applied 154 place count 1109 transition count 2540
Applied a total of 154 rules in 374 ms. Remains 1109 /1186 variables (removed 77) and now considering 2540/2722 (removed 182) transitions.
[2024-05-24 17:42:20] [INFO ] Flow matrix only has 2268 transitions (discarded 272 similar events)
// Phase 1: matrix 2268 rows 1109 cols
[2024-05-24 17:42:20] [INFO ] Computed 48 invariants in 26 ms
[2024-05-24 17:42:21] [INFO ] Implicit Places using invariants in 944 ms returned [520]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 947 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1108/1396 places, 2540/3070 transitions.
Applied a total of 0 rules in 70 ms. Remains 1108 /1108 variables (removed 0) and now considering 2540/2540 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2906 ms. Remains : 1108/1396 places, 2540/3070 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-15
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-15 finished in 3076 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||G(p1))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-06
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 1396 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1396 transition count 3040
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 1366 transition count 3040
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 60 place count 1366 transition count 3008
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 124 place count 1334 transition count 3008
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 142 place count 1316 transition count 2990
Iterating global reduction 2 with 18 rules applied. Total rules applied 160 place count 1316 transition count 2990
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 175 place count 1301 transition count 2910
Iterating global reduction 2 with 15 rules applied. Total rules applied 190 place count 1301 transition count 2910
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 192 place count 1299 transition count 2898
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 1299 transition count 2898
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 274 place count 1259 transition count 2858
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 292 place count 1241 transition count 2840
Iterating global reduction 2 with 18 rules applied. Total rules applied 310 place count 1241 transition count 2840
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 328 place count 1223 transition count 2732
Iterating global reduction 2 with 18 rules applied. Total rules applied 346 place count 1223 transition count 2732
Applied a total of 346 rules in 401 ms. Remains 1223 /1396 variables (removed 173) and now considering 2732/3070 (removed 338) transitions.
[2024-05-24 17:42:22] [INFO ] Flow matrix only has 2460 transitions (discarded 272 similar events)
// Phase 1: matrix 2460 rows 1223 cols
[2024-05-24 17:42:22] [INFO ] Computed 80 invariants in 28 ms
[2024-05-24 17:42:23] [INFO ] Implicit Places using invariants in 1101 ms returned [9, 159, 160, 324, 350, 358, 359, 400, 401, 478, 499, 518, 532, 550, 552, 561, 562, 563, 581, 591, 609, 647, 665, 666, 684, 730, 755, 789, 820, 823, 868, 911, 1018, 1091]
[2024-05-24 17:42:23] [INFO ] Actually due to overlaps returned [350, 9, 159, 160, 324, 358, 359, 400, 401, 478, 499, 518, 532, 550, 561, 562, 563, 581, 591, 609, 647, 665, 666, 684, 730, 755, 789, 820, 823, 868, 911, 1018, 1091]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 1102 ms to find 33 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1190/1396 places, 2732/3070 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1173 transition count 2715
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1173 transition count 2715
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 51 place count 1156 transition count 2698
Iterating global reduction 0 with 17 rules applied. Total rules applied 68 place count 1156 transition count 2698
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 76 place count 1148 transition count 2650
Iterating global reduction 0 with 8 rules applied. Total rules applied 84 place count 1148 transition count 2650
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 108 place count 1136 transition count 2638
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 120 place count 1124 transition count 2626
Iterating global reduction 0 with 12 rules applied. Total rules applied 132 place count 1124 transition count 2626
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 146 place count 1110 transition count 2542
Iterating global reduction 0 with 14 rules applied. Total rules applied 160 place count 1110 transition count 2542
Applied a total of 160 rules in 338 ms. Remains 1110 /1190 variables (removed 80) and now considering 2542/2732 (removed 190) transitions.
[2024-05-24 17:42:24] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1110 cols
[2024-05-24 17:42:24] [INFO ] Computed 47 invariants in 26 ms
[2024-05-24 17:42:24] [INFO ] Implicit Places using invariants in 940 ms returned [517]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 941 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1109/1396 places, 2542/3070 transitions.
Applied a total of 0 rules in 53 ms. Remains 1109 /1109 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2835 ms. Remains : 1109/1396 places, 2542/3070 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-06
Product exploration explored 100000 steps with 2267 reset in 490 ms.
Product exploration explored 100000 steps with 2269 reset in 512 ms.
Computed a total of 294 stabilizing places and 926 stable transitions
Computed a total of 294 stabilizing places and 926 stable transitions
Detected a total of 294/1109 stabilizing places and 926/2542 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 167 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (906 resets) in 363 ms. (109 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (187 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
[2024-05-24 17:42:26] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
// Phase 1: matrix 2270 rows 1109 cols
[2024-05-24 17:42:26] [INFO ] Computed 46 invariants in 24 ms
[2024-05-24 17:42:26] [INFO ] State equation strengthened by 853 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1016/1020 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/1037 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1037 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/1069 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1069 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/1097 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1097 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/1109 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2270/3379 variables, 1109/1155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3379 variables, 853/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3379 variables, 0/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/3379 variables, 0/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3379/3379 variables, and 2008 constraints, problems are : Problem set: 0 solved, 1 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 1109/1109 constraints, ReadFeed: 853/853 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 1020/3379 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 2/31 constraints, Generalized P Invariants (flows): 0/15 constraints, State Equation: 0/1109 constraints, ReadFeed: 0/853 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 926ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 315 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 4 out of 1109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1109/1109 places, 2542/2542 transitions.
Applied a total of 0 rules in 74 ms. Remains 1109 /1109 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2024-05-24 17:42:28] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 17:42:28] [INFO ] Invariant cache hit.
[2024-05-24 17:42:28] [INFO ] Implicit Places using invariants in 900 ms returned []
[2024-05-24 17:42:28] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 17:42:28] [INFO ] Invariant cache hit.
[2024-05-24 17:42:29] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-24 17:42:38] [INFO ] Implicit Places using invariants and state equation in 9991 ms returned []
Implicit Place search using SMT with State Equation took 10891 ms to find 0 implicit places.
[2024-05-24 17:42:38] [INFO ] Redundant transitions in 73 ms returned []
Running 2525 sub problems to find dead transitions.
[2024-05-24 17:42:39] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 17:42:39] [INFO ] Invariant cache hit.
[2024-05-24 17:42:39] [INFO ] State equation strengthened by 853 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1107 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2525 unsolved
SMT process timed out in 32647ms, After SMT, problems are : Problem set: 0 solved, 2525 unsolved
Search for dead transitions found 0 dead transitions in 32668ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43715 ms. Remains : 1109/1109 places, 2542/2542 transitions.
Computed a total of 294 stabilizing places and 926 stable transitions
Computed a total of 294 stabilizing places and 926 stable transitions
Detected a total of 294/1109 stabilizing places and 926/2542 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 173 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (904 resets) in 336 ms. (118 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (188 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
[2024-05-24 17:43:12] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 17:43:12] [INFO ] Invariant cache hit.
[2024-05-24 17:43:12] [INFO ] State equation strengthened by 853 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1016/1020 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1020 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/1037 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1037 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/1069 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1069 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/1097 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1097 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/1109 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2270/3379 variables, 1109/1155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3379 variables, 853/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3379 variables, 0/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/3379 variables, 0/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3379/3379 variables, and 2008 constraints, problems are : Problem set: 0 solved, 1 unsolved in 864 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 1109/1109 constraints, ReadFeed: 853/853 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 1020/3379 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 2/31 constraints, Generalized P Invariants (flows): 0/15 constraints, State Equation: 0/1109 constraints, ReadFeed: 0/853 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1001ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 278 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2273 reset in 538 ms.
Product exploration explored 100000 steps with 2271 reset in 513 ms.
Built C files in :
/tmp/ltsmin4779569487032074563
[2024-05-24 17:43:14] [INFO ] Too many transitions (2542) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:43:14] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4779569487032074563
Running compilation step : cd /tmp/ltsmin4779569487032074563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4779569487032074563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4779569487032074563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 1109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1109/1109 places, 2542/2542 transitions.
Applied a total of 0 rules in 77 ms. Remains 1109 /1109 variables (removed 0) and now considering 2542/2542 (removed 0) transitions.
[2024-05-24 17:43:17] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 17:43:17] [INFO ] Invariant cache hit.
[2024-05-24 17:43:18] [INFO ] Implicit Places using invariants in 928 ms returned []
[2024-05-24 17:43:18] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 17:43:18] [INFO ] Invariant cache hit.
[2024-05-24 17:43:19] [INFO ] State equation strengthened by 853 read => feed constraints.
[2024-05-24 17:43:29] [INFO ] Implicit Places using invariants and state equation in 10557 ms returned []
Implicit Place search using SMT with State Equation took 11486 ms to find 0 implicit places.
[2024-05-24 17:43:29] [INFO ] Redundant transitions in 78 ms returned []
Running 2525 sub problems to find dead transitions.
[2024-05-24 17:43:29] [INFO ] Flow matrix only has 2270 transitions (discarded 272 similar events)
[2024-05-24 17:43:29] [INFO ] Invariant cache hit.
[2024-05-24 17:43:29] [INFO ] State equation strengthened by 853 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1107 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2525 unsolved
SMT process timed out in 32818ms, After SMT, problems are : Problem set: 0 solved, 2525 unsolved
Search for dead transitions found 0 dead transitions in 32840ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44493 ms. Remains : 1109/1109 places, 2542/2542 transitions.
Built C files in :
/tmp/ltsmin7654541524106650906
[2024-05-24 17:44:02] [INFO ] Too many transitions (2542) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:44:02] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7654541524106650906
Running compilation step : cd /tmp/ltsmin7654541524106650906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7654541524106650906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7654541524106650906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 17:44:05] [INFO ] Flatten gal took : 50 ms
[2024-05-24 17:44:05] [INFO ] Flatten gal took : 51 ms
[2024-05-24 17:44:05] [INFO ] Time to serialize gal into /tmp/LTL2013192231925707453.gal : 20 ms
[2024-05-24 17:44:05] [INFO ] Time to serialize properties into /tmp/LTL10097991501326574166.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2013192231925707453.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8953762123335698876.hoa' '-atoms' '/tmp/LTL10097991501326574166.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10097991501326574166.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8953762123335698876.hoa
Detected timeout of ITS tools.
[2024-05-24 17:44:20] [INFO ] Flatten gal took : 50 ms
[2024-05-24 17:44:20] [INFO ] Flatten gal took : 51 ms
[2024-05-24 17:44:20] [INFO ] Time to serialize gal into /tmp/LTL6539111234435215944.gal : 10 ms
[2024-05-24 17:44:20] [INFO ] Time to serialize properties into /tmp/LTL16240690928633432789.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6539111234435215944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16240690928633432789.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(LeafSetOfRx0IsSentToNode4<=Node0ManageTheCrashOfNode10)")))||(G("(LeafSetOfLx2IsSentToNode9<=Node16HasTheLeafSetOfRx5ToRep...172
Formula 0 simplified : X(FG!"(LeafSetOfRx0IsSentToNode4<=Node0ManageTheCrashOfNode10)" & F!"(LeafSetOfLx2IsSentToNode9<=Node16HasTheLeafSetOfRx5ToReplaceNo...162
Detected timeout of ITS tools.
[2024-05-24 17:44:35] [INFO ] Flatten gal took : 51 ms
[2024-05-24 17:44:35] [INFO ] Applying decomposition
[2024-05-24 17:44:35] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph221562941770989927.txt' '-o' '/tmp/graph221562941770989927.bin' '-w' '/tmp/graph221562941770989927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph221562941770989927.bin' '-l' '-1' '-v' '-w' '/tmp/graph221562941770989927.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:44:36] [INFO ] Decomposing Gal with order
[2024-05-24 17:44:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:44:36] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-24 17:44:36] [INFO ] Flatten gal took : 74 ms
[2024-05-24 17:44:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 2 ms.
[2024-05-24 17:44:36] [INFO ] Time to serialize gal into /tmp/LTL355595154212918346.gal : 10 ms
[2024-05-24 17:44:36] [INFO ] Time to serialize properties into /tmp/LTL2818614830105634503.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL355595154212918346.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2818614830105634503.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(gu11.LeafSetOfRx0IsSentToNode4<=gu11.Node0ManageTheCrashOfNode10)")))||(G("(gu12.LeafSetOfLx2IsSentToNode9<=gu12.Node16Has...192
Formula 0 simplified : X(FG!"(gu11.LeafSetOfRx0IsSentToNode4<=gu11.Node0ManageTheCrashOfNode10)" & F!"(gu12.LeafSetOfLx2IsSentToNode9<=gu12.Node16HasTheLea...182
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-06 finished in 149382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G((p1||X(G(p2)))))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-14
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
Support contains 6 out of 1396 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1396/1396 places, 3070/3070 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 1396 transition count 3041
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1367 transition count 3041
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 58 place count 1367 transition count 3009
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 122 place count 1335 transition count 3009
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 141 place count 1316 transition count 2985
Iterating global reduction 2 with 19 rules applied. Total rules applied 160 place count 1316 transition count 2985
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 175 place count 1301 transition count 2915
Iterating global reduction 2 with 15 rules applied. Total rules applied 190 place count 1301 transition count 2915
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 193 place count 1298 transition count 2897
Iterating global reduction 2 with 3 rules applied. Total rules applied 196 place count 1298 transition count 2897
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 276 place count 1258 transition count 2857
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 291 place count 1243 transition count 2842
Iterating global reduction 2 with 15 rules applied. Total rules applied 306 place count 1243 transition count 2842
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 321 place count 1228 transition count 2752
Iterating global reduction 2 with 15 rules applied. Total rules applied 336 place count 1228 transition count 2752
Applied a total of 336 rules in 397 ms. Remains 1228 /1396 variables (removed 168) and now considering 2752/3070 (removed 318) transitions.
[2024-05-24 17:44:52] [INFO ] Flow matrix only has 2480 transitions (discarded 272 similar events)
// Phase 1: matrix 2480 rows 1228 cols
[2024-05-24 17:44:52] [INFO ] Computed 80 invariants in 30 ms
[2024-05-24 17:44:53] [INFO ] Implicit Places using invariants in 1099 ms returned [9, 158, 325, 351, 359, 360, 401, 402, 476, 497, 516, 530, 548, 550, 559, 560, 561, 612, 670, 691, 737, 762, 830, 833, 878, 921, 1028, 1101, 1102]
[2024-05-24 17:44:53] [INFO ] Actually due to overlaps returned [351, 9, 158, 325, 359, 360, 401, 402, 476, 497, 516, 530, 548, 559, 560, 561, 612, 670, 691, 737, 762, 830, 833, 878, 921, 1028, 1101, 1102]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 1101 ms to find 28 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1200/1396 places, 2752/3070 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1187 transition count 2739
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1187 transition count 2739
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1174 transition count 2726
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1174 transition count 2726
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 1168 transition count 2690
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 1168 transition count 2690
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 86 place count 1157 transition count 2679
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 97 place count 1146 transition count 2668
Iterating global reduction 0 with 11 rules applied. Total rules applied 108 place count 1146 transition count 2668
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 120 place count 1134 transition count 2596
Iterating global reduction 0 with 12 rules applied. Total rules applied 132 place count 1134 transition count 2596
Applied a total of 132 rules in 377 ms. Remains 1134 /1200 variables (removed 66) and now considering 2596/2752 (removed 156) transitions.
[2024-05-24 17:44:53] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
// Phase 1: matrix 2324 rows 1134 cols
[2024-05-24 17:44:53] [INFO ] Computed 52 invariants in 27 ms
[2024-05-24 17:44:54] [INFO ] Implicit Places using invariants in 965 ms returned [518]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 966 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1133/1396 places, 2596/3070 transitions.
Applied a total of 0 rules in 54 ms. Remains 1133 /1133 variables (removed 0) and now considering 2596/2596 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2895 ms. Remains : 1133/1396 places, 2596/3070 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-14
Product exploration explored 100000 steps with 2264 reset in 543 ms.
Product exploration explored 100000 steps with 2265 reset in 576 ms.
Computed a total of 318 stabilizing places and 980 stable transitions
Computed a total of 318 stabilizing places and 980 stable transitions
Detected a total of 318/1133 stabilizing places and 980/2596 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 472 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 11 to 9
RANDOM walk for 40000 steps (902 resets) in 1815 ms. (22 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40004 steps (188 resets) in 224 ms. (177 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (188 resets) in 282 ms. (141 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (188 resets) in 333 ms. (119 steps per ms) remains 3/3 properties
[2024-05-24 17:44:57] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
// Phase 1: matrix 2324 rows 1133 cols
[2024-05-24 17:44:57] [INFO ] Computed 51 invariants in 23 ms
[2024-05-24 17:44:57] [INFO ] State equation strengthened by 888 read => feed constraints.
Problem apf7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1030/1036 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1036 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/1053 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1053 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 40/1093 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1093 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/1121 variables, 28/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1121 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/1133 variables, 12/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1133 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2324/3457 variables, 1133/1184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3457 variables, 888/2072 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3457 variables, 0/2072 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/3457 variables, 0/2072 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3457/3457 variables, and 2072 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1019 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1133/1133 constraints, ReadFeed: 888/888 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1030/1036 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1036 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/1053 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1053 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem apf5 is UNSAT
At refinement iteration 5 (OVERLAPS) 40/1093 variables, 8/11 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-24 17:44:59] [INFO ] Deduced a trap composed of 47 places in 469 ms of which 6 ms to minimize.
[2024-05-24 17:44:59] [INFO ] Deduced a trap composed of 75 places in 474 ms of which 6 ms to minimize.
[2024-05-24 17:45:00] [INFO ] Deduced a trap composed of 266 places in 469 ms of which 7 ms to minimize.
[2024-05-24 17:45:00] [INFO ] Deduced a trap composed of 189 places in 448 ms of which 7 ms to minimize.
[2024-05-24 17:45:01] [INFO ] Deduced a trap composed of 151 places in 462 ms of which 7 ms to minimize.
[2024-05-24 17:45:01] [INFO ] Deduced a trap composed of 97 places in 463 ms of which 7 ms to minimize.
[2024-05-24 17:45:02] [INFO ] Deduced a trap composed of 261 places in 467 ms of which 7 ms to minimize.
[2024-05-24 17:45:02] [INFO ] Deduced a trap composed of 133 places in 450 ms of which 6 ms to minimize.
[2024-05-24 17:45:03] [INFO ] Deduced a trap composed of 132 places in 454 ms of which 6 ms to minimize.
[2024-05-24 17:45:03] [INFO ] Deduced a trap composed of 232 places in 446 ms of which 7 ms to minimize.
SMT process timed out in 6076ms, After SMT, problems are : Problem set: 2 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1133/1133 places, 2596/2596 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1133 transition count 2593
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1130 transition count 2593
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 10 place count 1126 transition count 2589
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 1126 transition count 2589
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 1122 transition count 2565
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 1122 transition count 2565
Free-agglomeration rule (complex) applied 139 times.
Iterating global reduction 2 with 139 rules applied. Total rules applied 161 place count 1122 transition count 3736
Reduce places removed 139 places and 0 transitions.
Iterating post reduction 2 with 139 rules applied. Total rules applied 300 place count 983 transition count 3736
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 306 place count 983 transition count 3736
Applied a total of 306 rules in 387 ms. Remains 983 /1133 variables (removed 150) and now considering 3736/2596 (removed -1140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 387 ms. Remains : 983/1133 places, 3736/2596 transitions.
RANDOM walk for 40000 steps (1129 resets) in 765 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (138 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 71429 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 71429 steps, saw 29861 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 17:45:07] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
// Phase 1: matrix 3338 rows 983 cols
[2024-05-24 17:45:07] [INFO ] Computed 51 invariants in 55 ms
[2024-05-24 17:45:07] [INFO ] State equation strengthened by 2178 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 887/889 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/889 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/906 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/943 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/943 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/971 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/971 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/983 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/983 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3338/4321 variables, 983/1034 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4321 variables, 2178/3212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4321 variables, 0/3212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4321 variables, 0/3212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4321/4321 variables, and 3212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1203 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 983/983 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 887/889 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/889 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/906 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/943 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:45:09] [INFO ] Deduced a trap composed of 75 places in 531 ms of which 6 ms to minimize.
[2024-05-24 17:45:09] [INFO ] Deduced a trap composed of 74 places in 529 ms of which 6 ms to minimize.
[2024-05-24 17:45:10] [INFO ] Deduced a trap composed of 71 places in 519 ms of which 6 ms to minimize.
[2024-05-24 17:45:10] [INFO ] Deduced a trap composed of 27 places in 530 ms of which 5 ms to minimize.
[2024-05-24 17:45:11] [INFO ] Deduced a trap composed of 65 places in 523 ms of which 6 ms to minimize.
[2024-05-24 17:45:11] [INFO ] Deduced a trap composed of 59 places in 514 ms of which 5 ms to minimize.
[2024-05-24 17:45:12] [INFO ] Deduced a trap composed of 57 places in 636 ms of which 6 ms to minimize.
[2024-05-24 17:45:13] [INFO ] Deduced a trap composed of 74 places in 505 ms of which 6 ms to minimize.
[2024-05-24 17:45:13] [INFO ] Deduced a trap composed of 92 places in 503 ms of which 6 ms to minimize.
[2024-05-24 17:45:14] [INFO ] Deduced a trap composed of 61 places in 494 ms of which 6 ms to minimize.
[2024-05-24 17:45:14] [INFO ] Deduced a trap composed of 59 places in 503 ms of which 6 ms to minimize.
[2024-05-24 17:45:15] [INFO ] Deduced a trap composed of 5 places in 513 ms of which 5 ms to minimize.
[2024-05-24 17:45:15] [INFO ] Deduced a trap composed of 64 places in 515 ms of which 6 ms to minimize.
[2024-05-24 17:45:16] [INFO ] Deduced a trap composed of 66 places in 513 ms of which 6 ms to minimize.
[2024-05-24 17:45:16] [INFO ] Deduced a trap composed of 58 places in 506 ms of which 5 ms to minimize.
[2024-05-24 17:45:17] [INFO ] Deduced a trap composed of 59 places in 512 ms of which 5 ms to minimize.
[2024-05-24 17:45:17] [INFO ] Deduced a trap composed of 56 places in 618 ms of which 6 ms to minimize.
[2024-05-24 17:45:18] [INFO ] Deduced a trap composed of 56 places in 638 ms of which 6 ms to minimize.
[2024-05-24 17:45:19] [INFO ] Deduced a trap composed of 92 places in 585 ms of which 6 ms to minimize.
[2024-05-24 17:45:19] [INFO ] Deduced a trap composed of 59 places in 602 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/943 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:45:20] [INFO ] Deduced a trap composed of 76 places in 604 ms of which 6 ms to minimize.
[2024-05-24 17:45:21] [INFO ] Deduced a trap composed of 71 places in 604 ms of which 6 ms to minimize.
[2024-05-24 17:45:21] [INFO ] Deduced a trap composed of 58 places in 620 ms of which 6 ms to minimize.
[2024-05-24 17:45:22] [INFO ] Deduced a trap composed of 88 places in 594 ms of which 5 ms to minimize.
[2024-05-24 17:45:22] [INFO ] Deduced a trap composed of 83 places in 520 ms of which 6 ms to minimize.
[2024-05-24 17:45:23] [INFO ] Deduced a trap composed of 59 places in 494 ms of which 6 ms to minimize.
[2024-05-24 17:45:24] [INFO ] Deduced a trap composed of 59 places in 616 ms of which 6 ms to minimize.
[2024-05-24 17:45:24] [INFO ] Deduced a trap composed of 70 places in 502 ms of which 6 ms to minimize.
[2024-05-24 17:45:25] [INFO ] Deduced a trap composed of 81 places in 496 ms of which 6 ms to minimize.
[2024-05-24 17:45:25] [INFO ] Deduced a trap composed of 78 places in 507 ms of which 6 ms to minimize.
[2024-05-24 17:45:26] [INFO ] Deduced a trap composed of 241 places in 492 ms of which 5 ms to minimize.
[2024-05-24 17:45:26] [INFO ] Deduced a trap composed of 90 places in 502 ms of which 6 ms to minimize.
[2024-05-24 17:45:27] [INFO ] Deduced a trap composed of 80 places in 495 ms of which 5 ms to minimize.
[2024-05-24 17:45:27] [INFO ] Deduced a trap composed of 239 places in 507 ms of which 5 ms to minimize.
[2024-05-24 17:45:28] [INFO ] Deduced a trap composed of 85 places in 505 ms of which 5 ms to minimize.
[2024-05-24 17:45:28] [INFO ] Deduced a trap composed of 243 places in 494 ms of which 6 ms to minimize.
[2024-05-24 17:45:29] [INFO ] Deduced a trap composed of 59 places in 496 ms of which 5 ms to minimize.
[2024-05-24 17:45:29] [INFO ] Deduced a trap composed of 248 places in 501 ms of which 6 ms to minimize.
[2024-05-24 17:45:30] [INFO ] Deduced a trap composed of 60 places in 490 ms of which 6 ms to minimize.
[2024-05-24 17:45:30] [INFO ] Deduced a trap composed of 245 places in 488 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/943 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:45:31] [INFO ] Deduced a trap composed of 260 places in 503 ms of which 6 ms to minimize.
[2024-05-24 17:45:31] [INFO ] Deduced a trap composed of 85 places in 538 ms of which 6 ms to minimize.
[2024-05-24 17:45:32] [INFO ] Deduced a trap composed of 81 places in 620 ms of which 6 ms to minimize.
[2024-05-24 17:45:33] [INFO ] Deduced a trap composed of 86 places in 597 ms of which 6 ms to minimize.
[2024-05-24 17:45:33] [INFO ] Deduced a trap composed of 57 places in 519 ms of which 5 ms to minimize.
[2024-05-24 17:45:34] [INFO ] Deduced a trap composed of 228 places in 513 ms of which 5 ms to minimize.
[2024-05-24 17:45:34] [INFO ] Deduced a trap composed of 70 places in 575 ms of which 6 ms to minimize.
[2024-05-24 17:45:35] [INFO ] Deduced a trap composed of 272 places in 593 ms of which 5 ms to minimize.
[2024-05-24 17:45:35] [INFO ] Deduced a trap composed of 59 places in 577 ms of which 6 ms to minimize.
[2024-05-24 17:45:36] [INFO ] Deduced a trap composed of 76 places in 604 ms of which 6 ms to minimize.
[2024-05-24 17:45:37] [INFO ] Deduced a trap composed of 68 places in 585 ms of which 6 ms to minimize.
[2024-05-24 17:45:37] [INFO ] Deduced a trap composed of 58 places in 585 ms of which 6 ms to minimize.
[2024-05-24 17:45:38] [INFO ] Deduced a trap composed of 98 places in 580 ms of which 5 ms to minimize.
[2024-05-24 17:45:38] [INFO ] Deduced a trap composed of 82 places in 597 ms of which 6 ms to minimize.
[2024-05-24 17:45:39] [INFO ] Deduced a trap composed of 56 places in 599 ms of which 6 ms to minimize.
[2024-05-24 17:45:40] [INFO ] Deduced a trap composed of 77 places in 579 ms of which 6 ms to minimize.
[2024-05-24 17:45:40] [INFO ] Deduced a trap composed of 82 places in 500 ms of which 6 ms to minimize.
[2024-05-24 17:45:41] [INFO ] Deduced a trap composed of 84 places in 581 ms of which 6 ms to minimize.
[2024-05-24 17:45:41] [INFO ] Deduced a trap composed of 104 places in 497 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/943 variables, 19/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/943 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/971 variables, 28/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/971 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/983 variables, 12/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/983 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3338/4321 variables, 983/1093 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4321 variables, 2178/3271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4321 variables, 1/3272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4321 variables, 0/3272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/4321 variables, 0/3272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4321/4321 variables, and 3272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 39181 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 983/983 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 59/59 constraints]
After SMT, in 40471ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 2 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 3736/3736 transitions.
Applied a total of 0 rules in 92 ms. Remains 983 /983 variables (removed 0) and now considering 3736/3736 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 983/983 places, 3736/3736 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 3736/3736 transitions.
Applied a total of 0 rules in 91 ms. Remains 983 /983 variables (removed 0) and now considering 3736/3736 (removed 0) transitions.
[2024-05-24 17:45:47] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
[2024-05-24 17:45:47] [INFO ] Invariant cache hit.
[2024-05-24 17:45:49] [INFO ] Implicit Places using invariants in 1229 ms returned [469, 478, 543, 640]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1232 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 979/983 places, 3736/3736 transitions.
Applied a total of 0 rules in 94 ms. Remains 979 /979 variables (removed 0) and now considering 3736/3736 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1419 ms. Remains : 979/983 places, 3736/3736 transitions.
RANDOM walk for 40000 steps (1128 resets) in 630 ms. (63 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (142 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 70731 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 70731 steps, saw 29570 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 17:45:52] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
// Phase 1: matrix 3338 rows 979 cols
[2024-05-24 17:45:52] [INFO ] Computed 47 invariants in 26 ms
[2024-05-24 17:45:52] [INFO ] State equation strengthened by 2178 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 887/889 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/889 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/906 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/939 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/939 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/967 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/967 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/979 variables, 12/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/979 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3338/4317 variables, 979/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4317 variables, 2178/3204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4317 variables, 0/3204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/4317 variables, 0/3204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4317/4317 variables, and 3204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1088 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 979/979 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 887/889 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/889 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/906 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/906 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 33/939 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:45:54] [INFO ] Deduced a trap composed of 5 places in 512 ms of which 6 ms to minimize.
[2024-05-24 17:45:54] [INFO ] Deduced a trap composed of 27 places in 543 ms of which 6 ms to minimize.
[2024-05-24 17:45:55] [INFO ] Deduced a trap composed of 156 places in 539 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/939 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/939 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/967 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/967 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/979 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/979 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3338/4317 variables, 979/1029 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4317 variables, 2178/3207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4317 variables, 1/3208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 17:45:57] [INFO ] Deduced a trap composed of 154 places in 456 ms of which 6 ms to minimize.
[2024-05-24 17:45:58] [INFO ] Deduced a trap composed of 153 places in 444 ms of which 6 ms to minimize.
[2024-05-24 17:45:58] [INFO ] Deduced a trap composed of 170 places in 439 ms of which 7 ms to minimize.
[2024-05-24 17:45:59] [INFO ] Deduced a trap composed of 183 places in 456 ms of which 6 ms to minimize.
[2024-05-24 17:46:00] [INFO ] Deduced a trap composed of 170 places in 453 ms of which 5 ms to minimize.
[2024-05-24 17:46:00] [INFO ] Deduced a trap composed of 124 places in 464 ms of which 5 ms to minimize.
[2024-05-24 17:46:01] [INFO ] Deduced a trap composed of 161 places in 483 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/4317 variables, 7/3215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4317 variables, 0/3215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/4317 variables, 0/3215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4317/4317 variables, and 3215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8232 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 979/979 constraints, ReadFeed: 2178/2178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 9380ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 630 steps, including 108 resets, run visited all 1 properties in 15 ms. (steps per millisecond=42 )
Parikh walk visited 1 properties in 25 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p2)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p2)), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 1327 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 1133 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1133/1133 places, 2596/2596 transitions.
Applied a total of 0 rules in 74 ms. Remains 1133 /1133 variables (removed 0) and now considering 2596/2596 (removed 0) transitions.
[2024-05-24 17:46:03] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
// Phase 1: matrix 2324 rows 1133 cols
[2024-05-24 17:46:03] [INFO ] Computed 51 invariants in 28 ms
[2024-05-24 17:46:04] [INFO ] Implicit Places using invariants in 996 ms returned []
[2024-05-24 17:46:04] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
[2024-05-24 17:46:04] [INFO ] Invariant cache hit.
[2024-05-24 17:46:05] [INFO ] State equation strengthened by 888 read => feed constraints.
[2024-05-24 17:46:17] [INFO ] Implicit Places using invariants and state equation in 12706 ms returned []
Implicit Place search using SMT with State Equation took 13705 ms to find 0 implicit places.
[2024-05-24 17:46:17] [INFO ] Redundant transitions in 78 ms returned []
Running 2579 sub problems to find dead transitions.
[2024-05-24 17:46:17] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
[2024-05-24 17:46:17] [INFO ] Invariant cache hit.
[2024-05-24 17:46:17] [INFO ] State equation strengthened by 888 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1131 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2579 unsolved
SMT process timed out in 33252ms, After SMT, problems are : Problem set: 0 solved, 2579 unsolved
Search for dead transitions found 0 dead transitions in 33279ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47153 ms. Remains : 1133/1133 places, 2596/2596 transitions.
Computed a total of 318 stabilizing places and 980 stable transitions
Computed a total of 318 stabilizing places and 980 stable transitions
Detected a total of 318/1133 stabilizing places and 980/2596 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p2 p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 235 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (904 resets) in 1354 ms. (29 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (188 resets) in 359 ms. (111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (188 resets) in 287 ms. (138 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (188 resets) in 299 ms. (133 steps per ms) remains 3/3 properties
[2024-05-24 17:46:51] [INFO ] Flow matrix only has 2324 transitions (discarded 272 similar events)
[2024-05-24 17:46:51] [INFO ] Invariant cache hit.
[2024-05-24 17:46:51] [INFO ] State equation strengthened by 888 read => feed constraints.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1032/1036 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1036 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 17/1053 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1053 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 40/1093 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1093 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 28/1121 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1121 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 12/1133 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1133 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2324/3457 variables, 1133/1184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3457 variables, 888/2072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3457 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/3457 variables, 0/2072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3457/3457 variables, and 2072 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1227 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 1133/1133 constraints, ReadFeed: 888/888 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1032/1036 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1036 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 17/1053 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1053 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 5 (OVERLAPS) 40/1093 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-24 17:46:53] [INFO ] Deduced a trap composed of 47 places in 469 ms of which 7 ms to minimize.
[2024-05-24 17:46:54] [INFO ] Deduced a trap composed of 84 places in 453 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1093 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1093 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/1121 variables, 28/41 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1121 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 12/1133 variables, 12/53 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-24 17:46:54] [INFO ] Deduced a trap composed of 98 places in 469 ms of which 6 ms to minimize.
[2024-05-24 17:46:55] [INFO ] Deduced a trap composed of 142 places in 465 ms of which 7 ms to minimize.
[2024-05-24 17:46:55] [INFO ] Deduced a trap composed of 100 places in 522 ms of which 7 ms to minimize.
[2024-05-24 17:46:56] [INFO ] Deduced a trap composed of 99 places in 535 ms of which 7 ms to minimize.
[2024-05-24 17:46:56] [INFO ] Deduced a trap composed of 83 places in 564 ms of which 8 ms to minimize.
[2024-05-24 17:46:57] [INFO ] Deduced a trap composed of 146 places in 554 ms of which 6 ms to minimize.
[2024-05-24 17:46:58] [INFO ] Deduced a trap composed of 93 places in 456 ms of which 6 ms to minimize.
SMT process timed out in 6385ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1133/1133 places, 2596/2596 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1133 transition count 2594
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1131 transition count 2594
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 1129 transition count 2592
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1129 transition count 2592
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 1127 transition count 2580
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1127 transition count 2580
Free-agglomeration rule (complex) applied 141 times.
Iterating global reduction 2 with 141 rules applied. Total rules applied 153 place count 1127 transition count 3739
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 2 with 141 rules applied. Total rules applied 294 place count 986 transition count 3739
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 300 place count 986 transition count 3739
Applied a total of 300 rules in 404 ms. Remains 986 /1133 variables (removed 147) and now considering 3739/2596 (removed -1143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 405 ms. Remains : 986/1133 places, 3739/2596 transitions.
RANDOM walk for 33111 steps (933 resets) in 937 ms. (35 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 12 factoid took 425 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 2267 reset in 594 ms.
Product exploration explored 100000 steps with 2264 reset in 614 ms.
Built C files in :
/tmp/ltsmin18335026371035712272
[2024-05-24 17:47:00] [INFO ] Too many transitions (2596) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:47:00] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18335026371035712272
Running compilation step : cd /tmp/ltsmin18335026371035712272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18335026371035712272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18335026371035712272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 1133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1133/1133 places, 2596/2596 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1133 transition count 2594
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1131 transition count 2594
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 1129 transition count 2592
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1129 transition count 2592
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 1127 transition count 2580
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1127 transition count 2580
Applied a total of 12 rules in 204 ms. Remains 1127 /1133 variables (removed 6) and now considering 2580/2596 (removed 16) transitions.
[2024-05-24 17:47:03] [INFO ] Flow matrix only has 2308 transitions (discarded 272 similar events)
// Phase 1: matrix 2308 rows 1127 cols
[2024-05-24 17:47:04] [INFO ] Computed 51 invariants in 31 ms
[2024-05-24 17:47:04] [INFO ] Implicit Places using invariants in 964 ms returned [538, 740]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 966 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1125/1133 places, 2580/2596 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1123 transition count 2578
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1121 transition count 2576
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1121 transition count 2576
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1119 transition count 2564
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1119 transition count 2564
Applied a total of 12 rules in 213 ms. Remains 1119 /1125 variables (removed 6) and now considering 2564/2580 (removed 16) transitions.
[2024-05-24 17:47:05] [INFO ] Flow matrix only has 2292 transitions (discarded 272 similar events)
// Phase 1: matrix 2292 rows 1119 cols
[2024-05-24 17:47:05] [INFO ] Computed 49 invariants in 26 ms
[2024-05-24 17:47:06] [INFO ] Implicit Places using invariants in 1075 ms returned []
[2024-05-24 17:47:06] [INFO ] Flow matrix only has 2292 transitions (discarded 272 similar events)
[2024-05-24 17:47:06] [INFO ] Invariant cache hit.
[2024-05-24 17:47:06] [INFO ] State equation strengthened by 868 read => feed constraints.
[2024-05-24 17:47:18] [INFO ] Implicit Places using invariants and state equation in 12374 ms returned []
Implicit Place search using SMT with State Equation took 13457 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1119/1133 places, 2564/2596 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14842 ms. Remains : 1119/1133 places, 2564/2596 transitions.
Built C files in :
/tmp/ltsmin11368666689849024813
[2024-05-24 17:47:18] [INFO ] Too many transitions (2564) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:47:18] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11368666689849024813
Running compilation step : cd /tmp/ltsmin11368666689849024813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11368666689849024813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11368666689849024813;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 17:47:21] [INFO ] Flatten gal took : 74 ms
[2024-05-24 17:47:21] [INFO ] Flatten gal took : 52 ms
[2024-05-24 17:47:21] [INFO ] Time to serialize gal into /tmp/LTL7565488853255780914.gal : 10 ms
[2024-05-24 17:47:21] [INFO ] Time to serialize properties into /tmp/LTL15734667542076950719.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7565488853255780914.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6246794640066702812.hoa' '-atoms' '/tmp/LTL15734667542076950719.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15734667542076950719.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6246794640066702812.hoa
Detected timeout of ITS tools.
[2024-05-24 17:47:36] [INFO ] Flatten gal took : 52 ms
[2024-05-24 17:47:37] [INFO ] Flatten gal took : 52 ms
[2024-05-24 17:47:37] [INFO ] Time to serialize gal into /tmp/LTL9385610252926626617.gal : 10 ms
[2024-05-24 17:47:37] [INFO ] Time to serialize properties into /tmp/LTL17087619982906737605.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9385610252926626617.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17087619982906737605.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("((Node8HasTheLeafSetOfLx1ToReplaceNode4<=Node13HasTheLeafSetOfRx2ToReplaceNode15)&&(Node10HasTheLeafSetOfRx4ToReplaceNode16<=...398
Formula 0 simplified : X(F!"((Node8HasTheLeafSetOfLx1ToReplaceNode4<=Node13HasTheLeafSetOfRx2ToReplaceNode15)&&(Node10HasTheLeafSetOfRx4ToReplaceNode16<=No...386
Detected timeout of ITS tools.
[2024-05-24 17:47:52] [INFO ] Flatten gal took : 54 ms
[2024-05-24 17:47:52] [INFO ] Applying decomposition
[2024-05-24 17:47:52] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7305410937586376457.txt' '-o' '/tmp/graph7305410937586376457.bin' '-w' '/tmp/graph7305410937586376457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7305410937586376457.bin' '-l' '-1' '-v' '-w' '/tmp/graph7305410937586376457.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:47:52] [INFO ] Decomposing Gal with order
[2024-05-24 17:47:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:47:52] [INFO ] Removed a total of 173 redundant transitions.
[2024-05-24 17:47:52] [INFO ] Flatten gal took : 86 ms
[2024-05-24 17:47:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 2 ms.
[2024-05-24 17:47:52] [INFO ] Time to serialize gal into /tmp/LTL17797125059059461840.gal : 10 ms
[2024-05-24 17:47:52] [INFO ] Time to serialize properties into /tmp/LTL7469849126565816194.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17797125059059461840.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7469849126565816194.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G("((gu16.Node8HasTheLeafSetOfLx1ToReplaceNode4<=gu16.Node13HasTheLeafSetOfRx2ToReplaceNode15)&&(gu12.Node10HasTheLeafSetOfRx4To...438
Formula 0 simplified : X(F!"((gu16.Node8HasTheLeafSetOfLx1ToReplaceNode4<=gu16.Node13HasTheLeafSetOfRx2ToReplaceNode15)&&(gu12.Node10HasTheLeafSetOfRx4ToRe...426
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-LTLCardinality-14 finished in 195979 ms.
[2024-05-24 17:48:07] [INFO ] Flatten gal took : 69 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13178064079183745468
[2024-05-24 17:48:07] [INFO ] Too many transitions (3070) to apply POR reductions. Disabling POR matrices.
[2024-05-24 17:48:07] [INFO ] Applying decomposition
[2024-05-24 17:48:07] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13178064079183745468
Running compilation step : cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '102' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 17:48:07] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1672110477138502391.txt' '-o' '/tmp/graph1672110477138502391.bin' '-w' '/tmp/graph1672110477138502391.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1672110477138502391.bin' '-l' '-1' '-v' '-w' '/tmp/graph1672110477138502391.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:48:08] [INFO ] Decomposing Gal with order
[2024-05-24 17:48:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:48:08] [INFO ] Removed a total of 2710 redundant transitions.
[2024-05-24 17:48:08] [INFO ] Flatten gal took : 195 ms
[2024-05-24 17:48:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 26 ms.
[2024-05-24 17:48:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality4043480285161092274.gal : 15 ms
[2024-05-24 17:48:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality6261485041703021271.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4043480285161092274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6261485041703021271.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 7 LTL properties
Checking formula 0 : !((F(G("(gu153.Node11HasTheLeafSetOfRx4ToReplaceNode8<=gu153.Node7HasTheLeafSetOfLx3ToReplaceNode2)"))))
Formula 0 simplified : GF!"(gu153.Node11HasTheLeafSetOfRx4ToReplaceNode8<=gu153.Node7HasTheLeafSetOfLx3ToReplaceNode2)"
Compilation finished in 9152 ms.
Running link step : cd /tmp/ltsmin13178064079183745468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp2==true)))||[]((LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>((LTLAPp2==true)))||[]((LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp5==true)) U []((LTLAPp6==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp5==true)) U []((LTLAPp6==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp7==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp7==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp8==true))||[](((LTLAPp9==true)||X([]((LTLAPp10==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>73 s) on command cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp8==true))||[](((LTLAPp9==true)||X([]((LTLAPp10==true)))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 4112 s
Running LTSmin : cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>587 s) on command cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13178064079183745468;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-24 18:07:35] [INFO ] Flatten gal took : 546 ms
[2024-05-24 18:07:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality18127454360347418161.gal : 32 ms
[2024-05-24 18:07:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality7734915559684244722.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18127454360347418161.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7734915559684244722.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 7 LTL properties
Checking formula 0 : !((F(G("(Node11HasTheLeafSetOfRx4ToReplaceNode8<=Node7HasTheLeafSetOfLx3ToReplaceNode2)"))))
Formula 0 simplified : GF!"(Node11HasTheLeafSetOfRx4ToReplaceNode8<=Node7HasTheLeafSetOfLx3ToReplaceNode2)"
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-S16C06"
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-5568"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C06, 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 r246-tall-171654350700035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C06.tgz
mv MultiCrashLeafsetExtension-PT-S16C06 execution
cd execution
if [ "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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;