Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r246-tall-171654350900100.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-S24C07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654350900100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K 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 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 12 07:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 12 07:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 19 15: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 14M 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-S24C07-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716594525186

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-S24C07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 23:48:46] [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 23:48:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 23:48:47] [INFO ] Load time of PNML (sax parser for PT used): 728 ms
[2024-05-24 23:48:47] [INFO ] Transformed 13822 places.
[2024-05-24 23:48:47] [INFO ] Transformed 20365 transitions.
[2024-05-24 23:48:47] [INFO ] Parsed PT model containing 13822 places and 20365 transitions and 77774 arcs in 927 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 13822 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13822/13822 places, 20365/20365 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 13780 transition count 20365
Discarding 4180 places :
Symmetric choice reduction at 1 with 4180 rule applications. Total rules 4222 place count 9600 transition count 16185
Iterating global reduction 1 with 4180 rules applied. Total rules applied 8402 place count 9600 transition count 16185
Discarding 3838 places :
Symmetric choice reduction at 1 with 3838 rule applications. Total rules 12240 place count 5762 transition count 12347
Iterating global reduction 1 with 3838 rules applied. Total rules applied 16078 place count 5762 transition count 12347
Discarding 534 places :
Symmetric choice reduction at 1 with 534 rule applications. Total rules 16612 place count 5228 transition count 8609
Iterating global reduction 1 with 534 rules applied. Total rules applied 17146 place count 5228 transition count 8609
Applied a total of 17146 rules in 3901 ms. Remains 5228 /13822 variables (removed 8594) and now considering 8609/20365 (removed 11756) transitions.
[2024-05-24 23:48:51] [INFO ] Flow matrix only has 8009 transitions (discarded 600 similar events)
// Phase 1: matrix 8009 rows 5228 cols
[2024-05-24 23:48:52] [INFO ] Computed 1041 invariants in 516 ms
[2024-05-24 23:49:01] [INFO ] Implicit Places using invariants in 10297 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 24, 26, 31, 38, 47, 58, 71, 86, 103, 122, 143, 166, 190, 214, 218, 220, 222, 224, 226, 228, 249, 268, 285, 300, 313, 324, 333, 340, 347, 350, 381, 388, 391, 392, 393, 394, 395, 396, 397, 398, 401, 406, 413, 422, 433, 446, 461, 478, 497, 518, 540, 562, 563, 564, 565, 566, 567, 568, 569, 588, 605, 620, 633, 644, 653, 660, 665, 668, 670, 701, 708, 711, 712, 713, 714, 715, 716, 717, 718, 720, 723, 728, 735, 744, 755, 768, 783, 800, 819, 839, 859, 860, 861, 862, 863, 864, 865, 866, 883, 898, 911, 922, 931, 938, 943, 946, 948, 950, 981, 988, 991, 992, 993, 994, 995, 996, 997, 998, 1000, 1002, 1005, 1010, 1017, 1026, 1037, 1050, 1065, 1082, 1100, 1118, 1119, 1120, 1121, 1122, 1123, 1124, 1125, 1140, 1153, 1164, 1173, 1180, 1185, 1188, 1190, 1192, 1194, 1225, 1232, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1244, 1246, 1248, 1251, 1256, 1263, 1272, 1283, 1296, 1311, 1327, 1343, 1344, 1345, 1346, 1347, 1348, 1349, 1350, 1363, 1374, 1383, 1390, 1395, 1398, 1400, 1402, 1404, 1406, 1437, 1444, 1447, 1448, 1449, 1450, 1451, 1452, 1453, 1454, 1456, 1458, 1460, 1462, 1465, 1477, 1486, 1497, 1510, 1524, 1538, 1539, 1540, 1541, 1542, 1543, 1544, 1545, 1556, 1565, 1572, 1577, 1580, 1582, 1584, 1586, 1588, 1590, 1621, 1628, 1631, 1632, 1633, 1634, 1635, 1636, 1637, 1638, 1640, 1642, 1644, 1646, 1648, 1651, 1656, 1663, 1672, 1683, 1695, 1707, 1708, 1709, 1710, 1711, 1712, 1713, 1714, 1723, 1730, 1735, 1738, 1740, 1742, 1744, 1746, 1748, 1750, 1781, 1788, 1791, 1792, 1793, 1794, 1795, 1796, 1797, 1798, 1800, 1802, 1804, 1806, 1808, 1810, 1813, 1818, 1825, 1834, 1844, 1854, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1868, 1873, 1876, 1878, 1880, 1882, 1884, 1886, 1888, 1890, 1921, 1928, 1931, 1932, 1933, 1934, 1935, 1936, 1937, 1938, 1940, 1942, 1944, 1946, 1948, 1950, 1952, 1955, 1960, 1967, 1975, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1995, 1998, 2000, 2002, 2004, 2007, 2009, 2011, 2013, 2015, 2053, 2056, 2057, 2058, 2059, 2061, 2062, 2063, 2065, 2067, 2069, 2071, 2073, 2075, 2077, 2081, 2084, 2089, 2095, 2101, 2102, 2103, 2104, 2105, 2106, 2107, 2108, 2111, 2113, 2115, 2117, 2119, 2121, 2123, 2125, 2127, 2129, 2160, 2167, 2170, 2171, 2172, 2173, 2174, 2175, 2176, 2177, 2179, 2181, 2183, 2185, 2187, 2189, 2191, 2193, 2195, 2198, 2203, 2207, 2208, 2209, 2210, 2211, 2212, 2213, 2214, 2216, 2218, 2220, 2222, 2224, 2226, 2228, 2230, 2232, 2234, 2265, 2272, 2275, 2276, 2277, 2278, 2279, 2280, 2281, 2282, 2284, 2286, 2288, 2290, 2292, 2294, 2296, 2298, 2300, 2302, 2304, 2307, 2308, 2309, 2310, 2311, 2312, 2313, 2314, 2316, 2318, 2320, 2322, 2324, 2326, 2328, 2330, 2332, 2334, 2365, 2367, 2371, 2374, 2375, 2376, 2377, 2378, 2379, 2380, 2381, 2383, 2385, 2387, 2389, 2391, 2393, 2395, 2397, 2399, 2401, 2403, 2406, 2407, 2408, 2409, 2410, 2411, 2412, 2413, 2415, 2417, 2420, 2422, 2424, 2426, 2428, 2430, 2432, 2434, 2465, 2472, 2475, 2476, 2477, 2478, 2479, 2480, 2482, 2484, 2486, 2488, 2490, 2494, 2496, 2498, 2500, 2502, 2504, 2506, 2509, 2510, 2511, 2512, 2513, 2514, 2515, 2516, 2518, 2520, 2522, 2524, 2526, 2528, 2530, 2532, 2534, 2536, 2567, 2574, 2577, 2578, 2579, 2580, 2581, 2582, 2583, 2584, 2586, 2588, 2590, 2592, 2594, 2596, 2598, 2600, 2602, 2604, 2607, 2612, 2613, 2614, 2615, 2616, 2617, 2618, 2619, 2622, 2624, 2626, 2628, 2630, 2632, 2634, 2636, 2638, 2640, 2671, 2678, 2681, 2683, 2684, 2685, 2686, 2688, 2690, 2695, 2697, 2699, 2703, 2705, 2707, 2709, 2711, 2714, 2719, 2726, 2727, 2728, 2729, 2730, 2731, 2732, 2733, 2738, 2741, 2743, 2745, 2747, 2749, 2751, 2753, 2755, 2757, 2788, 2795, 2798, 2799, 2800, 2802, 2803, 2804, 2805, 2807, 2809, 2811, 2813, 2815, 2817, 2819, 2824, 2827, 2832, 2839, 2848, 2850, 2851, 2852, 2853, 2854, 2855, 2864, 2869, 2872, 2874, 2876, 2878, 2880, 2882, 2884, 2886, 2917, 2924, 2927, 2928, 2929, 2930, 2931, 2932, 2933, 2934, 2936, 2938, 2940, 2942, 2944, 2946, 2948, 2951, 2956, 2963, 2972, 2983, 2984, 2985, 2986, 2987, 2988, 2989, 2990, 2999, 3006, 3011, 3014, 3016, 3018, 3020, 3022, 3024, 3026, 3057, 3064, 3067, 3068, 3070, 3071, 3072, 3073, 3074, 3078, 3080, 3082, 3084, 3086, 3088, 3091, 3096, 3103, 3112, 3123, 3136, 3137, 3138, 3139, 3141, 3142, 3143, 3154, 3163, 3170, 3175, 3178, 3180, 3182, 3184, 3186, 3188, 3222, 3229, 3232, 3236, 3237, 3238, 3239, 3240, 3244, 3246, 3248, 3250, 3252, 3255, 3260, 3267, 3276, 3290, 3303, 3318, 3319, 3320, 3321, 3322, 3323, 3324, 3325, 3338, 3349, 3358, 3365, 3370, 3373, 3375, 3377, 3379, 3381, 3412, 3419, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3429, 3431, 3433, 3435, 3437, 3440, 3445, 3452, 3461, 3472, 3485, 3500, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3524, 3539, 3552, 3563, 3572, 3579, 3584, 3587, 3589, 3591, 3593, 3624, 3631, 3634, 3635, 3636, 3637, 3638, 3639, 3640, 3641, 3643, 3645, 3647, 3650, 3655, 3662, 3671, 3682, 3695, 3710, 3727, 3746, 3747, 3748, 3749, 3750, 3751, 3752, 3753, 3770, 3785, 3798, 3809, 3818, 3825, 3830, 3833, 3835, 3837, 3868, 3875, 3878, 3879, 3880, 3881, 3882, 3883, 3884, 3885, 3887, 3889, 3892, 3898, 3905, 3914, 3925, 3938, 3953, 3970, 3989, 4010, 4011, 4012, 4013, 4014, 4015, 4016, 4017, 4036, 4053, 4068, 4081, 4092, 4101, 4108, 4113, 4116, 4118, 4149, 4156, 4159, 4160, 4161, 4162, 4163, 4164, 4165, 4166, 4168, 4171, 4176, 4183, 4192, 4203, 4216, 4231, 4248, 4267, 4288, 4311, 4312, 4313, 4314, 4315, 4316, 4317, 4318, 4339, 4358, 4375, 4390, 4403, 4414, 4423, 4430, 4435, 4438, 4469, 4471, 4475, 4478, 4479, 4480, 4481, 4482, 4484, 4485, 4488, 4493, 4503, 4512, 4523, 4536, 4551, 4568, 4587, 4608, 4631, 4656, 4657, 4658, 4659, 4660, 4661, 4662, 4663, 4686, 4707, 4726, 4743, 4758, 4771, 4782, 4791, 4798, 4803, 4835]
[2024-05-24 23:49:01] [INFO ] Actually due to overlaps returned [381, 701, 981, 1225, 1437, 1621, 1781, 1921, 2160, 2265, 2365, 2465, 2567, 2671, 2788, 2917, 3057, 3222, 3412, 3624, 3868, 4149, 4469, 4835, 4, 12, 14, 16, 18, 20, 22, 24, 86, 214, 218, 220, 222, 224, 226, 391, 392, 393, 394, 395, 396, 397, 446, 562, 563, 564, 565, 566, 567, 568, 711, 712, 713, 714, 715, 716, 717, 755, 859, 860, 861, 862, 863, 864, 865, 991, 992, 993, 994, 995, 996, 997, 1026, 1118, 1119, 1120, 1121, 1122, 1123, 1124, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1263, 1343, 1344, 1345, 1346, 1347, 1348, 1349, 1447, 1448, 1449, 1450, 1451, 1452, 1453, 1538, 1539, 1540, 1541, 1542, 1543, 1544, 1631, 1632, 1633, 1634, 1635, 1636, 1637, 1651, 1707, 1708, 1709, 1710, 1711, 1712, 1713, 1791, 1792, 1793, 1794, 1795, 1796, 1797, 1810, 1854, 1855, 1856, 1857, 1858, 1859, 1860, 1931, 1932, 1933, 1934, 1935, 1936, 1937, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 2056, 2057, 2058, 2059, 2061, 2062, 2077, 2101, 2102, 2103, 2104, 2105, 2106, 2107, 2170, 2171, 2172, 2173, 2174, 2175, 2176, 2191, 2207, 2208, 2209, 2210, 2211, 2212, 2213, 2275, 2276, 2277, 2278, 2279, 2280, 2281, 2296, 2307, 2308, 2309, 2310, 2311, 2312, 2313, 2367, 2374, 2375, 2376, 2377, 2378, 2379, 2380, 2395, 2406, 2407, 2408, 2409, 2410, 2411, 2412, 2475, 2476, 2477, 2478, 2479, 2480, 2498, 2509, 2510, 2511, 2512, 2513, 2514, 2515, 2577, 2578, 2579, 2580, 2581, 2582, 2583, 2598, 2612, 2613, 2614, 2615, 2616, 2617, 2618, 2681, 2683, 2684, 2685, 2686, 2707, 2726, 2727, 2728, 2729, 2730, 2731, 2732, 2798, 2799, 2800, 2802, 2803, 2804, 2819, 2848, 2850, 2851, 2852, 2853, 2854, 2927, 2928, 2929, 2930, 2931, 2932, 2933, 2948, 2983, 2984, 2985, 2986, 2987, 2988, 2989, 3067, 3068, 3070, 3071, 3072, 3073, 3091, 3136, 3137, 3138, 3139, 3141, 3142, 3232, 3236, 3237, 3238, 3239, 3260, 3318, 3319, 3320, 3321, 3322, 3323, 3324, 3422, 3423, 3424, 3425, 3426, 3427, 3428, 3452, 3517, 3518, 3519, 3520, 3521, 3522, 3523, 3634, 3635, 3636, 3637, 3638, 3639, 3640, 3671, 3746, 3747, 3748, 3749, 3750, 3751, 3752, 3878, 3879, 3880, 3881, 3882, 3883, 3884, 3925, 4010, 4011, 4012, 4013, 4014, 4015, 4016, 4159, 4160, 4161, 4162, 4163, 4164, 4165, 4216, 4311, 4312, 4313, 4314, 4315, 4316, 4317, 4471, 4478, 4479, 4480, 4481, 4482, 4484, 4551, 4656, 4657, 4658, 4659, 4660, 4661, 4662]
Discarding 388 places :
Implicit Place search using SMT only with invariants took 10348 ms to find 388 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 4840/13822 places, 8609/20365 transitions.
Discarding 324 places :
Symmetric choice reduction at 0 with 324 rule applications. Total rules 324 place count 4516 transition count 8285
Iterating global reduction 0 with 324 rules applied. Total rules applied 648 place count 4516 transition count 8285
Discarding 324 places :
Symmetric choice reduction at 0 with 324 rule applications. Total rules 972 place count 4192 transition count 7961
Iterating global reduction 0 with 324 rules applied. Total rules applied 1296 place count 4192 transition count 7961
Discarding 324 places :
Symmetric choice reduction at 0 with 324 rule applications. Total rules 1620 place count 3868 transition count 7637
Iterating global reduction 0 with 324 rules applied. Total rules applied 1944 place count 3868 transition count 7637
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 1982 place count 3830 transition count 7371
Iterating global reduction 0 with 38 rules applied. Total rules applied 2020 place count 3830 transition count 7371
Applied a total of 2020 rules in 1740 ms. Remains 3830 /4840 variables (removed 1010) and now considering 7371/8609 (removed 1238) transitions.
[2024-05-24 23:49:03] [INFO ] Flow matrix only has 6771 transitions (discarded 600 similar events)
// Phase 1: matrix 6771 rows 3830 cols
[2024-05-24 23:49:03] [INFO ] Computed 653 invariants in 193 ms
[2024-05-24 23:49:09] [INFO ] Implicit Places using invariants in 5891 ms returned [7, 18, 23, 30, 39, 50, 63, 94, 113, 134, 157, 181, 213, 234, 253, 270, 285, 298, 309, 318, 325, 332, 335, 372, 374, 377, 382, 389, 398, 409, 436, 453, 472, 493, 515, 537, 556, 573, 588, 601, 612, 621, 628, 633, 636, 638, 649, 651, 653, 656, 661, 668, 677, 700, 715, 732, 751, 771, 790, 807, 822, 835, 846, 855, 862, 867, 870, 872, 874, 883, 885, 887, 889, 892, 897, 904, 923, 936, 951, 968, 986, 1003, 1018, 1031, 1042, 1051, 1058, 1063, 1066, 1068, 1070, 1072, 1081, 1083, 1085, 1087, 1089, 1092, 1097, 1112, 1123, 1136, 1151, 1167, 1182, 1195, 1206, 1215, 1222, 1227, 1230, 1232, 1234, 1236, 1238, 1247, 1249, 1251, 1253, 1255, 1257, 1260, 1272, 1281, 1292, 1305, 1319, 1332, 1343, 1352, 1359, 1364, 1367, 1369, 1371, 1373, 1375, 1377, 1386, 1388, 1390, 1392, 1394, 1396, 1398, 1405, 1412, 1421, 1432, 1444, 1455, 1464, 1471, 1476, 1479, 1481, 1483, 1485, 1487, 1489, 1491, 1500, 1502, 1504, 1506, 1508, 1510, 1512, 1516, 1521, 1528, 1537, 1547, 1556, 1563, 1568, 1571, 1573, 1575, 1577, 1579, 1581, 1583, 1585, 1594, 1596, 1598, 1600, 1602, 1604, 1606, 1608, 1610, 1613, 1618, 1625, 1633, 1640, 1645, 1648, 1650, 1652, 1654, 1657, 1659, 1661, 1663, 1665, 1675, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1696, 1699, 1704, 1710, 1715, 1718, 1720, 1722, 1724, 1726, 1728, 1730, 1732, 1734, 1736, 1747, 1749, 1751, 1753, 1755, 1757, 1759, 1761, 1764, 1766, 1769, 1774, 1777, 1779, 1781, 1783, 1785, 1787, 1789, 1791, 1793, 1795, 1797, 1806, 1808, 1810, 1812, 1814, 1816, 1818, 1820, 1823, 1825, 1827, 1829, 1831, 1833, 1835, 1837, 1839, 1841, 1843, 1845, 1847, 1849, 1851, 1858, 1860, 1862, 1864, 1866, 1868, 1870, 1872, 1875, 1877, 1879, 1881, 1883, 1885, 1887, 1890, 1892, 1894, 1896, 1898, 1900, 1902, 1904, 1913, 1917, 1919, 1921, 1923, 1925, 1929, 1931, 1934, 1936, 1938, 1940, 1942, 1944, 1946, 1948, 1950, 1952, 1954, 1956, 1958, 1960, 1962, 1973, 1975, 1977, 1979, 1981, 1983, 1985, 1987, 1990, 1992, 1994, 1997, 2001, 2004, 2006, 2008, 2010, 2012, 2014, 2016, 2018, 2020, 2022, 2031, 2036, 2038, 2043, 2045, 2047, 2051, 2053, 2056, 2058, 2061, 2066, 2072, 2077, 2080, 2082, 2084, 2086, 2088, 2090, 2092, 2094, 2096, 2109, 2113, 2115, 2117, 2119, 2121, 2123, 2125, 2131, 2134, 2139, 2146, 2156, 2165, 2170, 2173, 2175, 2177, 2179, 2181, 2183, 2185, 2187, 2200, 2202, 2204, 2206, 2208, 2210, 2212, 2214, 2218, 2223, 2230, 2239, 2249, 2258, 2265, 2270, 2273, 2275, 2277, 2279, 2281, 2283, 2285, 2294, 2298, 2302, 2304, 2306, 2308, 2310, 2312, 2319, 2326, 2335, 2346, 2360, 2371, 2380, 2387, 2392, 2395, 2397, 2399, 2401, 2403, 2405, 2421, 2427, 2431, 2433, 2435, 2437, 2439, 2442, 2453, 2462, 2476, 2489, 2503, 2516, 2527, 2536, 2543, 2548, 2551, 2553, 2555, 2557, 2559, 2572, 2574, 2576, 2578, 2580, 2582, 2585, 2590, 2605, 2616, 2629, 2644, 2660, 2675, 2688, 2699, 2708, 2715, 2720, 2723, 2725, 2727, 2729, 2738, 2740, 2742, 2744, 2746, 2749, 2754, 2761, 2780, 2793, 2808, 2825, 2843, 2860, 2875, 2888, 2899, 2908, 2915, 2920, 2923, 2925, 2927, 2936, 2938, 2940, 2942, 2945, 2951, 2958, 2967, 2990, 3005, 3022, 3041, 3061, 3080, 3097, 3112, 3125, 3136, 3145, 3152, 3157, 3160, 3162, 3171, 3173, 3175, 3178, 3183, 3190, 3199, 3210, 3237, 3254, 3273, 3294, 3316, 3337, 3356, 3373, 3388, 3401, 3412, 3421, 3428, 3433, 3436, 3443, 3447, 3450, 3455, 3465, 3474, 3485, 3498, 3529, 3548, 3569, 3592, 3616, 3639, 3660, 3679, 3696, 3711, 3724, 3735, 3744, 3751, 3756]
Discarding 576 places :
Implicit Place search using SMT only with invariants took 5910 ms to find 576 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3254/13822 places, 7371/20365 transitions.
Applied a total of 0 rules in 317 ms. Remains 3254 /3254 variables (removed 0) and now considering 7371/7371 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 22238 ms. Remains : 3254/13822 places, 7371/20365 transitions.
Support contains 54 out of 3254 places after structural reductions.
[2024-05-24 23:49:10] [INFO ] Flatten gal took : 450 ms
[2024-05-24 23:49:11] [INFO ] Flatten gal took : 276 ms
[2024-05-24 23:49:11] [INFO ] Input system was already deterministic with 7371 transitions.
Reduction of identical properties reduced properties to check from 31 to 28
RANDOM walk for 40000 steps (555 resets) in 1956 ms. (20 steps per ms) remains 17/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 14/14 properties
[2024-05-24 23:49:12] [INFO ] Flow matrix only has 6771 transitions (discarded 600 similar events)
// Phase 1: matrix 6771 rows 3254 cols
[2024-05-24 23:49:12] [INFO ] Computed 77 invariants in 206 ms
[2024-05-24 23:49:12] [INFO ] State equation strengthened by 2770 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 3121/3146 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-24 23:49:15] [INFO ] Deduced a trap composed of 280 places in 2226 ms of which 45 ms to minimize.
[2024-05-24 23:49:17] [INFO ] Deduced a trap composed of 342 places in 2371 ms of which 23 ms to minimize.
SMT process timed out in 5550ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 3254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3254/3254 places, 7371/7371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 3254 transition count 7347
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 3230 transition count 7347
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 48 place count 3230 transition count 7329
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 84 place count 3212 transition count 7329
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 3207 transition count 7312
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 3207 transition count 7312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 94 place count 3207 transition count 7311
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 3206 transition count 7311
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 99 place count 3203 transition count 7290
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 3203 transition count 7290
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 8 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 174 place count 3167 transition count 7254
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 178 place count 3163 transition count 7250
Iterating global reduction 2 with 4 rules applied. Total rules applied 182 place count 3163 transition count 7250
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 186 place count 3159 transition count 7222
Iterating global reduction 2 with 4 rules applied. Total rules applied 190 place count 3159 transition count 7222
Free-agglomeration rule (complex) applied 304 times.
Iterating global reduction 2 with 304 rules applied. Total rules applied 494 place count 3159 transition count 10404
Reduce places removed 304 places and 0 transitions.
Iterating post reduction 2 with 304 rules applied. Total rules applied 798 place count 2855 transition count 10404
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 806 place count 2855 transition count 10404
Applied a total of 806 rules in 3993 ms. Remains 2855 /3254 variables (removed 399) and now considering 10404/7371 (removed -3033) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3995 ms. Remains : 2855/3254 places, 10404/7371 transitions.
RANDOM walk for 40000 steps (941 resets) in 2684 ms. (14 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (94 resets) in 228 ms. (174 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (95 resets) in 233 ms. (170 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (108 resets) in 237 ms. (168 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (87 resets) in 206 ms. (193 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (97 resets) in 320 ms. (124 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (87 resets) in 270 ms. (147 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (88 resets) in 306 ms. (130 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (100 resets) in 246 ms. (161 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (88 resets) in 206 ms. (193 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (98 resets) in 216 ms. (184 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40004 steps (96 resets) in 214 ms. (186 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (98 resets) in 408 ms. (97 steps per ms) remains 11/11 properties
[2024-05-24 23:49:23] [INFO ] Flow matrix only has 9519 transitions (discarded 885 similar events)
// Phase 1: matrix 9519 rows 2855 cols
[2024-05-24 23:49:23] [INFO ] Computed 77 invariants in 234 ms
[2024-05-24 23:49:23] [INFO ] State equation strengthened by 6202 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2130/2152 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 23:49:25] [INFO ] Deduced a trap composed of 1104 places in 1443 ms of which 14 ms to minimize.
[2024-05-24 23:49:26] [INFO ] Deduced a trap composed of 1078 places in 874 ms of which 13 ms to minimize.
[2024-05-24 23:49:27] [INFO ] Deduced a trap composed of 103 places in 347 ms of which 1 ms to minimize.
[2024-05-24 23:49:27] [INFO ] Deduced a trap composed of 108 places in 305 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2152 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/2153 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 654/2807 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 23:49:31] [INFO ] Deduced a trap composed of 5 places in 2455 ms of which 20 ms to minimize.
[2024-05-24 23:49:34] [INFO ] Deduced a trap composed of 130 places in 2424 ms of which 20 ms to minimize.
[2024-05-24 23:49:36] [INFO ] Deduced a trap composed of 114 places in 2406 ms of which 19 ms to minimize.
[2024-05-24 23:49:39] [INFO ] Deduced a trap composed of 128 places in 2422 ms of which 19 ms to minimize.
[2024-05-24 23:49:41] [INFO ] Deduced a trap composed of 39 places in 2524 ms of which 20 ms to minimize.
[2024-05-24 23:49:44] [INFO ] Deduced a trap composed of 165 places in 2466 ms of which 20 ms to minimize.
[2024-05-24 23:49:46] [INFO ] Deduced a trap composed of 121 places in 2496 ms of which 19 ms to minimize.
[2024-05-24 23:49:49] [INFO ] Deduced a trap composed of 39 places in 2458 ms of which 18 ms to minimize.
[2024-05-24 23:49:51] [INFO ] Deduced a trap composed of 155 places in 2417 ms of which 20 ms to minimize.
[2024-05-24 23:49:54] [INFO ] Deduced a trap composed of 120 places in 2339 ms of which 16 ms to minimize.
[2024-05-24 23:49:56] [INFO ] Deduced a trap composed of 152 places in 2339 ms of which 19 ms to minimize.
[2024-05-24 23:49:59] [INFO ] Deduced a trap composed of 140 places in 2453 ms of which 18 ms to minimize.
[2024-05-24 23:50:01] [INFO ] Deduced a trap composed of 146 places in 2466 ms of which 18 ms to minimize.
[2024-05-24 23:50:04] [INFO ] Deduced a trap composed of 151 places in 2456 ms of which 17 ms to minimize.
[2024-05-24 23:50:06] [INFO ] Deduced a trap composed of 115 places in 2350 ms of which 18 ms to minimize.
[2024-05-24 23:50:09] [INFO ] Deduced a trap composed of 119 places in 2467 ms of which 20 ms to minimize.
SMT process timed out in 45655ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 22 out of 2855 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2855/2855 places, 10404/10404 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2855 transition count 10403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2854 transition count 10403
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 2854 transition count 10402
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2853 transition count 10402
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 2852 transition count 10401
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 2852 transition count 10401
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 2852 transition count 10401
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 2851 transition count 10400
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 2851 transition count 10400
Applied a total of 10 rules in 1458 ms. Remains 2851 /2855 variables (removed 4) and now considering 10400/10404 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1460 ms. Remains : 2851/2855 places, 10400/10404 transitions.
RANDOM walk for 40000 steps (944 resets) in 1738 ms. (23 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (99 resets) in 221 ms. (180 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (97 resets) in 215 ms. (185 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (108 resets) in 260 ms. (153 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (86 resets) in 196 ms. (203 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (95 resets) in 211 ms. (188 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (88 resets) in 199 ms. (200 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (88 resets) in 200 ms. (199 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (88 resets) in 199 ms. (200 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (96 resets) in 210 ms. (189 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (98 resets) in 216 ms. (184 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (97 resets) in 216 ms. (184 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 24105 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 11
Probabilistic random walk after 24105 steps, saw 10326 distinct states, run finished after 3004 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-24 23:50:14] [INFO ] Flow matrix only has 9515 transitions (discarded 885 similar events)
// Phase 1: matrix 9515 rows 2851 cols
[2024-05-24 23:50:15] [INFO ] Computed 77 invariants in 251 ms
[2024-05-24 23:50:15] [INFO ] State equation strengthened by 6202 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2729/2751 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 23:50:17] [INFO ] Deduced a trap composed of 123 places in 2342 ms of which 19 ms to minimize.
[2024-05-24 23:50:20] [INFO ] Deduced a trap composed of 128 places in 2331 ms of which 18 ms to minimize.
[2024-05-24 23:50:22] [INFO ] Deduced a trap composed of 163 places in 2298 ms of which 20 ms to minimize.
[2024-05-24 23:50:25] [INFO ] Deduced a trap composed of 175 places in 2245 ms of which 18 ms to minimize.
[2024-05-24 23:50:27] [INFO ] Deduced a trap composed of 207 places in 2223 ms of which 19 ms to minimize.
[2024-05-24 23:50:29] [INFO ] Deduced a trap composed of 171 places in 2296 ms of which 18 ms to minimize.
[2024-05-24 23:50:31] [INFO ] Deduced a trap composed of 102 places in 2137 ms of which 18 ms to minimize.
[2024-05-24 23:50:34] [INFO ] Deduced a trap composed of 1078 places in 2163 ms of which 18 ms to minimize.
[2024-05-24 23:50:36] [INFO ] Deduced a trap composed of 124 places in 2268 ms of which 17 ms to minimize.
[2024-05-24 23:50:38] [INFO ] Deduced a trap composed of 168 places in 2145 ms of which 19 ms to minimize.
[2024-05-24 23:50:40] [INFO ] Deduced a trap composed of 265 places in 2134 ms of which 17 ms to minimize.
[2024-05-24 23:50:43] [INFO ] Deduced a trap composed of 405 places in 2172 ms of which 18 ms to minimize.
[2024-05-24 23:50:45] [INFO ] Deduced a trap composed of 282 places in 2187 ms of which 21 ms to minimize.
[2024-05-24 23:50:47] [INFO ] Deduced a trap composed of 243 places in 2182 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2751 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2751 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/2752 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2752 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 52/2804 variables, 19/44 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2804 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 38/2842 variables, 38/82 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2842 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 9/2851 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2851 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 9515/12366 variables, 2851/2942 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/12366 variables, 6202/9144 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/12366 variables, 0/9144 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/12366 variables, 0/9144 constraints. Problems are: Problem set: 4 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12366/12366 variables, and 9144 constraints, problems are : Problem set: 4 solved, 7 unsolved in 64195 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 2851/2851 constraints, ReadFeed: 6202/6202 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 4 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 2731/2747 variables, 7/8 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2747 variables, 3/11 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-24 23:51:22] [INFO ] Deduced a trap composed of 203 places in 2209 ms of which 18 ms to minimize.
[2024-05-24 23:51:24] [INFO ] Deduced a trap composed of 250 places in 2233 ms of which 17 ms to minimize.
[2024-05-24 23:51:26] [INFO ] Deduced a trap composed of 277 places in 2209 ms of which 17 ms to minimize.
[2024-05-24 23:51:29] [INFO ] Deduced a trap composed of 218 places in 2223 ms of which 20 ms to minimize.
[2024-05-24 23:51:31] [INFO ] Deduced a trap composed of 331 places in 2201 ms of which 18 ms to minimize.
[2024-05-24 23:51:33] [INFO ] Deduced a trap composed of 417 places in 2076 ms of which 17 ms to minimize.
[2024-05-24 23:51:35] [INFO ] Deduced a trap composed of 382 places in 2289 ms of which 19 ms to minimize.
[2024-05-24 23:51:38] [INFO ] Deduced a trap composed of 164 places in 2268 ms of which 18 ms to minimize.
[2024-05-24 23:51:40] [INFO ] Deduced a trap composed of 211 places in 2226 ms of which 18 ms to minimize.
[2024-05-24 23:51:42] [INFO ] Deduced a trap composed of 280 places in 2123 ms of which 16 ms to minimize.
[2024-05-24 23:51:44] [INFO ] Deduced a trap composed of 338 places in 2206 ms of which 20 ms to minimize.
[2024-05-24 23:51:47] [INFO ] Deduced a trap composed of 168 places in 2296 ms of which 19 ms to minimize.
[2024-05-24 23:51:49] [INFO ] Deduced a trap composed of 265 places in 2298 ms of which 19 ms to minimize.
[2024-05-24 23:51:51] [INFO ] Deduced a trap composed of 1571 places in 1670 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2747 variables, 14/25 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-24 23:51:53] [INFO ] Deduced a trap composed of 196 places in 2378 ms of which 19 ms to minimize.
[2024-05-24 23:51:56] [INFO ] Deduced a trap composed of 322 places in 2270 ms of which 18 ms to minimize.
[2024-05-24 23:51:58] [INFO ] Deduced a trap composed of 179 places in 2273 ms of which 19 ms to minimize.
[2024-05-24 23:52:00] [INFO ] Deduced a trap composed of 253 places in 2203 ms of which 18 ms to minimize.
[2024-05-24 23:52:03] [INFO ] Deduced a trap composed of 401 places in 2182 ms of which 20 ms to minimize.
[2024-05-24 23:52:05] [INFO ] Deduced a trap composed of 207 places in 2158 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2747 variables, 6/31 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2747 variables, 0/31 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/2748 variables, 1/32 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2748 variables, 0/32 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 52/2800 variables, 17/49 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2800 variables, 10/59 constraints. Problems are: Problem set: 4 solved, 7 unsolved
[2024-05-24 23:52:09] [INFO ] Deduced a trap composed of 5 places in 2367 ms of which 19 ms to minimize.
[2024-05-24 23:52:11] [INFO ] Deduced a trap composed of 124 places in 2492 ms of which 20 ms to minimize.
[2024-05-24 23:52:13] [INFO ] Deduced a trap composed of 39 places in 2296 ms of which 18 ms to minimize.
[2024-05-24 23:52:16] [INFO ] Deduced a trap composed of 145 places in 2422 ms of which 19 ms to minimize.
[2024-05-24 23:52:18] [INFO ] Deduced a trap composed of 108 places in 2423 ms of which 21 ms to minimize.
[2024-05-24 23:52:21] [INFO ] Deduced a trap composed of 114 places in 2379 ms of which 17 ms to minimize.
[2024-05-24 23:52:23] [INFO ] Deduced a trap composed of 116 places in 2439 ms of which 20 ms to minimize.
[2024-05-24 23:52:26] [INFO ] Deduced a trap composed of 121 places in 2412 ms of which 19 ms to minimize.
[2024-05-24 23:52:28] [INFO ] Deduced a trap composed of 137 places in 2428 ms of which 19 ms to minimize.
[2024-05-24 23:52:31] [INFO ] Deduced a trap composed of 135 places in 2396 ms of which 23 ms to minimize.
[2024-05-24 23:52:33] [INFO ] Deduced a trap composed of 139 places in 2471 ms of which 21 ms to minimize.
[2024-05-24 23:52:36] [INFO ] Deduced a trap composed of 120 places in 2425 ms of which 21 ms to minimize.
SMT process timed out in 141365ms, After SMT, problems are : Problem set: 4 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 2851 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2851/2851 places, 10400/10400 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2851 transition count 10399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2850 transition count 10399
Applied a total of 2 rules in 1032 ms. Remains 2850 /2851 variables (removed 1) and now considering 10399/10400 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1032 ms. Remains : 2850/2851 places, 10399/10400 transitions.
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 630 stabilizing places and 2170 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((F(p1)&&X(F(p0))) U p1)))'
Support contains 6 out of 3254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3254/3254 places, 7371/7371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 3254 transition count 7345
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 3228 transition count 7345
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 52 place count 3228 transition count 7324
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 94 place count 3207 transition count 7324
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 104 place count 3197 transition count 7290
Iterating global reduction 2 with 10 rules applied. Total rules applied 114 place count 3197 transition count 7290
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 114 place count 3197 transition count 7287
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 120 place count 3194 transition count 7287
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 126 place count 3188 transition count 7245
Iterating global reduction 2 with 6 rules applied. Total rules applied 132 place count 3188 transition count 7245
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 4 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 202 place count 3153 transition count 7210
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 208 place count 3147 transition count 7204
Iterating global reduction 2 with 6 rules applied. Total rules applied 214 place count 3147 transition count 7204
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 220 place count 3141 transition count 7162
Iterating global reduction 2 with 6 rules applied. Total rules applied 226 place count 3141 transition count 7162
Applied a total of 226 rules in 2379 ms. Remains 3141 /3254 variables (removed 113) and now considering 7162/7371 (removed 209) transitions.
[2024-05-24 23:52:39] [INFO ] Flow matrix only has 6562 transitions (discarded 600 similar events)
// Phase 1: matrix 6562 rows 3141 cols
[2024-05-24 23:52:40] [INFO ] Computed 77 invariants in 227 ms
[2024-05-24 23:52:44] [INFO ] Implicit Places using invariants in 4599 ms returned [185, 1427, 1564, 1631, 1632, 1678, 1707, 1808, 1857, 1904, 1905, 2797]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 4604 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3129/3254 places, 7162/7371 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3122 transition count 7155
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3122 transition count 7155
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 3115 transition count 7148
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 3115 transition count 7148
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 3111 transition count 7120
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 3111 transition count 7120
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 3106 transition count 7115
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 3101 transition count 7110
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 3101 transition count 7110
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 3095 transition count 7068
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 3095 transition count 7068
Applied a total of 68 rules in 2385 ms. Remains 3095 /3129 variables (removed 34) and now considering 7068/7162 (removed 94) transitions.
[2024-05-24 23:52:46] [INFO ] Flow matrix only has 6468 transitions (discarded 600 similar events)
// Phase 1: matrix 6468 rows 3095 cols
[2024-05-24 23:52:47] [INFO ] Computed 65 invariants in 201 ms
[2024-05-24 23:52:51] [INFO ] Implicit Places using invariants in 4455 ms returned []
[2024-05-24 23:52:51] [INFO ] Flow matrix only has 6468 transitions (discarded 600 similar events)
[2024-05-24 23:52:51] [INFO ] Invariant cache hit.
[2024-05-24 23:52:54] [INFO ] State equation strengthened by 2614 read => feed constraints.
[2024-05-24 23:53:25] [INFO ] Performed 1089/3095 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:53:55] [INFO ] Performed 1782/3095 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2024-05-24 23:54:25] [INFO ] Performed 2825/3095 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2024-05-24 23:54:33] [INFO ] Implicit Places using invariants and state equation in 102139 ms returned [3067, 3087]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 106602 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3093/3254 places, 7068/7371 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 3093 transition count 7066
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3091 transition count 7066
Applied a total of 4 rules in 466 ms. Remains 3091 /3093 variables (removed 2) and now considering 7066/7068 (removed 2) transitions.
[2024-05-24 23:54:33] [INFO ] Flow matrix only has 6466 transitions (discarded 600 similar events)
// Phase 1: matrix 6466 rows 3091 cols
[2024-05-24 23:54:34] [INFO ] Computed 63 invariants in 221 ms
[2024-05-24 23:54:38] [INFO ] Implicit Places using invariants in 4400 ms returned []
[2024-05-24 23:54:38] [INFO ] Flow matrix only has 6466 transitions (discarded 600 similar events)
[2024-05-24 23:54:38] [INFO ] Invariant cache hit.
[2024-05-24 23:54:40] [INFO ] State equation strengthened by 2614 read => feed constraints.
[2024-05-24 23:55:12] [INFO ] Performed 1090/3091 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-24 23:55:42] [INFO ] Performed 1808/3091 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-24 23:56:12] [INFO ] Performed 3022/3091 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-24 23:56:14] [INFO ] Implicit Places using invariants and state equation in 95920 ms returned []
Implicit Place search using SMT with State Equation took 100324 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 3091/3254 places, 7066/7371 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 216763 ms. Remains : 3091/3254 places, 7066/7371 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-00
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 4 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-00 finished in 217075 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 4 out of 3254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3254/3254 places, 7371/7371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 3254 transition count 7345
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 3228 transition count 7345
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 52 place count 3228 transition count 7325
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 92 place count 3208 transition count 7325
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 101 place count 3199 transition count 7292
Iterating global reduction 2 with 9 rules applied. Total rules applied 110 place count 3199 transition count 7292
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 110 place count 3199 transition count 7290
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 3197 transition count 7290
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 3192 transition count 7255
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 3192 transition count 7255
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 4 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 196 place count 3156 transition count 7219
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 202 place count 3150 transition count 7213
Iterating global reduction 2 with 6 rules applied. Total rules applied 208 place count 3150 transition count 7213
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 214 place count 3144 transition count 7171
Iterating global reduction 2 with 6 rules applied. Total rules applied 220 place count 3144 transition count 7171
Applied a total of 220 rules in 2068 ms. Remains 3144 /3254 variables (removed 110) and now considering 7171/7371 (removed 200) transitions.
[2024-05-24 23:56:16] [INFO ] Flow matrix only has 6571 transitions (discarded 600 similar events)
// Phase 1: matrix 6571 rows 3144 cols
[2024-05-24 23:56:16] [INFO ] Computed 77 invariants in 320 ms
[2024-05-24 23:56:21] [INFO ] Implicit Places using invariants in 4972 ms returned [186, 1107, 1420, 1428, 1635, 1636, 1682, 1711, 1812, 1861, 1908, 1909, 2801]
[2024-05-24 23:56:21] [INFO ] Actually due to overlaps returned [1420, 186, 1428, 1635, 1636, 1682, 1711, 1812, 1861, 1908, 1909, 2801]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 4979 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3132/3254 places, 7171/7371 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 3127 transition count 7166
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 3127 transition count 7166
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 3122 transition count 7161
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 3122 transition count 7161
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 3119 transition count 7140
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 3119 transition count 7140
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 38 place count 3113 transition count 7134
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 3107 transition count 7128
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 3107 transition count 7128
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 3101 transition count 7086
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 3101 transition count 7086
Applied a total of 62 rules in 2360 ms. Remains 3101 /3132 variables (removed 31) and now considering 7086/7171 (removed 85) transitions.
[2024-05-24 23:56:23] [INFO ] Flow matrix only has 6486 transitions (discarded 600 similar events)
// Phase 1: matrix 6486 rows 3101 cols
[2024-05-24 23:56:24] [INFO ] Computed 65 invariants in 164 ms
[2024-05-24 23:56:28] [INFO ] Implicit Places using invariants in 4682 ms returned [1104]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4687 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3100/3254 places, 7086/7371 transitions.
Applied a total of 0 rules in 412 ms. Remains 3100 /3100 variables (removed 0) and now considering 7086/7086 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 14509 ms. Remains : 3100/3254 places, 7086/7371 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-01
Product exploration explored 100000 steps with 1974 reset in 1223 ms.
Product exploration explored 100000 steps with 1974 reset in 1022 ms.
Computed a total of 501 stabilizing places and 1910 stable transitions
Computed a total of 501 stabilizing places and 1910 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (787 resets) in 609 ms. (65 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (112 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 30429 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 1
Probabilistic random walk after 30429 steps, saw 12986 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-24 23:56:34] [INFO ] Flow matrix only has 6486 transitions (discarded 600 similar events)
// Phase 1: matrix 6486 rows 3100 cols
[2024-05-24 23:56:35] [INFO ] Computed 64 invariants in 153 ms
[2024-05-24 23:56:35] [INFO ] State equation strengthened by 2626 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2400/2404 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2404 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/2405 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2405 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 639/3044 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3044 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/3086 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3086 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/3100 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3100 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9586/9586 variables, and 3164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2975 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 3100/3100 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2400/2404 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2404 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/2405 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2405 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 639/3044 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 23:56:40] [INFO ] Deduced a trap composed of 117 places in 2222 ms of which 20 ms to minimize.
[2024-05-24 23:56:42] [INFO ] Deduced a trap composed of 108 places in 2176 ms of which 21 ms to minimize.
[2024-05-24 23:56:45] [INFO ] Deduced a trap composed of 132 places in 2276 ms of which 21 ms to minimize.
SMT process timed out in 10473ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 7086/7086 transitions.
Free-agglomeration rule (complex) applied 292 times.
Iterating global reduction 0 with 292 rules applied. Total rules applied 292 place count 3100 transition count 10370
Reduce places removed 292 places and 0 transitions.
Iterating post reduction 0 with 292 rules applied. Total rules applied 584 place count 2808 transition count 10370
Applied a total of 584 rules in 1069 ms. Remains 2808 /3100 variables (removed 292) and now considering 10370/7086 (removed -3284) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1070 ms. Remains : 2808/3100 places, 10370/7086 transitions.
RANDOM walk for 40000 steps (968 resets) in 1598 ms. (25 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (84 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 25594 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 1
Probabilistic random walk after 25594 steps, saw 10942 distinct states, run finished after 3004 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-24 23:56:49] [INFO ] Flow matrix only has 9485 transitions (discarded 885 similar events)
// Phase 1: matrix 9485 rows 2808 cols
[2024-05-24 23:56:50] [INFO ] Computed 64 invariants in 144 ms
[2024-05-24 23:56:50] [INFO ] State equation strengthened by 6202 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2108/2112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/2113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 639/2752 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2752 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/2794 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2794 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/2808 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2808 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9485/12293 variables, 2808/2872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/12293 variables, 6202/9074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12293 variables, 0/9074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/12293 variables, 0/9074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12293/12293 variables, and 9074 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5676 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 2808/2808 constraints, ReadFeed: 6202/6202 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2108/2112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/2113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 639/2752 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 23:56:58] [INFO ] Deduced a trap composed of 39 places in 2407 ms of which 19 ms to minimize.
[2024-05-24 23:57:00] [INFO ] Deduced a trap composed of 87 places in 2192 ms of which 18 ms to minimize.
[2024-05-24 23:57:03] [INFO ] Deduced a trap composed of 89 places in 2234 ms of which 20 ms to minimize.
[2024-05-24 23:57:05] [INFO ] Deduced a trap composed of 103 places in 2205 ms of which 19 ms to minimize.
[2024-05-24 23:57:07] [INFO ] Deduced a trap composed of 99 places in 2401 ms of which 21 ms to minimize.
[2024-05-24 23:57:10] [INFO ] Deduced a trap composed of 103 places in 2345 ms of which 19 ms to minimize.
[2024-05-24 23:57:12] [INFO ] Deduced a trap composed of 99 places in 2391 ms of which 18 ms to minimize.
[2024-05-24 23:57:15] [INFO ] Deduced a trap composed of 82 places in 2275 ms of which 18 ms to minimize.
[2024-05-24 23:57:17] [INFO ] Deduced a trap composed of 101 places in 2223 ms of which 19 ms to minimize.
[2024-05-24 23:57:19] [INFO ] Deduced a trap composed of 94 places in 2400 ms of which 19 ms to minimize.
[2024-05-24 23:57:22] [INFO ] Deduced a trap composed of 97 places in 2315 ms of which 18 ms to minimize.
[2024-05-24 23:57:24] [INFO ] Deduced a trap composed of 99 places in 2281 ms of which 18 ms to minimize.
[2024-05-24 23:57:26] [INFO ] Deduced a trap composed of 96 places in 2312 ms of which 19 ms to minimize.
[2024-05-24 23:57:29] [INFO ] Deduced a trap composed of 102 places in 2419 ms of which 19 ms to minimize.
[2024-05-24 23:57:31] [INFO ] Deduced a trap composed of 103 places in 2342 ms of which 18 ms to minimize.
[2024-05-24 23:57:34] [INFO ] Deduced a trap composed of 175 places in 2384 ms of which 19 ms to minimize.
[2024-05-24 23:57:36] [INFO ] Deduced a trap composed of 199 places in 2226 ms of which 18 ms to minimize.
[2024-05-24 23:57:38] [INFO ] Deduced a trap composed of 97 places in 2251 ms of which 19 ms to minimize.
[2024-05-24 23:57:41] [INFO ] Deduced a trap composed of 5 places in 2356 ms of which 23 ms to minimize.
SMT process timed out in 51188ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2808 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10370/10370 transitions.
Applied a total of 0 rules in 556 ms. Remains 2808 /2808 variables (removed 0) and now considering 10370/10370 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 557 ms. Remains : 2808/2808 places, 10370/10370 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2808/2808 places, 10370/10370 transitions.
Applied a total of 0 rules in 556 ms. Remains 2808 /2808 variables (removed 0) and now considering 10370/10370 (removed 0) transitions.
[2024-05-24 23:57:42] [INFO ] Flow matrix only has 9485 transitions (discarded 885 similar events)
[2024-05-24 23:57:42] [INFO ] Invariant cache hit.
[2024-05-24 23:57:47] [INFO ] Implicit Places using invariants in 5464 ms returned []
Implicit Place search using SMT only with invariants took 5465 ms to find 0 implicit places.
Running 10276 sub problems to find dead transitions.
[2024-05-24 23:57:47] [INFO ] Flow matrix only has 9485 transitions (discarded 885 similar events)
[2024-05-24 23:57:47] [INFO ] Invariant cache hit.
[2024-05-24 23:57:47] [INFO ] State equation strengthened by 6202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2806 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 10276 unsolved
SMT process timed out in 106080ms, After SMT, problems are : Problem set: 0 solved, 10276 unsolved
Search for dead transitions found 0 dead transitions in 106209ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112271 ms. Remains : 2808/2808 places, 10370/10370 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 4 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3100/3100 places, 7086/7086 transitions.
Applied a total of 0 rules in 435 ms. Remains 3100 /3100 variables (removed 0) and now considering 7086/7086 (removed 0) transitions.
[2024-05-24 23:59:34] [INFO ] Flow matrix only has 6486 transitions (discarded 600 similar events)
// Phase 1: matrix 6486 rows 3100 cols
[2024-05-24 23:59:34] [INFO ] Computed 64 invariants in 172 ms
[2024-05-24 23:59:39] [INFO ] Implicit Places using invariants in 4690 ms returned []
[2024-05-24 23:59:39] [INFO ] Flow matrix only has 6486 transitions (discarded 600 similar events)
[2024-05-24 23:59:39] [INFO ] Invariant cache hit.
[2024-05-24 23:59:41] [INFO ] State equation strengthened by 2626 read => feed constraints.
[2024-05-25 00:00:11] [INFO ] Performed 1100/3100 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-25 00:00:42] [INFO ] Performed 1787/3100 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-25 00:01:12] [INFO ] Performed 2922/3100 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-25 00:01:18] [INFO ] Implicit Places using invariants and state equation in 98971 ms returned [3092]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 103671 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3099/3100 places, 7086/7086 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 3099 transition count 7085
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 3098 transition count 7085
Applied a total of 2 rules in 521 ms. Remains 3098 /3099 variables (removed 1) and now considering 7085/7086 (removed 1) transitions.
[2024-05-25 00:01:18] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
// Phase 1: matrix 6485 rows 3098 cols
[2024-05-25 00:01:18] [INFO ] Computed 63 invariants in 158 ms
[2024-05-25 00:01:23] [INFO ] Implicit Places using invariants in 4699 ms returned []
[2024-05-25 00:01:23] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
[2024-05-25 00:01:23] [INFO ] Invariant cache hit.
[2024-05-25 00:01:26] [INFO ] State equation strengthened by 2626 read => feed constraints.
[2024-05-25 00:01:56] [INFO ] Performed 972/3098 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-25 00:02:27] [INFO ] Performed 1621/3098 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-25 00:02:57] [INFO ] Performed 2510/3098 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-25 00:03:13] [INFO ] Implicit Places using invariants and state equation in 109787 ms returned []
Implicit Place search using SMT with State Equation took 114488 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3098/3100 places, 7085/7086 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 219118 ms. Remains : 3098/3100 places, 7085/7086 transitions.
Computed a total of 499 stabilizing places and 1909 stable transitions
Computed a total of 499 stabilizing places and 1909 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 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 47 ms :[(NOT p0)]
RANDOM walk for 40000 steps (789 resets) in 482 ms. (82 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (112 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 30563 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 1
Probabilistic random walk after 30563 steps, saw 13027 distinct states, run finished after 3001 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-25 00:03:16] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
[2024-05-25 00:03:16] [INFO ] Invariant cache hit.
[2024-05-25 00:03:16] [INFO ] State equation strengthened by 2626 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2399/2403 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2403 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/2404 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2404 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 639/3043 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3043 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/3085 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3085 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/3098 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3098 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9583/9583 variables, and 3161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2516 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 3098/3098 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2399/2403 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2403 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/2404 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2404 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 639/3043 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 00:03:21] [INFO ] Deduced a trap composed of 121 places in 2143 ms of which 21 ms to minimize.
[2024-05-25 00:03:23] [INFO ] Deduced a trap composed of 118 places in 2081 ms of which 20 ms to minimize.
[2024-05-25 00:03:25] [INFO ] Deduced a trap composed of 264 places in 2038 ms of which 21 ms to minimize.
SMT process timed out in 9400ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 3098 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3098/3098 places, 7085/7085 transitions.
Free-agglomeration rule (complex) applied 292 times.
Iterating global reduction 0 with 292 rules applied. Total rules applied 292 place count 3098 transition count 10369
Reduce places removed 292 places and 0 transitions.
Iterating post reduction 0 with 292 rules applied. Total rules applied 584 place count 2806 transition count 10369
Applied a total of 584 rules in 1101 ms. Remains 2806 /3098 variables (removed 292) and now considering 10369/7085 (removed -3284) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1103 ms. Remains : 2806/3098 places, 10369/7085 transitions.
RANDOM walk for 40000 steps (967 resets) in 1527 ms. (26 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (84 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 27021 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 1
Probabilistic random walk after 27021 steps, saw 11520 distinct states, run finished after 3002 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-25 00:03:30] [INFO ] Flow matrix only has 9484 transitions (discarded 885 similar events)
// Phase 1: matrix 9484 rows 2806 cols
[2024-05-25 00:03:30] [INFO ] Computed 63 invariants in 182 ms
[2024-05-25 00:03:30] [INFO ] State equation strengthened by 6202 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2107/2111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/2112 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 639/2751 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2751 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 42/2793 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2793 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/2806 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2806 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9484/12290 variables, 2806/2869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/12290 variables, 6202/9071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12290 variables, 0/9071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/12290 variables, 0/9071 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12290/12290 variables, and 9071 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5414 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 2806/2806 constraints, ReadFeed: 6202/6202 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2107/2111 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/2112 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 639/2751 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 00:03:39] [INFO ] Deduced a trap composed of 89 places in 2296 ms of which 19 ms to minimize.
[2024-05-25 00:03:41] [INFO ] Deduced a trap composed of 88 places in 2459 ms of which 19 ms to minimize.
[2024-05-25 00:03:43] [INFO ] Deduced a trap composed of 5 places in 2251 ms of which 19 ms to minimize.
[2024-05-25 00:03:46] [INFO ] Deduced a trap composed of 91 places in 2358 ms of which 17 ms to minimize.
[2024-05-25 00:03:48] [INFO ] Deduced a trap composed of 130 places in 2234 ms of which 18 ms to minimize.
[2024-05-25 00:03:50] [INFO ] Deduced a trap composed of 117 places in 2389 ms of which 19 ms to minimize.
[2024-05-25 00:03:53] [INFO ] Deduced a trap composed of 101 places in 2248 ms of which 19 ms to minimize.
[2024-05-25 00:03:55] [INFO ] Deduced a trap composed of 116 places in 2295 ms of which 18 ms to minimize.
[2024-05-25 00:03:57] [INFO ] Deduced a trap composed of 112 places in 2341 ms of which 18 ms to minimize.
[2024-05-25 00:04:00] [INFO ] Deduced a trap composed of 114 places in 2306 ms of which 20 ms to minimize.
[2024-05-25 00:04:02] [INFO ] Deduced a trap composed of 91 places in 2377 ms of which 19 ms to minimize.
[2024-05-25 00:04:05] [INFO ] Deduced a trap composed of 70 places in 2283 ms of which 18 ms to minimize.
[2024-05-25 00:04:07] [INFO ] Deduced a trap composed of 112 places in 2340 ms of which 19 ms to minimize.
[2024-05-25 00:04:09] [INFO ] Deduced a trap composed of 95 places in 2357 ms of which 18 ms to minimize.
[2024-05-25 00:04:12] [INFO ] Deduced a trap composed of 92 places in 2364 ms of which 18 ms to minimize.
[2024-05-25 00:04:14] [INFO ] Deduced a trap composed of 109 places in 2297 ms of which 19 ms to minimize.
[2024-05-25 00:04:16] [INFO ] Deduced a trap composed of 112 places in 2296 ms of which 19 ms to minimize.
[2024-05-25 00:04:19] [INFO ] Deduced a trap composed of 112 places in 2318 ms of which 19 ms to minimize.
[2024-05-25 00:04:21] [INFO ] Deduced a trap composed of 99 places in 2333 ms of which 19 ms to minimize.
SMT process timed out in 51049ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10369/10369 transitions.
Applied a total of 0 rules in 518 ms. Remains 2806 /2806 variables (removed 0) and now considering 10369/10369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 519 ms. Remains : 2806/2806 places, 10369/10369 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10369/10369 transitions.
Applied a total of 0 rules in 520 ms. Remains 2806 /2806 variables (removed 0) and now considering 10369/10369 (removed 0) transitions.
[2024-05-25 00:04:22] [INFO ] Flow matrix only has 9484 transitions (discarded 885 similar events)
[2024-05-25 00:04:22] [INFO ] Invariant cache hit.
[2024-05-25 00:04:28] [INFO ] Implicit Places using invariants in 5448 ms returned []
Implicit Place search using SMT only with invariants took 5450 ms to find 0 implicit places.
Running 10275 sub problems to find dead transitions.
[2024-05-25 00:04:28] [INFO ] Flow matrix only has 9484 transitions (discarded 885 similar events)
[2024-05-25 00:04:28] [INFO ] Invariant cache hit.
[2024-05-25 00:04:28] [INFO ] State equation strengthened by 6202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2804 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 10275 unsolved
SMT process timed out in 104973ms, After SMT, problems are : Problem set: 0 solved, 10275 unsolved
Search for dead transitions found 0 dead transitions in 105082ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111103 ms. Remains : 2806/2806 places, 10369/10369 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1973 reset in 1014 ms.
Product exploration explored 100000 steps with 1973 reset in 1131 ms.
Built C files in :
/tmp/ltsmin14589273265001299712
[2024-05-25 00:06:15] [INFO ] Too many transitions (7085) to apply POR reductions. Disabling POR matrices.
[2024-05-25 00:06:15] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14589273265001299712
Running compilation step : cd /tmp/ltsmin14589273265001299712;'/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/ltsmin14589273265001299712;'/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/ltsmin14589273265001299712;'/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 3098 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3098/3098 places, 7085/7085 transitions.
Applied a total of 0 rules in 444 ms. Remains 3098 /3098 variables (removed 0) and now considering 7085/7085 (removed 0) transitions.
[2024-05-25 00:06:19] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
// Phase 1: matrix 6485 rows 3098 cols
[2024-05-25 00:06:19] [INFO ] Computed 63 invariants in 251 ms
[2024-05-25 00:06:24] [INFO ] Implicit Places using invariants in 4843 ms returned []
[2024-05-25 00:06:24] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
[2024-05-25 00:06:24] [INFO ] Invariant cache hit.
[2024-05-25 00:06:27] [INFO ] State equation strengthened by 2626 read => feed constraints.
[2024-05-25 00:06:57] [INFO ] Performed 996/3098 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-25 00:07:28] [INFO ] Performed 1621/3098 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2024-05-25 00:07:58] [INFO ] Performed 2430/3098 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2024-05-25 00:08:14] [INFO ] Implicit Places using invariants and state equation in 110147 ms returned []
Implicit Place search using SMT with State Equation took 114996 ms to find 0 implicit places.
[2024-05-25 00:08:15] [INFO ] Redundant transitions in 691 ms returned []
Running 7060 sub problems to find dead transitions.
[2024-05-25 00:08:15] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
[2024-05-25 00:08:15] [INFO ] Invariant cache hit.
[2024-05-25 00:08:15] [INFO ] State equation strengthened by 2626 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3096 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7060 unsolved
SMT process timed out in 46363ms, After SMT, problems are : Problem set: 0 solved, 7060 unsolved
Search for dead transitions found 0 dead transitions in 46433ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 162592 ms. Remains : 3098/3098 places, 7085/7085 transitions.
Built C files in :
/tmp/ltsmin4251018899867094585
[2024-05-25 00:09:01] [INFO ] Too many transitions (7085) to apply POR reductions. Disabling POR matrices.
[2024-05-25 00:09:01] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4251018899867094585
Running compilation step : cd /tmp/ltsmin4251018899867094585;'/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/ltsmin4251018899867094585;'/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/ltsmin4251018899867094585;'/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-25 00:09:05] [INFO ] Flatten gal took : 385 ms
[2024-05-25 00:09:05] [INFO ] Flatten gal took : 171 ms
[2024-05-25 00:09:05] [INFO ] Time to serialize gal into /tmp/LTL10046488936525167395.gal : 60 ms
[2024-05-25 00:09:05] [INFO ] Time to serialize properties into /tmp/LTL3990393144334192482.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/LTL10046488936525167395.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13182377226598199089.hoa' '-atoms' '/tmp/LTL3990393144334192482.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/LTL3990393144334192482.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13182377226598199089.hoa
Detected timeout of ITS tools.
[2024-05-25 00:09:21] [INFO ] Flatten gal took : 159 ms
[2024-05-25 00:09:21] [INFO ] Flatten gal took : 164 ms
[2024-05-25 00:09:21] [INFO ] Time to serialize gal into /tmp/LTL12581091348015401025.gal : 34 ms
[2024-05-25 00:09:21] [INFO ] Time to serialize properties into /tmp/LTL4386643611688676155.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12581091348015401025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4386643611688676155.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((Node6ThinksNode7ShouldBeNodeMasterToReplaceNode17<1)||(Node7NotifyThatHeIsActive<1))&&((Node13HasAskedItsLeafSetToLx6ToRepl...205
Formula 0 simplified : GF!"(((Node6ThinksNode7ShouldBeNodeMasterToReplaceNode17<1)||(Node7NotifyThatHeIsActive<1))&&((Node13HasAskedItsLeafSetToLx6ToReplac...199
Detected timeout of ITS tools.
[2024-05-25 00:09:36] [INFO ] Flatten gal took : 192 ms
[2024-05-25 00:09:36] [INFO ] Applying decomposition
[2024-05-25 00:09:36] [INFO ] Flatten gal took : 168 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/graph3027201410562035891.txt' '-o' '/tmp/graph3027201410562035891.bin' '-w' '/tmp/graph3027201410562035891.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3027201410562035891.bin' '-l' '-1' '-v' '-w' '/tmp/graph3027201410562035891.weights' '-q' '0' '-e' '0.001'
[2024-05-25 00:09:37] [INFO ] Decomposing Gal with order
[2024-05-25 00:09:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 00:09:38] [INFO ] Removed a total of 6670 redundant transitions.
[2024-05-25 00:09:39] [INFO ] Flatten gal took : 1293 ms
[2024-05-25 00:09:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 2996 labels/synchronizations in 397 ms.
[2024-05-25 00:09:39] [INFO ] Time to serialize gal into /tmp/LTL8944622783420291936.gal : 65 ms
[2024-05-25 00:09:39] [INFO ] Time to serialize properties into /tmp/LTL17061534890575048671.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/LTL8944622783420291936.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17061534890575048671.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("(((i18.u142.Node6ThinksNode7ShouldBeNodeMasterToReplaceNode17<1)||(i18.u143.Node7NotifyThatHeIsActive<1))&&((i15.i1.i2.u174.No...253
Formula 0 simplified : GF!"(((i18.u142.Node6ThinksNode7ShouldBeNodeMasterToReplaceNode17<1)||(i18.u143.Node7NotifyThatHeIsActive<1))&&((i15.i1.i2.u174.Node...247
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-01 finished in 820331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 6 out of 3254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3254/3254 places, 7371/7371 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 3238 transition count 7331
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 3238 transition count 7331
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 44 place count 3226 transition count 7283
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 3226 transition count 7283
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 3220 transition count 7241
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 3220 transition count 7241
Applied a total of 68 rules in 1253 ms. Remains 3220 /3254 variables (removed 34) and now considering 7241/7371 (removed 130) transitions.
[2024-05-25 00:09:56] [INFO ] Flow matrix only has 6641 transitions (discarded 600 similar events)
// Phase 1: matrix 6641 rows 3220 cols
[2024-05-25 00:09:56] [INFO ] Computed 77 invariants in 209 ms
[2024-05-25 00:10:01] [INFO ] Implicit Places using invariants in 4996 ms returned [194, 1141, 1457, 1466, 1608, 1678, 1679, 1728, 1757, 1862, 1911, 1961, 1962, 2861]
[2024-05-25 00:10:01] [INFO ] Actually due to overlaps returned [1457, 194, 1466, 1608, 1678, 1679, 1728, 1757, 1862, 1911, 1961, 1962, 2861]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 5009 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3207/3254 places, 7241/7371 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3195 transition count 7229
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3195 transition count 7229
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 3183 transition count 7217
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 3183 transition count 7217
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 3171 transition count 7205
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 3171 transition count 7205
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 3161 transition count 7135
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 3161 transition count 7135
Applied a total of 92 rules in 1491 ms. Remains 3161 /3207 variables (removed 46) and now considering 7135/7241 (removed 106) transitions.
[2024-05-25 00:10:02] [INFO ] Flow matrix only has 6535 transitions (discarded 600 similar events)
// Phase 1: matrix 6535 rows 3161 cols
[2024-05-25 00:10:02] [INFO ] Computed 64 invariants in 170 ms
[2024-05-25 00:10:07] [INFO ] Implicit Places using invariants in 4623 ms returned [1137]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4627 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3160/3254 places, 7135/7371 transitions.
Applied a total of 0 rules in 283 ms. Remains 3160 /3160 variables (removed 0) and now considering 7135/7135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12664 ms. Remains : 3160/3254 places, 7135/7371 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-02
Product exploration explored 100000 steps with 1389 reset in 827 ms.
Product exploration explored 100000 steps with 1387 reset in 846 ms.
Computed a total of 536 stabilizing places and 1934 stable transitions
Computed a total of 536 stabilizing places and 1934 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (553 resets) in 515 ms. (77 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (104 resets) in 531 ms. (75 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (104 resets) in 403 ms. (99 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (104 resets) in 276 ms. (144 steps per ms) remains 3/3 properties
[2024-05-25 00:10:10] [INFO ] Flow matrix only has 6535 transitions (discarded 600 similar events)
// Phase 1: matrix 6535 rows 3160 cols
[2024-05-25 00:10:10] [INFO ] Computed 63 invariants in 163 ms
[2024-05-25 00:10:10] [INFO ] State equation strengthened by 2614 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 2459/2465 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2465 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 601/3066 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3066 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/3104 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3104 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/3146 variables, 42/49 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3146 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/3160 variables, 14/63 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3160 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6535/9695 variables, 3160/3223 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9695/9695 variables, and 5837 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4047 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 3160/3160 constraints, ReadFeed: 2614/2614 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2459/2465 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2465 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 601/3066 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-25 00:10:17] [INFO ] Deduced a trap composed of 284 places in 2270 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/3066 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3066 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 38/3104 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-25 00:10:19] [INFO ] Deduced a trap composed of 219 places in 2302 ms of which 22 ms to minimize.
SMT process timed out in 9695ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 3160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3160/3160 places, 7135/7135 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 3160 transition count 7107
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 3132 transition count 7107
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 56 place count 3132 transition count 7093
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 3118 transition count 7093
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 4 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 130 place count 3095 transition count 7070
Free-agglomeration rule (complex) applied 270 times.
Iterating global reduction 2 with 270 rules applied. Total rules applied 400 place count 3095 transition count 10388
Reduce places removed 270 places and 0 transitions.
Iterating post reduction 2 with 270 rules applied. Total rules applied 670 place count 2825 transition count 10388
Applied a total of 670 rules in 1480 ms. Remains 2825 /3160 variables (removed 335) and now considering 10388/7135 (removed -3253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1481 ms. Remains : 2825/3160 places, 10388/7135 transitions.
RANDOM walk for 40000 steps (944 resets) in 2026 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (108 resets) in 310 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (108 resets) in 273 ms. (146 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 25542 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 25542 steps, saw 10864 distinct states, run finished after 3003 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-25 00:10:25] [INFO ] Flow matrix only has 9522 transitions (discarded 866 similar events)
// Phase 1: matrix 9522 rows 2825 cols
[2024-05-25 00:10:25] [INFO ] Computed 63 invariants in 154 ms
[2024-05-25 00:10:25] [INFO ] State equation strengthened by 6202 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) 2124/2130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 601/2731 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2731 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/2769 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2769 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/2811 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2811 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/2825 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2825 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9522/12347 variables, 2825/2888 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/12347 variables, 6202/9090 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12347 variables, 0/9090 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/12347 variables, 0/9090 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12347/12347 variables, and 9090 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7427 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 2825/2825 constraints, ReadFeed: 6202/6202 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2124/2130 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 601/2731 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 00:10:35] [INFO ] Deduced a trap composed of 239 places in 2270 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2731 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2731 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 38/2769 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 00:10:38] [INFO ] Deduced a trap composed of 5 places in 2301 ms of which 18 ms to minimize.
[2024-05-25 00:10:40] [INFO ] Deduced a trap composed of 150 places in 2449 ms of which 18 ms to minimize.
[2024-05-25 00:10:41] [INFO ] Deduced a trap composed of 91 places in 1077 ms of which 14 ms to minimize.
[2024-05-25 00:10:44] [INFO ] Deduced a trap composed of 91 places in 2279 ms of which 18 ms to minimize.
[2024-05-25 00:10:46] [INFO ] Deduced a trap composed of 139 places in 2464 ms of which 19 ms to minimize.
[2024-05-25 00:10:47] [INFO ] Deduced a trap composed of 161 places in 1108 ms of which 13 ms to minimize.
[2024-05-25 00:10:50] [INFO ] Deduced a trap composed of 110 places in 2304 ms of which 18 ms to minimize.
[2024-05-25 00:10:51] [INFO ] Deduced a trap composed of 136 places in 1100 ms of which 13 ms to minimize.
[2024-05-25 00:10:53] [INFO ] Deduced a trap composed of 138 places in 2455 ms of which 18 ms to minimize.
[2024-05-25 00:10:56] [INFO ] Deduced a trap composed of 81 places in 2357 ms of which 18 ms to minimize.
[2024-05-25 00:10:57] [INFO ] Deduced a trap composed of 319 places in 1098 ms of which 13 ms to minimize.
[2024-05-25 00:10:59] [INFO ] Deduced a trap composed of 186 places in 2390 ms of which 19 ms to minimize.
[2024-05-25 00:11:02] [INFO ] Deduced a trap composed of 158 places in 2334 ms of which 18 ms to minimize.
[2024-05-25 00:11:04] [INFO ] Deduced a trap composed of 93 places in 2289 ms of which 18 ms to minimize.
[2024-05-25 00:11:06] [INFO ] Deduced a trap composed of 100 places in 2199 ms of which 18 ms to minimize.
[2024-05-25 00:11:09] [INFO ] Deduced a trap composed of 106 places in 2332 ms of which 18 ms to minimize.
[2024-05-25 00:11:11] [INFO ] Deduced a trap composed of 134 places in 2345 ms of which 19 ms to minimize.
[2024-05-25 00:11:13] [INFO ] Deduced a trap composed of 111 places in 2327 ms of which 25 ms to minimize.
[2024-05-25 00:11:16] [INFO ] Deduced a trap composed of 144 places in 2371 ms of which 18 ms to minimize.
[2024-05-25 00:11:18] [INFO ] Deduced a trap composed of 100 places in 2304 ms of which 18 ms to minimize.
SMT process timed out in 53395ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 2825 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2825/2825 places, 10388/10388 transitions.
Applied a total of 0 rules in 525 ms. Remains 2825 /2825 variables (removed 0) and now considering 10388/10388 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 525 ms. Remains : 2825/2825 places, 10388/10388 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2825/2825 places, 10388/10388 transitions.
Applied a total of 0 rules in 495 ms. Remains 2825 /2825 variables (removed 0) and now considering 10388/10388 (removed 0) transitions.
[2024-05-25 00:11:19] [INFO ] Flow matrix only has 9522 transitions (discarded 866 similar events)
[2024-05-25 00:11:19] [INFO ] Invariant cache hit.
[2024-05-25 00:11:25] [INFO ] Implicit Places using invariants in 5564 ms returned []
Implicit Place search using SMT only with invariants took 5566 ms to find 0 implicit places.
Running 10317 sub problems to find dead transitions.
[2024-05-25 00:11:25] [INFO ] Flow matrix only has 9522 transitions (discarded 866 similar events)
[2024-05-25 00:11:25] [INFO ] Invariant cache hit.
[2024-05-25 00:11:25] [INFO ] State equation strengthened by 6202 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2823 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 10317 unsolved
SMT process timed out in 99544ms, After SMT, problems are : Problem set: 0 solved, 10317 unsolved
Search for dead transitions found 0 dead transitions in 99643ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105760 ms. Remains : 2825/2825 places, 10388/10388 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 236 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Support contains 6 out of 3160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3160/3160 places, 7135/7135 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 3160 transition count 7107
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 3132 transition count 7107
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 56 place count 3132 transition count 7093
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 84 place count 3118 transition count 7093
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 130 place count 3095 transition count 7070
Applied a total of 130 rules in 819 ms. Remains 3095 /3160 variables (removed 65) and now considering 7070/7135 (removed 65) transitions.
[2024-05-25 00:13:06] [INFO ] Flow matrix only has 6470 transitions (discarded 600 similar events)
// Phase 1: matrix 6470 rows 3095 cols
[2024-05-25 00:13:06] [INFO ] Computed 63 invariants in 134 ms
[2024-05-25 00:13:11] [INFO ] Implicit Places using invariants in 4590 ms returned []
[2024-05-25 00:13:11] [INFO ] Flow matrix only has 6470 transitions (discarded 600 similar events)
[2024-05-25 00:13:11] [INFO ] Invariant cache hit.
[2024-05-25 00:13:14] [INFO ] State equation strengthened by 2614 read => feed constraints.
[2024-05-25 00:13:45] [INFO ] Performed 1059/3095 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-25 00:14:15] [INFO ] Performed 1714/3095 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-25 00:14:45] [INFO ] Performed 2865/3095 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-25 00:14:51] [INFO ] Implicit Places using invariants and state equation in 100398 ms returned [3071, 3092]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 105013 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3093/3160 places, 7070/7135 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 3093 transition count 7068
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3091 transition count 7068
Applied a total of 4 rules in 447 ms. Remains 3091 /3093 variables (removed 2) and now considering 7068/7070 (removed 2) transitions.
[2024-05-25 00:14:51] [INFO ] Flow matrix only has 6468 transitions (discarded 600 similar events)
// Phase 1: matrix 6468 rows 3091 cols
[2024-05-25 00:14:52] [INFO ] Computed 61 invariants in 158 ms
[2024-05-25 00:14:56] [INFO ] Implicit Places using invariants in 4634 ms returned []
[2024-05-25 00:14:56] [INFO ] Flow matrix only has 6468 transitions (discarded 600 similar events)
[2024-05-25 00:14:56] [INFO ] Invariant cache hit.
[2024-05-25 00:14:59] [INFO ] State equation strengthened by 2614 read => feed constraints.
[2024-05-25 00:15:29] [INFO ] Performed 1090/3091 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-25 00:16:00] [INFO ] Performed 1782/3091 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2024-05-25 00:16:30] [INFO ] Performed 2741/3091 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2024-05-25 00:16:42] [INFO ] Implicit Places using invariants and state equation in 105479 ms returned []
Implicit Place search using SMT with State Equation took 110113 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3091/3160 places, 7068/7135 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 216396 ms. Remains : 3091/3160 places, 7068/7135 transitions.
Computed a total of 490 stabilizing places and 1890 stable transitions
Computed a total of 490 stabilizing places and 1890 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 127 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 388 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (788 resets) in 2454 ms. (16 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (112 resets) in 398 ms. (100 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (112 resets) in 260 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (112 resets) in 258 ms. (154 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (112 resets) in 239 ms. (166 steps per ms) remains 3/3 properties
[2024-05-25 00:16:43] [INFO ] Flow matrix only has 6468 transitions (discarded 600 similar events)
[2024-05-25 00:16:43] [INFO ] Invariant cache hit.
[2024-05-25 00:16:43] [INFO ] State equation strengthened by 2614 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 2392/2398 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2398 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 601/2999 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2999 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 38/3037 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3037 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 42/3079 variables, 42/49 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3079 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 12/3091 variables, 12/61 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3091 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6468/9559 variables, 3091/3152 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9559/9559 variables, and 5766 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4195 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 3091/3091 constraints, ReadFeed: 2614/2614 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2392/2398 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2398 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 601/2999 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-25 00:16:50] [INFO ] Deduced a trap composed of 430 places in 2040 ms of which 21 ms to minimize.
[2024-05-25 00:16:52] [INFO ] Deduced a trap composed of 249 places in 2087 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2999 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2999 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 38/3037 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3037/9559 variables, and 9 constraints, problems are : Problem set: 1 solved, 2 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 5/47 constraints, Generalized P Invariants (flows): 2/14 constraints, State Equation: 0/3091 constraints, ReadFeed: 0/2614 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 9256ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 3091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3091/3091 places, 7068/7068 transitions.
Free-agglomeration rule (complex) applied 270 times.
Iterating global reduction 0 with 270 rules applied. Total rules applied 270 place count 3091 transition count 10386
Reduce places removed 270 places and 0 transitions.
Iterating post reduction 0 with 270 rules applied. Total rules applied 540 place count 2821 transition count 10386
Applied a total of 540 rules in 1060 ms. Remains 2821 /3091 variables (removed 270) and now considering 10386/7068 (removed -3318) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1060 ms. Remains : 2821/3091 places, 10386/7068 transitions.
RANDOM walk for 40000 steps (944 resets) in 2016 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (108 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (108 resets) in 323 ms. (123 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 25610 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 25610 steps, saw 10884 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-25 00:16:57] [INFO ] Flow matrix only has 9520 transitions (discarded 866 similar events)
// Phase 1: matrix 9520 rows 2821 cols
[2024-05-25 00:16:58] [INFO ] Computed 61 invariants in 365 ms
[2024-05-25 00:16:58] [INFO ] State equation strengthened by 6202 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) 2122/2128 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 601/2729 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 00:17:00] [INFO ] Deduced a trap composed of 171 places in 2228 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2729 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2729 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 38/2767 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 00:17:03] [INFO ] Deduced a trap composed of 100 places in 2243 ms of which 18 ms to minimize.
[2024-05-25 00:17:05] [INFO ] Deduced a trap composed of 101 places in 2310 ms of which 19 ms to minimize.
[2024-05-25 00:17:07] [INFO ] Deduced a trap composed of 91 places in 1108 ms of which 12 ms to minimize.
[2024-05-25 00:17:09] [INFO ] Deduced a trap composed of 99 places in 2459 ms of which 19 ms to minimize.
[2024-05-25 00:17:12] [INFO ] Deduced a trap composed of 103 places in 2292 ms of which 18 ms to minimize.
[2024-05-25 00:17:14] [INFO ] Deduced a trap composed of 119 places in 2216 ms of which 19 ms to minimize.
[2024-05-25 00:17:16] [INFO ] Deduced a trap composed of 97 places in 2361 ms of which 19 ms to minimize.
[2024-05-25 00:17:17] [INFO ] Deduced a trap composed of 161 places in 1096 ms of which 13 ms to minimize.
[2024-05-25 00:17:20] [INFO ] Deduced a trap composed of 122 places in 2253 ms of which 18 ms to minimize.
[2024-05-25 00:17:22] [INFO ] Deduced a trap composed of 114 places in 2276 ms of which 18 ms to minimize.
[2024-05-25 00:17:23] [INFO ] Deduced a trap composed of 136 places in 1123 ms of which 13 ms to minimize.
[2024-05-25 00:17:24] [INFO ] Deduced a trap composed of 119 places in 1146 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2767 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2767 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 42/2809 variables, 42/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2809 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/2821 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2821 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9520/12341 variables, 2821/2895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/12341 variables, 6202/9097 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/12341 variables, 0/9097 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/12341 variables, 0/9097 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12341/12341 variables, and 9097 constraints, problems are : Problem set: 0 solved, 2 unsolved in 34196 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 2821/2821 constraints, ReadFeed: 6202/6202 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 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) 2122/2128 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 601/2729 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2729 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2729 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 38/2767 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2767 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 00:17:34] [INFO ] Deduced a trap composed of 5 places in 1082 ms of which 14 ms to minimize.
[2024-05-25 00:17:35] [INFO ] Deduced a trap composed of 136 places in 1096 ms of which 13 ms to minimize.
[2024-05-25 00:17:36] [INFO ] Deduced a trap composed of 119 places in 1159 ms of which 13 ms to minimize.
[2024-05-25 00:17:37] [INFO ] Deduced a trap composed of 144 places in 1153 ms of which 13 ms to minimize.
[2024-05-25 00:17:38] [INFO ] Deduced a trap composed of 166 places in 1177 ms of which 14 ms to minimize.
[2024-05-25 00:17:40] [INFO ] Deduced a trap composed of 166 places in 1165 ms of which 14 ms to minimize.
[2024-05-25 00:17:41] [INFO ] Deduced a trap composed of 144 places in 1072 ms of which 13 ms to minimize.
[2024-05-25 00:17:42] [INFO ] Deduced a trap composed of 182 places in 1054 ms of which 13 ms to minimize.
[2024-05-25 00:17:43] [INFO ] Deduced a trap composed of 166 places in 1197 ms of which 14 ms to minimize.
[2024-05-25 00:17:44] [INFO ] Deduced a trap composed of 119 places in 1064 ms of which 13 ms to minimize.
[2024-05-25 00:17:45] [INFO ] Deduced a trap composed of 159 places in 1103 ms of which 13 ms to minimize.
[2024-05-25 00:17:46] [INFO ] Deduced a trap composed of 182 places in 1094 ms of which 13 ms to minimize.
[2024-05-25 00:17:48] [INFO ] Deduced a trap composed of 144 places in 1096 ms of which 13 ms to minimize.
[2024-05-25 00:17:49] [INFO ] Deduced a trap composed of 166 places in 1173 ms of which 13 ms to minimize.
[2024-05-25 00:17:50] [INFO ] Deduced a trap composed of 166 places in 1155 ms of which 14 ms to minimize.
[2024-05-25 00:17:51] [INFO ] Deduced a trap composed of 185 places in 1141 ms of which 13 ms to minimize.
[2024-05-25 00:17:52] [INFO ] Deduced a trap composed of 185 places in 1149 ms of which 13 ms to minimize.
[2024-05-25 00:17:54] [INFO ] Deduced a trap composed of 201 places in 1179 ms of which 14 ms to minimize.
[2024-05-25 00:17:55] [INFO ] Deduced a trap composed of 201 places in 1187 ms of which 13 ms to minimize.
[2024-05-25 00:17:56] [INFO ] Deduced a trap composed of 214 places in 1200 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2767 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 00:17:57] [INFO ] Deduced a trap composed of 225 places in 1189 ms of which 14 ms to minimize.
[2024-05-25 00:17:59] [INFO ] Deduced a trap composed of 214 places in 1173 ms of which 13 ms to minimize.
[2024-05-25 00:18:00] [INFO ] Deduced a trap composed of 227 places in 1198 ms of which 14 ms to minimize.
[2024-05-25 00:18:01] [INFO ] Deduced a trap composed of 281 places in 1166 ms of which 14 ms to minimize.
[2024-05-25 00:18:02] [INFO ] Deduced a trap composed of 225 places in 1178 ms of which 14 ms to minimize.
[2024-05-25 00:18:03] [INFO ] Deduced a trap composed of 267 places in 1149 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2767 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2767 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 42/2809 variables, 42/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 00:18:06] [INFO ] Deduced a trap composed of 104 places in 2274 ms of which 18 ms to minimize.
[2024-05-25 00:18:09] [INFO ] Deduced a trap composed of 74 places in 2337 ms of which 20 ms to minimize.
[2024-05-25 00:18:11] [INFO ] Deduced a trap composed of 102 places in 2106 ms of which 18 ms to minimize.
[2024-05-25 00:18:13] [INFO ] Deduced a trap composed of 102 places in 2326 ms of which 19 ms to minimize.
[2024-05-25 00:18:15] [INFO ] Deduced a trap composed of 109 places in 2278 ms of which 19 ms to minimize.
[2024-05-25 00:18:18] [INFO ] Deduced a trap composed of 104 places in 2303 ms of which 19 ms to minimize.
SMT process timed out in 80516ms, 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 2821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2821/2821 places, 10386/10386 transitions.
Applied a total of 0 rules in 548 ms. Remains 2821 /2821 variables (removed 0) and now considering 10386/10386 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 551 ms. Remains : 2821/2821 places, 10386/10386 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2821/2821 places, 10386/10386 transitions.
Applied a total of 0 rules in 527 ms. Remains 2821 /2821 variables (removed 0) and now considering 10386/10386 (removed 0) transitions.
[2024-05-25 00:18:19] [INFO ] Flow matrix only has 9520 transitions (discarded 866 similar events)
[2024-05-25 00:18:19] [INFO ] Invariant cache hit.
[2024-05-25 00:18:24] [INFO ] Implicit Places using invariants in 5637 ms returned []
Implicit Place search using SMT only with invariants took 5638 ms to find 0 implicit places.
Running 10315 sub problems to find dead transitions.
[2024-05-25 00:18:25] [INFO ] Flow matrix only has 9520 transitions (discarded 866 similar events)
[2024-05-25 00:18:25] [INFO ] Invariant cache hit.
[2024-05-25 00:18:25] [INFO ] State equation strengthened by 6202 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2819 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 10315 unsolved
SMT process timed out in 104765ms, After SMT, problems are : Problem set: 0 solved, 10315 unsolved
Search for dead transitions found 0 dead transitions in 104861ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111060 ms. Remains : 2821/2821 places, 10386/10386 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 276 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 323 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 297 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 1974 reset in 1077 ms.
Product exploration explored 100000 steps with 1975 reset in 1111 ms.
Built C files in :
/tmp/ltsmin16259072740748438878
[2024-05-25 00:20:13] [INFO ] Too many transitions (7068) to apply POR reductions. Disabling POR matrices.
[2024-05-25 00:20:13] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16259072740748438878
Running compilation step : cd /tmp/ltsmin16259072740748438878;'/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/ltsmin16259072740748438878;'/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/ltsmin16259072740748438878;'/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 3091 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3091/3091 places, 7068/7068 transitions.
Applied a total of 0 rules in 429 ms. Remains 3091 /3091 variables (removed 0) and now considering 7068/7068 (removed 0) transitions.
[2024-05-25 00:20:16] [INFO ] Flow matrix only has 6468 transitions (discarded 600 similar events)
// Phase 1: matrix 6468 rows 3091 cols
[2024-05-25 00:20:17] [INFO ] Computed 61 invariants in 167 ms
[2024-05-25 00:20:21] [INFO ] Implicit Places using invariants in 4675 ms returned []
[2024-05-25 00:20:21] [INFO ] Flow matrix only has 6468 transitions (discarded 600 similar events)
[2024-05-25 00:20:21] [INFO ] Invariant cache hit.
[2024-05-25 00:20:24] [INFO ] State equation strengthened by 2614 read => feed constraints.
[2024-05-25 00:20:54] [INFO ] Performed 1090/3091 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-25 00:21:24] [INFO ] Performed 1801/3091 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-25 00:21:54] [INFO ] Performed 2908/3091 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-25 00:21:59] [INFO ] Implicit Places using invariants and state equation in 97934 ms returned []
Implicit Place search using SMT with State Equation took 102627 ms to find 0 implicit places.
[2024-05-25 00:21:59] [INFO ] Redundant transitions in 472 ms returned []
Running 7043 sub problems to find dead transitions.
[2024-05-25 00:22:00] [INFO ] Flow matrix only has 6468 transitions (discarded 600 similar events)
[2024-05-25 00:22:00] [INFO ] Invariant cache hit.
[2024-05-25 00:22:00] [INFO ] State equation strengthened by 2614 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3089 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7043 unsolved
SMT process timed out in 46754ms, After SMT, problems are : Problem set: 0 solved, 7043 unsolved
Search for dead transitions found 0 dead transitions in 46855ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 150413 ms. Remains : 3091/3091 places, 7068/7068 transitions.
Built C files in :
/tmp/ltsmin10169844248029063776
[2024-05-25 00:22:46] [INFO ] Too many transitions (7068) to apply POR reductions. Disabling POR matrices.
[2024-05-25 00:22:46] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10169844248029063776
Running compilation step : cd /tmp/ltsmin10169844248029063776;'/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/ltsmin10169844248029063776;'/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/ltsmin10169844248029063776;'/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-25 00:22:50] [INFO ] Flatten gal took : 162 ms
[2024-05-25 00:22:50] [INFO ] Flatten gal took : 161 ms
[2024-05-25 00:22:50] [INFO ] Time to serialize gal into /tmp/LTL8662286525045741173.gal : 31 ms
[2024-05-25 00:22:50] [INFO ] Time to serialize properties into /tmp/LTL2281422374030266989.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/LTL8662286525045741173.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15880094629874809757.hoa' '-atoms' '/tmp/LTL2281422374030266989.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/LTL2281422374030266989.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15880094629874809757.hoa
Detected timeout of ITS tools.
[2024-05-25 00:23:05] [INFO ] Flatten gal took : 150 ms
[2024-05-25 00:23:05] [INFO ] Flatten gal took : 159 ms
[2024-05-25 00:23:05] [INFO ] Time to serialize gal into /tmp/LTL17439659043092584746.gal : 30 ms
[2024-05-25 00:23:05] [INFO ] Time to serialize properties into /tmp/LTL14244857426118910486.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/LTL17439659043092584746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14244857426118910486.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("(((Node14IsActive>=1)&&(Node14IsTheNodeMaster>=1))&&(Node22AsksIsThereANodeMaster>=1))"))||(X(G("(((Node0IsActive<1)||(Node0IsT...212
Formula 0 simplified : G!"(((Node14IsActive>=1)&&(Node14IsTheNodeMaster>=1))&&(Node22AsksIsThereANodeMaster>=1))" & XF!"(((Node0IsActive<1)||(Node0IsTheNod...202
Detected timeout of ITS tools.
[2024-05-25 00:23:21] [INFO ] Flatten gal took : 163 ms
[2024-05-25 00:23:21] [INFO ] Applying decomposition
[2024-05-25 00:23:21] [INFO ] Flatten gal took : 181 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/graph2908568745378710147.txt' '-o' '/tmp/graph2908568745378710147.bin' '-w' '/tmp/graph2908568745378710147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2908568745378710147.bin' '-l' '-1' '-v' '-w' '/tmp/graph2908568745378710147.weights' '-q' '0' '-e' '0.001'
[2024-05-25 00:23:21] [INFO ] Decomposing Gal with order
[2024-05-25 00:23:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 00:23:22] [INFO ] Removed a total of 6599 redundant transitions.
[2024-05-25 00:23:23] [INFO ] Flatten gal took : 1107 ms
[2024-05-25 00:23:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 4277 labels/synchronizations in 364 ms.
[2024-05-25 00:23:23] [INFO ] Time to serialize gal into /tmp/LTL16622228073807600333.gal : 137 ms
[2024-05-25 00:23:23] [INFO ] Time to serialize properties into /tmp/LTL8864923074323487445.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16622228073807600333.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8864923074323487445.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("(((i0.u0.Node14IsActive>=1)&&(i0.u0.Node14IsTheNodeMaster>=1))&&(i0.u0.Node22AsksIsThereANodeMaster>=1))"))||(X(G("(((i0.u0.Nod...248
Formula 0 simplified : G!"(((i0.u0.Node14IsActive>=1)&&(i0.u0.Node14IsTheNodeMaster>=1))&&(i0.u0.Node22AsksIsThereANodeMaster>=1))" & XF!"(((i0.u0.Node0IsA...238
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-02 finished in 824156 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(((X(p1)&&p0)||G(F(p2)))))'
Support contains 3 out of 3254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3254/3254 places, 7371/7371 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3239 transition count 7332
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3239 transition count 7332
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 3228 transition count 7285
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 3228 transition count 7285
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 3223 transition count 7250
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 3223 transition count 7250
Applied a total of 62 rules in 1290 ms. Remains 3223 /3254 variables (removed 31) and now considering 7250/7371 (removed 121) transitions.
[2024-05-25 00:23:40] [INFO ] Flow matrix only has 6650 transitions (discarded 600 similar events)
// Phase 1: matrix 6650 rows 3223 cols
[2024-05-25 00:23:40] [INFO ] Computed 77 invariants in 212 ms
[2024-05-25 00:23:45] [INFO ] Implicit Places using invariants in 5079 ms returned [194, 1141, 1457, 1466, 1608, 1679, 1731, 1760, 1865, 1914, 1964, 1965, 2864]
[2024-05-25 00:23:45] [INFO ] Actually due to overlaps returned [1457, 194, 1466, 1608, 1679, 1731, 1760, 1865, 1914, 1964, 1965, 2864]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 5094 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3211/3254 places, 7250/7371 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3200 transition count 7239
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3200 transition count 7239
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 3189 transition count 7228
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 3189 transition count 7228
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 3178 transition count 7217
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 3178 transition count 7217
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 3169 transition count 7154
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 3169 transition count 7154
Applied a total of 84 rules in 1510 ms. Remains 3169 /3211 variables (removed 42) and now considering 7154/7250 (removed 96) transitions.
[2024-05-25 00:23:46] [INFO ] Flow matrix only has 6554 transitions (discarded 600 similar events)
// Phase 1: matrix 6554 rows 3169 cols
[2024-05-25 00:23:47] [INFO ] Computed 65 invariants in 184 ms
[2024-05-25 00:23:51] [INFO ] Implicit Places using invariants in 4641 ms returned [1137]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4646 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3168/3254 places, 7154/7371 transitions.
Applied a total of 0 rules in 282 ms. Remains 3168 /3168 variables (removed 0) and now considering 7154/7154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12824 ms. Remains : 3168/3254 places, 7154/7371 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-03
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-03 finished in 13053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 3254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3254/3254 places, 7371/7371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 3254 transition count 7345
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 3228 transition count 7345
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 52 place count 3228 transition count 7325
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 92 place count 3208 transition count 7325
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 101 place count 3199 transition count 7292
Iterating global reduction 2 with 9 rules applied. Total rules applied 110 place count 3199 transition count 7292
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 110 place count 3199 transition count 7290
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 3197 transition count 7290
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 3192 transition count 7255
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 3192 transition count 7255
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 4 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 196 place count 3156 transition count 7219
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 202 place count 3150 transition count 7213
Iterating global reduction 2 with 6 rules applied. Total rules applied 208 place count 3150 transition count 7213
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 214 place count 3144 transition count 7171
Iterating global reduction 2 with 6 rules applied. Total rules applied 220 place count 3144 transition count 7171
Applied a total of 220 rules in 2236 ms. Remains 3144 /3254 variables (removed 110) and now considering 7171/7371 (removed 200) transitions.
[2024-05-25 00:23:54] [INFO ] Flow matrix only has 6571 transitions (discarded 600 similar events)
// Phase 1: matrix 6571 rows 3144 cols
[2024-05-25 00:23:54] [INFO ] Computed 77 invariants in 225 ms
[2024-05-25 00:23:59] [INFO ] Implicit Places using invariants in 4881 ms returned [186, 1107, 1420, 1568, 1635, 1636, 1682, 1711, 1812, 1861, 1908, 1909, 2801]
[2024-05-25 00:23:59] [INFO ] Actually due to overlaps returned [1420, 186, 1568, 1635, 1636, 1682, 1711, 1812, 1861, 1908, 1909, 2801]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 4890 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3132/3254 places, 7171/7371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3126 transition count 7165
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3126 transition count 7165
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 3120 transition count 7159
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 3120 transition count 7159
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 3117 transition count 7138
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 3117 transition count 7138
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 3112 transition count 7133
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 3107 transition count 7128
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 3107 transition count 7128
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 3101 transition count 7086
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 3101 transition count 7086
Applied a total of 62 rules in 2657 ms. Remains 3101 /3132 variables (removed 31) and now considering 7086/7171 (removed 85) transitions.
[2024-05-25 00:24:01] [INFO ] Flow matrix only has 6486 transitions (discarded 600 similar events)
// Phase 1: matrix 6486 rows 3101 cols
[2024-05-25 00:24:02] [INFO ] Computed 65 invariants in 192 ms
[2024-05-25 00:24:06] [INFO ] Implicit Places using invariants in 4814 ms returned [1104]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4819 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3100/3254 places, 7086/7371 transitions.
Applied a total of 0 rules in 423 ms. Remains 3100 /3100 variables (removed 0) and now considering 7086/7086 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 15030 ms. Remains : 3100/3254 places, 7086/7371 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-04
Product exploration explored 100000 steps with 1974 reset in 1073 ms.
Product exploration explored 100000 steps with 1972 reset in 1126 ms.
Computed a total of 501 stabilizing places and 1910 stable transitions
Computed a total of 501 stabilizing places and 1910 stable transitions
Detected a total of 501/3100 stabilizing places and 1910/7086 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 40000 steps (788 resets) in 741 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (112 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 29193 steps, run timeout after 3001 ms. (steps per millisecond=9 ) properties seen :0 out of 1
Probabilistic random walk after 29193 steps, saw 12478 distinct states, run finished after 3003 ms. (steps per millisecond=9 ) properties seen :0
[2024-05-25 00:24:12] [INFO ] Flow matrix only has 6486 transitions (discarded 600 similar events)
// Phase 1: matrix 6486 rows 3100 cols
[2024-05-25 00:24:13] [INFO ] Computed 64 invariants in 174 ms
[2024-05-25 00:24:13] [INFO ] State equation strengthened by 2626 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2949/2951 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2951 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/2976 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2976 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 66/3042 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 00:24:15] [INFO ] Deduced a trap composed of 108 places in 2062 ms of which 19 ms to minimize.
[2024-05-25 00:24:17] [INFO ] Deduced a trap composed of 115 places in 2095 ms of which 19 ms to minimize.
[2024-05-25 00:24:19] [INFO ] Deduced a trap composed of 109 places in 2080 ms of which 19 ms to minimize.
SMT process timed out in 7082ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 3100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3100/3100 places, 7086/7086 transitions.
Free-agglomeration rule (complex) applied 293 times.
Iterating global reduction 0 with 293 rules applied. Total rules applied 293 place count 3100 transition count 10369
Reduce places removed 293 places and 0 transitions.
Iterating post reduction 0 with 293 rules applied. Total rules applied 586 place count 2807 transition count 10369
Applied a total of 586 rules in 1277 ms. Remains 2807 /3100 variables (removed 293) and now considering 10369/7086 (removed -3283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1277 ms. Remains : 2807/3100 places, 10369/7086 transitions.
RANDOM walk for 40000 steps (968 resets) in 3059 ms. (13 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (85 resets) in 299 ms. (133 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 26801 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 1
Probabilistic random walk after 26801 steps, saw 11426 distinct states, run finished after 3003 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-25 00:24:25] [INFO ] Flow matrix only has 9483 transitions (discarded 886 similar events)
// Phase 1: matrix 9483 rows 2807 cols
[2024-05-25 00:24:25] [INFO ] Computed 64 invariants in 146 ms
[2024-05-25 00:24:25] [INFO ] State equation strengthened by 6202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2642/2724 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2724 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 69/2793 variables, 45/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2793 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/2807 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2807 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9483/12290 variables, 2807/2871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12290 variables, 6202/9073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12290 variables, 0/9073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/12290 variables, 0/9073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12290/12290 variables, and 9073 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4511 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 2807/2807 constraints, ReadFeed: 6202/6202 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2642/2724 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 00:24:32] [INFO ] Deduced a trap composed of 104 places in 2239 ms of which 20 ms to minimize.
[2024-05-25 00:24:34] [INFO ] Deduced a trap composed of 85 places in 2143 ms of which 19 ms to minimize.
[2024-05-25 00:24:36] [INFO ] Deduced a trap composed of 95 places in 2133 ms of which 19 ms to minimize.
[2024-05-25 00:24:39] [INFO ] Deduced a trap composed of 99 places in 2267 ms of which 18 ms to minimize.
[2024-05-25 00:24:41] [INFO ] Deduced a trap composed of 109 places in 2125 ms of which 19 ms to minimize.
[2024-05-25 00:24:43] [INFO ] Deduced a trap composed of 119 places in 2233 ms of which 18 ms to minimize.
[2024-05-25 00:24:45] [INFO ] Deduced a trap composed of 101 places in 2060 ms of which 18 ms to minimize.
[2024-05-25 00:24:47] [INFO ] Deduced a trap composed of 108 places in 2101 ms of which 18 ms to minimize.
[2024-05-25 00:24:49] [INFO ] Deduced a trap composed of 96 places in 2064 ms of which 18 ms to minimize.
[2024-05-25 00:24:51] [INFO ] Deduced a trap composed of 91 places in 1893 ms of which 18 ms to minimize.
[2024-05-25 00:24:54] [INFO ] Deduced a trap composed of 95 places in 2103 ms of which 16 ms to minimize.
[2024-05-25 00:24:56] [INFO ] Deduced a trap composed of 101 places in 2294 ms of which 20 ms to minimize.
[2024-05-25 00:24:58] [INFO ] Deduced a trap composed of 86 places in 2081 ms of which 18 ms to minimize.
[2024-05-25 00:25:00] [INFO ] Deduced a trap composed of 165 places in 2057 ms of which 20 ms to minimize.
[2024-05-25 00:25:02] [INFO ] Deduced a trap composed of 97 places in 2089 ms of which 19 ms to minimize.
[2024-05-25 00:25:04] [INFO ] Deduced a trap composed of 93 places in 2077 ms of which 17 ms to minimize.
[2024-05-25 00:25:06] [INFO ] Deduced a trap composed of 99 places in 1980 ms of which 18 ms to minimize.
[2024-05-25 00:25:09] [INFO ] Deduced a trap composed of 106 places in 2035 ms of which 19 ms to minimize.
[2024-05-25 00:25:11] [INFO ] Deduced a trap composed of 102 places in 2083 ms of which 18 ms to minimize.
[2024-05-25 00:25:13] [INFO ] Deduced a trap composed of 91 places in 2073 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2724 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 00:25:15] [INFO ] Deduced a trap composed of 92 places in 1951 ms of which 18 ms to minimize.
SMT process timed out in 50185ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 2807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2807/2807 places, 10369/10369 transitions.
Applied a total of 0 rules in 517 ms. Remains 2807 /2807 variables (removed 0) and now considering 10369/10369 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 520 ms. Remains : 2807/2807 places, 10369/10369 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2807/2807 places, 10369/10369 transitions.
Applied a total of 0 rules in 530 ms. Remains 2807 /2807 variables (removed 0) and now considering 10369/10369 (removed 0) transitions.
[2024-05-25 00:25:16] [INFO ] Flow matrix only has 9483 transitions (discarded 886 similar events)
[2024-05-25 00:25:16] [INFO ] Invariant cache hit.
[2024-05-25 00:25:21] [INFO ] Implicit Places using invariants in 5387 ms returned []
Implicit Place search using SMT only with invariants took 5407 ms to find 0 implicit places.
Running 10275 sub problems to find dead transitions.
[2024-05-25 00:25:21] [INFO ] Flow matrix only has 9483 transitions (discarded 886 similar events)
[2024-05-25 00:25:21] [INFO ] Invariant cache hit.
[2024-05-25 00:25:21] [INFO ] State equation strengthened by 6202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2805 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 10275 unsolved
SMT process timed out in 102578ms, After SMT, problems are : Problem set: 0 solved, 10275 unsolved
Search for dead transitions found 0 dead transitions in 102667ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108619 ms. Remains : 2807/2807 places, 10369/10369 transitions.
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 206 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 3100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3100/3100 places, 7086/7086 transitions.
Applied a total of 0 rules in 448 ms. Remains 3100 /3100 variables (removed 0) and now considering 7086/7086 (removed 0) transitions.
[2024-05-25 00:27:05] [INFO ] Flow matrix only has 6486 transitions (discarded 600 similar events)
// Phase 1: matrix 6486 rows 3100 cols
[2024-05-25 00:27:05] [INFO ] Computed 64 invariants in 150 ms
[2024-05-25 00:27:09] [INFO ] Implicit Places using invariants in 4685 ms returned []
[2024-05-25 00:27:09] [INFO ] Flow matrix only has 6486 transitions (discarded 600 similar events)
[2024-05-25 00:27:09] [INFO ] Invariant cache hit.
[2024-05-25 00:27:12] [INFO ] State equation strengthened by 2626 read => feed constraints.
[2024-05-25 00:27:42] [INFO ] Performed 1205/3100 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-25 00:28:12] [INFO ] Performed 1957/3100 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-25 00:28:41] [INFO ] Implicit Places using invariants and state equation in 91422 ms returned [3092]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 96133 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3099/3100 places, 7086/7086 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 3099 transition count 7085
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3098 transition count 7085
Applied a total of 2 rules in 460 ms. Remains 3098 /3099 variables (removed 1) and now considering 7085/7086 (removed 1) transitions.
[2024-05-25 00:28:41] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
// Phase 1: matrix 6485 rows 3098 cols
[2024-05-25 00:28:41] [INFO ] Computed 63 invariants in 149 ms
[2024-05-25 00:28:46] [INFO ] Implicit Places using invariants in 4755 ms returned []
[2024-05-25 00:28:46] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
[2024-05-25 00:28:46] [INFO ] Invariant cache hit.
[2024-05-25 00:28:48] [INFO ] State equation strengthened by 2626 read => feed constraints.
[2024-05-25 00:29:19] [INFO ] Performed 1016/3098 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-25 00:29:50] [INFO ] Performed 1787/3098 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2024-05-25 00:30:20] [INFO ] Performed 2934/3098 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2024-05-25 00:30:24] [INFO ] Implicit Places using invariants and state equation in 98129 ms returned []
Implicit Place search using SMT with State Equation took 102904 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3098/3100 places, 7085/7086 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 199945 ms. Remains : 3098/3100 places, 7085/7086 transitions.
Computed a total of 499 stabilizing places and 1909 stable transitions
Computed a total of 499 stabilizing places and 1909 stable transitions
Detected a total of 499/3098 stabilizing places and 1909/7085 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 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 34712 steps (683 resets) in 642 ms. (53 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1973 reset in 1040 ms.
Product exploration explored 100000 steps with 1974 reset in 1036 ms.
Built C files in :
/tmp/ltsmin4001613288576867654
[2024-05-25 00:30:27] [INFO ] Too many transitions (7085) to apply POR reductions. Disabling POR matrices.
[2024-05-25 00:30:27] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4001613288576867654
Running compilation step : cd /tmp/ltsmin4001613288576867654;'/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/ltsmin4001613288576867654;'/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/ltsmin4001613288576867654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 3098 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3098/3098 places, 7085/7085 transitions.
Applied a total of 0 rules in 444 ms. Remains 3098 /3098 variables (removed 0) and now considering 7085/7085 (removed 0) transitions.
[2024-05-25 00:30:30] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
[2024-05-25 00:30:30] [INFO ] Invariant cache hit.
[2024-05-25 00:30:35] [INFO ] Implicit Places using invariants in 4565 ms returned []
[2024-05-25 00:30:35] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
[2024-05-25 00:30:35] [INFO ] Invariant cache hit.
[2024-05-25 00:30:37] [INFO ] State equation strengthened by 2626 read => feed constraints.
[2024-05-25 00:31:07] [INFO ] Performed 970/3098 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-25 00:31:37] [INFO ] Performed 1752/3098 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-25 00:32:07] [INFO ] Performed 2750/3098 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-25 00:32:17] [INFO ] Implicit Places using invariants and state equation in 101736 ms returned []
Implicit Place search using SMT with State Equation took 106305 ms to find 0 implicit places.
[2024-05-25 00:32:17] [INFO ] Redundant transitions in 722 ms returned []
Running 7060 sub problems to find dead transitions.
[2024-05-25 00:32:18] [INFO ] Flow matrix only has 6485 transitions (discarded 600 similar events)
[2024-05-25 00:32:18] [INFO ] Invariant cache hit.
[2024-05-25 00:32:18] [INFO ] State equation strengthened by 2626 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3096 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7060 unsolved
SMT process timed out in 46267ms, After SMT, problems are : Problem set: 0 solved, 7060 unsolved
Search for dead transitions found 0 dead transitions in 46327ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 153821 ms. Remains : 3098/3098 places, 7085/7085 transitions.
Built C files in :
/tmp/ltsmin2591844286969735858
[2024-05-25 00:33:04] [INFO ] Too many transitions (7085) to apply POR reductions. Disabling POR matrices.
[2024-05-25 00:33:04] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2591844286969735858
Running compilation step : cd /tmp/ltsmin2591844286969735858;'/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/ltsmin2591844286969735858;'/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/ltsmin2591844286969735858;'/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-25 00:33:07] [INFO ] Flatten gal took : 163 ms
[2024-05-25 00:33:07] [INFO ] Flatten gal took : 175 ms
[2024-05-25 00:33:07] [INFO ] Time to serialize gal into /tmp/LTL10371532130495918386.gal : 33 ms
[2024-05-25 00:33:07] [INFO ] Time to serialize properties into /tmp/LTL7343749761935124135.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/LTL10371532130495918386.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17433561187388392549.hoa' '-atoms' '/tmp/LTL7343749761935124135.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/LTL7343749761935124135.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17433561187388392549.hoa
Detected timeout of ITS tools.
[2024-05-25 00:33:23] [INFO ] Flatten gal took : 144 ms
[2024-05-25 00:33:23] [INFO ] Flatten gal took : 160 ms
[2024-05-25 00:33:23] [INFO ] Time to serialize gal into /tmp/LTL14785376373192417873.gal : 29 ms
[2024-05-25 00:33:23] [INFO ] Time to serialize properties into /tmp/LTL8480360517413901712.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/LTL14785376373192417873.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8480360517413901712.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((Node9HasAskedItsLeafSetToLx4ToReplaceNode8<1)||(LeafSetOfLx4IsSentToNode9<1))"))))
Formula 0 simplified : GF!"((Node9HasAskedItsLeafSetToLx4ToReplaceNode8<1)||(LeafSetOfLx4IsSentToNode9<1))"
Detected timeout of ITS tools.
[2024-05-25 00:33:38] [INFO ] Flatten gal took : 146 ms
[2024-05-25 00:33:38] [INFO ] Applying decomposition
[2024-05-25 00:33:38] [INFO ] Flatten gal took : 146 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/graph9585722708103756059.txt' '-o' '/tmp/graph9585722708103756059.bin' '-w' '/tmp/graph9585722708103756059.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9585722708103756059.bin' '-l' '-1' '-v' '-w' '/tmp/graph9585722708103756059.weights' '-q' '0' '-e' '0.001'
[2024-05-25 00:33:39] [INFO ] Decomposing Gal with order
[2024-05-25 00:33:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 00:33:39] [INFO ] Removed a total of 6650 redundant transitions.
[2024-05-25 00:33:40] [INFO ] Flatten gal took : 742 ms
[2024-05-25 00:33:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 3875 labels/synchronizations in 277 ms.
[2024-05-25 00:33:40] [INFO ] Time to serialize gal into /tmp/LTL11529259839216638813.gal : 42 ms
[2024-05-25 00:33:40] [INFO ] Time to serialize properties into /tmp/LTL14906678088576291346.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/LTL11529259839216638813.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14906678088576291346.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i30.u166.Node9HasAskedItsLeafSetToLx4ToReplaceNode8<1)||(i30.u166.LeafSetOfLx4IsSentToNode9<1))"))))
Formula 0 simplified : GF!"((i30.u166.Node9HasAskedItsLeafSetToLx4ToReplaceNode8<1)||(i30.u166.LeafSetOfLx4IsSentToNode9<1))"
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-04 finished in 603430 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)||G(p1))))'
Support contains 4 out of 3254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3254/3254 places, 7371/7371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 3254 transition count 7345
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 3228 transition count 7345
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 52 place count 3228 transition count 7325
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 92 place count 3208 transition count 7325
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 3200 transition count 7299
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 3200 transition count 7299
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 108 place count 3200 transition count 7296
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 3197 transition count 7296
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 3192 transition count 7261
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 3192 transition count 7261
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 5 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 194 place count 3157 transition count 7226
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 200 place count 3151 transition count 7220
Iterating global reduction 2 with 6 rules applied. Total rules applied 206 place count 3151 transition count 7220
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 212 place count 3145 transition count 7178
Iterating global reduction 2 with 6 rules applied. Total rules applied 218 place count 3145 transition count 7178
Applied a total of 218 rules in 2330 ms. Remains 3145 /3254 variables (removed 109) and now considering 7178/7371 (removed 193) transitions.
[2024-05-25 00:33:57] [INFO ] Flow matrix only has 6578 transitions (discarded 600 similar events)
// Phase 1: matrix 6578 rows 3145 cols
[2024-05-25 00:33:58] [INFO ] Computed 77 invariants in 212 ms
[2024-05-25 00:34:02] [INFO ] Implicit Places using invariants in 4848 ms returned [185, 1106, 1419, 1427, 1564, 1631, 1632, 1678, 1707, 1859, 1907, 1908, 2801]
[2024-05-25 00:34:02] [INFO ] Actually due to overlaps returned [1419, 185, 1427, 1564, 1631, 1632, 1678, 1707, 1859, 1907, 1908, 2801]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 4864 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3133/3254 places, 7178/7371 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3127 transition count 7172
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3127 transition count 7172
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 3121 transition count 7166
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 3121 transition count 7166
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 3117 transition count 7138
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 3117 transition count 7138
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 3112 transition count 7133
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 3107 transition count 7128
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 3107 transition count 7128
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 3102 transition count 7093
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 3102 transition count 7093
Applied a total of 62 rules in 2520 ms. Remains 3102 /3133 variables (removed 31) and now considering 7093/7178 (removed 85) transitions.
[2024-05-25 00:34:05] [INFO ] Flow matrix only has 6493 transitions (discarded 600 similar events)
// Phase 1: matrix 6493 rows 3102 cols
[2024-05-25 00:34:05] [INFO ] Computed 65 invariants in 194 ms
[2024-05-25 00:34:09] [INFO ] Implicit Places using invariants in 4728 ms returned [1103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4735 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3101/3254 places, 7093/7371 transitions.
Applied a total of 0 rules in 461 ms. Remains 3101 /3101 variables (removed 0) and now considering 7093/7093 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 14911 ms. Remains : 3101/3254 places, 7093/7371 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-05
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-05 finished in 15012 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)||G(p1))))'
Support contains 3 out of 3254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3254/3254 places, 7371/7371 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 3254 transition count 7346
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 3229 transition count 7346
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 50 place count 3229 transition count 7325
Deduced a syphon composed of 21 places in 5 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 92 place count 3208 transition count 7325
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 102 place count 3198 transition count 7291
Iterating global reduction 2 with 10 rules applied. Total rules applied 112 place count 3198 transition count 7291
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 112 place count 3198 transition count 7288
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 3195 transition count 7288
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 124 place count 3189 transition count 7246
Iterating global reduction 2 with 6 rules applied. Total rules applied 130 place count 3189 transition count 7246
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 5 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 200 place count 3154 transition count 7211
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 205 place count 3149 transition count 7206
Iterating global reduction 2 with 5 rules applied. Total rules applied 210 place count 3149 transition count 7206
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 215 place count 3144 transition count 7171
Iterating global reduction 2 with 5 rules applied. Total rules applied 220 place count 3144 transition count 7171
Applied a total of 220 rules in 2277 ms. Remains 3144 /3254 variables (removed 110) and now considering 7171/7371 (removed 200) transitions.
[2024-05-25 00:34:12] [INFO ] Flow matrix only has 6571 transitions (discarded 600 similar events)
// Phase 1: matrix 6571 rows 3144 cols
[2024-05-25 00:34:13] [INFO ] Computed 77 invariants in 224 ms
[2024-05-25 00:34:17] [INFO ] Implicit Places using invariants in 5051 ms returned [185, 1106, 1419, 1427, 1564, 1631, 1632, 1678, 1707, 1808, 1907, 1908, 2800]
[2024-05-25 00:34:17] [INFO ] Actually due to overlaps returned [1419, 185, 1427, 1564, 1631, 1632, 1678, 1707, 1808, 1907, 1908, 2800]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 5057 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3132/3254 places, 7171/7371 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3125 transition count 7164
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3125 transition count 7164
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 3118 transition count 7157
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 3118 transition count 7157
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 3114 transition count 7129
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 3114 transition count 7129
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 3110 transition count 7125
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 3106 transition count 7121
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 3106 transition count 7121
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 3101 transition count 7086
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 3101 transition count 7086
Applied a total of 62 rules in 2504 ms. Remains 3101 /3132 variables (removed 31) and now considering 7086/7171 (removed 85) transitions.
[2024-05-25 00:34:20] [INFO ] Flow matrix only has 6486 transitions (discarded 600 similar events)
// Phase 1: matrix 6486 rows 3101 cols
[2024-05-25 00:34:20] [INFO ] Computed 65 invariants in 168 ms
[2024-05-25 00:34:25] [INFO ] Implicit Places using invariants in 4758 ms returned [1103]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4763 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3100/3254 places, 7086/7371 transitions.
Applied a total of 0 rules in 461 ms. Remains 3100 /3100 variables (removed 0) and now considering 7086/7086 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 15065 ms. Remains : 3100/3254 places, 7086/7371 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-09
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-09 finished in 15149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||G(p1)))'
Support contains 4 out of 3254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3254/3254 places, 7371/7371 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 3240 transition count 7333
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 3240 transition count 7333
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 3230 transition count 7299
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 3230 transition count 7299
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 3224 transition count 7257
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 3224 transition count 7257
Applied a total of 60 rules in 1220 ms. Remains 3224 /3254 variables (removed 30) and now considering 7257/7371 (removed 114) transitions.
[2024-05-25 00:34:26] [INFO ] Flow matrix only has 6657 transitions (discarded 600 similar events)
// Phase 1: matrix 6657 rows 3224 cols
[2024-05-25 00:34:27] [INFO ] Computed 77 invariants in 212 ms
[2024-05-25 00:34:31] [INFO ] Implicit Places using invariants in 5065 ms returned [1143, 1459, 1468, 1610, 1680, 1732, 1761, 1866, 1915, 1965, 1966, 2865]
[2024-05-25 00:34:31] [INFO ] Actually due to overlaps returned [1459, 1468, 1610, 1680, 1732, 1761, 1866, 1915, 1965, 1966, 2865]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 5072 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3213/3254 places, 7257/7371 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 3203 transition count 7247
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 3203 transition count 7247
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 3193 transition count 7237
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 3193 transition count 7237
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 3183 transition count 7227
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 3183 transition count 7227
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 3175 transition count 7171
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 3175 transition count 7171
Applied a total of 76 rules in 1512 ms. Remains 3175 /3213 variables (removed 38) and now considering 7171/7257 (removed 86) transitions.
[2024-05-25 00:34:33] [INFO ] Flow matrix only has 6571 transitions (discarded 600 similar events)
// Phase 1: matrix 6571 rows 3175 cols
[2024-05-25 00:34:33] [INFO ] Computed 66 invariants in 161 ms
[2024-05-25 00:34:38] [INFO ] Implicit Places using invariants in 4932 ms returned [1143]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4937 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3174/3254 places, 7171/7371 transitions.
Applied a total of 0 rules in 293 ms. Remains 3174 /3174 variables (removed 0) and now considering 7171/7171 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 13034 ms. Remains : 3174/3254 places, 7171/7371 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-10
Product exploration explored 100000 steps with 1390 reset in 834 ms.
Product exploration explored 100000 steps with 1391 reset in 870 ms.
Computed a total of 550 stabilizing places and 1970 stable transitions
Computed a total of 550 stabilizing places and 1970 stable transitions
Detected a total of 550/3174 stabilizing places and 1970/7171 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 177 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (552 resets) in 1541 ms. (25 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (104 resets) in 390 ms. (102 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (104 resets) in 309 ms. (129 steps per ms) remains 2/2 properties
[2024-05-25 00:34:41] [INFO ] Flow matrix only has 6571 transitions (discarded 600 similar events)
// Phase 1: matrix 6571 rows 3174 cols
[2024-05-25 00:34:41] [INFO ] Computed 65 invariants in 131 ms
[2024-05-25 00:34:41] [INFO ] State equation strengthened by 2638 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 133/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2929/3066 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3066 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 94/3160 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3160 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 14/3174 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3174 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6571/9745 variables, 3174/3239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9745/9745 variables, and 5877 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3823 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 3174/3174 constraints, ReadFeed: 2638/2638 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 133/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2929/3066 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 00:34:48] [INFO ] Deduced a trap composed of 146 places in 1972 ms of which 19 ms to minimize.
[2024-05-25 00:34:50] [INFO ] Deduced a trap composed of 201 places in 2019 ms of which 20 ms to minimize.
[2024-05-25 00:34:52] [INFO ] Deduced a trap composed of 248 places in 2055 ms of which 20 ms to minimize.
SMT process timed out in 10563ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 3174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3174/3174 places, 7171/7171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 3174 transition count 7145
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 3148 transition count 7145
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 52 place count 3148 transition count 7131
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 3134 transition count 7131
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 4 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 134 place count 3107 transition count 7104
Free-agglomeration rule (complex) applied 295 times.
Iterating global reduction 2 with 295 rules applied. Total rules applied 429 place count 3107 transition count 10373
Reduce places removed 295 places and 0 transitions.
Iterating post reduction 2 with 295 rules applied. Total rules applied 724 place count 2812 transition count 10373
Applied a total of 724 rules in 1545 ms. Remains 2812 /3174 variables (removed 362) and now considering 10373/7171 (removed -3202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1547 ms. Remains : 2812/3174 places, 10373/7171 transitions.
RANDOM walk for 40000 steps (968 resets) in 4448 ms. (8 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (85 resets) in 334 ms. (119 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (85 resets) in 428 ms. (93 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 24743 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 24743 steps, saw 10587 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-25 00:34:58] [INFO ] Flow matrix only has 9487 transitions (discarded 886 similar events)
// Phase 1: matrix 9487 rows 2812 cols
[2024-05-25 00:34:58] [INFO ] Computed 65 invariants in 147 ms
[2024-05-25 00:34:58] [INFO ] State equation strengthened by 6202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2643/2729 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2729 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 69/2798 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2798 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 14/2812 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2812 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9487/12299 variables, 2812/2877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12299 variables, 6202/9079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12299 variables, 0/9079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/12299 variables, 0/9079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12299/12299 variables, and 9079 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 2812/2812 constraints, ReadFeed: 6202/6202 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2643/2729 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 00:35:05] [INFO ] Deduced a trap composed of 93 places in 2164 ms of which 17 ms to minimize.
[2024-05-25 00:35:08] [INFO ] Deduced a trap composed of 93 places in 2147 ms of which 17 ms to minimize.
[2024-05-25 00:35:10] [INFO ] Deduced a trap composed of 100 places in 2120 ms of which 18 ms to minimize.
[2024-05-25 00:35:12] [INFO ] Deduced a trap composed of 92 places in 2139 ms of which 18 ms to minimize.
[2024-05-25 00:35:14] [INFO ] Deduced a trap composed of 99 places in 2137 ms of which 17 ms to minimize.
[2024-05-25 00:35:16] [INFO ] Deduced a trap composed of 101 places in 1936 ms of which 17 ms to minimize.
[2024-05-25 00:35:18] [INFO ] Deduced a trap composed of 94 places in 2129 ms of which 17 ms to minimize.
[2024-05-25 00:35:21] [INFO ] Deduced a trap composed of 101 places in 2136 ms of which 16 ms to minimize.
[2024-05-25 00:35:23] [INFO ] Deduced a trap composed of 90 places in 2042 ms of which 17 ms to minimize.
[2024-05-25 00:35:25] [INFO ] Deduced a trap composed of 105 places in 2137 ms of which 17 ms to minimize.
[2024-05-25 00:35:27] [INFO ] Deduced a trap composed of 108 places in 2281 ms of which 18 ms to minimize.
[2024-05-25 00:35:29] [INFO ] Deduced a trap composed of 112 places in 2097 ms of which 17 ms to minimize.
[2024-05-25 00:35:31] [INFO ] Deduced a trap composed of 107 places in 2157 ms of which 18 ms to minimize.
[2024-05-25 00:35:34] [INFO ] Deduced a trap composed of 104 places in 2262 ms of which 19 ms to minimize.
[2024-05-25 00:35:36] [INFO ] Deduced a trap composed of 99 places in 2165 ms of which 18 ms to minimize.
[2024-05-25 00:35:38] [INFO ] Deduced a trap composed of 91 places in 2152 ms of which 18 ms to minimize.
[2024-05-25 00:35:40] [INFO ] Deduced a trap composed of 95 places in 2120 ms of which 18 ms to minimize.
[2024-05-25 00:35:43] [INFO ] Deduced a trap composed of 98 places in 2221 ms of which 18 ms to minimize.
[2024-05-25 00:35:45] [INFO ] Deduced a trap composed of 106 places in 2182 ms of which 18 ms to minimize.
[2024-05-25 00:35:47] [INFO ] Deduced a trap composed of 194 places in 2041 ms of which 18 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2729 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 00:35:49] [INFO ] Deduced a trap composed of 94 places in 2062 ms of which 19 ms to minimize.
SMT process timed out in 51454ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2812 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2812/2812 places, 10373/10373 transitions.
Applied a total of 0 rules in 535 ms. Remains 2812 /2812 variables (removed 0) and now considering 10373/10373 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 536 ms. Remains : 2812/2812 places, 10373/10373 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2812/2812 places, 10373/10373 transitions.
Applied a total of 0 rules in 559 ms. Remains 2812 /2812 variables (removed 0) and now considering 10373/10373 (removed 0) transitions.
[2024-05-25 00:35:50] [INFO ] Flow matrix only has 9487 transitions (discarded 886 similar events)
[2024-05-25 00:35:50] [INFO ] Invariant cache hit.
[2024-05-25 00:35:56] [INFO ] Implicit Places using invariants in 5666 ms returned []
Implicit Place search using SMT only with invariants took 5670 ms to find 0 implicit places.
Running 10279 sub problems to find dead transitions.
[2024-05-25 00:35:56] [INFO ] Flow matrix only has 9487 transitions (discarded 886 similar events)
[2024-05-25 00:35:56] [INFO ] Invariant cache hit.
[2024-05-25 00:35:56] [INFO ] State equation strengthened by 6202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2810 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 10279 unsolved
SMT process timed out in 109392ms, After SMT, problems are : Problem set: 0 solved, 10279 unsolved
Search for dead transitions found 0 dead transitions in 109514ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115765 ms. Remains : 2812/2812 places, 10373/10373 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 8 factoid took 275 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 3174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3174/3174 places, 7171/7171 transitions.
Applied a total of 0 rules in 272 ms. Remains 3174 /3174 variables (removed 0) and now considering 7171/7171 (removed 0) transitions.
[2024-05-25 00:37:46] [INFO ] Flow matrix only has 6571 transitions (discarded 600 similar events)
// Phase 1: matrix 6571 rows 3174 cols
[2024-05-25 00:37:47] [INFO ] Computed 65 invariants in 138 ms
[2024-05-25 00:37:51] [INFO ] Implicit Places using invariants in 4755 ms returned []
[2024-05-25 00:37:51] [INFO ] Flow matrix only has 6571 transitions (discarded 600 similar events)
[2024-05-25 00:37:51] [INFO ] Invariant cache hit.
[2024-05-25 00:37:55] [INFO ] State equation strengthened by 2638 read => feed constraints.
[2024-05-25 00:38:25] [INFO ] Performed 950/3174 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-25 00:38:55] [INFO ] Performed 1505/3174 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-25 00:39:25] [INFO ] Performed 2024/3174 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-25 00:39:55] [INFO ] Performed 3122/3174 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-25 00:39:55] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-25 00:39:55] [INFO ] Implicit Places using invariants and state equation in 123792 ms returned []
Implicit Place search using SMT with State Equation took 128550 ms to find 0 implicit places.
Running 7146 sub problems to find dead transitions.
[2024-05-25 00:39:55] [INFO ] Flow matrix only has 6571 transitions (discarded 600 similar events)
[2024-05-25 00:39:55] [INFO ] Invariant cache hit.
[2024-05-25 00:39:55] [INFO ] State equation strengthened by 2638 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3172 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7146 unsolved
SMT process timed out in 43156ms, After SMT, problems are : Problem set: 0 solved, 7146 unsolved
Search for dead transitions found 0 dead transitions in 43226ms
Finished structural reductions in LTL mode , in 1 iterations and 172057 ms. Remains : 3174/3174 places, 7171/7171 transitions.
Computed a total of 550 stabilizing places and 1970 stable transitions
Computed a total of 550 stabilizing places and 1970 stable transitions
Detected a total of 550/3174 stabilizing places and 1970/7171 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 159 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (553 resets) in 1956 ms. (20 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (104 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (104 resets) in 255 ms. (156 steps per ms) remains 2/2 properties
[2024-05-25 00:40:39] [INFO ] Flow matrix only has 6571 transitions (discarded 600 similar events)
[2024-05-25 00:40:39] [INFO ] Invariant cache hit.
[2024-05-25 00:40:39] [INFO ] State equation strengthened by 2638 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 133/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2929/3066 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3066 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 94/3160 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3160 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 14/3174 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3174 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6571/9745 variables, 3174/3239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9745/9745 variables, and 5877 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4251 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 3174/3174 constraints, ReadFeed: 2638/2638 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 133/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2929/3066 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 00:40:46] [INFO ] Deduced a trap composed of 119 places in 2106 ms of which 21 ms to minimize.
[2024-05-25 00:40:48] [INFO ] Deduced a trap composed of 125 places in 2104 ms of which 22 ms to minimize.
[2024-05-25 00:40:50] [INFO ] Deduced a trap composed of 124 places in 2181 ms of which 21 ms to minimize.
SMT process timed out in 11209ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 3174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3174/3174 places, 7171/7171 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 3174 transition count 7145
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 3148 transition count 7145
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 52 place count 3148 transition count 7131
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 3134 transition count 7131
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 3 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 134 place count 3107 transition count 7104
Free-agglomeration rule (complex) applied 295 times.
Iterating global reduction 2 with 295 rules applied. Total rules applied 429 place count 3107 transition count 10373
Reduce places removed 295 places and 0 transitions.
Iterating post reduction 2 with 295 rules applied. Total rules applied 724 place count 2812 transition count 10373
Applied a total of 724 rules in 1607 ms. Remains 2812 /3174 variables (removed 362) and now considering 10373/7171 (removed -3202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1607 ms. Remains : 2812/3174 places, 10373/7171 transitions.
RANDOM walk for 40000 steps (967 resets) in 2060 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (88 resets) in 285 ms. (139 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (85 resets) in 234 ms. (170 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 25402 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 2
Probabilistic random walk after 25402 steps, saw 10864 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-25 00:40:56] [INFO ] Flow matrix only has 9487 transitions (discarded 886 similar events)
// Phase 1: matrix 9487 rows 2812 cols
[2024-05-25 00:40:56] [INFO ] Computed 65 invariants in 155 ms
[2024-05-25 00:40:56] [INFO ] State equation strengthened by 6202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2643/2729 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2729 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 69/2798 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2798 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 14/2812 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2812 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9487/12299 variables, 2812/2877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12299 variables, 6202/9079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12299 variables, 0/9079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/12299 variables, 0/9079 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12299/12299 variables, and 9079 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5500 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 2812/2812 constraints, ReadFeed: 6202/6202 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 82/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2643/2729 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 00:41:04] [INFO ] Deduced a trap composed of 93 places in 2222 ms of which 20 ms to minimize.
[2024-05-25 00:41:06] [INFO ] Deduced a trap composed of 93 places in 2227 ms of which 19 ms to minimize.
[2024-05-25 00:41:09] [INFO ] Deduced a trap composed of 100 places in 2113 ms of which 19 ms to minimize.
[2024-05-25 00:41:11] [INFO ] Deduced a trap composed of 92 places in 2272 ms of which 19 ms to minimize.
[2024-05-25 00:41:13] [INFO ] Deduced a trap composed of 99 places in 2089 ms of which 18 ms to minimize.
[2024-05-25 00:41:15] [INFO ] Deduced a trap composed of 101 places in 2113 ms of which 18 ms to minimize.
[2024-05-25 00:41:18] [INFO ] Deduced a trap composed of 94 places in 2285 ms of which 18 ms to minimize.
[2024-05-25 00:41:20] [INFO ] Deduced a trap composed of 101 places in 2013 ms of which 17 ms to minimize.
[2024-05-25 00:41:22] [INFO ] Deduced a trap composed of 90 places in 2068 ms of which 18 ms to minimize.
[2024-05-25 00:41:24] [INFO ] Deduced a trap composed of 105 places in 2172 ms of which 19 ms to minimize.
[2024-05-25 00:41:26] [INFO ] Deduced a trap composed of 108 places in 2010 ms of which 16 ms to minimize.
[2024-05-25 00:41:28] [INFO ] Deduced a trap composed of 112 places in 2129 ms of which 17 ms to minimize.
[2024-05-25 00:41:30] [INFO ] Deduced a trap composed of 107 places in 2216 ms of which 18 ms to minimize.
[2024-05-25 00:41:33] [INFO ] Deduced a trap composed of 104 places in 2190 ms of which 18 ms to minimize.
[2024-05-25 00:41:35] [INFO ] Deduced a trap composed of 99 places in 2038 ms of which 17 ms to minimize.
[2024-05-25 00:41:37] [INFO ] Deduced a trap composed of 91 places in 2159 ms of which 23 ms to minimize.
[2024-05-25 00:41:39] [INFO ] Deduced a trap composed of 95 places in 2092 ms of which 18 ms to minimize.
[2024-05-25 00:41:41] [INFO ] Deduced a trap composed of 98 places in 2171 ms of which 19 ms to minimize.
[2024-05-25 00:41:44] [INFO ] Deduced a trap composed of 106 places in 2154 ms of which 17 ms to minimize.
[2024-05-25 00:41:46] [INFO ] Deduced a trap composed of 194 places in 1943 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2729 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 00:41:48] [INFO ] Deduced a trap composed of 94 places in 2091 ms of which 17 ms to minimize.
SMT process timed out in 51893ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2812 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2812/2812 places, 10373/10373 transitions.
Applied a total of 0 rules in 531 ms. Remains 2812 /2812 variables (removed 0) and now considering 10373/10373 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 531 ms. Remains : 2812/2812 places, 10373/10373 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2812/2812 places, 10373/10373 transitions.
Applied a total of 0 rules in 499 ms. Remains 2812 /2812 variables (removed 0) and now considering 10373/10373 (removed 0) transitions.
[2024-05-25 00:41:49] [INFO ] Flow matrix only has 9487 transitions (discarded 886 similar events)
[2024-05-25 00:41:49] [INFO ] Invariant cache hit.
[2024-05-25 00:41:54] [INFO ] Implicit Places using invariants in 5352 ms returned []
Implicit Place search using SMT only with invariants took 5356 ms to find 0 implicit places.
Running 10279 sub problems to find dead transitions.
[2024-05-25 00:41:54] [INFO ] Flow matrix only has 9487 transitions (discarded 886 similar events)
[2024-05-25 00:41:54] [INFO ] Invariant cache hit.
[2024-05-25 00:41:54] [INFO ] State equation strengthened by 6202 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2810 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 10279 unsolved
SMT process timed out in 100515ms, After SMT, problems are : Problem set: 0 solved, 10279 unsolved
Search for dead transitions found 0 dead transitions in 100622ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106501 ms. Remains : 2812/2812 places, 10373/10373 transitions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0)]
Knowledge based reduction with 7 factoid took 256 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1394 reset in 874 ms.
Product exploration explored 100000 steps with 1392 reset in 825 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 3174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3174/3174 places, 7171/7171 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 3174 transition count 7171
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 26 place count 3174 transition count 7171
Deduced a syphon composed of 40 places in 4 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 40 place count 3174 transition count 7171
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 52 place count 3162 transition count 7159
Deduced a syphon composed of 28 places in 4 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 64 place count 3162 transition count 7159
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 4 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 91 place count 3162 transition count 7159
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 3160 transition count 7157
Deduced a syphon composed of 53 places in 10 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 3160 transition count 7157
Deduced a syphon composed of 53 places in 4 ms
Applied a total of 95 rules in 2028 ms. Remains 3160 /3174 variables (removed 14) and now considering 7157/7171 (removed 14) transitions.
[2024-05-25 00:43:40] [INFO ] Redundant transitions in 490 ms returned []
Running 7132 sub problems to find dead transitions.
[2024-05-25 00:43:40] [INFO ] Flow matrix only has 6557 transitions (discarded 600 similar events)
// Phase 1: matrix 6557 rows 3160 cols
[2024-05-25 00:43:40] [INFO ] Computed 65 invariants in 174 ms
[2024-05-25 00:43:40] [INFO ] State equation strengthened by 2638 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3158 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7132 unsolved
SMT process timed out in 45817ms, After SMT, problems are : Problem set: 0 solved, 7132 unsolved
Search for dead transitions found 0 dead transitions in 45875ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3160/3174 places, 7157/7171 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48411 ms. Remains : 3160/3174 places, 7157/7171 transitions.
Built C files in :
/tmp/ltsmin3021476222416958127
[2024-05-25 00:44:26] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3021476222416958127
Running compilation step : cd /tmp/ltsmin3021476222416958127;'/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/ltsmin3021476222416958127;'/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/ltsmin3021476222416958127;'/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 3174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3174/3174 places, 7171/7171 transitions.
Applied a total of 0 rules in 294 ms. Remains 3174 /3174 variables (removed 0) and now considering 7171/7171 (removed 0) transitions.
[2024-05-25 00:44:29] [INFO ] Flow matrix only has 6571 transitions (discarded 600 similar events)
// Phase 1: matrix 6571 rows 3174 cols
[2024-05-25 00:44:30] [INFO ] Computed 65 invariants in 136 ms
[2024-05-25 00:44:34] [INFO ] Implicit Places using invariants in 4727 ms returned []
[2024-05-25 00:44:34] [INFO ] Flow matrix only has 6571 transitions (discarded 600 similar events)
[2024-05-25 00:44:34] [INFO ] Invariant cache hit.
[2024-05-25 00:44:37] [INFO ] State equation strengthened by 2638 read => feed constraints.
[2024-05-25 00:45:08] [INFO ] Performed 959/3174 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-25 00:45:38] [INFO ] Performed 1514/3174 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-25 00:46:08] [INFO ] Performed 2057/3174 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-25 00:46:34] [INFO ] Implicit Places using invariants and state equation in 119863 ms returned []
Implicit Place search using SMT with State Equation took 124591 ms to find 0 implicit places.
Running 7146 sub problems to find dead transitions.
[2024-05-25 00:46:34] [INFO ] Flow matrix only has 6571 transitions (discarded 600 similar events)
[2024-05-25 00:46:34] [INFO ] Invariant cache hit.
[2024-05-25 00:46:34] [INFO ] State equation strengthened by 2638 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3172 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7146 unsolved
SMT process timed out in 44823ms, After SMT, problems are : Problem set: 0 solved, 7146 unsolved
Search for dead transitions found 0 dead transitions in 45017ms
Finished structural reductions in LTL mode , in 1 iterations and 169911 ms. Remains : 3174/3174 places, 7171/7171 transitions.
Built C files in :
/tmp/ltsmin15656388998240852277
[2024-05-25 00:47:19] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15656388998240852277
Running compilation step : cd /tmp/ltsmin15656388998240852277;'/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/ltsmin15656388998240852277;'/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/ltsmin15656388998240852277;'/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-25 00:47:22] [INFO ] Flatten gal took : 165 ms
[2024-05-25 00:47:23] [INFO ] Flatten gal took : 175 ms
[2024-05-25 00:47:23] [INFO ] Time to serialize gal into /tmp/LTL13596460892946612985.gal : 30 ms
[2024-05-25 00:47:23] [INFO ] Time to serialize properties into /tmp/LTL11597824819583350880.prop : 7 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/LTL13596460892946612985.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2966612766259076041.hoa' '-atoms' '/tmp/LTL11597824819583350880.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/LTL11597824819583350880.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2966612766259076041.hoa
Detected timeout of ITS tools.
[2024-05-25 00:47:38] [INFO ] Flatten gal took : 169 ms
[2024-05-25 00:47:38] [INFO ] Flatten gal took : 170 ms
[2024-05-25 00:47:38] [INFO ] Time to serialize gal into /tmp/LTL2246435305740628263.gal : 33 ms
[2024-05-25 00:47:38] [INFO ] Time to serialize properties into /tmp/LTL14336532152642727406.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/LTL2246435305740628263.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14336532152642727406.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("((Node0HasAskedItsLeafSetToRx1ToReplaceNode22>=1)&&(LeafSetOfRx1IsSentToNode0>=1))"))))||(G("((Node15HasAskedItsLeafSetToLx...211
Formula 0 simplified : XXG!"((Node0HasAskedItsLeafSetToRx1ToReplaceNode22>=1)&&(LeafSetOfRx1IsSentToNode0>=1))" & F!"((Node15HasAskedItsLeafSetToLx6ToRepla...199
Detected timeout of ITS tools.
[2024-05-25 00:47:53] [INFO ] Flatten gal took : 173 ms
[2024-05-25 00:47:53] [INFO ] Applying decomposition
[2024-05-25 00:47:54] [INFO ] Flatten gal took : 176 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/graph15913963625173658519.txt' '-o' '/tmp/graph15913963625173658519.bin' '-w' '/tmp/graph15913963625173658519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15913963625173658519.bin' '-l' '-1' '-v' '-w' '/tmp/graph15913963625173658519.weights' '-q' '0' '-e' '0.001'
[2024-05-25 00:47:54] [INFO ] Decomposing Gal with order
[2024-05-25 00:47:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 00:47:54] [INFO ] Removed a total of 5746 redundant transitions.
[2024-05-25 00:47:55] [INFO ] Flatten gal took : 391 ms
[2024-05-25 00:47:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 4054 labels/synchronizations in 241 ms.
[2024-05-25 00:47:55] [INFO ] Time to serialize gal into /tmp/LTL8191953326984725781.gal : 51 ms
[2024-05-25 00:47:55] [INFO ] Time to serialize properties into /tmp/LTL11141024378605625254.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/LTL8191953326984725781.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11141024378605625254.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(X(F("((i27.i1.i4.u365.Node0HasAskedItsLeafSetToRx1ToReplaceNode22>=1)&&(i27.i1.i4.u356.LeafSetOfRx1IsSentToNode0>=1))"))))||(G("...271
Formula 0 simplified : XXG!"((i27.i1.i4.u365.Node0HasAskedItsLeafSetToRx1ToReplaceNode22>=1)&&(i27.i1.i4.u356.LeafSetOfRx1IsSentToNode0>=1))" & F!"((i27.i0...259
Detected timeout of ITS tools.
Treatment of property MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-10 finished in 824808 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((X((F(p2)&&p1))||p0))))'
Support contains 4 out of 3254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3254/3254 places, 7371/7371 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 3239 transition count 7332
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 3239 transition count 7332
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 3228 transition count 7291
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 3228 transition count 7291
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 3222 transition count 7249
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 3222 transition count 7249
Applied a total of 64 rules in 1459 ms. Remains 3222 /3254 variables (removed 32) and now considering 7249/7371 (removed 122) transitions.
[2024-05-25 00:48:11] [INFO ] Flow matrix only has 6649 transitions (discarded 600 similar events)
// Phase 1: matrix 6649 rows 3222 cols
[2024-05-25 00:48:12] [INFO ] Computed 77 invariants in 185 ms
[2024-05-25 00:48:16] [INFO ] Implicit Places using invariants in 4906 ms returned [194, 1141, 1457, 1466, 1608, 1678, 1679, 1728, 1864, 1913, 1963, 1964, 2863]
[2024-05-25 00:48:16] [INFO ] Actually due to overlaps returned [1457, 194, 1466, 1608, 1678, 1679, 1728, 1864, 1913, 1963, 1964, 2863]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 4920 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 3210/3254 places, 7249/7371 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 3199 transition count 7238
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 3199 transition count 7238
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 3188 transition count 7227
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 3188 transition count 7227
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 3177 transition count 7216
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 3177 transition count 7216
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 75 place count 3168 transition count 7153
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 3168 transition count 7153
Applied a total of 84 rules in 1573 ms. Remains 3168 /3210 variables (removed 42) and now considering 7153/7249 (removed 96) transitions.
[2024-05-25 00:48:18] [INFO ] Flow matrix only has 6553 transitions (discarded 600 similar events)
// Phase 1: matrix 6553 rows 3168 cols
[2024-05-25 00:48:18] [INFO ] Computed 65 invariants in 153 ms
[2024-05-25 00:48:23] [INFO ] Implicit Places using invariants in 4661 ms returned [1137]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 4665 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 3167/3254 places, 7153/7371 transitions.
Applied a total of 0 rules in 310 ms. Remains 3167 /3167 variables (removed 0) and now considering 7153/7153 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 12936 ms. Remains : 3167/3254 places, 7153/7371 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S24C07-LTLFireability-11
Product exploration explored 100000 steps with 1388 reset in 852 ms.
Product exploration explored 100000 steps with 1390 reset in 857 ms.
Computed a total of 543 stabilizing places and 1952 stable transitions
Computed a total of 543 stabilizing places and 1952 stable transitions
Detected a total of 543/3167 stabilizing places and 1952/7153 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (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 : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 1913 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 10 to 6
RANDOM walk for 40000 steps (553 resets) in 1418 ms. (28 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (104 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
[2024-05-25 00:48:27] [INFO ] Flow matrix only has 6553 transitions (discarded 600 similar events)
// Phase 1: matrix 6553 rows 3167 cols
[2024-05-25 00:48:28] [INFO ] Computed 64 invariants in 184 ms
[2024-05-25 00:48:28] [INFO ] State equation strengthened by 2626 read => feed constraints.
Problem apf5 is UNSAT
After SMT solving in domain Real declared 2/9720 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 0/47 constraints, Generalized P Invariants (flows): 0/17 constraints, State Equation: 0/3167 constraints, ReadFeed: 0/2626 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 246ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (F (NOT (OR p0 p2))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p0)), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p2)))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 2917 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 3167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3167/3167 places, 7153/7153 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 3167 transition count 7126
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 3140 transition count 7126
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 54 place count 3140 transition count 7112
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 82 place count 3126 transition count 7112
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 4 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 134 place count 3100 transition count 7086
Applied a total of 134 rules in 960 ms. Remains 3100 /3167 variables (removed 67) and now considering 7086/7153 (removed 67) transitions.
[2024-05-25 00:48:32] [INFO ] Flow matrix only has 6486 transitions (discarded 600 similar events)
// Phase 1: matrix 6486 rows 3100 cols
[2024-05-25 00:48:32] [INFO ] Computed 64 invariants in 158 ms
[2024-05-25 00:48:37] [INFO ] Implicit Places using invariants in 4835 ms returned []
[2024-05-25 00:48:37] [INFO ] Flow matrix only has 6486 transitions (discarded 600 similar events)
[2024-05-25 00:48:37] [INFO ] Invariant cache hit.
[2024-05-25 00:48:39] [INFO ] State equation strengthened by 2626 read => feed constraints.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S24C07"
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-S24C07, 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-171654350900100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C07.tgz
mv MultiCrashLeafsetExtension-PT-S24C07 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;