About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S24C05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3403803.00 | 0.00 | 0.00 | TTT?TT?FTFF?FTTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r246-tall-171654350800084.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-S24C05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654350800084
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K 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 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 06:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 12 06:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 19 15:28 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 12M 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-S24C05-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716588250224
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 22:04:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 22:04:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 22:04:12] [INFO ] Load time of PNML (sax parser for PT used): 622 ms
[2024-05-24 22:04:12] [INFO ] Transformed 11106 places.
[2024-05-24 22:04:12] [INFO ] Transformed 16561 transitions.
[2024-05-24 22:04:12] [INFO ] Parsed PT model containing 11106 places and 16561 transitions and 65150 arcs in 804 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 11106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11106/11106 places, 16561/16561 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 11068 transition count 16561
Discarding 2984 places :
Symmetric choice reduction at 1 with 2984 rule applications. Total rules 3022 place count 8084 transition count 13577
Iterating global reduction 1 with 2984 rules applied. Total rules applied 6006 place count 8084 transition count 13577
Discarding 2735 places :
Symmetric choice reduction at 1 with 2735 rule applications. Total rules 8741 place count 5349 transition count 10842
Iterating global reduction 1 with 2735 rules applied. Total rules applied 11476 place count 5349 transition count 10842
Discarding 533 places :
Symmetric choice reduction at 1 with 533 rule applications. Total rules 12009 place count 4816 transition count 8177
Iterating global reduction 1 with 533 rules applied. Total rules applied 12542 place count 4816 transition count 8177
Applied a total of 12542 rules in 3262 ms. Remains 4816 /11106 variables (removed 6290) and now considering 8177/16561 (removed 8384) transitions.
[2024-05-24 22:04:15] [INFO ] Flow matrix only has 7577 transitions (discarded 600 similar events)
// Phase 1: matrix 7577 rows 4816 cols
[2024-05-24 22:04:16] [INFO ] Computed 937 invariants in 409 ms
[2024-05-24 22:04:24] [INFO ] Implicit Places using invariants in 8958 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 27, 34, 43, 54, 67, 82, 99, 118, 139, 162, 186, 210, 212, 214, 216, 218, 220, 241, 260, 277, 292, 305, 316, 325, 332, 337, 340, 363, 370, 373, 374, 375, 376, 377, 378, 381, 386, 393, 402, 413, 426, 441, 458, 477, 498, 521, 543, 544, 546, 547, 548, 567, 584, 599, 612, 623, 632, 639, 644, 649, 651, 681, 684, 685, 686, 687, 688, 689, 691, 694, 699, 706, 715, 726, 739, 754, 771, 790, 810, 830, 831, 832, 833, 834, 835, 852, 867, 880, 891, 900, 907, 912, 915, 917, 919, 942, 949, 952, 953, 954, 955, 956, 957, 959, 961, 964, 969, 976, 985, 996, 1009, 1024, 1041, 1059, 1077, 1078, 1079, 1080, 1081, 1082, 1097, 1110, 1121, 1130, 1137, 1142, 1145, 1147, 1149, 1151, 1174, 1181, 1184, 1185, 1186, 1188, 1189, 1191, 1193, 1195, 1201, 1206, 1213, 1222, 1233, 1246, 1261, 1277, 1293, 1294, 1295, 1297, 1298, 1311, 1322, 1331, 1338, 1343, 1346, 1348, 1350, 1352, 1357, 1380, 1387, 1390, 1391, 1392, 1393, 1394, 1395, 1397, 1399, 1401, 1403, 1406, 1411, 1418, 1427, 1438, 1451, 1465, 1479, 1480, 1481, 1482, 1483, 1484, 1495, 1504, 1511, 1516, 1519, 1521, 1523, 1525, 1527, 1529, 1552, 1559, 1562, 1563, 1565, 1566, 1567, 1569, 1571, 1573, 1575, 1577, 1580, 1585, 1592, 1601, 1612, 1626, 1638, 1639, 1640, 1641, 1642, 1643, 1652, 1659, 1664, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1702, 1709, 1712, 1713, 1714, 1715, 1716, 1717, 1719, 1721, 1723, 1725, 1727, 1729, 1732, 1737, 1744, 1753, 1763, 1773, 1774, 1775, 1776, 1777, 1778, 1785, 1790, 1793, 1795, 1797, 1799, 1801, 1803, 1805, 1807, 1830, 1837, 1840, 1841, 1842, 1843, 1844, 1845, 1847, 1849, 1851, 1853, 1855, 1857, 1859, 1862, 1867, 1874, 1882, 1890, 1891, 1892, 1893, 1894, 1895, 1900, 1903, 1905, 1907, 1909, 1911, 1913, 1915, 1917, 1919, 1942, 1949, 1952, 1953, 1954, 1955, 1956, 1957, 1959, 1961, 1963, 1965, 1967, 1969, 1971, 1974, 1977, 1982, 1988, 1994, 1995, 1996, 1997, 1998, 1999, 2002, 2004, 2006, 2008, 2010, 2012, 2015, 2017, 2019, 2021, 2044, 2051, 2054, 2055, 2056, 2057, 2058, 2059, 2061, 2063, 2065, 2067, 2069, 2071, 2073, 2075, 2077, 2080, 2084, 2088, 2089, 2090, 2092, 2093, 2097, 2099, 2101, 2103, 2105, 2107, 2109, 2111, 2113, 2115, 2138, 2145, 2148, 2149, 2150, 2151, 2152, 2153, 2155, 2157, 2159, 2161, 2163, 2165, 2167, 2169, 2171, 2173, 2175, 2179, 2181, 2182, 2183, 2189, 2191, 2193, 2195, 2197, 2199, 2201, 2203, 2205, 2207, 2230, 2232, 2236, 2239, 2240, 2241, 2242, 2243, 2246, 2248, 2250, 2252, 2254, 2256, 2258, 2260, 2262, 2264, 2266, 2269, 2271, 2272, 2273, 2274, 2276, 2278, 2280, 2282, 2284, 2286, 2288, 2290, 2294, 2296, 2319, 2326, 2329, 2331, 2332, 2333, 2334, 2338, 2340, 2342, 2344, 2346, 2348, 2350, 2352, 2354, 2356, 2358, 2361, 2362, 2363, 2364, 2365, 2366, 2368, 2370, 2372, 2374, 2376, 2378, 2380, 2382, 2384, 2386, 2409, 2416, 2419, 2420, 2421, 2422, 2423, 2424, 2426, 2428, 2430, 2432, 2434, 2436, 2438, 2440, 2442, 2444, 2447, 2452, 2453, 2455, 2456, 2457, 2463, 2465, 2467, 2469, 2471, 2473, 2475, 2477, 2479, 2481, 2504, 2511, 2514, 2515, 2516, 2517, 2519, 2523, 2525, 2527, 2529, 2531, 2533, 2535, 2537, 2539, 2542, 2547, 2554, 2555, 2556, 2557, 2558, 2559, 2564, 2567, 2569, 2571, 2573, 2575, 2577, 2579, 2581, 2583, 2606, 2613, 2616, 2617, 2618, 2619, 2620, 2621, 2623, 2625, 2627, 2629, 2631, 2633, 2635, 2637, 2640, 2645, 2652, 2661, 2662, 2663, 2664, 2665, 2666, 2673, 2678, 2681, 2683, 2685, 2687, 2689, 2691, 2693, 2695, 2718, 2725, 2728, 2729, 2730, 2731, 2732, 2733, 2735, 2737, 2739, 2741, 2743, 2745, 2747, 2750, 2755, 2762, 2771, 2782, 2783, 2785, 2786, 2787, 2798, 2805, 2810, 2813, 2815, 2817, 2819, 2821, 2823, 2825, 2848, 2855, 2858, 2859, 2860, 2861, 2862, 2863, 2865, 2867, 2869, 2871, 2873, 2875, 2878, 2883, 2890, 2899, 2910, 2923, 2924, 2926, 2927, 2928, 2942, 2951, 2958, 2963, 2966, 2968, 2970, 2972, 2974, 2976, 2999, 3006, 3009, 3010, 3011, 3013, 3014, 3016, 3018, 3020, 3022, 3024, 3027, 3034, 3041, 3050, 3061, 3074, 3089, 3090, 3091, 3092, 3093, 3094, 3107, 3118, 3127, 3134, 3139, 3142, 3144, 3146, 3148, 3150, 3173, 3180, 3183, 3184, 3185, 3186, 3187, 3188, 3190, 3192, 3194, 3196, 3199, 3204, 3211, 3220, 3231, 3244, 3259, 3276, 3277, 3278, 3279, 3280, 3281, 3296, 3309, 3320, 3329, 3336, 3341, 3344, 3346, 3348, 3350, 3373, 3380, 3383, 3384, 3385, 3386, 3387, 3388, 3390, 3392, 3394, 3397, 3402, 3409, 3418, 3429, 3442, 3457, 3474, 3493, 3494, 3495, 3496, 3497, 3498, 3515, 3530, 3543, 3554, 3563, 3570, 3575, 3578, 3580, 3582, 3605, 3612, 3615, 3616, 3617, 3618, 3619, 3620, 3622, 3624, 3627, 3632, 3639, 3648, 3659, 3672, 3687, 3704, 3723, 3744, 3745, 3746, 3747, 3748, 3749, 3768, 3785, 3800, 3813, 3824, 3833, 3840, 3845, 3848, 3850, 3873, 3880, 3883, 3884, 3885, 3886, 3887, 3888, 3890, 3893, 3898, 3905, 3914, 3925, 3938, 3953, 3970, 3989, 4010, 4033, 4034, 4035, 4038, 4039, 4062, 4081, 4098, 4113, 4126, 4137, 4146, 4153, 4158, 4161, 4184, 4186, 4190, 4193, 4194, 4195, 4196, 4197, 4198, 4201, 4206, 4213, 4222, 4233, 4246, 4261, 4278, 4297, 4318, 4341, 4366, 4367, 4368, 4369, 4370, 4371, 4394, 4415, 4434, 4451, 4466, 4479, 4490, 4499, 4506, 4511, 4535]
[2024-05-24 22:04:24] [INFO ] Actually due to overlaps returned [363, 942, 1174, 1380, 1552, 1702, 1830, 1942, 2044, 2138, 2230, 2319, 2409, 2504, 2606, 2718, 2848, 2999, 3173, 3373, 3605, 3873, 4184, 4535, 4, 8, 12, 14, 16, 18, 20, 210, 212, 214, 216, 218, 373, 374, 375, 376, 377, 543, 544, 546, 547, 684, 685, 686, 687, 688, 689, 830, 831, 832, 833, 834, 952, 953, 954, 955, 956, 957, 1077, 1078, 1079, 1080, 1081, 1184, 1185, 1186, 1188, 1189, 1293, 1294, 1295, 1297, 1390, 1391, 1392, 1393, 1394, 1395, 1479, 1480, 1481, 1482, 1483, 1562, 1563, 1565, 1566, 1567, 1638, 1639, 1640, 1641, 1642, 1712, 1713, 1714, 1715, 1716, 1717, 1773, 1774, 1775, 1776, 1777, 1840, 1841, 1842, 1843, 1844, 1845, 1890, 1891, 1892, 1893, 1894, 1952, 1953, 1954, 1955, 1956, 1957, 1994, 1995, 1996, 1997, 1998, 2054, 2055, 2056, 2057, 2058, 2059, 2088, 2089, 2090, 2092, 2148, 2149, 2150, 2151, 2152, 2153, 2179, 2181, 2182, 2232, 2239, 2240, 2241, 2242, 2243, 2269, 2271, 2272, 2273, 2329, 2331, 2332, 2333, 2334, 2361, 2362, 2363, 2364, 2365, 2419, 2420, 2421, 2422, 2423, 2424, 2452, 2453, 2455, 2456, 2514, 2515, 2516, 2517, 2519, 2554, 2555, 2556, 2557, 2558, 2616, 2617, 2618, 2619, 2620, 2621, 2661, 2662, 2663, 2664, 2665, 2728, 2729, 2730, 2731, 2732, 2733, 2782, 2783, 2785, 2786, 2858, 2859, 2860, 2861, 2862, 2863, 2923, 2924, 2926, 2927, 3009, 3010, 3011, 3013, 3014, 3089, 3090, 3091, 3092, 3093, 3183, 3184, 3185, 3186, 3187, 3188, 3276, 3277, 3278, 3279, 3280, 3383, 3384, 3385, 3386, 3387, 3388, 3493, 3494, 3495, 3496, 3497, 3615, 3616, 3617, 3618, 3619, 3620, 3744, 3745, 3746, 3747, 3748, 3883, 3884, 3885, 3886, 3887, 3888, 4033, 4034, 4035, 4038, 4186, 4193, 4194, 4195, 4196, 4197, 4198, 4366, 4367, 4368, 4369, 4370]
Discarding 285 places :
Implicit Place search using SMT only with invariants took 9004 ms to find 285 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4531/11106 places, 8177/16561 transitions.
Discarding 225 places :
Symmetric choice reduction at 0 with 225 rule applications. Total rules 225 place count 4306 transition count 7952
Iterating global reduction 0 with 225 rules applied. Total rules applied 450 place count 4306 transition count 7952
Discarding 225 places :
Symmetric choice reduction at 0 with 225 rule applications. Total rules 675 place count 4081 transition count 7727
Iterating global reduction 0 with 225 rules applied. Total rules applied 900 place count 4081 transition count 7727
Discarding 225 places :
Symmetric choice reduction at 0 with 225 rule applications. Total rules 1125 place count 3856 transition count 7502
Iterating global reduction 0 with 225 rules applied. Total rules applied 1350 place count 3856 transition count 7502
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 1384 place count 3822 transition count 7332
Iterating global reduction 0 with 34 rules applied. Total rules applied 1418 place count 3822 transition count 7332
Applied a total of 1418 rules in 1715 ms. Remains 3822 /4531 variables (removed 709) and now considering 7332/8177 (removed 845) transitions.
[2024-05-24 22:04:26] [INFO ] Flow matrix only has 6732 transitions (discarded 600 similar events)
// Phase 1: matrix 6732 rows 3822 cols
[2024-05-24 22:04:26] [INFO ] Computed 652 invariants in 207 ms
[2024-05-24 22:04:32] [INFO ] Implicit Places using invariants in 5905 ms returned [15, 20, 27, 36, 47, 60, 75, 92, 111, 132, 155, 179, 208, 229, 248, 265, 280, 293, 304, 313, 320, 325, 328, 357, 359, 362, 367, 374, 383, 394, 407, 422, 439, 458, 479, 502, 525, 544, 561, 576, 589, 600, 609, 616, 621, 626, 628, 640, 643, 646, 651, 658, 667, 678, 691, 706, 723, 742, 762, 781, 798, 813, 826, 837, 846, 853, 858, 861, 863, 865, 874, 877, 879, 882, 887, 894, 903, 914, 927, 942, 959, 977, 994, 1009, 1022, 1033, 1042, 1049, 1054, 1057, 1059, 1061, 1063, 1072, 1077, 1079, 1081, 1087, 1092, 1099, 1108, 1119, 1132, 1147, 1163, 1180, 1193, 1204, 1213, 1220, 1225, 1228, 1230, 1232, 1234, 1239, 1252, 1255, 1257, 1259, 1261, 1264, 1269, 1276, 1285, 1296, 1309, 1323, 1336, 1347, 1356, 1363, 1368, 1371, 1373, 1375, 1377, 1379, 1381, 1390, 1395, 1397, 1399, 1401, 1403, 1406, 1411, 1418, 1427, 1438, 1452, 1463, 1472, 1479, 1484, 1487, 1489, 1491, 1493, 1495, 1497, 1499, 1510, 1513, 1515, 1517, 1519, 1521, 1523, 1526, 1531, 1538, 1547, 1557, 1566, 1573, 1578, 1581, 1583, 1585, 1587, 1589, 1591, 1593, 1595, 1604, 1607, 1609, 1611, 1613, 1615, 1617, 1619, 1622, 1627, 1634, 1642, 1649, 1654, 1657, 1659, 1661, 1663, 1665, 1667, 1669, 1671, 1673, 1682, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1700, 1703, 1708, 1714, 1719, 1722, 1724, 1726, 1728, 1730, 1732, 1735, 1737, 1739, 1741, 1750, 1753, 1755, 1757, 1759, 1761, 1763, 1765, 1767, 1769, 1772, 1776, 1781, 1785, 1787, 1789, 1791, 1793, 1795, 1797, 1799, 1801, 1803, 1814, 1817, 1819, 1821, 1823, 1825, 1827, 1829, 1831, 1833, 1835, 1837, 1842, 1848, 1850, 1852, 1854, 1856, 1858, 1860, 1862, 1864, 1866, 1877, 1881, 1883, 1885, 1887, 1889, 1891, 1893, 1895, 1897, 1899, 1901, 1905, 1907, 1909, 1911, 1913, 1915, 1917, 1919, 1921, 1925, 1927, 1938, 1945, 1947, 1949, 1951, 1953, 1955, 1957, 1959, 1961, 1963, 1965, 1967, 1969, 1971, 1973, 1975, 1977, 1979, 1981, 1983, 1985, 1987, 1998, 2001, 2003, 2005, 2007, 2009, 2011, 2013, 2015, 2017, 2019, 2022, 2028, 2034, 2036, 2038, 2040, 2042, 2044, 2046, 2048, 2050, 2052, 2063, 2070, 2072, 2074, 2076, 2078, 2080, 2082, 2084, 2086, 2089, 2094, 2100, 2105, 2108, 2110, 2112, 2114, 2116, 2118, 2120, 2122, 2124, 2135, 2138, 2140, 2142, 2144, 2146, 2148, 2150, 2152, 2155, 2160, 2167, 2175, 2182, 2187, 2190, 2192, 2194, 2196, 2198, 2200, 2202, 2204, 2213, 2216, 2218, 2220, 2222, 2224, 2226, 2228, 2231, 2236, 2243, 2252, 2264, 2275, 2282, 2287, 2290, 2292, 2294, 2296, 2298, 2300, 2302, 2313, 2316, 2318, 2320, 2322, 2324, 2326, 2329, 2334, 2341, 2350, 2361, 2375, 2389, 2398, 2405, 2410, 2413, 2415, 2417, 2419, 2421, 2423, 2434, 2439, 2441, 2443, 2445, 2447, 2450, 2457, 2464, 2473, 2484, 2497, 2511, 2524, 2535, 2544, 2551, 2556, 2559, 2561, 2563, 2565, 2567, 2578, 2581, 2583, 2585, 2587, 2590, 2595, 2602, 2611, 2622, 2635, 2650, 2666, 2681, 2694, 2705, 2714, 2721, 2726, 2729, 2731, 2733, 2735, 2744, 2747, 2749, 2751, 2754, 2759, 2766, 2775, 2786, 2799, 2814, 2831, 2849, 2866, 2881, 2894, 2905, 2914, 2921, 2926, 2929, 2931, 2933, 2942, 2945, 2947, 2950, 2955, 2962, 2971, 2982, 2995, 3010, 3027, 3046, 3066, 3085, 3102, 3117, 3130, 3141, 3150, 3157, 3162, 3165, 3167, 3176, 3179, 3182, 3187, 3194, 3203, 3214, 3227, 3242, 3259, 3278, 3299, 3324, 3347, 3366, 3383, 3398, 3411, 3422, 3431, 3438, 3443, 3446, 3455, 3459, 3464, 3471, 3480, 3491, 3504, 3519, 3536, 3555, 3576, 3599, 3623, 3646, 3667, 3686, 3703, 3718, 3731, 3742, 3751, 3758, 3763]
Discarding 576 places :
Implicit Place search using SMT only with invariants took 5916 ms to find 576 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3246/11106 places, 7332/16561 transitions.
Applied a total of 0 rules in 288 ms. Remains 3246 /3246 variables (removed 0) and now considering 7332/7332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 20203 ms. Remains : 3246/11106 places, 7332/16561 transitions.
Support contains 62 out of 3246 places after structural reductions.
[2024-05-24 22:04:33] [INFO ] Flatten gal took : 447 ms
[2024-05-24 22:04:33] [INFO ] Flatten gal took : 284 ms
[2024-05-24 22:04:34] [INFO ] Input system was already deterministic with 7332 transitions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (772 resets) in 2169 ms. (18 steps per ms) remains 17/32 properties
BEST_FIRST walk for 4002 steps (12 resets) in 54 ms. (72 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (12 resets) in 44 ms. (88 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4000 steps (12 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (12 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (12 resets) in 37 ms. (105 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4000 steps (12 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (12 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (12 resets) in 75 ms. (52 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (12 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (12 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (12 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (12 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (12 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (12 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
[2024-05-24 22:04:35] [INFO ] Flow matrix only has 6732 transitions (discarded 600 similar events)
// Phase 1: matrix 6732 rows 3246 cols
[2024-05-24 22:04:35] [INFO ] Computed 76 invariants in 259 ms
[2024-05-24 22:04:35] [INFO ] State equation strengthened by 2734 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 2522/2556 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2556 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 3/2559 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2559 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 6 (OVERLAPS) 651/3210 variables, 19/40 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3210 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 26/3236 variables, 26/66 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3236 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 10/3246 variables, 10/76 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3246 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9978/9978 variables, and 3322 constraints, problems are : Problem set: 1 solved, 14 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 3246/3246 constraints, ReadFeed: 0/2734 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 2523/2555 variables, 16/18 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-05-24 22:04:42] [INFO ] Deduced a trap composed of 1453 places in 1520 ms of which 160 ms to minimize.
[2024-05-24 22:04:43] [INFO ] Deduced a trap composed of 1463 places in 1370 ms of which 20 ms to minimize.
[2024-05-24 22:04:45] [INFO ] Deduced a trap composed of 1489 places in 1509 ms of which 17 ms to minimize.
[2024-05-24 22:04:46] [INFO ] Deduced a trap composed of 1463 places in 999 ms of which 14 ms to minimize.
SMT process timed out in 11368ms, After SMT, problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 3246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3246/3246 places, 7332/7332 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 3246 transition count 7314
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 3228 transition count 7314
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 36 place count 3228 transition count 7296
Deduced a syphon composed of 18 places in 5 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 72 place count 3210 transition count 7296
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 80 place count 3202 transition count 7276
Iterating global reduction 2 with 8 rules applied. Total rules applied 88 place count 3202 transition count 7276
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 88 place count 3202 transition count 7273
Deduced a syphon composed of 3 places in 9 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 3199 transition count 7273
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 3195 transition count 7253
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 3195 transition count 7253
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 7 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 166 place count 3163 transition count 7221
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 172 place count 3157 transition count 7215
Iterating global reduction 2 with 6 rules applied. Total rules applied 178 place count 3157 transition count 7215
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 184 place count 3151 transition count 7185
Iterating global reduction 2 with 6 rules applied. Total rules applied 190 place count 3151 transition count 7185
Free-agglomeration rule (complex) applied 301 times.
Iterating global reduction 2 with 301 rules applied. Total rules applied 491 place count 3151 transition count 9160
Reduce places removed 301 places and 0 transitions.
Iterating post reduction 2 with 301 rules applied. Total rules applied 792 place count 2850 transition count 9160
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 800 place count 2850 transition count 9160
Applied a total of 800 rules in 3546 ms. Remains 2850 /3246 variables (removed 396) and now considering 9160/7332 (removed -1828) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3549 ms. Remains : 2850/3246 places, 9160/7332 transitions.
RANDOM walk for 40000 steps (1354 resets) in 1680 ms. (23 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (90 resets) in 144 ms. (275 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (107 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (107 resets) in 148 ms. (268 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (91 resets) in 131 ms. (303 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (106 resets) in 145 ms. (274 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (106 resets) in 146 ms. (272 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (92 resets) in 132 ms. (300 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (106 resets) in 150 ms. (264 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (108 resets) in 202 ms. (197 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (105 resets) in 150 ms. (264 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (91 resets) in 131 ms. (303 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (108 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (91 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 26691 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 13
Probabilistic random walk after 26691 steps, saw 11445 distinct states, run finished after 3005 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-24 22:04:54] [INFO ] Flow matrix only has 8281 transitions (discarded 879 similar events)
// Phase 1: matrix 8281 rows 2850 cols
[2024-05-24 22:04:54] [INFO ] Computed 76 invariants in 219 ms
[2024-05-24 22:04:54] [INFO ] State equation strengthened by 4958 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 2738/2768 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2768 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 3/2771 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2771 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 43/2814 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2814 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 26/2840 variables, 26/66 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2840 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 10/2850 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2850 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 8281/11131 variables, 2850/2926 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/11131 variables, 4958/7884 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/11131 variables, 0/7884 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/11131 variables, 0/7884 constraints. Problems are: Problem set: 8 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11131/11131 variables, and 7884 constraints, problems are : Problem set: 8 solved, 5 unsolved in 13808 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 2850/2850 constraints, ReadFeed: 4958/4958 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2737/2749 variables, 8/8 constraints. Problems are: Problem set: 8 solved, 5 unsolved
[2024-05-24 22:05:10] [INFO ] Deduced a trap composed of 127 places in 2117 ms of which 20 ms to minimize.
[2024-05-24 22:05:13] [INFO ] Deduced a trap composed of 134 places in 2094 ms of which 19 ms to minimize.
[2024-05-24 22:05:15] [INFO ] Deduced a trap composed of 371 places in 2095 ms of which 18 ms to minimize.
[2024-05-24 22:05:17] [INFO ] Deduced a trap composed of 135 places in 2094 ms of which 18 ms to minimize.
[2024-05-24 22:05:19] [INFO ] Deduced a trap composed of 198 places in 2075 ms of which 18 ms to minimize.
[2024-05-24 22:05:21] [INFO ] Deduced a trap composed of 369 places in 2080 ms of which 19 ms to minimize.
[2024-05-24 22:05:23] [INFO ] Deduced a trap composed of 2566 places in 1802 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2749 variables, 7/15 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2749 variables, 0/15 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/2750 variables, 1/16 constraints. Problems are: Problem set: 8 solved, 5 unsolved
[2024-05-24 22:05:26] [INFO ] Deduced a trap composed of 1680 places in 1804 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2750 variables, 1/17 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2750 variables, 0/17 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 50/2800 variables, 17/34 constraints. Problems are: Problem set: 8 solved, 5 unsolved
[2024-05-24 22:05:28] [INFO ] Deduced a trap composed of 5 places in 2106 ms of which 18 ms to minimize.
[2024-05-24 22:05:30] [INFO ] Deduced a trap composed of 119 places in 2265 ms of which 19 ms to minimize.
[2024-05-24 22:05:33] [INFO ] Deduced a trap composed of 182 places in 2199 ms of which 18 ms to minimize.
[2024-05-24 22:05:35] [INFO ] Deduced a trap composed of 199 places in 2171 ms of which 19 ms to minimize.
[2024-05-24 22:05:37] [INFO ] Deduced a trap composed of 174 places in 2192 ms of which 19 ms to minimize.
[2024-05-24 22:05:39] [INFO ] Deduced a trap composed of 107 places in 2061 ms of which 18 ms to minimize.
[2024-05-24 22:05:41] [INFO ] Deduced a trap composed of 134 places in 2141 ms of which 19 ms to minimize.
[2024-05-24 22:05:44] [INFO ] Deduced a trap composed of 142 places in 2260 ms of which 16 ms to minimize.
[2024-05-24 22:05:46] [INFO ] Deduced a trap composed of 126 places in 2223 ms of which 21 ms to minimize.
[2024-05-24 22:05:48] [INFO ] Deduced a trap composed of 127 places in 2207 ms of which 18 ms to minimize.
[2024-05-24 22:05:51] [INFO ] Deduced a trap composed of 113 places in 2273 ms of which 19 ms to minimize.
[2024-05-24 22:05:53] [INFO ] Deduced a trap composed of 105 places in 2254 ms of which 19 ms to minimize.
SMT process timed out in 59191ms, After SMT, problems are : Problem set: 8 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 2850 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2850/2850 places, 9160/9160 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 2850 transition count 9159
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2849 transition count 9159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 2848 transition count 9158
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2848 transition count 9158
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 2848 transition count 9158
Applied a total of 5 rules in 1259 ms. Remains 2848 /2850 variables (removed 2) and now considering 9158/9160 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1260 ms. Remains : 2848/2850 places, 9158/9160 transitions.
RANDOM walk for 40000 steps (1354 resets) in 1605 ms. (24 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (108 resets) in 176 ms. (226 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (107 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (105 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (105 resets) in 202 ms. (197 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (90 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 27629 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 5
Probabilistic random walk after 27629 steps, saw 11825 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-24 22:05:58] [INFO ] Flow matrix only has 8279 transitions (discarded 879 similar events)
// Phase 1: matrix 8279 rows 2848 cols
[2024-05-24 22:05:58] [INFO ] Computed 76 invariants in 202 ms
[2024-05-24 22:05:58] [INFO ] State equation strengthened by 4958 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2736/2748 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2748 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/2749 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2749 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 49/2798 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2798 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 40/2838 variables, 40/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2838 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 10/2848 variables, 10/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2848 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 8279/11127 variables, 2848/2924 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/11127 variables, 4958/7882 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/11127 variables, 0/7882 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/11127 variables, 0/7882 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11127/11127 variables, and 7882 constraints, problems are : Problem set: 0 solved, 5 unsolved in 11929 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 2848/2848 constraints, ReadFeed: 4958/4958 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 2736/2748 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 22:06:13] [INFO ] Deduced a trap composed of 165 places in 1990 ms of which 17 ms to minimize.
[2024-05-24 22:06:15] [INFO ] Deduced a trap composed of 268 places in 2040 ms of which 18 ms to minimize.
[2024-05-24 22:06:17] [INFO ] Deduced a trap composed of 289 places in 1984 ms of which 17 ms to minimize.
[2024-05-24 22:06:19] [INFO ] Deduced a trap composed of 198 places in 1991 ms of which 29 ms to minimize.
[2024-05-24 22:06:21] [INFO ] Deduced a trap composed of 103 places in 2057 ms of which 17 ms to minimize.
[2024-05-24 22:06:23] [INFO ] Deduced a trap composed of 237 places in 2017 ms of which 18 ms to minimize.
[2024-05-24 22:06:25] [INFO ] Deduced a trap composed of 126 places in 1973 ms of which 18 ms to minimize.
[2024-05-24 22:06:27] [INFO ] Deduced a trap composed of 354 places in 1999 ms of which 18 ms to minimize.
[2024-05-24 22:06:29] [INFO ] Deduced a trap composed of 457 places in 1986 ms of which 17 ms to minimize.
[2024-05-24 22:06:31] [INFO ] Deduced a trap composed of 370 places in 1981 ms of which 20 ms to minimize.
[2024-05-24 22:06:33] [INFO ] Deduced a trap composed of 158 places in 1897 ms of which 17 ms to minimize.
[2024-05-24 22:06:35] [INFO ] Deduced a trap composed of 126 places in 1989 ms of which 18 ms to minimize.
[2024-05-24 22:06:37] [INFO ] Deduced a trap composed of 327 places in 1987 ms of which 19 ms to minimize.
[2024-05-24 22:06:39] [INFO ] Deduced a trap composed of 253 places in 2045 ms of which 18 ms to minimize.
[2024-05-24 22:06:41] [INFO ] Deduced a trap composed of 198 places in 1987 ms of which 19 ms to minimize.
[2024-05-24 22:06:43] [INFO ] Deduced a trap composed of 225 places in 1950 ms of which 20 ms to minimize.
[2024-05-24 22:06:45] [INFO ] Deduced a trap composed of 250 places in 1982 ms of which 18 ms to minimize.
[2024-05-24 22:06:47] [INFO ] Deduced a trap composed of 292 places in 1992 ms of which 18 ms to minimize.
[2024-05-24 22:06:49] [INFO ] Deduced a trap composed of 126 places in 2031 ms of which 19 ms to minimize.
[2024-05-24 22:06:51] [INFO ] Deduced a trap composed of 2589 places in 1777 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2748 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 22:06:53] [INFO ] Deduced a trap composed of 199 places in 2057 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2748 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 22:06:56] [INFO ] Deduced a trap composed of 349 places in 1967 ms of which 18 ms to minimize.
[2024-05-24 22:06:58] [INFO ] Deduced a trap composed of 224 places in 1986 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2748 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 22:07:00] [INFO ] Deduced a trap composed of 133 places in 1989 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2748 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2748 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/2749 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2749 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 49/2798 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 22:07:03] [INFO ] Deduced a trap composed of 5 places in 2155 ms of which 18 ms to minimize.
[2024-05-24 22:07:05] [INFO ] Deduced a trap composed of 71 places in 2203 ms of which 18 ms to minimize.
[2024-05-24 22:07:08] [INFO ] Deduced a trap composed of 117 places in 2199 ms of which 18 ms to minimize.
[2024-05-24 22:07:10] [INFO ] Deduced a trap composed of 106 places in 2180 ms of which 18 ms to minimize.
[2024-05-24 22:07:12] [INFO ] Deduced a trap composed of 104 places in 2233 ms of which 19 ms to minimize.
[2024-05-24 22:07:14] [INFO ] Deduced a trap composed of 108 places in 2168 ms of which 17 ms to minimize.
[2024-05-24 22:07:16] [INFO ] Deduced a trap composed of 119 places in 2189 ms of which 18 ms to minimize.
[2024-05-24 22:07:19] [INFO ] Deduced a trap composed of 115 places in 2211 ms of which 17 ms to minimize.
[2024-05-24 22:07:21] [INFO ] Deduced a trap composed of 104 places in 2186 ms of which 17 ms to minimize.
[2024-05-24 22:07:23] [INFO ] Deduced a trap composed of 108 places in 2205 ms of which 19 ms to minimize.
[2024-05-24 22:07:25] [INFO ] Deduced a trap composed of 114 places in 2182 ms of which 17 ms to minimize.
SMT process timed out in 87475ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 12 out of 2848 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2848/2848 places, 9158/9158 transitions.
Applied a total of 0 rules in 494 ms. Remains 2848 /2848 variables (removed 0) and now considering 9158/9158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 494 ms. Remains : 2848/2848 places, 9158/9158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2848/2848 places, 9158/9158 transitions.
Applied a total of 0 rules in 467 ms. Remains 2848 /2848 variables (removed 0) and now considering 9158/9158 (removed 0) transitions.
[2024-05-24 22:07:26] [INFO ] Flow matrix only has 8279 transitions (discarded 879 similar events)
[2024-05-24 22:07:26] [INFO ] Invariant cache hit.
[2024-05-24 22:07:31] [INFO ] Implicit Places using invariants in 4846 ms returned [430, 517, 873, 953, 1346, 1378, 1379, 1398, 1411, 1430, 1475, 1614, 1687, 2431]
[2024-05-24 22:07:31] [INFO ] Actually due to overlaps returned [517, 430, 873, 953, 1346, 1378, 1379, 1411, 1430, 1475, 1614, 1687, 2431]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 4860 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2835/2848 places, 9158/9158 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2826 transition count 9149
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2826 transition count 9149
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 2817 transition count 9140
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 2817 transition count 9140
Applied a total of 36 rules in 981 ms. Remains 2817 /2835 variables (removed 18) and now considering 9140/9158 (removed 18) transitions.
[2024-05-24 22:07:32] [INFO ] Flow matrix only has 8261 transitions (discarded 879 similar events)
// Phase 1: matrix 8261 rows 2817 cols
[2024-05-24 22:07:32] [INFO ] Computed 63 invariants in 169 ms
[2024-05-24 22:07:37] [INFO ] Implicit Places using invariants in 5092 ms returned [1388]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 5100 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2816/2848 places, 9140/9158 transitions.
Applied a total of 0 rules in 484 ms. Remains 2816 /2816 variables (removed 0) and now considering 9140/9140 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 11894 ms. Remains : 2816/2848 places, 9140/9158 transitions.
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 622 stabilizing places and 2131 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-14 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' '!(X(X((!p0 U (!p0&&G((!p1||(!p0&&X((!p0 U (!p2||G(!p0))))))))))))'
Support contains 8 out of 3246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3246/3246 places, 7332/7332 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3230 transition count 7304
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3230 transition count 7304
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 44 place count 3218 transition count 7268
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 3218 transition count 7268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 3212 transition count 7238
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 3212 transition count 7238
Applied a total of 68 rules in 1610 ms. Remains 3212 /3246 variables (removed 34) and now considering 7238/7332 (removed 94) transitions.
[2024-05-24 22:07:40] [INFO ] Flow matrix only has 6638 transitions (discarded 600 similar events)
// Phase 1: matrix 6638 rows 3212 cols
[2024-05-24 22:07:40] [INFO ] Computed 76 invariants in 224 ms
[2024-05-24 22:07:44] [INFO ] Implicit Places using invariants in 4562 ms returned [487, 978, 1068, 1244, 1524, 1559, 1560, 1621, 1671, 1835, 1921, 1969, 2749]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 4568 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3199/3246 places, 7238/7332 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3186 transition count 7225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3186 transition count 7225
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 3173 transition count 7212
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 3173 transition count 7212
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 3160 transition count 7199
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 3160 transition count 7199
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 3148 transition count 7139
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 3148 transition count 7139
Applied a total of 102 rules in 2048 ms. Remains 3148 /3199 variables (removed 51) and now considering 7139/7238 (removed 99) transitions.
[2024-05-24 22:07:46] [INFO ] Flow matrix only has 6539 transitions (discarded 600 similar events)
// Phase 1: matrix 6539 rows 3148 cols
[2024-05-24 22:07:47] [INFO ] Computed 63 invariants in 212 ms
[2024-05-24 22:07:51] [INFO ] Implicit Places using invariants in 4463 ms returned []
[2024-05-24 22:07:51] [INFO ] Flow matrix only has 6539 transitions (discarded 600 similar events)
[2024-05-24 22:07:51] [INFO ] Invariant cache hit.
[2024-05-24 22:07:54] [INFO ] State equation strengthened by 2626 read => feed constraints.
[2024-05-24 22:08:24] [INFO ] Performed 973/3148 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 22:08:54] [INFO ] Performed 1545/3148 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 22:09:24] [INFO ] Performed 2148/3148 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 22:09:48] [INFO ] Implicit Places using invariants and state equation in 116657 ms returned []
Implicit Place search using SMT with State Equation took 121121 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3148/3246 places, 7139/7332 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129349 ms. Remains : 3148/3246 places, 7139/7332 transitions.
Stuttering acceptance computed with spot in 425 ms :[true, p0, p0, p0, (OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-01
Product exploration explored 100000 steps with 1936 reset in 928 ms.
Product exploration explored 100000 steps with 1934 reset in 860 ms.
Computed a total of 524 stabilizing places and 1938 stable transitions
Computed a total of 524 stabilizing places and 1938 stable transitions
Detected a total of 524/3148 stabilizing places and 1938/7139 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 436 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[true, (AND p0 p1), (OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (773 resets) in 624 ms. (64 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40004 steps (144 resets) in 338 ms. (118 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (144 resets) in 224 ms. (177 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (144 resets) in 295 ms. (135 steps per ms) remains 2/2 properties
[2024-05-24 22:09:51] [INFO ] Flow matrix only has 6539 transitions (discarded 600 similar events)
[2024-05-24 22:09:51] [INFO ] Invariant cache hit.
[2024-05-24 22:09:51] [INFO ] State equation strengthened by 2626 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf6 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Real declared 120/9687 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 2/47 constraints, Generalized P Invariants (flows): 0/16 constraints, State Equation: 0/3148 constraints, ReadFeed: 0/2626 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (AND (OR (NOT p0) (NOT p1)) (OR (NOT p0) (NOT p2)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (AND (OR p0 (NOT p1)) (OR p0 (NOT p2))))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F p1)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 12 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-01 finished in 133194 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 1 out of 3246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3246/3246 places, 7332/7332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 3246 transition count 7315
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 3229 transition count 7315
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 34 place count 3229 transition count 7293
Deduced a syphon composed of 22 places in 6 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 78 place count 3207 transition count 7293
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 90 place count 3195 transition count 7269
Iterating global reduction 2 with 12 rules applied. Total rules applied 102 place count 3195 transition count 7269
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 102 place count 3195 transition count 7264
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 112 place count 3190 transition count 7264
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 120 place count 3182 transition count 7224
Iterating global reduction 2 with 8 rules applied. Total rules applied 128 place count 3182 transition count 7224
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 7 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 190 place count 3151 transition count 7193
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 195 place count 3146 transition count 7188
Iterating global reduction 2 with 5 rules applied. Total rules applied 200 place count 3146 transition count 7188
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 205 place count 3141 transition count 7163
Iterating global reduction 2 with 5 rules applied. Total rules applied 210 place count 3141 transition count 7163
Applied a total of 210 rules in 3038 ms. Remains 3141 /3246 variables (removed 105) and now considering 7163/7332 (removed 169) transitions.
[2024-05-24 22:09:54] [INFO ] Flow matrix only has 6563 transitions (discarded 600 similar events)
// Phase 1: matrix 6563 rows 3141 cols
[2024-05-24 22:09:55] [INFO ] Computed 76 invariants in 262 ms
[2024-05-24 22:09:59] [INFO ] Implicit Places using invariants in 4876 ms returned [465, 560, 952, 1042, 1214, 1489, 1522, 1523, 1542, 1556, 1577, 1625, 1647, 1782, 1915, 2690]
[2024-05-24 22:09:59] [INFO ] Actually due to overlaps returned [560, 465, 952, 1042, 1214, 1489, 1522, 1523, 1556, 1577, 1625, 1647, 1782, 1915, 2690]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 4881 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3126/3246 places, 7163/7332 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3115 transition count 7152
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3115 transition count 7152
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 3104 transition count 7141
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 3104 transition count 7141
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 3094 transition count 7091
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 3094 transition count 7091
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 3091 transition count 7088
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 3088 transition count 7085
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 3088 transition count 7085
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 3085 transition count 7070
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 3085 transition count 7070
Applied a total of 82 rules in 3330 ms. Remains 3085 /3126 variables (removed 41) and now considering 7070/7163 (removed 93) transitions.
[2024-05-24 22:10:03] [INFO ] Flow matrix only has 6470 transitions (discarded 600 similar events)
// Phase 1: matrix 6470 rows 3085 cols
[2024-05-24 22:10:03] [INFO ] Computed 61 invariants in 184 ms
[2024-05-24 22:10:07] [INFO ] Implicit Places using invariants in 4638 ms returned [1521]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4643 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3084/3246 places, 7070/7332 transitions.
Applied a total of 0 rules in 531 ms. Remains 3084 /3084 variables (removed 0) and now considering 7070/7070 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 16423 ms. Remains : 3084/3246 places, 7070/7332 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-03
Product exploration explored 100000 steps with 2742 reset in 960 ms.
Product exploration explored 100000 steps with 2742 reset in 1000 ms.
Computed a total of 485 stabilizing places and 1894 stable transitions
Computed a total of 485 stabilizing places and 1894 stable transitions
Detected a total of 485/3084 stabilizing places and 1894/7070 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 87 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 32 ms :[(NOT p0)]
RANDOM walk for 33005 steps (902 resets) in 552 ms. (59 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 90 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 1 out of 3084 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3084/3084 places, 7070/7070 transitions.
Applied a total of 0 rules in 534 ms. Remains 3084 /3084 variables (removed 0) and now considering 7070/7070 (removed 0) transitions.
[2024-05-24 22:10:11] [INFO ] Flow matrix only has 6470 transitions (discarded 600 similar events)
// Phase 1: matrix 6470 rows 3084 cols
[2024-05-24 22:10:11] [INFO ] Computed 60 invariants in 182 ms
[2024-05-24 22:10:15] [INFO ] Implicit Places using invariants in 4589 ms returned []
[2024-05-24 22:10:15] [INFO ] Flow matrix only has 6470 transitions (discarded 600 similar events)
[2024-05-24 22:10:15] [INFO ] Invariant cache hit.
[2024-05-24 22:10:18] [INFO ] State equation strengthened by 2618 read => feed constraints.
[2024-05-24 22:10:48] [INFO ] Performed 1221/3084 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 22:11:18] [INFO ] Performed 1843/3084 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 22:11:48] [INFO ] Implicit Places using invariants and state equation in 92303 ms returned [3064]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 96897 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3083/3084 places, 7070/7070 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 3083 transition count 7069
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3082 transition count 7069
Applied a total of 2 rules in 563 ms. Remains 3082 /3083 variables (removed 1) and now considering 7069/7070 (removed 1) transitions.
[2024-05-24 22:11:48] [INFO ] Flow matrix only has 6469 transitions (discarded 600 similar events)
// Phase 1: matrix 6469 rows 3082 cols
[2024-05-24 22:11:48] [INFO ] Computed 59 invariants in 188 ms
[2024-05-24 22:11:53] [INFO ] Implicit Places using invariants in 4522 ms returned []
[2024-05-24 22:11:53] [INFO ] Flow matrix only has 6469 transitions (discarded 600 similar events)
[2024-05-24 22:11:53] [INFO ] Invariant cache hit.
[2024-05-24 22:11:56] [INFO ] State equation strengthened by 2618 read => feed constraints.
[2024-05-24 22:12:26] [INFO ] Performed 1084/3082 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 22:12:56] [INFO ] Performed 1743/3082 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 22:13:26] [INFO ] Performed 2851/3082 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 22:13:33] [INFO ] Implicit Places using invariants and state equation in 100301 ms returned []
Implicit Place search using SMT with State Equation took 104824 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3082/3084 places, 7069/7070 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 202819 ms. Remains : 3082/3084 places, 7069/7070 transitions.
Computed a total of 483 stabilizing places and 1893 stable transitions
Computed a total of 483 stabilizing places and 1893 stable transitions
Detected a total of 483/3082 stabilizing places and 1893/7069 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 118 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 50 ms :[(NOT p0)]
RANDOM walk for 27817 steps (761 resets) in 316 ms. (87 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 125 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 p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2740 reset in 936 ms.
Product exploration explored 100000 steps with 2745 reset in 962 ms.
Built C files in :
/tmp/ltsmin15558518310062282998
[2024-05-24 22:13:36] [INFO ] Too many transitions (7069) to apply POR reductions. Disabling POR matrices.
[2024-05-24 22:13:36] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15558518310062282998
Running compilation step : cd /tmp/ltsmin15558518310062282998;'/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/ltsmin15558518310062282998;'/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/ltsmin15558518310062282998;'/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 1 out of 3082 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3082/3082 places, 7069/7069 transitions.
Applied a total of 0 rules in 575 ms. Remains 3082 /3082 variables (removed 0) and now considering 7069/7069 (removed 0) transitions.
[2024-05-24 22:13:39] [INFO ] Flow matrix only has 6469 transitions (discarded 600 similar events)
[2024-05-24 22:13:39] [INFO ] Invariant cache hit.
[2024-05-24 22:13:44] [INFO ] Implicit Places using invariants in 4448 ms returned []
[2024-05-24 22:13:44] [INFO ] Flow matrix only has 6469 transitions (discarded 600 similar events)
[2024-05-24 22:13:44] [INFO ] Invariant cache hit.
[2024-05-24 22:13:47] [INFO ] State equation strengthened by 2618 read => feed constraints.
[2024-05-24 22:14:17] [INFO ] Performed 1079/3082 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 22:14:47] [INFO ] Performed 1653/3082 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 22:15:17] [INFO ] Performed 2741/3082 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 22:15:27] [INFO ] Implicit Places using invariants and state equation in 102707 ms returned []
Implicit Place search using SMT with State Equation took 107157 ms to find 0 implicit places.
[2024-05-24 22:15:27] [INFO ] Redundant transitions in 682 ms returned []
Running 7044 sub problems to find dead transitions.
[2024-05-24 22:15:27] [INFO ] Flow matrix only has 6469 transitions (discarded 600 similar events)
[2024-05-24 22:15:27] [INFO ] Invariant cache hit.
[2024-05-24 22:15:27] [INFO ] State equation strengthened by 2618 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 0.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 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.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 0.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 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.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 1.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 0.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 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.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 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.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 1.0)
(s266 0.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 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 1.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 1.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 0.0)
(s558 0.0)
(s559 1.0)
(s560 0.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 1.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 1.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 1.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 1.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 1.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 1.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 1.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 1.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 1.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 1.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 1.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 1.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 1.0)
(s762 0.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 0.0)
(s768 0.0)
(s769 1.0)
(s770 0.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 0.0)
(s777 1.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 1.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 1.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 1.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 1.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 1.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 1.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 1.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 1.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 1.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 1.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 1.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 1.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 1.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 1.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 1.0)
(s935 0.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 0.0)
(s942 0.0)
(s943 1.0)
(s944 0.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 0.0)
(s952 1.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 1.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 1.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 1.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 1.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 1.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 1.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 1.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 1.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 1.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 1.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 1.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 1.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 1.0)
(s1076 0.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 0.0)
(s1084 0.0)
(s1085 1.0)
(s1086 0.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 0.0)
(s1095 1.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 1.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 1.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 1.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(timeout
s1122 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3080 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7044 unsolved
SMT process timed out in 45747ms, After SMT, problems are : Problem set: 0 solved, 7044 unsolved
Search for dead transitions found 0 dead transitions in 45824ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 154278 ms. Remains : 3082/3082 places, 7069/7069 transitions.
Built C files in :
/tmp/ltsmin7066348701442221260
[2024-05-24 22:16:13] [INFO ] Too many transitions (7069) to apply POR reductions. Disabling POR matrices.
[2024-05-24 22:16:13] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7066348701442221260
Running compilation step : cd /tmp/ltsmin7066348701442221260;'/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/ltsmin7066348701442221260;'/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/ltsmin7066348701442221260;'/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 22:16:17] [INFO ] Flatten gal took : 218 ms
[2024-05-24 22:16:17] [INFO ] Flatten gal took : 177 ms
[2024-05-24 22:16:17] [INFO ] Time to serialize gal into /tmp/LTL5500010592353250018.gal : 65 ms
[2024-05-24 22:16:17] [INFO ] Time to serialize properties into /tmp/LTL9148512175110307897.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/LTL5500010592353250018.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12352271453017516228.hoa' '-atoms' '/tmp/LTL9148512175110307897.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/LTL9148512175110307897.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12352271453017516228.hoa
Detected timeout of ITS tools.
[2024-05-24 22:16:32] [INFO ] Flatten gal took : 163 ms
[2024-05-24 22:16:33] [INFO ] Flatten gal took : 164 ms
[2024-05-24 22:16:33] [INFO ] Time to serialize gal into /tmp/LTL11918096999817878930.gal : 35 ms
[2024-05-24 22:16:33] [INFO ] Time to serialize properties into /tmp/LTL14891988026386393551.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/LTL11918096999817878930.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14891988026386393551.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("(Node18HasTheLeafSetOfRx2ToReplaceNode13<1)"))))
Formula 0 simplified : GF!"(Node18HasTheLeafSetOfRx2ToReplaceNode13<1)"
Detected timeout of ITS tools.
[2024-05-24 22:16:48] [INFO ] Flatten gal took : 160 ms
[2024-05-24 22:16:48] [INFO ] Applying decomposition
[2024-05-24 22:16:48] [INFO ] Flatten gal took : 165 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/graph7208216909952514027.txt' '-o' '/tmp/graph7208216909952514027.bin' '-w' '/tmp/graph7208216909952514027.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7208216909952514027.bin' '-l' '-1' '-v' '-w' '/tmp/graph7208216909952514027.weights' '-q' '0' '-e' '0.001'
[2024-05-24 22:16:48] [INFO ] Decomposing Gal with order
[2024-05-24 22:16:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 22:16:50] [INFO ] Removed a total of 6632 redundant transitions.
[2024-05-24 22:16:50] [INFO ] Flatten gal took : 1200 ms
[2024-05-24 22:16:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 3742 labels/synchronizations in 401 ms.
[2024-05-24 22:16:51] [INFO ] Time to serialize gal into /tmp/LTL15159341138388339076.gal : 59 ms
[2024-05-24 22:16:51] [INFO ] Time to serialize properties into /tmp/LTL9494864345213657689.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/LTL15159341138388339076.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9494864345213657689.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(i30.u203.Node18HasTheLeafSetOfRx2ToReplaceNode13<1)"))))
Formula 0 simplified : GF!"(i30.u203.Node18HasTheLeafSetOfRx2ToReplaceNode13<1)"
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-03 finished in 434478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(X(F(!p1)))) U (p2&&(p0||X(X(F(!p1))))))))'
Support contains 4 out of 3246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3246/3246 places, 7332/7332 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3230 transition count 7304
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3230 transition count 7304
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 44 place count 3218 transition count 7260
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 3218 transition count 7260
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 3214 transition count 7240
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 3214 transition count 7240
Applied a total of 64 rules in 1600 ms. Remains 3214 /3246 variables (removed 32) and now considering 7240/7332 (removed 92) transitions.
[2024-05-24 22:17:07] [INFO ] Flow matrix only has 6640 transitions (discarded 600 similar events)
// Phase 1: matrix 6640 rows 3214 cols
[2024-05-24 22:17:08] [INFO ] Computed 76 invariants in 180 ms
[2024-05-24 22:17:12] [INFO ] Implicit Places using invariants in 4828 ms returned [487, 583, 978, 1247, 1527, 1562, 1563, 1585, 1599, 1622, 1699, 1837, 1923, 1971, 2751]
[2024-05-24 22:17:12] [INFO ] Actually due to overlaps returned [583, 487, 978, 1247, 1527, 1562, 1563, 1599, 1622, 1699, 1837, 1923, 1971, 2751]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 4835 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3200/3246 places, 7240/7332 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3187 transition count 7227
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3187 transition count 7227
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 3174 transition count 7214
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 3174 transition count 7214
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 3161 transition count 7201
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 3161 transition count 7201
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 3149 transition count 7141
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 3149 transition count 7141
Applied a total of 102 rules in 2110 ms. Remains 3149 /3200 variables (removed 51) and now considering 7141/7240 (removed 99) transitions.
[2024-05-24 22:17:14] [INFO ] Flow matrix only has 6541 transitions (discarded 600 similar events)
// Phase 1: matrix 6541 rows 3149 cols
[2024-05-24 22:17:15] [INFO ] Computed 62 invariants in 172 ms
[2024-05-24 22:17:19] [INFO ] Implicit Places using invariants in 4668 ms returned [1561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4672 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3148/3246 places, 7141/7332 transitions.
Applied a total of 0 rules in 379 ms. Remains 3148 /3148 variables (removed 0) and now considering 7141/7141 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13597 ms. Remains : 3148/3246 places, 7141/7332 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-06
Product exploration explored 100000 steps with 19935 reset in 1413 ms.
Product exploration explored 100000 steps with 19972 reset in 1441 ms.
Computed a total of 524 stabilizing places and 1940 stable transitions
Computed a total of 524 stabilizing places and 1940 stable transitions
Detected a total of 524/3148 stabilizing places and 1940/7141 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 188 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
RANDOM walk for 40000 steps (773 resets) in 599 ms. (66 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (144 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
[2024-05-24 22:17:23] [INFO ] Flow matrix only has 6541 transitions (discarded 600 similar events)
// Phase 1: matrix 6541 rows 3148 cols
[2024-05-24 22:17:23] [INFO ] Computed 61 invariants in 136 ms
[2024-05-24 22:17:23] [INFO ] State equation strengthened by 2626 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3003/3004 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3004 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/3054 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3054 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/3094 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/3094 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 44/3138 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3138 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/3148 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3148 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9689/9689 variables, and 3209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2873 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 3148/3148 constraints, ReadFeed: 0/2626 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3003/3004 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3004 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/3054 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 22:17:29] [INFO ] Deduced a trap composed of 2590 places in 1939 ms of which 20 ms to minimize.
[2024-05-24 22:17:31] [INFO ] Deduced a trap composed of 2684 places in 2089 ms of which 19 ms to minimize.
[2024-05-24 22:17:33] [INFO ] Deduced a trap composed of 2572 places in 1970 ms of which 19 ms to minimize.
SMT process timed out in 9585ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3148/3148 places, 7141/7141 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 3148 transition count 7122
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 3129 transition count 7122
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 38 place count 3129 transition count 7112
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 58 place count 3119 transition count 7112
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 6 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 116 place count 3090 transition count 7083
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 3089 transition count 7082
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 3089 transition count 7082
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 3088 transition count 7077
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 3088 transition count 7077
Free-agglomeration rule (complex) applied 294 times.
Iterating global reduction 2 with 294 rules applied. Total rules applied 414 place count 3088 transition count 9163
Reduce places removed 294 places and 0 transitions.
Iterating post reduction 2 with 294 rules applied. Total rules applied 708 place count 2794 transition count 9163
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 710 place count 2794 transition count 9163
Applied a total of 710 rules in 3075 ms. Remains 2794 /3148 variables (removed 354) and now considering 9163/7141 (removed -2022) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3075 ms. Remains : 2794/3148 places, 9163/7141 transitions.
RANDOM walk for 33825 steps (1152 resets) in 1180 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 251 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
[2024-05-24 22:17:37] [INFO ] Flow matrix only has 6541 transitions (discarded 600 similar events)
[2024-05-24 22:17:37] [INFO ] Invariant cache hit.
[2024-05-24 22:17:49] [INFO ] [Real]Absence check using 47 positive place invariants in 129 ms returned sat
[2024-05-24 22:17:49] [INFO ] [Real]Absence check using 47 positive and 14 generalized place invariants in 84 ms returned sat
[2024-05-24 22:17:52] [INFO ] [Real]Absence check using state equation in 2648 ms returned unknown
Could not prove EG (NOT p2)
Support contains 4 out of 3148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3148/3148 places, 7141/7141 transitions.
Applied a total of 0 rules in 369 ms. Remains 3148 /3148 variables (removed 0) and now considering 7141/7141 (removed 0) transitions.
[2024-05-24 22:17:52] [INFO ] Flow matrix only has 6541 transitions (discarded 600 similar events)
[2024-05-24 22:17:52] [INFO ] Invariant cache hit.
[2024-05-24 22:17:57] [INFO ] Implicit Places using invariants in 4320 ms returned []
[2024-05-24 22:17:57] [INFO ] Flow matrix only has 6541 transitions (discarded 600 similar events)
[2024-05-24 22:17:57] [INFO ] Invariant cache hit.
[2024-05-24 22:18:00] [INFO ] State equation strengthened by 2626 read => feed constraints.
[2024-05-24 22:18:31] [INFO ] Performed 924/3148 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 22:19:01] [INFO ] Performed 1599/3148 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 22:19:31] [INFO ] Performed 2179/3148 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 22:19:57] [INFO ] Implicit Places using invariants and state equation in 120114 ms returned [3118]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 124440 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3147/3148 places, 7141/7141 transitions.
Applied a total of 0 rules in 377 ms. Remains 3147 /3147 variables (removed 0) and now considering 7141/7141 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125187 ms. Remains : 3147/3148 places, 7141/7141 transitions.
Computed a total of 523 stabilizing places and 1940 stable transitions
Computed a total of 523 stabilizing places and 1940 stable transitions
Detected a total of 523/3147 stabilizing places and 1940/7141 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 139 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
RANDOM walk for 40000 steps (772 resets) in 487 ms. (81 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (144 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
[2024-05-24 22:19:58] [INFO ] Flow matrix only has 6541 transitions (discarded 600 similar events)
// Phase 1: matrix 6541 rows 3147 cols
[2024-05-24 22:19:58] [INFO ] Computed 60 invariants in 129 ms
[2024-05-24 22:19:58] [INFO ] State equation strengthened by 2626 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3003/3004 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3004 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/3054 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3054 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 40/3094 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 22:20:01] [INFO ] Deduced a trap composed of 107 places in 2294 ms of which 20 ms to minimize.
[2024-05-24 22:20:03] [INFO ] Deduced a trap composed of 244 places in 2252 ms of which 20 ms to minimize.
SMT process timed out in 5318ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 3147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3147/3147 places, 7141/7141 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 3147 transition count 7121
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 3127 transition count 7121
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 40 place count 3127 transition count 7111
Deduced a syphon composed of 10 places in 6 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 60 place count 3117 transition count 7111
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 8 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 118 place count 3088 transition count 7082
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 3087 transition count 7081
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 3087 transition count 7081
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 3086 transition count 7076
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 3086 transition count 7076
Free-agglomeration rule (complex) applied 294 times.
Iterating global reduction 2 with 294 rules applied. Total rules applied 416 place count 3086 transition count 9162
Reduce places removed 294 places and 0 transitions.
Iterating post reduction 2 with 294 rules applied. Total rules applied 710 place count 2792 transition count 9162
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 712 place count 2792 transition count 9162
Applied a total of 712 rules in 3019 ms. Remains 2792 /3147 variables (removed 355) and now considering 9162/7141 (removed -2021) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3019 ms. Remains : 2792/3147 places, 9162/7141 transitions.
RANDOM walk for 10581 steps (358 resets) in 383 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 259 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
[2024-05-24 22:20:07] [INFO ] Flow matrix only has 6541 transitions (discarded 600 similar events)
[2024-05-24 22:20:07] [INFO ] Invariant cache hit.
[2024-05-24 22:20:19] [INFO ] [Real]Absence check using 47 positive place invariants in 119 ms returned sat
[2024-05-24 22:20:19] [INFO ] [Real]Absence check using 47 positive and 13 generalized place invariants in 48 ms returned sat
[2024-05-24 22:20:22] [INFO ] [Real]Absence check using state equation in 2234 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
Product exploration explored 100000 steps with 19955 reset in 1413 ms.
Product exploration explored 100000 steps with 19973 reset in 1420 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), p1, p1]
Support contains 4 out of 3147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3147/3147 places, 7141/7141 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 3147 transition count 7141
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 19 place count 3147 transition count 7143
Deduced a syphon composed of 29 places in 6 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 29 place count 3147 transition count 7143
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 38 place count 3138 transition count 7134
Deduced a syphon composed of 20 places in 6 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 47 place count 3138 transition count 7134
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 6 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 76 place count 3138 transition count 7134
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 3134 transition count 7130
Deduced a syphon composed of 45 places in 6 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 3134 transition count 7130
Deduced a syphon composed of 45 places in 6 ms
Applied a total of 84 rules in 2031 ms. Remains 3134 /3147 variables (removed 13) and now considering 7130/7141 (removed 11) transitions.
[2024-05-24 22:20:28] [INFO ] Redundant transitions in 640 ms returned []
Running 7105 sub problems to find dead transitions.
[2024-05-24 22:20:28] [INFO ] Flow matrix only has 6530 transitions (discarded 600 similar events)
// Phase 1: matrix 6530 rows 3134 cols
[2024-05-24 22:20:28] [INFO ] Computed 60 invariants in 127 ms
[2024-05-24 22:20:28] [INFO ] State equation strengthened by 2626 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3132 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7105 unsolved
SMT process timed out in 44922ms, After SMT, problems are : Problem set: 0 solved, 7105 unsolved
Search for dead transitions found 0 dead transitions in 44996ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3134/3147 places, 7130/7141 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47691 ms. Remains : 3134/3147 places, 7130/7141 transitions.
Built C files in :
/tmp/ltsmin4448756072118435444
[2024-05-24 22:21:13] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4448756072118435444
Running compilation step : cd /tmp/ltsmin4448756072118435444;'/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/ltsmin4448756072118435444;'/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/ltsmin4448756072118435444;'/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 3147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3147/3147 places, 7141/7141 transitions.
Applied a total of 0 rules in 241 ms. Remains 3147 /3147 variables (removed 0) and now considering 7141/7141 (removed 0) transitions.
[2024-05-24 22:21:16] [INFO ] Flow matrix only has 6541 transitions (discarded 600 similar events)
// Phase 1: matrix 6541 rows 3147 cols
[2024-05-24 22:21:16] [INFO ] Computed 60 invariants in 135 ms
[2024-05-24 22:21:21] [INFO ] Implicit Places using invariants in 4606 ms returned []
[2024-05-24 22:21:21] [INFO ] Flow matrix only has 6541 transitions (discarded 600 similar events)
[2024-05-24 22:21:21] [INFO ] Invariant cache hit.
[2024-05-24 22:21:25] [INFO ] State equation strengthened by 2626 read => feed constraints.
[2024-05-24 22:21:55] [INFO ] Performed 989/3147 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 22:22:25] [INFO ] Performed 1563/3147 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 22:22:55] [INFO ] Performed 1995/3147 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 22:23:25] [INFO ] Implicit Places using invariants and state equation in 124164 ms returned []
Implicit Place search using SMT with State Equation took 128773 ms to find 0 implicit places.
Running 7116 sub problems to find dead transitions.
[2024-05-24 22:23:25] [INFO ] Flow matrix only has 6541 transitions (discarded 600 similar events)
[2024-05-24 22:23:25] [INFO ] Invariant cache hit.
[2024-05-24 22:23:25] [INFO ] State equation strengthened by 2626 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3145 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7116 unsolved
SMT process timed out in 42405ms, After SMT, problems are : Problem set: 0 solved, 7116 unsolved
Search for dead transitions found 0 dead transitions in 42468ms
Finished structural reductions in LTL mode , in 1 iterations and 171495 ms. Remains : 3147/3147 places, 7141/7141 transitions.
Built C files in :
/tmp/ltsmin3955168644597214325
[2024-05-24 22:24:08] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3955168644597214325
Running compilation step : cd /tmp/ltsmin3955168644597214325;'/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/ltsmin3955168644597214325;'/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/ltsmin3955168644597214325;'/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 22:24:11] [INFO ] Flatten gal took : 204 ms
[2024-05-24 22:24:11] [INFO ] Flatten gal took : 213 ms
[2024-05-24 22:24:11] [INFO ] Time to serialize gal into /tmp/LTL12583340065059265204.gal : 43 ms
[2024-05-24 22:24:11] [INFO ] Time to serialize properties into /tmp/LTL16536322684149726674.prop : 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/LTL12583340065059265204.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7203428219832936034.hoa' '-atoms' '/tmp/LTL16536322684149726674.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/LTL16536322684149726674.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7203428219832936034.hoa
Detected timeout of ITS tools.
[2024-05-24 22:24:27] [INFO ] Flatten gal took : 187 ms
[2024-05-24 22:24:27] [INFO ] Flatten gal took : 192 ms
[2024-05-24 22:24:27] [INFO ] Time to serialize gal into /tmp/LTL9557846807306431280.gal : 33 ms
[2024-05-24 22:24:27] [INFO ] Time to serialize properties into /tmp/LTL12252979660335963299.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/LTL9557846807306431280.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12252979660335963299.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((("(Node4HasTheLeafSetOfRx3ToReplaceNode23>=1)")||(X(X(F(!("((!((Node21NotifyThatHeIsActive>=1)&&(Node24ThinksNode21ShouldBeNodeM...496
Formula 0 simplified : X(!"(Node14HasTheLeafSetOfRx2ToReplaceNode13>=1)" W (!"(Node4HasTheLeafSetOfRx3ToReplaceNode23>=1)" & XXG"((!((Node21NotifyThatHeIsA...272
Detected timeout of ITS tools.
[2024-05-24 22:24:42] [INFO ] Flatten gal took : 189 ms
[2024-05-24 22:24:42] [INFO ] Applying decomposition
[2024-05-24 22:24:42] [INFO ] Flatten gal took : 194 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/graph8446012685469490422.txt' '-o' '/tmp/graph8446012685469490422.bin' '-w' '/tmp/graph8446012685469490422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8446012685469490422.bin' '-l' '-1' '-v' '-w' '/tmp/graph8446012685469490422.weights' '-q' '0' '-e' '0.001'
[2024-05-24 22:24:43] [INFO ] Decomposing Gal with order
[2024-05-24 22:24:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 22:24:43] [INFO ] Removed a total of 5763 redundant transitions.
[2024-05-24 22:24:44] [INFO ] Flatten gal took : 517 ms
[2024-05-24 22:24:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 3094 labels/synchronizations in 262 ms.
[2024-05-24 22:24:44] [INFO ] Time to serialize gal into /tmp/LTL10582328139928647314.gal : 51 ms
[2024-05-24 22:24:44] [INFO ] Time to serialize properties into /tmp/LTL15028837856768881596.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/LTL10582328139928647314.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15028837856768881596.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((("(i26.i1.i3.u120.Node4HasTheLeafSetOfRx3ToReplaceNode23>=1)")||(X(X(F(!("((!((i2.u252.Node21NotifyThatHeIsActive>=1)&&(i2.u326....603
Formula 0 simplified : X(!"(i26.i1.i5.u360.Node14HasTheLeafSetOfRx2ToReplaceNode13>=1)" W (!"(i26.i1.i3.u120.Node4HasTheLeafSetOfRx3ToReplaceNode23>=1)" & ...333
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-06 finished in 473229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(((p1||X(G(p1)))&&p0))))))'
Support contains 4 out of 3246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3246/3246 places, 7332/7332 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3230 transition count 7304
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3230 transition count 7304
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 44 place count 3218 transition count 7268
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 3218 transition count 7268
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 3212 transition count 7238
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 3212 transition count 7238
Applied a total of 68 rules in 1319 ms. Remains 3212 /3246 variables (removed 34) and now considering 7238/7332 (removed 94) transitions.
[2024-05-24 22:25:00] [INFO ] Flow matrix only has 6638 transitions (discarded 600 similar events)
// Phase 1: matrix 6638 rows 3212 cols
[2024-05-24 22:25:01] [INFO ] Computed 76 invariants in 148 ms
[2024-05-24 22:25:05] [INFO ] Implicit Places using invariants in 4918 ms returned [585, 980, 1070, 1246, 1526, 1561, 1562, 1584, 1598, 1621, 1671, 1695, 1921, 1969, 2749]
[2024-05-24 22:25:05] [INFO ] Actually due to overlaps returned [585, 980, 1070, 1246, 1526, 1561, 1562, 1598, 1621, 1671, 1695, 1921, 1969, 2749]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 4926 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3198/3246 places, 7238/7332 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3185 transition count 7225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3185 transition count 7225
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 3172 transition count 7212
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 3172 transition count 7212
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 3159 transition count 7199
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 3159 transition count 7199
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 3147 transition count 7139
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 3147 transition count 7139
Applied a total of 102 rules in 1605 ms. Remains 3147 /3198 variables (removed 51) and now considering 7139/7238 (removed 99) transitions.
[2024-05-24 22:25:07] [INFO ] Flow matrix only has 6539 transitions (discarded 600 similar events)
// Phase 1: matrix 6539 rows 3147 cols
[2024-05-24 22:25:07] [INFO ] Computed 62 invariants in 147 ms
[2024-05-24 22:25:12] [INFO ] Implicit Places using invariants in 4724 ms returned [1560]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4729 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3146/3246 places, 7139/7332 transitions.
Applied a total of 0 rules in 308 ms. Remains 3146 /3146 variables (removed 0) and now considering 7139/7139 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12889 ms. Remains : 3146/3246 places, 7139/7332 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-09
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-09 finished in 13156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1 U p2))))'
Support contains 6 out of 3246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3246/3246 places, 7332/7332 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 3246 transition count 7314
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 3228 transition count 7314
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 36 place count 3228 transition count 7293
Deduced a syphon composed of 21 places in 6 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 78 place count 3207 transition count 7293
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 89 place count 3196 transition count 7270
Iterating global reduction 2 with 11 rules applied. Total rules applied 100 place count 3196 transition count 7270
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 100 place count 3196 transition count 7266
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 3192 transition count 7266
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 115 place count 3185 transition count 7231
Iterating global reduction 2 with 7 rules applied. Total rules applied 122 place count 3185 transition count 7231
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 6 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 184 place count 3154 transition count 7200
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 190 place count 3148 transition count 7194
Iterating global reduction 2 with 6 rules applied. Total rules applied 196 place count 3148 transition count 7194
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 202 place count 3142 transition count 7164
Iterating global reduction 2 with 6 rules applied. Total rules applied 208 place count 3142 transition count 7164
Applied a total of 208 rules in 2263 ms. Remains 3142 /3246 variables (removed 104) and now considering 7164/7332 (removed 168) transitions.
[2024-05-24 22:25:14] [INFO ] Flow matrix only has 6564 transitions (discarded 600 similar events)
// Phase 1: matrix 6564 rows 3142 cols
[2024-05-24 22:25:15] [INFO ] Computed 76 invariants in 191 ms
[2024-05-24 22:25:19] [INFO ] Implicit Places using invariants in 4894 ms returned [466, 561, 953, 1043, 1493, 1526, 1527, 1546, 1560, 1581, 1629, 1651, 1786, 1870, 1916, 2692]
[2024-05-24 22:25:19] [INFO ] Actually due to overlaps returned [561, 466, 953, 1043, 1493, 1526, 1527, 1560, 1581, 1629, 1651, 1786, 1870, 1916, 2692]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 4902 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3127/3246 places, 7164/7332 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3116 transition count 7153
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3116 transition count 7153
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 3105 transition count 7142
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 3105 transition count 7142
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 3095 transition count 7092
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 3095 transition count 7092
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 3092 transition count 7089
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 3089 transition count 7086
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 3089 transition count 7086
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 3086 transition count 7071
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 3086 transition count 7071
Applied a total of 82 rules in 2515 ms. Remains 3086 /3127 variables (removed 41) and now considering 7071/7164 (removed 93) transitions.
[2024-05-24 22:25:22] [INFO ] Flow matrix only has 6471 transitions (discarded 600 similar events)
// Phase 1: matrix 6471 rows 3086 cols
[2024-05-24 22:25:22] [INFO ] Computed 61 invariants in 138 ms
[2024-05-24 22:25:27] [INFO ] Implicit Places using invariants in 4718 ms returned [1528]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4728 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3085/3246 places, 7071/7332 transitions.
Applied a total of 0 rules in 468 ms. Remains 3085 /3085 variables (removed 0) and now considering 7071/7071 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 14882 ms. Remains : 3085/3246 places, 7071/7332 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-10
Stuttering criterion allowed to conclude after 58 steps with 1 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-10 finished in 14968 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||F(p1)) U (G(!p2)||(!p2&&F(!p3)))))))'
Support contains 8 out of 3246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3246/3246 places, 7332/7332 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3231 transition count 7309
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3231 transition count 7309
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 42 place count 3219 transition count 7273
Iterating global reduction 0 with 12 rules applied. Total rules applied 54 place count 3219 transition count 7273
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 3213 transition count 7243
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 3213 transition count 7243
Applied a total of 66 rules in 1242 ms. Remains 3213 /3246 variables (removed 33) and now considering 7243/7332 (removed 89) transitions.
[2024-05-24 22:25:28] [INFO ] Flow matrix only has 6643 transitions (discarded 600 similar events)
// Phase 1: matrix 6643 rows 3213 cols
[2024-05-24 22:25:29] [INFO ] Computed 76 invariants in 174 ms
[2024-05-24 22:25:33] [INFO ] Implicit Places using invariants in 4886 ms returned [488, 584, 979, 1069, 1245, 1562, 1563, 1585, 1599, 1622, 1672, 1696, 1834, 1920, 2750]
[2024-05-24 22:25:33] [INFO ] Actually due to overlaps returned [584, 488, 979, 1069, 1245, 1562, 1563, 1599, 1622, 1672, 1696, 1834, 1920, 2750]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 4895 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3199/3246 places, 7243/7332 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3186 transition count 7230
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3186 transition count 7230
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 3173 transition count 7217
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 3173 transition count 7217
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 65 place count 3160 transition count 7204
Iterating global reduction 0 with 13 rules applied. Total rules applied 78 place count 3160 transition count 7204
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 3148 transition count 7144
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 3148 transition count 7144
Applied a total of 102 rules in 1600 ms. Remains 3148 /3199 variables (removed 51) and now considering 7144/7243 (removed 99) transitions.
[2024-05-24 22:25:35] [INFO ] Flow matrix only has 6544 transitions (discarded 600 similar events)
// Phase 1: matrix 6544 rows 3148 cols
[2024-05-24 22:25:35] [INFO ] Computed 62 invariants in 150 ms
[2024-05-24 22:25:40] [INFO ] Implicit Places using invariants in 4665 ms returned [1561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4673 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3147/3246 places, 7144/7332 transitions.
Applied a total of 0 rules in 306 ms. Remains 3147 /3147 variables (removed 0) and now considering 7144/7144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12719 ms. Remains : 3147/3246 places, 7144/7332 transitions.
Stuttering acceptance computed with spot in 324 ms :[p2, p2, (NOT p1), p2, (AND (NOT p1) p3 p2), (AND p2 p3), (AND (NOT p1) p3)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-11
Product exploration explored 100000 steps with 1935 reset in 960 ms.
Product exploration explored 100000 steps with 1935 reset in 819 ms.
Computed a total of 523 stabilizing places and 1943 stable transitions
Computed a total of 523 stabilizing places and 1943 stable transitions
Detected a total of 523/3147 stabilizing places and 1943/7144 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 478 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 272 ms :[p2, (NOT p1), p2, (AND (NOT p1) p3 p2), (AND p2 p3), (AND (NOT p1) p3)]
RANDOM walk for 40000 steps (772 resets) in 935 ms. (42 steps per ms) remains 5/12 properties
BEST_FIRST walk for 40002 steps (144 resets) in 269 ms. (148 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (144 resets) in 326 ms. (122 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (144 resets) in 399 ms. (100 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (144 resets) in 407 ms. (98 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (144 resets) in 394 ms. (101 steps per ms) remains 5/5 properties
[2024-05-24 22:25:44] [INFO ] Flow matrix only has 6544 transitions (discarded 600 similar events)
// Phase 1: matrix 6544 rows 3147 cols
[2024-05-24 22:25:44] [INFO ] Computed 61 invariants in 129 ms
[2024-05-24 22:25:44] [INFO ] State equation strengthened by 2630 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 3026/3034 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3034 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 64/3098 variables, 7/12 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-24 22:25:47] [INFO ] Deduced a trap composed of 129 places in 2286 ms of which 22 ms to minimize.
[2024-05-24 22:25:49] [INFO ] Deduced a trap composed of 153 places in 2252 ms of which 21 ms to minimize.
SMT process timed out in 5421ms, After SMT, problems are : Problem set: 3 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 3147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3147/3147 places, 7144/7144 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 3147 transition count 7126
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 3129 transition count 7126
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 36 place count 3129 transition count 7115
Deduced a syphon composed of 11 places in 7 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 58 place count 3118 transition count 7115
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 3117 transition count 7114
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 3117 transition count 7114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 60 place count 3117 transition count 7113
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 3116 transition count 7113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 3115 transition count 7108
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 3115 transition count 7108
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 6 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 116 place count 3089 transition count 7082
Free-agglomeration rule (complex) applied 293 times.
Iterating global reduction 2 with 293 rules applied. Total rules applied 409 place count 3089 transition count 9165
Reduce places removed 293 places and 0 transitions.
Iterating post reduction 2 with 293 rules applied. Total rules applied 702 place count 2796 transition count 9165
Applied a total of 702 rules in 2087 ms. Remains 2796 /3147 variables (removed 351) and now considering 9165/7144 (removed -2021) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2087 ms. Remains : 2796/3147 places, 9165/7144 transitions.
RANDOM walk for 40000 steps (1360 resets) in 1891 ms. (21 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (90 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (90 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 28301 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 2
Probabilistic random walk after 28301 steps, saw 11968 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-24 22:25:55] [INFO ] Flow matrix only has 8280 transitions (discarded 885 similar events)
// Phase 1: matrix 8280 rows 2796 cols
[2024-05-24 22:25:55] [INFO ] Computed 61 invariants in 136 ms
[2024-05-24 22:25:55] [INFO ] State equation strengthened by 5002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2702/2708 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 22:25:58] [INFO ] Deduced a trap composed of 339 places in 2057 ms of which 18 ms to minimize.
[2024-05-24 22:26:00] [INFO ] Deduced a trap composed of 98 places in 2071 ms of which 18 ms to minimize.
[2024-05-24 22:26:02] [INFO ] Deduced a trap composed of 205 places in 1981 ms of which 17 ms to minimize.
[2024-05-24 22:26:04] [INFO ] Deduced a trap composed of 169 places in 1953 ms of which 17 ms to minimize.
[2024-05-24 22:26:06] [INFO ] Deduced a trap composed of 129 places in 1951 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2708 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2708 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 39/2747 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2747 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 42/2789 variables, 42/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2789 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/2796 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2796 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8280/11076 variables, 2796/2862 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/11076 variables, 5002/7864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/11076 variables, 0/7864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/11076 variables, 0/7864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11076/11076 variables, and 7864 constraints, problems are : Problem set: 0 solved, 2 unsolved in 16340 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 2796/2796 constraints, ReadFeed: 5002/5002 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2702/2708 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2708 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 22:26:14] [INFO ] Deduced a trap composed of 122 places in 1997 ms of which 18 ms to minimize.
[2024-05-24 22:26:16] [INFO ] Deduced a trap composed of 98 places in 1844 ms of which 17 ms to minimize.
[2024-05-24 22:26:18] [INFO ] Deduced a trap composed of 368 places in 1922 ms of which 17 ms to minimize.
[2024-05-24 22:26:20] [INFO ] Deduced a trap composed of 115 places in 1970 ms of which 17 ms to minimize.
[2024-05-24 22:26:22] [INFO ] Deduced a trap composed of 98 places in 2021 ms of which 17 ms to minimize.
[2024-05-24 22:26:24] [INFO ] Deduced a trap composed of 406 places in 1914 ms of which 18 ms to minimize.
[2024-05-24 22:26:26] [INFO ] Deduced a trap composed of 135 places in 1830 ms of which 15 ms to minimize.
[2024-05-24 22:26:28] [INFO ] Deduced a trap composed of 219 places in 1948 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2708 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2708 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 39/2747 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 22:26:30] [INFO ] Deduced a trap composed of 5 places in 2103 ms of which 19 ms to minimize.
[2024-05-24 22:26:32] [INFO ] Deduced a trap composed of 101 places in 2062 ms of which 17 ms to minimize.
[2024-05-24 22:26:34] [INFO ] Deduced a trap composed of 91 places in 2091 ms of which 18 ms to minimize.
[2024-05-24 22:26:36] [INFO ] Deduced a trap composed of 88 places in 2018 ms of which 18 ms to minimize.
[2024-05-24 22:26:38] [INFO ] Deduced a trap composed of 87 places in 2004 ms of which 18 ms to minimize.
[2024-05-24 22:26:40] [INFO ] Deduced a trap composed of 100 places in 2014 ms of which 18 ms to minimize.
[2024-05-24 22:26:42] [INFO ] Deduced a trap composed of 98 places in 2090 ms of which 19 ms to minimize.
[2024-05-24 22:26:45] [INFO ] Deduced a trap composed of 96 places in 2119 ms of which 18 ms to minimize.
[2024-05-24 22:26:47] [INFO ] Deduced a trap composed of 193 places in 2136 ms of which 18 ms to minimize.
[2024-05-24 22:26:49] [INFO ] Deduced a trap composed of 96 places in 2143 ms of which 18 ms to minimize.
[2024-05-24 22:26:51] [INFO ] Deduced a trap composed of 196 places in 2087 ms of which 18 ms to minimize.
[2024-05-24 22:26:53] [INFO ] Deduced a trap composed of 86 places in 2094 ms of which 18 ms to minimize.
[2024-05-24 22:26:55] [INFO ] Deduced a trap composed of 101 places in 2109 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2747 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2747 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 42/2789 variables, 42/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2789 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 7/2796 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2796 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 61562ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 2796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2796/2796 places, 9165/9165 transitions.
Applied a total of 0 rules in 459 ms. Remains 2796 /2796 variables (removed 0) and now considering 9165/9165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 459 ms. Remains : 2796/2796 places, 9165/9165 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2796/2796 places, 9165/9165 transitions.
Applied a total of 0 rules in 452 ms. Remains 2796 /2796 variables (removed 0) and now considering 9165/9165 (removed 0) transitions.
[2024-05-24 22:26:57] [INFO ] Flow matrix only has 8280 transitions (discarded 885 similar events)
[2024-05-24 22:26:57] [INFO ] Invariant cache hit.
[2024-05-24 22:27:02] [INFO ] Implicit Places using invariants in 4898 ms returned [1332]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4904 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2795/2796 places, 9165/9165 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2794 transition count 9164
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2794 transition count 9164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 2793 transition count 9163
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2793 transition count 9163
Applied a total of 4 rules in 848 ms. Remains 2793 /2795 variables (removed 2) and now considering 9163/9165 (removed 2) transitions.
[2024-05-24 22:27:03] [INFO ] Flow matrix only has 8278 transitions (discarded 885 similar events)
// Phase 1: matrix 8278 rows 2793 cols
[2024-05-24 22:27:03] [INFO ] Computed 60 invariants in 117 ms
[2024-05-24 22:27:08] [INFO ] Implicit Places using invariants in 4868 ms returned []
[2024-05-24 22:27:08] [INFO ] Flow matrix only has 8278 transitions (discarded 885 similar events)
[2024-05-24 22:27:08] [INFO ] Invariant cache hit.
[2024-05-24 22:27:11] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-05-24 22:27:41] [INFO ] Performed 429/2793 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 22:28:11] [INFO ] Performed 852/2793 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 22:28:42] [INFO ] Performed 1092/2793 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 22:29:12] [INFO ] Performed 1310/2793 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-24 22:29:12] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-24 22:29:12] [INFO ] Implicit Places using invariants and state equation in 123543 ms returned []
Implicit Place search using SMT with State Equation took 128413 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2793/2796 places, 9163/9165 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 134617 ms. Remains : 2793/2796 places, 9163/9165 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (OR (NOT p2) (NOT p3))), (G (OR p1 (NOT p2) (NOT p3))), (G (OR p0 p1 (NOT p2) (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR p0 p1 p2 (NOT p3)))), (F p3), (F (NOT (OR p2 (NOT p3)))), (F p1), (F (NOT (OR p1 p2 (NOT p3)))), (F p0), (F (NOT (OR p1 (NOT p3))))]
Knowledge based reduction with 22 factoid took 1317 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 101 ms :[p2, (NOT p1), p2]
Support contains 6 out of 3147 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 : 3147/3147 places, 7144/7144 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 3147 transition count 7126
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 3129 transition count 7126
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 36 place count 3129 transition count 7116
Deduced a syphon composed of 10 places in 7 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 56 place count 3119 transition count 7116
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 6 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 110 place count 3092 transition count 7089
Applied a total of 110 rules in 864 ms. Remains 3092 /3147 variables (removed 55) and now considering 7089/7144 (removed 55) transitions.
[2024-05-24 22:29:14] [INFO ] Flow matrix only has 6489 transitions (discarded 600 similar events)
// Phase 1: matrix 6489 rows 3092 cols
[2024-05-24 22:29:14] [INFO ] Computed 61 invariants in 143 ms
[2024-05-24 22:29:19] [INFO ] Implicit Places using invariants in 4609 ms returned []
[2024-05-24 22:29:19] [INFO ] Flow matrix only has 6489 transitions (discarded 600 similar events)
[2024-05-24 22:29:19] [INFO ] Invariant cache hit.
[2024-05-24 22:29:22] [INFO ] State equation strengthened by 2630 read => feed constraints.
[2024-05-24 22:29:52] [INFO ] Performed 994/3092 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 22:30:22] [INFO ] Performed 1558/3092 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 22:30:52] [INFO ] Performed 2190/3092 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 22:31:16] [INFO ] Implicit Places using invariants and state equation in 117637 ms returned []
Implicit Place search using SMT with State Equation took 122253 ms to find 0 implicit places.
[2024-05-24 22:31:17] [INFO ] Redundant transitions in 899 ms returned []
Running 7064 sub problems to find dead transitions.
[2024-05-24 22:31:17] [INFO ] Flow matrix only has 6489 transitions (discarded 600 similar events)
[2024-05-24 22:31:17] [INFO ] Invariant cache hit.
[2024-05-24 22:31:17] [INFO ] State equation strengthened by 2630 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3090 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7064 unsolved
SMT process timed out in 44841ms, After SMT, problems are : Problem set: 0 solved, 7064 unsolved
Search for dead transitions found 0 dead transitions in 44918ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3092/3147 places, 7089/7144 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168956 ms. Remains : 3092/3147 places, 7089/7144 transitions.
Computed a total of 493 stabilizing places and 1913 stable transitions
Computed a total of 493 stabilizing places and 1913 stable transitions
Detected a total of 493/3092 stabilizing places and 1913/7089 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 205 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[p2, (NOT p1), p2]
RANDOM walk for 40000 steps (1096 resets) in 503 ms. (79 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (152 resets) in 231 ms. (172 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (152 resets) in 235 ms. (169 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (152 resets) in 225 ms. (177 steps per ms) remains 3/3 properties
[2024-05-24 22:32:03] [INFO ] Flow matrix only has 6489 transitions (discarded 600 similar events)
[2024-05-24 22:32:03] [INFO ] Invariant cache hit.
[2024-05-24 22:32:03] [INFO ] State equation strengthened by 2630 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2973/2979 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2979 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 64/3043 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3043 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 42/3085 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3085 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 7/3092 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3092 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9581/9581 variables, and 3153 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4431 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 3092/3092 constraints, ReadFeed: 0/2630 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2973/2979 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2979 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 64/3043 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 22:32:10] [INFO ] Deduced a trap composed of 212 places in 2064 ms of which 19 ms to minimize.
[2024-05-24 22:32:12] [INFO ] Deduced a trap composed of 242 places in 2195 ms of which 19 ms to minimize.
[2024-05-24 22:32:14] [INFO ] Deduced a trap composed of 71 places in 2197 ms of which 21 ms to minimize.
SMT process timed out in 11581ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 3092 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3092/3092 places, 7089/7089 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 3092 transition count 7088
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3091 transition count 7088
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 3090 transition count 7087
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 3090 transition count 7087
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 3089 transition count 7082
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3089 transition count 7082
Free-agglomeration rule (complex) applied 293 times.
Iterating global reduction 0 with 293 rules applied. Total rules applied 299 place count 3089 transition count 9165
Reduce places removed 293 places and 0 transitions.
Iterating post reduction 0 with 293 rules applied. Total rules applied 592 place count 2796 transition count 9165
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 593 place count 2796 transition count 9165
Applied a total of 593 rules in 2085 ms. Remains 2796 /3092 variables (removed 296) and now considering 9165/7089 (removed -2076) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2085 ms. Remains : 2796/3092 places, 9165/7089 transitions.
RANDOM walk for 40000 steps (1361 resets) in 1984 ms. (20 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (92 resets) in 191 ms. (208 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (90 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (104 resets) in 204 ms. (195 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 27189 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 3
Probabilistic random walk after 27189 steps, saw 11524 distinct states, run finished after 3002 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-24 22:32:20] [INFO ] Flow matrix only has 8280 transitions (discarded 885 similar events)
// Phase 1: matrix 8280 rows 2796 cols
[2024-05-24 22:32:20] [INFO ] Computed 61 invariants in 177 ms
[2024-05-24 22:32:21] [INFO ] State equation strengthened by 5002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2702/2708 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 22:32:23] [INFO ] Deduced a trap composed of 98 places in 2100 ms of which 18 ms to minimize.
[2024-05-24 22:32:25] [INFO ] Deduced a trap composed of 297 places in 2105 ms of which 18 ms to minimize.
[2024-05-24 22:32:27] [INFO ] Deduced a trap composed of 121 places in 1982 ms of which 17 ms to minimize.
[2024-05-24 22:32:29] [INFO ] Deduced a trap composed of 195 places in 1958 ms of which 19 ms to minimize.
[2024-05-24 22:32:31] [INFO ] Deduced a trap composed of 135 places in 1983 ms of which 15 ms to minimize.
[2024-05-24 22:32:33] [INFO ] Deduced a trap composed of 149 places in 2082 ms of which 18 ms to minimize.
[2024-05-24 22:32:35] [INFO ] Deduced a trap composed of 217 places in 2062 ms of which 18 ms to minimize.
[2024-05-24 22:32:38] [INFO ] Deduced a trap composed of 218 places in 2107 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2708 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2708 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 39/2747 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 22:32:40] [INFO ] Deduced a trap composed of 5 places in 2237 ms of which 18 ms to minimize.
[2024-05-24 22:32:43] [INFO ] Deduced a trap composed of 96 places in 2259 ms of which 18 ms to minimize.
[2024-05-24 22:32:45] [INFO ] Deduced a trap composed of 120 places in 2313 ms of which 18 ms to minimize.
[2024-05-24 22:32:47] [INFO ] Deduced a trap composed of 103 places in 2267 ms of which 19 ms to minimize.
[2024-05-24 22:32:50] [INFO ] Deduced a trap composed of 108 places in 2298 ms of which 18 ms to minimize.
[2024-05-24 22:32:52] [INFO ] Deduced a trap composed of 113 places in 2294 ms of which 19 ms to minimize.
[2024-05-24 22:32:54] [INFO ] Deduced a trap composed of 108 places in 2284 ms of which 19 ms to minimize.
[2024-05-24 22:32:57] [INFO ] Deduced a trap composed of 107 places in 2301 ms of which 18 ms to minimize.
[2024-05-24 22:32:59] [INFO ] Deduced a trap composed of 101 places in 2301 ms of which 21 ms to minimize.
[2024-05-24 22:33:01] [INFO ] Deduced a trap composed of 127 places in 2312 ms of which 19 ms to minimize.
[2024-05-24 22:33:04] [INFO ] Deduced a trap composed of 103 places in 2283 ms of which 16 ms to minimize.
[2024-05-24 22:33:06] [INFO ] Deduced a trap composed of 104 places in 2258 ms of which 18 ms to minimize.
SMT process timed out in 45639ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 2796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2796/2796 places, 9165/9165 transitions.
Applied a total of 0 rules in 445 ms. Remains 2796 /2796 variables (removed 0) and now considering 9165/9165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 2796/2796 places, 9165/9165 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2796/2796 places, 9165/9165 transitions.
Applied a total of 0 rules in 444 ms. Remains 2796 /2796 variables (removed 0) and now considering 9165/9165 (removed 0) transitions.
[2024-05-24 22:33:07] [INFO ] Flow matrix only has 8280 transitions (discarded 885 similar events)
[2024-05-24 22:33:07] [INFO ] Invariant cache hit.
[2024-05-24 22:33:12] [INFO ] Implicit Places using invariants in 4963 ms returned [1333]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4973 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2795/2796 places, 9165/9165 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2794 transition count 9164
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2794 transition count 9164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 2793 transition count 9163
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2793 transition count 9163
Applied a total of 4 rules in 828 ms. Remains 2793 /2795 variables (removed 2) and now considering 9163/9165 (removed 2) transitions.
[2024-05-24 22:33:13] [INFO ] Flow matrix only has 8278 transitions (discarded 885 similar events)
// Phase 1: matrix 8278 rows 2793 cols
[2024-05-24 22:33:13] [INFO ] Computed 60 invariants in 152 ms
[2024-05-24 22:33:18] [INFO ] Implicit Places using invariants in 5156 ms returned []
[2024-05-24 22:33:18] [INFO ] Flow matrix only has 8278 transitions (discarded 885 similar events)
[2024-05-24 22:33:18] [INFO ] Invariant cache hit.
[2024-05-24 22:33:21] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-05-24 22:33:52] [INFO ] Performed 514/2793 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 22:34:23] [INFO ] Performed 958/2793 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 22:34:53] [INFO ] Performed 1166/2793 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 22:35:23] [INFO ] Performed 1308/2793 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-24 22:35:23] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-24 22:35:23] [INFO ] Implicit Places using invariants and state equation in 124880 ms returned []
Implicit Place search using SMT with State Equation took 130039 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2793/2796 places, 9163/9165 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 136284 ms. Remains : 2793/2796 places, 9163/9165 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 11 factoid took 290 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 139 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 122 ms :[p2, (NOT p1), p2]
Product exploration explored 100000 steps with 2742 reset in 933 ms.
Product exploration explored 100000 steps with 2742 reset in 994 ms.
Built C files in :
/tmp/ltsmin8754927843502373918
[2024-05-24 22:35:25] [INFO ] Too many transitions (7089) to apply POR reductions. Disabling POR matrices.
[2024-05-24 22:35:25] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8754927843502373918
Running compilation step : cd /tmp/ltsmin8754927843502373918;'/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/ltsmin8754927843502373918;'/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/ltsmin8754927843502373918;'/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 6 out of 3092 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3092/3092 places, 7089/7089 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 3092 transition count 7088
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3091 transition count 7088
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 3090 transition count 7087
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 3090 transition count 7087
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 3089 transition count 7082
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3089 transition count 7082
Applied a total of 6 rules in 1089 ms. Remains 3089 /3092 variables (removed 3) and now considering 7082/7089 (removed 7) transitions.
[2024-05-24 22:35:29] [INFO ] Flow matrix only has 6482 transitions (discarded 600 similar events)
// Phase 1: matrix 6482 rows 3089 cols
[2024-05-24 22:35:30] [INFO ] Computed 61 invariants in 240 ms
[2024-05-24 22:35:34] [INFO ] Implicit Places using invariants in 4616 ms returned [1479]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4620 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3088/3092 places, 7082/7089 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3087 transition count 7081
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 3086 transition count 7080
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 3086 transition count 7080
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 3085 transition count 7075
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3085 transition count 7075
Applied a total of 6 rules in 1419 ms. Remains 3085 /3088 variables (removed 3) and now considering 7075/7082 (removed 7) transitions.
[2024-05-24 22:35:36] [INFO ] Flow matrix only has 6475 transitions (discarded 600 similar events)
// Phase 1: matrix 6475 rows 3085 cols
[2024-05-24 22:35:36] [INFO ] Computed 60 invariants in 118 ms
[2024-05-24 22:35:40] [INFO ] Implicit Places using invariants in 4436 ms returned []
[2024-05-24 22:35:40] [INFO ] Flow matrix only has 6475 transitions (discarded 600 similar events)
[2024-05-24 22:35:40] [INFO ] Invariant cache hit.
[2024-05-24 22:35:43] [INFO ] State equation strengthened by 2622 read => feed constraints.
[2024-05-24 22:36:13] [INFO ] Performed 1089/3085 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 22:36:43] [INFO ] Performed 1779/3085 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 22:37:13] [INFO ] Performed 3040/3085 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 22:37:14] [INFO ] Implicit Places using invariants and state equation in 94440 ms returned [3082]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 98879 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3084/3092 places, 7075/7089 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 3084 transition count 7074
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3083 transition count 7074
Applied a total of 2 rules in 466 ms. Remains 3083 /3084 variables (removed 1) and now considering 7074/7075 (removed 1) transitions.
[2024-05-24 22:37:15] [INFO ] Flow matrix only has 6474 transitions (discarded 600 similar events)
// Phase 1: matrix 6474 rows 3083 cols
[2024-05-24 22:37:15] [INFO ] Computed 59 invariants in 123 ms
[2024-05-24 22:37:19] [INFO ] Implicit Places using invariants in 4428 ms returned []
[2024-05-24 22:37:19] [INFO ] Flow matrix only has 6474 transitions (discarded 600 similar events)
[2024-05-24 22:37:19] [INFO ] Invariant cache hit.
[2024-05-24 22:37:22] [INFO ] State equation strengthened by 2622 read => feed constraints.
[2024-05-24 22:37:52] [INFO ] Performed 1105/3083 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 22:38:22] [INFO ] Performed 1771/3083 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 22:38:52] [INFO ] Performed 2738/3083 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 22:39:01] [INFO ] Implicit Places using invariants and state equation in 101425 ms returned []
Implicit Place search using SMT with State Equation took 105854 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 3083/3092 places, 7074/7089 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 212327 ms. Remains : 3083/3092 places, 7074/7089 transitions.
Built C files in :
/tmp/ltsmin7429495531736498995
[2024-05-24 22:39:01] [INFO ] Too many transitions (7074) to apply POR reductions. Disabling POR matrices.
[2024-05-24 22:39:01] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7429495531736498995
Running compilation step : cd /tmp/ltsmin7429495531736498995;'/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/ltsmin7429495531736498995;'/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/ltsmin7429495531736498995;'/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 22:39:04] [INFO ] Flatten gal took : 145 ms
[2024-05-24 22:39:04] [INFO ] Flatten gal took : 152 ms
[2024-05-24 22:39:04] [INFO ] Time to serialize gal into /tmp/LTL18333514476963872342.gal : 31 ms
[2024-05-24 22:39:04] [INFO ] Time to serialize properties into /tmp/LTL4883067897575788768.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/LTL18333514476963872342.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14289108561144887530.hoa' '-atoms' '/tmp/LTL4883067897575788768.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/LTL4883067897575788768.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14289108561144887530.hoa
Detected timeout of ITS tools.
[2024-05-24 22:39:19] [INFO ] Flatten gal took : 142 ms
[2024-05-24 22:39:20] [INFO ] Flatten gal took : 149 ms
[2024-05-24 22:39:20] [INFO ] Time to serialize gal into /tmp/LTL10654344337345724030.gal : 29 ms
[2024-05-24 22:39:20] [INFO ] Time to serialize properties into /tmp/LTL16708591866836216431.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/LTL10654344337345724030.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16708591866836216431.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("((Node1ManageTheCrashOfNode12>=1)&&(Lx2IsAtTheLeftExtremityOfTheLeafSet>=1))"))||("((Node19HasAskedItsLeafSetToLx3ToReplac...522
Formula 0 simplified : XF((!"((Node19HasAskedItsLeafSetToLx3ToReplaceNode7>=1)&&(LeafSetOfLx3IsSentToNode19>=1))" & G!"((Node1ManageTheCrashOfNode12>=1)&&(...499
Detected timeout of ITS tools.
[2024-05-24 22:39:35] [INFO ] Flatten gal took : 145 ms
[2024-05-24 22:39:35] [INFO ] Applying decomposition
[2024-05-24 22:39:35] [INFO ] Flatten gal took : 155 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/graph5972856393951673483.txt' '-o' '/tmp/graph5972856393951673483.bin' '-w' '/tmp/graph5972856393951673483.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5972856393951673483.bin' '-l' '-1' '-v' '-w' '/tmp/graph5972856393951673483.weights' '-q' '0' '-e' '0.001'
[2024-05-24 22:39:35] [INFO ] Decomposing Gal with order
[2024-05-24 22:39:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 22:39:36] [INFO ] Removed a total of 6632 redundant transitions.
[2024-05-24 22:39:36] [INFO ] Flatten gal took : 738 ms
[2024-05-24 22:39:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 4221 labels/synchronizations in 294 ms.
[2024-05-24 22:39:37] [INFO ] Time to serialize gal into /tmp/LTL7703768566534451148.gal : 58 ms
[2024-05-24 22:39:37] [INFO ] Time to serialize properties into /tmp/LTL14555411777010614279.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/LTL7703768566534451148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14555411777010614279.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G(((F("((i33.i0.u331.Node1ManageTheCrashOfNode12>=1)&&(i33.i0.u335.Lx2IsAtTheLeftExtremityOfTheLeafSet>=1))"))||("((i33.i1.u336.N...632
Formula 0 simplified : XF((!"((i33.i1.u336.Node19HasAskedItsLeafSetToLx3ToReplaceNode7>=1)&&(i33.i1.u336.LeafSetOfLx3IsSentToNode19>=1))" & G!"((i33.i0.u33...609
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-11 finished in 864804 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 1 out of 3246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3246/3246 places, 7332/7332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 3246 transition count 7315
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 3229 transition count 7315
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 34 place count 3229 transition count 7293
Deduced a syphon composed of 22 places in 9 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 78 place count 3207 transition count 7293
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 90 place count 3195 transition count 7269
Iterating global reduction 2 with 12 rules applied. Total rules applied 102 place count 3195 transition count 7269
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 102 place count 3195 transition count 7264
Deduced a syphon composed of 5 places in 10 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 112 place count 3190 transition count 7264
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 120 place count 3182 transition count 7224
Iterating global reduction 2 with 8 rules applied. Total rules applied 128 place count 3182 transition count 7224
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 6 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 190 place count 3151 transition count 7193
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 195 place count 3146 transition count 7188
Iterating global reduction 2 with 5 rules applied. Total rules applied 200 place count 3146 transition count 7188
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 205 place count 3141 transition count 7163
Iterating global reduction 2 with 5 rules applied. Total rules applied 210 place count 3141 transition count 7163
Applied a total of 210 rules in 2250 ms. Remains 3141 /3246 variables (removed 105) and now considering 7163/7332 (removed 169) transitions.
[2024-05-24 22:39:54] [INFO ] Flow matrix only has 6563 transitions (discarded 600 similar events)
// Phase 1: matrix 6563 rows 3141 cols
[2024-05-24 22:39:54] [INFO ] Computed 76 invariants in 193 ms
[2024-05-24 22:39:59] [INFO ] Implicit Places using invariants in 4801 ms returned [465, 560, 1045, 1217, 1492, 1525, 1526, 1545, 1559, 1580, 1628, 1650, 1785, 1869, 1915, 2690]
[2024-05-24 22:39:59] [INFO ] Actually due to overlaps returned [560, 465, 1045, 1217, 1492, 1525, 1526, 1559, 1580, 1628, 1650, 1785, 1869, 1915, 2690]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 4805 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3126/3246 places, 7163/7332 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3115 transition count 7152
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3115 transition count 7152
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 3104 transition count 7141
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 3104 transition count 7141
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 3094 transition count 7091
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 3094 transition count 7091
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 3091 transition count 7088
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 3088 transition count 7085
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 3088 transition count 7085
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 3085 transition count 7070
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 3085 transition count 7070
Applied a total of 82 rules in 2507 ms. Remains 3085 /3126 variables (removed 41) and now considering 7070/7163 (removed 93) transitions.
[2024-05-24 22:40:02] [INFO ] Flow matrix only has 6470 transitions (discarded 600 similar events)
// Phase 1: matrix 6470 rows 3085 cols
[2024-05-24 22:40:02] [INFO ] Computed 61 invariants in 168 ms
[2024-05-24 22:40:06] [INFO ] Implicit Places using invariants in 4593 ms returned [1527]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4597 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3084/3246 places, 7070/7332 transitions.
Applied a total of 0 rules in 444 ms. Remains 3084 /3084 variables (removed 0) and now considering 7070/7070 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 14609 ms. Remains : 3084/3246 places, 7070/7332 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-12
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-12 finished in 14723 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((G(p0)||(p0&&F(!p1))))))'
Support contains 3 out of 3246 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3246/3246 places, 7332/7332 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3230 transition count 7308
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3230 transition count 7308
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 45 place count 3217 transition count 7263
Iterating global reduction 0 with 13 rules applied. Total rules applied 58 place count 3217 transition count 7263
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 3212 transition count 7238
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 3212 transition count 7238
Applied a total of 68 rules in 1220 ms. Remains 3212 /3246 variables (removed 34) and now considering 7238/7332 (removed 94) transitions.
[2024-05-24 22:40:08] [INFO ] Flow matrix only has 6638 transitions (discarded 600 similar events)
// Phase 1: matrix 6638 rows 3212 cols
[2024-05-24 22:40:08] [INFO ] Computed 76 invariants in 160 ms
[2024-05-24 22:40:13] [INFO ] Implicit Places using invariants in 4773 ms returned [487, 583, 978, 1068, 1244, 1525, 1560, 1561, 1583, 1597, 1620, 1670, 1694, 1832, 1918, 1966]
[2024-05-24 22:40:13] [INFO ] Actually due to overlaps returned [583, 487, 978, 1068, 1244, 1525, 1560, 1561, 1597, 1620, 1670, 1694, 1832, 1918, 1966]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 4778 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3197/3246 places, 7238/7332 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3183 transition count 7224
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3183 transition count 7224
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 3169 transition count 7210
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 3169 transition count 7210
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 70 place count 3155 transition count 7196
Iterating global reduction 0 with 14 rules applied. Total rules applied 84 place count 3155 transition count 7196
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 97 place count 3142 transition count 7131
Iterating global reduction 0 with 13 rules applied. Total rules applied 110 place count 3142 transition count 7131
Applied a total of 110 rules in 1541 ms. Remains 3142 /3197 variables (removed 55) and now considering 7131/7238 (removed 107) transitions.
[2024-05-24 22:40:14] [INFO ] Flow matrix only has 6531 transitions (discarded 600 similar events)
// Phase 1: matrix 6531 rows 3142 cols
[2024-05-24 22:40:14] [INFO ] Computed 61 invariants in 135 ms
[2024-05-24 22:40:19] [INFO ] Implicit Places using invariants in 4470 ms returned [1555]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4475 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3141/3246 places, 7131/7332 transitions.
Applied a total of 0 rules in 294 ms. Remains 3141 /3141 variables (removed 0) and now considering 7131/7131 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12309 ms. Remains : 3141/3246 places, 7131/7332 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 1364 ms.
Product exploration explored 100000 steps with 50000 reset in 1375 ms.
Computed a total of 517 stabilizing places and 1930 stable transitions
Computed a total of 517 stabilizing places and 1930 stable transitions
Detected a total of 517/3141 stabilizing places and 1930/7131 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 20 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-13 finished in 15220 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' '!(X(((p0||X(X(F(!p1)))) U (p2&&(p0||X(X(F(!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' '!(X(G(((p0||F(p1)) U (G(!p2)||(!p2&&F(!p3)))))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-11
Stuttering acceptance computed with spot in 305 ms :[p2, p2, (NOT p1), p2, (AND (NOT p1) p3 p2), (AND p2 p3), (AND (NOT p1) p3)]
Support contains 8 out of 3246 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3246/3246 places, 7332/7332 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 3246 transition count 7314
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 3228 transition count 7314
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 36 place count 3228 transition count 7294
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 76 place count 3208 transition count 7294
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 85 place count 3199 transition count 7277
Iterating global reduction 2 with 9 rules applied. Total rules applied 94 place count 3199 transition count 7277
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 94 place count 3199 transition count 7272
Deduced a syphon composed of 5 places in 7 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 3194 transition count 7272
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 110 place count 3188 transition count 7242
Iterating global reduction 2 with 6 rules applied. Total rules applied 116 place count 3188 transition count 7242
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 6 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 178 place count 3157 transition count 7211
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 184 place count 3151 transition count 7205
Iterating global reduction 2 with 6 rules applied. Total rules applied 190 place count 3151 transition count 7205
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 196 place count 3145 transition count 7175
Iterating global reduction 2 with 6 rules applied. Total rules applied 202 place count 3145 transition count 7175
Applied a total of 202 rules in 2162 ms. Remains 3145 /3246 variables (removed 101) and now considering 7175/7332 (removed 157) transitions.
[2024-05-24 22:40:25] [INFO ] Flow matrix only has 6575 transitions (discarded 600 similar events)
// Phase 1: matrix 6575 rows 3145 cols
[2024-05-24 22:40:25] [INFO ] Computed 76 invariants in 190 ms
[2024-05-24 22:40:29] [INFO ] Implicit Places using invariants in 4686 ms returned [466, 561, 953, 1043, 1215, 1526, 1527, 1546, 1560, 1581, 1629, 1651, 1786, 1870, 2694]
[2024-05-24 22:40:29] [INFO ] Actually due to overlaps returned [561, 466, 953, 1043, 1215, 1526, 1527, 1560, 1581, 1629, 1651, 1786, 1870, 2694]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 4691 ms to find 14 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 3131/3246 places, 7175/7332 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3121 transition count 7165
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3121 transition count 7165
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 3111 transition count 7155
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 3111 transition count 7155
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 3102 transition count 7110
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 3102 transition count 7110
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 3099 transition count 7107
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 3096 transition count 7104
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 3096 transition count 7104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 3093 transition count 7089
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 3093 transition count 7089
Applied a total of 76 rules in 2316 ms. Remains 3093 /3131 variables (removed 38) and now considering 7089/7175 (removed 86) transitions.
[2024-05-24 22:40:32] [INFO ] Flow matrix only has 6489 transitions (discarded 600 similar events)
// Phase 1: matrix 6489 rows 3093 cols
[2024-05-24 22:40:32] [INFO ] Computed 62 invariants in 154 ms
[2024-05-24 22:40:36] [INFO ] Implicit Places using invariants in 4527 ms returned [1528]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4533 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 3092/3246 places, 7089/7332 transitions.
Applied a total of 0 rules in 339 ms. Remains 3092 /3092 variables (removed 0) and now considering 7089/7089 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 14043 ms. Remains : 3092/3246 places, 7089/7332 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-11
Product exploration explored 100000 steps with 2742 reset in 937 ms.
Product exploration explored 100000 steps with 2742 reset in 989 ms.
Computed a total of 493 stabilizing places and 1913 stable transitions
Computed a total of 493 stabilizing places and 1913 stable transitions
Detected a total of 493/3092 stabilizing places and 1913/7089 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 503 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 16 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 243 ms :[p2, (NOT p1), p2, (AND (NOT p1) p3 p2), (AND p2 p3), (AND (NOT p1) p3)]
RANDOM walk for 40000 steps (1092 resets) in 632 ms. (63 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (152 resets) in 350 ms. (113 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (152 resets) in 383 ms. (104 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (152 resets) in 425 ms. (93 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (152 resets) in 391 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (152 resets) in 338 ms. (118 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (152 resets) in 320 ms. (124 steps per ms) remains 6/6 properties
[2024-05-24 22:40:40] [INFO ] Flow matrix only has 6489 transitions (discarded 600 similar events)
// Phase 1: matrix 6489 rows 3092 cols
[2024-05-24 22:40:40] [INFO ] Computed 61 invariants in 148 ms
[2024-05-24 22:40:40] [INFO ] State equation strengthened by 2630 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2397/2405 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2405 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
Problem apf4 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 3 (OVERLAPS) 638/3043 variables, 7/12 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-24 22:40:43] [INFO ] Deduced a trap composed of 127 places in 2124 ms of which 20 ms to minimize.
[2024-05-24 22:40:46] [INFO ] Deduced a trap composed of 113 places in 2212 ms of which 20 ms to minimize.
SMT process timed out in 5288ms, After SMT, problems are : Problem set: 3 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 3092 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3092/3092 places, 7089/7089 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 3092 transition count 7088
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3091 transition count 7088
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 3090 transition count 7087
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 3090 transition count 7087
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 3089 transition count 7082
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3089 transition count 7082
Free-agglomeration rule (complex) applied 293 times.
Iterating global reduction 0 with 293 rules applied. Total rules applied 299 place count 3089 transition count 9165
Reduce places removed 293 places and 0 transitions.
Iterating post reduction 0 with 293 rules applied. Total rules applied 592 place count 2796 transition count 9165
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 593 place count 2796 transition count 9165
Applied a total of 593 rules in 2099 ms. Remains 2796 /3092 variables (removed 296) and now considering 9165/7089 (removed -2076) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2100 ms. Remains : 2796/3092 places, 9165/7089 transitions.
RANDOM walk for 40000 steps (1361 resets) in 2071 ms. (19 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (91 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (92 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (107 resets) in 217 ms. (183 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 28212 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 3
Probabilistic random walk after 28212 steps, saw 11938 distinct states, run finished after 3002 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-24 22:40:51] [INFO ] Flow matrix only has 8280 transitions (discarded 885 similar events)
// Phase 1: matrix 8280 rows 2796 cols
[2024-05-24 22:40:52] [INFO ] Computed 61 invariants in 168 ms
[2024-05-24 22:40:52] [INFO ] State equation strengthened by 5002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2702/2708 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 22:40:54] [INFO ] Deduced a trap composed of 401 places in 2019 ms of which 16 ms to minimize.
[2024-05-24 22:40:56] [INFO ] Deduced a trap composed of 280 places in 2020 ms of which 17 ms to minimize.
[2024-05-24 22:40:58] [INFO ] Deduced a trap composed of 155 places in 2005 ms of which 17 ms to minimize.
[2024-05-24 22:41:00] [INFO ] Deduced a trap composed of 175 places in 2010 ms of which 17 ms to minimize.
[2024-05-24 22:41:02] [INFO ] Deduced a trap composed of 147 places in 1996 ms of which 17 ms to minimize.
[2024-05-24 22:41:04] [INFO ] Deduced a trap composed of 487 places in 2023 ms of which 18 ms to minimize.
[2024-05-24 22:41:06] [INFO ] Deduced a trap composed of 194 places in 2010 ms of which 17 ms to minimize.
[2024-05-24 22:41:08] [INFO ] Deduced a trap composed of 356 places in 2031 ms of which 17 ms to minimize.
[2024-05-24 22:41:10] [INFO ] Deduced a trap composed of 226 places in 2035 ms of which 17 ms to minimize.
[2024-05-24 22:41:12] [INFO ] Deduced a trap composed of 211 places in 2015 ms of which 18 ms to minimize.
[2024-05-24 22:41:14] [INFO ] Deduced a trap composed of 261 places in 1976 ms of which 17 ms to minimize.
[2024-05-24 22:41:17] [INFO ] Deduced a trap composed of 172 places in 2018 ms of which 17 ms to minimize.
[2024-05-24 22:41:19] [INFO ] Deduced a trap composed of 338 places in 2009 ms of which 18 ms to minimize.
[2024-05-24 22:41:21] [INFO ] Deduced a trap composed of 384 places in 1999 ms of which 17 ms to minimize.
[2024-05-24 22:41:23] [INFO ] Deduced a trap composed of 309 places in 2007 ms of which 17 ms to minimize.
[2024-05-24 22:41:25] [INFO ] Deduced a trap composed of 340 places in 2002 ms of which 17 ms to minimize.
[2024-05-24 22:41:27] [INFO ] Deduced a trap composed of 246 places in 2003 ms of which 16 ms to minimize.
[2024-05-24 22:41:29] [INFO ] Deduced a trap composed of 139 places in 1953 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2708 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2708 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 39/2747 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2747 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 42/2789 variables, 42/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2789 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 7/2796 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2796 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 8280/11076 variables, 2796/2875 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/11076 variables, 5002/7877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/11076 variables, 0/7877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 11076/11076 variables, and 7877 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45032 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 2796/2796 constraints, ReadFeed: 5002/5002 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2702/2708 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2708 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2708 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 39/2747 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 22:41:39] [INFO ] Deduced a trap composed of 5 places in 2107 ms of which 18 ms to minimize.
[2024-05-24 22:41:41] [INFO ] Deduced a trap composed of 102 places in 2080 ms of which 19 ms to minimize.
[2024-05-24 22:41:44] [INFO ] Deduced a trap composed of 171 places in 2075 ms of which 16 ms to minimize.
[2024-05-24 22:41:46] [INFO ] Deduced a trap composed of 88 places in 2018 ms of which 17 ms to minimize.
[2024-05-24 22:41:48] [INFO ] Deduced a trap composed of 99 places in 2033 ms of which 18 ms to minimize.
[2024-05-24 22:41:50] [INFO ] Deduced a trap composed of 89 places in 2072 ms of which 17 ms to minimize.
[2024-05-24 22:41:52] [INFO ] Deduced a trap composed of 93 places in 2078 ms of which 17 ms to minimize.
[2024-05-24 22:41:54] [INFO ] Deduced a trap composed of 99 places in 2103 ms of which 17 ms to minimize.
[2024-05-24 22:41:56] [INFO ] Deduced a trap composed of 96 places in 2117 ms of which 18 ms to minimize.
[2024-05-24 22:41:58] [INFO ] Deduced a trap composed of 97 places in 2125 ms of which 18 ms to minimize.
[2024-05-24 22:42:00] [INFO ] Deduced a trap composed of 94 places in 2082 ms of which 18 ms to minimize.
[2024-05-24 22:42:03] [INFO ] Deduced a trap composed of 103 places in 2260 ms of which 18 ms to minimize.
[2024-05-24 22:42:05] [INFO ] Deduced a trap composed of 95 places in 2072 ms of which 17 ms to minimize.
[2024-05-24 22:42:07] [INFO ] Deduced a trap composed of 90 places in 2074 ms of which 18 ms to minimize.
[2024-05-24 22:42:09] [INFO ] Deduced a trap composed of 92 places in 2135 ms of which 18 ms to minimize.
[2024-05-24 22:42:12] [INFO ] Deduced a trap composed of 88 places in 2205 ms of which 18 ms to minimize.
[2024-05-24 22:42:14] [INFO ] Deduced a trap composed of 96 places in 2179 ms of which 17 ms to minimize.
[2024-05-24 22:42:16] [INFO ] Deduced a trap composed of 109 places in 2170 ms of which 20 ms to minimize.
[2024-05-24 22:42:18] [INFO ] Deduced a trap composed of 108 places in 2161 ms of which 19 ms to minimize.
[2024-05-24 22:42:20] [INFO ] Deduced a trap composed of 156 places in 2232 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2747 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 22:42:23] [INFO ] Deduced a trap composed of 108 places in 2084 ms of which 19 ms to minimize.
SMT process timed out in 91227ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 2796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2796/2796 places, 9165/9165 transitions.
Applied a total of 0 rules in 448 ms. Remains 2796 /2796 variables (removed 0) and now considering 9165/9165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 448 ms. Remains : 2796/2796 places, 9165/9165 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2796/2796 places, 9165/9165 transitions.
Applied a total of 0 rules in 450 ms. Remains 2796 /2796 variables (removed 0) and now considering 9165/9165 (removed 0) transitions.
[2024-05-24 22:42:24] [INFO ] Flow matrix only has 8280 transitions (discarded 885 similar events)
[2024-05-24 22:42:24] [INFO ] Invariant cache hit.
[2024-05-24 22:42:28] [INFO ] Implicit Places using invariants in 4846 ms returned [1331]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4856 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2795/2796 places, 9165/9165 transitions.
Applied a total of 0 rules in 453 ms. Remains 2795 /2795 variables (removed 0) and now considering 9165/9165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5760 ms. Remains : 2795/2796 places, 9165/9165 transitions.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3 (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (OR (NOT p2) (NOT p3))), (G (OR p1 (NOT p2) (NOT p3))), (G (OR p0 p1 (NOT p2) (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR p0 p1 p2 (NOT p3)))), (F p3), (F (NOT (OR p2 (NOT p3)))), (F p1), (F (NOT (OR p1 p2 (NOT p3)))), (F (NOT (OR p1 (NOT p3))))]
Knowledge based reduction with 22 factoid took 1232 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 114 ms :[p2, (NOT p1), p2]
Support contains 6 out of 3092 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 : 3092/3092 places, 7089/7089 transitions.
Applied a total of 0 rules in 437 ms. Remains 3092 /3092 variables (removed 0) and now considering 7089/7089 (removed 0) transitions.
[2024-05-24 22:42:31] [INFO ] Flow matrix only has 6489 transitions (discarded 600 similar events)
// Phase 1: matrix 6489 rows 3092 cols
[2024-05-24 22:42:31] [INFO ] Computed 61 invariants in 154 ms
[2024-05-24 22:42:35] [INFO ] Implicit Places using invariants in 4564 ms returned []
[2024-05-24 22:42:35] [INFO ] Flow matrix only has 6489 transitions (discarded 600 similar events)
[2024-05-24 22:42:35] [INFO ] Invariant cache hit.
[2024-05-24 22:42:38] [INFO ] State equation strengthened by 2630 read => feed constraints.
[2024-05-24 22:43:08] [INFO ] Performed 1091/3092 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 22:43:39] [INFO ] Performed 1772/3092 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 22:44:09] [INFO ] Performed 2957/3092 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 22:44:12] [INFO ] Implicit Places using invariants and state equation in 96203 ms returned []
Implicit Place search using SMT with State Equation took 100769 ms to find 0 implicit places.
[2024-05-24 22:44:12] [INFO ] Redundant transitions in 469 ms returned []
Running 7064 sub problems to find dead transitions.
[2024-05-24 22:44:12] [INFO ] Flow matrix only has 6489 transitions (discarded 600 similar events)
[2024-05-24 22:44:12] [INFO ] Invariant cache hit.
[2024-05-24 22:44:12] [INFO ] State equation strengthened by 2630 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3090 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7064 unsolved
SMT process timed out in 45196ms, After SMT, problems are : Problem set: 0 solved, 7064 unsolved
Search for dead transitions found 0 dead transitions in 45258ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 146956 ms. Remains : 3092/3092 places, 7089/7089 transitions.
Computed a total of 493 stabilizing places and 1913 stable transitions
Computed a total of 493 stabilizing places and 1913 stable transitions
Detected a total of 493/3092 stabilizing places and 1913/7089 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 218 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[p2, (NOT p1), p2]
RANDOM walk for 40000 steps (1093 resets) in 1716 ms. (23 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (152 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (152 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
[2024-05-24 22:44:58] [INFO ] Flow matrix only has 6489 transitions (discarded 600 similar events)
[2024-05-24 22:44:58] [INFO ] Invariant cache hit.
[2024-05-24 22:44:58] [INFO ] State equation strengthened by 2630 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2399/2405 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2405 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 638/3043 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 22:45:01] [INFO ] Deduced a trap composed of 99 places in 2286 ms of which 18 ms to minimize.
[2024-05-24 22:45:04] [INFO ] Deduced a trap composed of 105 places in 2333 ms of which 20 ms to minimize.
SMT process timed out in 5268ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 3092 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3092/3092 places, 7089/7089 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 3092 transition count 7088
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3091 transition count 7088
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 3090 transition count 7087
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 3090 transition count 7087
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 3089 transition count 7082
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3089 transition count 7082
Free-agglomeration rule (complex) applied 293 times.
Iterating global reduction 0 with 293 rules applied. Total rules applied 299 place count 3089 transition count 9165
Reduce places removed 293 places and 0 transitions.
Iterating post reduction 0 with 293 rules applied. Total rules applied 592 place count 2796 transition count 9165
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 593 place count 2796 transition count 9165
Applied a total of 593 rules in 2108 ms. Remains 2796 /3092 variables (removed 296) and now considering 9165/7089 (removed -2076) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2109 ms. Remains : 2796/3092 places, 9165/7089 transitions.
RANDOM walk for 40000 steps (1362 resets) in 1780 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (92 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (91 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 28997 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 2
Probabilistic random walk after 28997 steps, saw 12260 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-24 22:45:09] [INFO ] Flow matrix only has 8280 transitions (discarded 885 similar events)
// Phase 1: matrix 8280 rows 2796 cols
[2024-05-24 22:45:10] [INFO ] Computed 61 invariants in 143 ms
[2024-05-24 22:45:10] [INFO ] State equation strengthened by 5002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2702/2708 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 22:45:12] [INFO ] Deduced a trap composed of 504 places in 2106 ms of which 18 ms to minimize.
[2024-05-24 22:45:14] [INFO ] Deduced a trap composed of 127 places in 2106 ms of which 18 ms to minimize.
[2024-05-24 22:45:16] [INFO ] Deduced a trap composed of 122 places in 2086 ms of which 17 ms to minimize.
[2024-05-24 22:45:18] [INFO ] Deduced a trap composed of 206 places in 1976 ms of which 17 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2708 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2708 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 39/2747 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 22:45:21] [INFO ] Deduced a trap composed of 5 places in 1917 ms of which 16 ms to minimize.
[2024-05-24 22:45:23] [INFO ] Deduced a trap composed of 171 places in 2068 ms of which 19 ms to minimize.
[2024-05-24 22:45:25] [INFO ] Deduced a trap composed of 173 places in 2158 ms of which 19 ms to minimize.
[2024-05-24 22:45:27] [INFO ] Deduced a trap composed of 171 places in 2064 ms of which 19 ms to minimize.
[2024-05-24 22:45:29] [INFO ] Deduced a trap composed of 173 places in 2110 ms of which 20 ms to minimize.
[2024-05-24 22:45:31] [INFO ] Deduced a trap composed of 172 places in 2129 ms of which 19 ms to minimize.
[2024-05-24 22:45:33] [INFO ] Deduced a trap composed of 173 places in 2094 ms of which 19 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2747 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2747 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/2789 variables, 42/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2789 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/2796 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2796 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8280/11076 variables, 2796/2868 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/11076 variables, 5002/7870 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/11076 variables, 0/7870 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/11076 variables, 0/7870 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11076/11076 variables, and 7870 constraints, problems are : Problem set: 0 solved, 2 unsolved in 29728 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 2796/2796 constraints, ReadFeed: 5002/5002 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2702/2708 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2708 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 22:45:42] [INFO ] Deduced a trap composed of 168 places in 2016 ms of which 18 ms to minimize.
[2024-05-24 22:45:44] [INFO ] Deduced a trap composed of 277 places in 1956 ms of which 17 ms to minimize.
[2024-05-24 22:45:46] [INFO ] Deduced a trap composed of 177 places in 2003 ms of which 17 ms to minimize.
[2024-05-24 22:45:48] [INFO ] Deduced a trap composed of 160 places in 1899 ms of which 16 ms to minimize.
[2024-05-24 22:45:50] [INFO ] Deduced a trap composed of 140 places in 2099 ms of which 18 ms to minimize.
[2024-05-24 22:45:52] [INFO ] Deduced a trap composed of 252 places in 2120 ms of which 18 ms to minimize.
[2024-05-24 22:45:54] [INFO ] Deduced a trap composed of 163 places in 2015 ms of which 18 ms to minimize.
[2024-05-24 22:45:56] [INFO ] Deduced a trap composed of 170 places in 2125 ms of which 18 ms to minimize.
[2024-05-24 22:45:58] [INFO ] Deduced a trap composed of 346 places in 2076 ms of which 18 ms to minimize.
[2024-05-24 22:46:00] [INFO ] Deduced a trap composed of 275 places in 2092 ms of which 18 ms to minimize.
[2024-05-24 22:46:02] [INFO ] Deduced a trap composed of 289 places in 2030 ms of which 17 ms to minimize.
[2024-05-24 22:46:05] [INFO ] Deduced a trap composed of 165 places in 2126 ms of which 18 ms to minimize.
[2024-05-24 22:46:07] [INFO ] Deduced a trap composed of 353 places in 2112 ms of which 18 ms to minimize.
[2024-05-24 22:46:09] [INFO ] Deduced a trap composed of 356 places in 2109 ms of which 18 ms to minimize.
[2024-05-24 22:46:11] [INFO ] Deduced a trap composed of 445 places in 1987 ms of which 15 ms to minimize.
[2024-05-24 22:46:13] [INFO ] Deduced a trap composed of 309 places in 1920 ms of which 17 ms to minimize.
[2024-05-24 22:46:15] [INFO ] Deduced a trap composed of 258 places in 2012 ms of which 20 ms to minimize.
[2024-05-24 22:46:17] [INFO ] Deduced a trap composed of 272 places in 2086 ms of which 17 ms to minimize.
[2024-05-24 22:46:19] [INFO ] Deduced a trap composed of 318 places in 2016 ms of which 17 ms to minimize.
[2024-05-24 22:46:21] [INFO ] Deduced a trap composed of 272 places in 1996 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2708 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2708 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 39/2747 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2747 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 22:46:23] [INFO ] Deduced a trap composed of 169 places in 2127 ms of which 19 ms to minimize.
[2024-05-24 22:46:25] [INFO ] Deduced a trap composed of 170 places in 1935 ms of which 18 ms to minimize.
SMT process timed out in 76053ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 2796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2796/2796 places, 9165/9165 transitions.
Applied a total of 0 rules in 451 ms. Remains 2796 /2796 variables (removed 0) and now considering 9165/9165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 451 ms. Remains : 2796/2796 places, 9165/9165 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2796/2796 places, 9165/9165 transitions.
Applied a total of 0 rules in 447 ms. Remains 2796 /2796 variables (removed 0) and now considering 9165/9165 (removed 0) transitions.
[2024-05-24 22:46:26] [INFO ] Flow matrix only has 8280 transitions (discarded 885 similar events)
[2024-05-24 22:46:26] [INFO ] Invariant cache hit.
[2024-05-24 22:46:31] [INFO ] Implicit Places using invariants in 4864 ms returned [1331]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4871 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2795/2796 places, 9165/9165 transitions.
Applied a total of 0 rules in 447 ms. Remains 2795 /2795 variables (removed 0) and now considering 9165/9165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5766 ms. Remains : 2795/2796 places, 9165/9165 transitions.
RANDOM walk for 40000 steps (1361 resets) in 1731 ms. (23 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (92 resets) in 173 ms. (229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (90 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 28990 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 2
Probabilistic random walk after 28990 steps, saw 12257 distinct states, run finished after 3001 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-24 22:46:35] [INFO ] Flow matrix only has 8280 transitions (discarded 885 similar events)
// Phase 1: matrix 8280 rows 2795 cols
[2024-05-24 22:46:35] [INFO ] Computed 60 invariants in 142 ms
[2024-05-24 22:46:35] [INFO ] State equation strengthened by 5002 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2702/2708 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 22:46:38] [INFO ] Deduced a trap composed of 177 places in 2050 ms of which 17 ms to minimize.
[2024-05-24 22:46:40] [INFO ] Deduced a trap composed of 165 places in 1957 ms of which 18 ms to minimize.
[2024-05-24 22:46:42] [INFO ] Deduced a trap composed of 275 places in 2013 ms of which 18 ms to minimize.
[2024-05-24 22:46:44] [INFO ] Deduced a trap composed of 301 places in 1985 ms of which 18 ms to minimize.
[2024-05-24 22:46:46] [INFO ] Deduced a trap composed of 170 places in 2023 ms of which 17 ms to minimize.
[2024-05-24 22:46:48] [INFO ] Deduced a trap composed of 140 places in 2027 ms of which 17 ms to minimize.
[2024-05-24 22:46:50] [INFO ] Deduced a trap composed of 168 places in 1996 ms of which 18 ms to minimize.
[2024-05-24 22:46:52] [INFO ] Deduced a trap composed of 504 places in 2018 ms of which 18 ms to minimize.
[2024-05-24 22:46:54] [INFO ] Deduced a trap composed of 272 places in 2010 ms of which 17 ms to minimize.
[2024-05-24 22:46:56] [INFO ] Deduced a trap composed of 318 places in 2017 ms of which 17 ms to minimize.
[2024-05-24 22:46:58] [INFO ] Deduced a trap composed of 127 places in 2033 ms of which 17 ms to minimize.
[2024-05-24 22:47:00] [INFO ] Deduced a trap composed of 346 places in 2002 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2708 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2708 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 38/2746 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 22:47:03] [INFO ] Deduced a trap composed of 5 places in 2178 ms of which 18 ms to minimize.
[2024-05-24 22:47:05] [INFO ] Deduced a trap composed of 86 places in 2149 ms of which 18 ms to minimize.
[2024-05-24 22:47:07] [INFO ] Deduced a trap composed of 106 places in 2195 ms of which 19 ms to minimize.
[2024-05-24 22:47:09] [INFO ] Deduced a trap composed of 96 places in 2094 ms of which 18 ms to minimize.
[2024-05-24 22:47:12] [INFO ] Deduced a trap composed of 90 places in 2171 ms of which 19 ms to minimize.
[2024-05-24 22:47:14] [INFO ] Deduced a trap composed of 94 places in 2092 ms of which 18 ms to minimize.
[2024-05-24 22:47:16] [INFO ] Deduced a trap composed of 98 places in 2134 ms of which 17 ms to minimize.
[2024-05-24 22:47:18] [INFO ] Deduced a trap composed of 169 places in 2050 ms of which 19 ms to minimize.
[2024-05-24 22:47:20] [INFO ] Deduced a trap composed of 165 places in 1962 ms of which 18 ms to minimize.
[2024-05-24 22:47:22] [INFO ] Deduced a trap composed of 94 places in 2080 ms of which 19 ms to minimize.
[2024-05-24 22:47:24] [INFO ] Deduced a trap composed of 174 places in 2057 ms of which 18 ms to minimize.
[2024-05-24 22:47:26] [INFO ] Deduced a trap composed of 93 places in 2110 ms of which 17 ms to minimize.
[2024-05-24 22:47:29] [INFO ] Deduced a trap composed of 112 places in 2135 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2746 variables, 13/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2746 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/2788 variables, 42/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2788 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/2795 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2795 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8280/11075 variables, 2795/2880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/11075 variables, 5002/7882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/11075 variables, 0/7882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/11075 variables, 0/7882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11075/11075 variables, and 7882 constraints, problems are : Problem set: 0 solved, 2 unsolved in 61088 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 2795/2795 constraints, ReadFeed: 5002/5002 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2702/2708 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2708 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 22:47:39] [INFO ] Deduced a trap composed of 252 places in 1958 ms of which 15 ms to minimize.
[2024-05-24 22:47:41] [INFO ] Deduced a trap composed of 258 places in 1929 ms of which 16 ms to minimize.
[2024-05-24 22:47:43] [INFO ] Deduced a trap composed of 289 places in 1989 ms of which 17 ms to minimize.
[2024-05-24 22:47:45] [INFO ] Deduced a trap composed of 160 places in 2041 ms of which 18 ms to minimize.
[2024-05-24 22:47:47] [INFO ] Deduced a trap composed of 412 places in 2027 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2708 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2708 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/2746 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2746 variables, 13/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 22:47:49] [INFO ] Deduced a trap composed of 92 places in 2108 ms of which 17 ms to minimize.
[2024-05-24 22:47:51] [INFO ] Deduced a trap composed of 102 places in 2092 ms of which 18 ms to minimize.
[2024-05-24 22:47:54] [INFO ] Deduced a trap composed of 107 places in 2087 ms of which 19 ms to minimize.
[2024-05-24 22:47:56] [INFO ] Deduced a trap composed of 170 places in 2035 ms of which 18 ms to minimize.
[2024-05-24 22:47:58] [INFO ] Deduced a trap composed of 168 places in 2016 ms of which 17 ms to minimize.
[2024-05-24 22:48:00] [INFO ] Deduced a trap composed of 107 places in 2111 ms of which 19 ms to minimize.
[2024-05-24 22:48:02] [INFO ] Deduced a trap composed of 112 places in 2153 ms of which 18 ms to minimize.
[2024-05-24 22:48:04] [INFO ] Deduced a trap composed of 96 places in 2141 ms of which 18 ms to minimize.
[2024-05-24 22:48:06] [INFO ] Deduced a trap composed of 92 places in 2105 ms of which 19 ms to minimize.
[2024-05-24 22:48:09] [INFO ] Deduced a trap composed of 187 places in 2034 ms of which 18 ms to minimize.
[2024-05-24 22:48:11] [INFO ] Deduced a trap composed of 169 places in 2116 ms of which 18 ms to minimize.
[2024-05-24 22:48:13] [INFO ] Deduced a trap composed of 95 places in 2195 ms of which 18 ms to minimize.
[2024-05-24 22:48:15] [INFO ] Deduced a trap composed of 105 places in 2283 ms of which 18 ms to minimize.
[2024-05-24 22:48:18] [INFO ] Deduced a trap composed of 85 places in 2297 ms of which 17 ms to minimize.
[2024-05-24 22:48:20] [INFO ] Deduced a trap composed of 166 places in 2091 ms of which 18 ms to minimize.
[2024-05-24 22:48:22] [INFO ] Deduced a trap composed of 88 places in 2223 ms of which 18 ms to minimize.
[2024-05-24 22:48:24] [INFO ] Deduced a trap composed of 101 places in 2166 ms of which 18 ms to minimize.
[2024-05-24 22:48:26] [INFO ] Deduced a trap composed of 168 places in 2115 ms of which 18 ms to minimize.
[2024-05-24 22:48:29] [INFO ] Deduced a trap composed of 194 places in 2300 ms of which 19 ms to minimize.
[2024-05-24 22:48:31] [INFO ] Deduced a trap composed of 103 places in 2252 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2746 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 22:48:33] [INFO ] Deduced a trap composed of 119 places in 2211 ms of which 19 ms to minimize.
[2024-05-24 22:48:36] [INFO ] Deduced a trap composed of 103 places in 2269 ms of which 18 ms to minimize.
[2024-05-24 22:48:38] [INFO ] Deduced a trap composed of 102 places in 2161 ms of which 19 ms to minimize.
[2024-05-24 22:48:40] [INFO ] Deduced a trap composed of 104 places in 2297 ms of which 19 ms to minimize.
[2024-05-24 22:48:42] [INFO ] Deduced a trap composed of 104 places in 2230 ms of which 18 ms to minimize.
[2024-05-24 22:48:45] [INFO ] Deduced a trap composed of 97 places in 2126 ms of which 18 ms to minimize.
[2024-05-24 22:48:47] [INFO ] Deduced a trap composed of 115 places in 2332 ms of which 18 ms to minimize.
[2024-05-24 22:48:50] [INFO ] Deduced a trap composed of 116 places in 2367 ms of which 19 ms to minimize.
[2024-05-24 22:48:52] [INFO ] Deduced a trap composed of 165 places in 2350 ms of which 19 ms to minimize.
SMT process timed out in 136792ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 2795 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2795/2795 places, 9165/9165 transitions.
Applied a total of 0 rules in 463 ms. Remains 2795 /2795 variables (removed 0) and now considering 9165/9165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 463 ms. Remains : 2795/2795 places, 9165/9165 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2795/2795 places, 9165/9165 transitions.
Applied a total of 0 rules in 452 ms. Remains 2795 /2795 variables (removed 0) and now considering 9165/9165 (removed 0) transitions.
[2024-05-24 22:48:53] [INFO ] Flow matrix only has 8280 transitions (discarded 885 similar events)
[2024-05-24 22:48:53] [INFO ] Invariant cache hit.
[2024-05-24 22:48:58] [INFO ] Implicit Places using invariants in 4995 ms returned []
[2024-05-24 22:48:58] [INFO ] Flow matrix only has 8280 transitions (discarded 885 similar events)
[2024-05-24 22:48:58] [INFO ] Invariant cache hit.
[2024-05-24 22:49:01] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2024-05-24 22:49:32] [INFO ] Performed 454/2795 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 22:50:02] [INFO ] Performed 884/2795 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 22:50:32] [INFO ] Performed 1168/2795 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 22:51:03] [INFO ] Performed 1322/2795 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2024-05-24 22:51:03] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2024-05-24 22:51:03] [INFO ] Implicit Places using invariants and state equation in 124892 ms returned []
Implicit Place search using SMT with State Equation took 129888 ms to find 0 implicit places.
[2024-05-24 22:51:04] [INFO ] Redundant transitions in 946 ms returned []
Running 9071 sub problems to find dead transitions.
[2024-05-24 22:51:04] [INFO ] Flow matrix only has 8280 transitions (discarded 885 similar events)
[2024-05-24 22:51:04] [INFO ] Invariant cache hit.
[2024-05-24 22:51:04] [INFO ] State equation strengthened by 5002 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2793 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 9071 unsolved
SMT process timed out in 79710ms, After SMT, problems are : Problem set: 0 solved, 9071 unsolved
Search for dead transitions found 0 dead transitions in 79792ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211109 ms. Remains : 2795/2795 places, 9165/9165 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 11 factoid took 329 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 111 ms :[p2, (NOT p1), p2]
Stuttering acceptance computed with spot in 128 ms :[p2, (NOT p1), p2]
Product exploration explored 100000 steps with 2739 reset in 921 ms.
Product exploration explored 100000 steps with 2741 reset in 1083 ms.
Built C files in :
/tmp/ltsmin1967554287127612987
[2024-05-24 22:52:26] [INFO ] Too many transitions (7089) to apply POR reductions. Disabling POR matrices.
[2024-05-24 22:52:26] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1967554287127612987
Running compilation step : cd /tmp/ltsmin1967554287127612987;'/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/ltsmin1967554287127612987;'/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/ltsmin1967554287127612987;'/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 6 out of 3092 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3092/3092 places, 7089/7089 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 3092 transition count 7088
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3091 transition count 7088
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 3090 transition count 7087
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 3090 transition count 7087
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 3089 transition count 7082
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3089 transition count 7082
Applied a total of 6 rules in 1094 ms. Remains 3089 /3092 variables (removed 3) and now considering 7082/7089 (removed 7) transitions.
[2024-05-24 22:52:30] [INFO ] Flow matrix only has 6482 transitions (discarded 600 similar events)
// Phase 1: matrix 6482 rows 3089 cols
[2024-05-24 22:52:31] [INFO ] Computed 61 invariants in 130 ms
[2024-05-24 22:52:35] [INFO ] Implicit Places using invariants in 4502 ms returned [1477]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4507 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3088/3092 places, 7082/7089 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3087 transition count 7081
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 3086 transition count 7080
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 3086 transition count 7080
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 3085 transition count 7075
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 3085 transition count 7075
Applied a total of 6 rules in 1526 ms. Remains 3085 /3088 variables (removed 3) and now considering 7075/7082 (removed 7) transitions.
[2024-05-24 22:52:37] [INFO ] Flow matrix only has 6475 transitions (discarded 600 similar events)
// Phase 1: matrix 6475 rows 3085 cols
[2024-05-24 22:52:37] [INFO ] Computed 60 invariants in 124 ms
[2024-05-24 22:52:41] [INFO ] Implicit Places using invariants in 4455 ms returned []
[2024-05-24 22:52:41] [INFO ] Flow matrix only has 6475 transitions (discarded 600 similar events)
[2024-05-24 22:52:41] [INFO ] Invariant cache hit.
[2024-05-24 22:52:43] [INFO ] State equation strengthened by 2622 read => feed constraints.
[2024-05-24 22:53:14] [INFO ] Performed 1086/3085 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 22:53:44] [INFO ] Performed 1870/3085 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 22:54:14] [INFO ] Performed 3079/3085 implicitness test of which 1 returned IMPLICIT in 90 seconds.
[2024-05-24 22:54:14] [INFO ] Implicit Places using invariants and state equation in 92991 ms returned [3079]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 97451 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3084/3092 places, 7075/7089 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 3084 transition count 7074
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3083 transition count 7074
Applied a total of 2 rules in 461 ms. Remains 3083 /3084 variables (removed 1) and now considering 7074/7075 (removed 1) transitions.
[2024-05-24 22:54:14] [INFO ] Flow matrix only has 6474 transitions (discarded 600 similar events)
// Phase 1: matrix 6474 rows 3083 cols
[2024-05-24 22:54:15] [INFO ] Computed 59 invariants in 126 ms
[2024-05-24 22:54:19] [INFO ] Implicit Places using invariants in 4440 ms returned []
[2024-05-24 22:54:19] [INFO ] Flow matrix only has 6474 transitions (discarded 600 similar events)
[2024-05-24 22:54:19] [INFO ] Invariant cache hit.
[2024-05-24 22:54:21] [INFO ] State equation strengthened by 2622 read => feed constraints.
[2024-05-24 22:54:52] [INFO ] Performed 1059/3083 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 22:55:22] [INFO ] Performed 1710/3083 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 22:55:52] [INFO ] Performed 2762/3083 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 22:55:59] [INFO ] Implicit Places using invariants and state equation in 100168 ms returned []
Implicit Place search using SMT with State Equation took 104609 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 3083/3092 places, 7074/7089 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 209649 ms. Remains : 3083/3092 places, 7074/7089 transitions.
Built C files in :
/tmp/ltsmin8239769915244639139
[2024-05-24 22:55:59] [INFO ] Too many transitions (7074) to apply POR reductions. Disabling POR matrices.
[2024-05-24 22:55:59] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8239769915244639139
Running compilation step : cd /tmp/ltsmin8239769915244639139;'/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/ltsmin8239769915244639139;'/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/ltsmin8239769915244639139;'/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 22:56:02] [INFO ] Flatten gal took : 138 ms
[2024-05-24 22:56:03] [INFO ] Flatten gal took : 144 ms
[2024-05-24 22:56:03] [INFO ] Time to serialize gal into /tmp/LTL8608363946780538842.gal : 30 ms
[2024-05-24 22:56:03] [INFO ] Time to serialize properties into /tmp/LTL14164926046685383796.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/LTL8608363946780538842.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16635540104035882802.hoa' '-atoms' '/tmp/LTL14164926046685383796.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/LTL14164926046685383796.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16635540104035882802.hoa
Detected timeout of ITS tools.
[2024-05-24 22:56:18] [INFO ] Flatten gal took : 146 ms
[2024-05-24 22:56:18] [INFO ] Flatten gal took : 151 ms
[2024-05-24 22:56:18] [INFO ] Time to serialize gal into /tmp/LTL12323045139225485489.gal : 30 ms
[2024-05-24 22:56:18] [INFO ] Time to serialize properties into /tmp/LTL191424145567448550.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/LTL12323045139225485489.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL191424145567448550.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(((F("((Node1ManageTheCrashOfNode12>=1)&&(Lx2IsAtTheLeftExtremityOfTheLeafSet>=1))"))||("((Node19HasAskedItsLeafSetToLx3ToReplac...522
Formula 0 simplified : XF((!"((Node19HasAskedItsLeafSetToLx3ToReplaceNode7>=1)&&(LeafSetOfLx3IsSentToNode19>=1))" & G!"((Node1ManageTheCrashOfNode12>=1)&&(...499
Detected timeout of ITS tools.
[2024-05-24 22:56:33] [INFO ] Flatten gal took : 145 ms
[2024-05-24 22:56:33] [INFO ] Applying decomposition
[2024-05-24 22:56:33] [INFO ] Flatten gal took : 153 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/graph2317712275565184971.txt' '-o' '/tmp/graph2317712275565184971.bin' '-w' '/tmp/graph2317712275565184971.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2317712275565184971.bin' '-l' '-1' '-v' '-w' '/tmp/graph2317712275565184971.weights' '-q' '0' '-e' '0.001'
[2024-05-24 22:56:34] [INFO ] Decomposing Gal with order
[2024-05-24 22:56:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 22:56:35] [INFO ] Removed a total of 6635 redundant transitions.
[2024-05-24 22:56:35] [INFO ] Flatten gal took : 707 ms
[2024-05-24 22:56:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 4424 labels/synchronizations in 305 ms.
[2024-05-24 22:56:35] [INFO ] Time to serialize gal into /tmp/LTL458446835017281178.gal : 98 ms
[2024-05-24 22:56:35] [INFO ] Time to serialize properties into /tmp/LTL16541019911668476479.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/LTL458446835017281178.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16541019911668476479.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(((F("((i36.i1.u334.Node1ManageTheCrashOfNode12>=1)&&(i36.i1.u26.Lx2IsAtTheLeftExtremityOfTheLeafSet>=1))"))||("((i36.i0.u337.No...627
Formula 0 simplified : XF((!"((i36.i0.u337.Node19HasAskedItsLeafSetToLx3ToReplaceNode7>=1)&&(i36.i0.u337.LeafSetOfLx3IsSentToNode19>=1))" & G!"((i36.i1.u33...604
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S24C05-LTLFireability-11 finished in 987970 ms.
[2024-05-24 22:56:50] [INFO ] Flatten gal took : 169 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7508365913715540838
[2024-05-24 22:56:50] [INFO ] Too many transitions (7332) to apply POR reductions. Disabling POR matrices.
[2024-05-24 22:56:51] [INFO ] Applying decomposition
[2024-05-24 22:56:51] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7508365913715540838
Running compilation step : cd /tmp/ltsmin7508365913715540838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 22:56:51] [INFO ] Flatten gal took : 179 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/graph18135866814023839868.txt' '-o' '/tmp/graph18135866814023839868.bin' '-w' '/tmp/graph18135866814023839868.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18135866814023839868.bin' '-l' '-1' '-v' '-w' '/tmp/graph18135866814023839868.weights' '-q' '0' '-e' '0.001'
[2024-05-24 22:56:51] [INFO ] Decomposing Gal with order
[2024-05-24 22:56:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 22:56:52] [INFO ] Removed a total of 6161 redundant transitions.
[2024-05-24 22:56:52] [INFO ] Flatten gal took : 414 ms
[2024-05-24 22:56:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 3290 labels/synchronizations in 244 ms.
[2024-05-24 22:56:52] [INFO ] Time to serialize gal into /tmp/LTLFireability10359784757469887025.gal : 42 ms
[2024-05-24 22:56:52] [INFO ] Time to serialize properties into /tmp/LTLFireability11759882301007837074.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/LTLFireability10359784757469887025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11759882301007837074.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((F(G("(i10.i3.u386.Node18HasTheLeafSetOfRx2ToReplaceNode13<1)"))))
Formula 0 simplified : GF!"(i10.i3.u386.Node18HasTheLeafSetOfRx2ToReplaceNode13<1)"
Compilation finished in 38414 ms.
Running link step : cd /tmp/ltsmin7508365913715540838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 89 ms.
Running LTSmin : cd /tmp/ltsmin7508365913715540838;'/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'
BK_STOP 1716591654027
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S24C05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S24C05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654350800084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C05.tgz
mv MultiCrashLeafsetExtension-PT-S24C05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;