MCC'2024- Execution of r508-tall-171654350700027

About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S16C05

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
4313.911	960310.00	2325578.00	1840.10	TTTFTFTTTFTTFTFF	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r508-tall-171654350700027.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 ltsminxred
Input is MultiCrashLeafsetExtension-PT-S16C05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350700027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 18K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 05:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 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 4.6M 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-S16C05-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717195372144

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:42:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:42:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:42:53] [INFO ] Load time of PNML (sax parser for PT used): 351 ms
[2024-05-31 22:42:53] [INFO ] Transformed 4914 places.
[2024-05-31 22:42:53] [INFO ] Transformed 6913 transitions.
[2024-05-31 22:42:53] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 486 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 4914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 4885 transition count 6913
Discarding 1341 places :
Symmetric choice reduction at 1 with 1341 rule applications. Total rules 1370 place count 3544 transition count 5572
Iterating global reduction 1 with 1341 rules applied. Total rules applied 2711 place count 3544 transition count 5572
Discarding 1172 places :
Symmetric choice reduction at 1 with 1172 rule applications. Total rules 3883 place count 2372 transition count 4400
Iterating global reduction 1 with 1172 rules applied. Total rules applied 5055 place count 2372 transition count 4400
Discarding 220 places :
Symmetric choice reduction at 1 with 220 rule applications. Total rules 5275 place count 2152 transition count 3300
Iterating global reduction 1 with 220 rules applied. Total rules applied 5495 place count 2152 transition count 3300
Applied a total of 5495 rules in 929 ms. Remains 2152 /4914 variables (removed 2762) and now considering 3300/6913 (removed 3613) transitions.
[2024-05-31 22:42:54] [INFO ] Flow matrix only has 3028 transitions (discarded 272 similar events)
// Phase 1: matrix 3028 rows 2152 cols
[2024-05-31 22:42:55] [INFO ] Computed 506 invariants in 155 ms
[2024-05-31 22:42:57] [INFO ] Implicit Places using invariants in 2971 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 27, 34, 43, 54, 67, 82, 98, 114, 116, 120, 122, 124, 137, 148, 157, 164, 169, 174, 197, 204, 207, 208, 209, 210, 211, 212, 215, 220, 227, 236, 247, 260, 274, 288, 289, 290, 291, 292, 293, 304, 313, 320, 325, 328, 330, 353, 360, 363, 364, 365, 366, 367, 368, 370, 373, 378, 385, 394, 405, 417, 429, 430, 431, 432, 433, 434, 443, 450, 455, 458, 460, 462, 485, 492, 496, 497, 498, 499, 500, 502, 506, 509, 514, 521, 530, 540, 553, 556, 557, 567, 572, 575, 579, 581, 583, 606, 613, 616, 617, 618, 619, 620, 621, 623, 625, 627, 630, 635, 642, 650, 658, 659, 660, 661, 663, 668, 674, 676, 678, 680, 682, 705, 712, 715, 716, 717, 718, 719, 720, 722, 724, 726, 728, 731, 736, 742, 748, 749, 750, 751, 752, 753, 756, 758, 760, 762, 764, 766, 789, 796, 801, 802, 803, 804, 808, 810, 812, 817, 819, 822, 826, 830, 831, 832, 833, 834, 835, 837, 839, 841, 843, 845, 847, 870, 877, 880, 881, 882, 885, 889, 891, 893, 898, 900, 902, 904, 907, 908, 909, 910, 911, 912, 914, 916, 918, 920, 922, 924, 947, 949, 953, 956, 957, 958, 959, 960, 961, 963, 965, 967, 969, 971, 973, 975, 978, 979, 980, 981, 982, 983, 985, 987, 989, 991, 993, 995, 1018, 1025, 1028, 1029, 1031, 1032, 1033, 1038, 1040, 1042, 1044, 1046, 1048, 1050, 1053, 1054, 1055, 1056, 1057, 1058, 1060, 1062, 1064, 1066, 1068, 1070, 1093, 1100, 1103, 1104, 1105, 1106, 1107, 1108, 1110, 1112, 1114, 1116, 1118, 1120, 1123, 1128, 1129, 1130, 1131, 1132, 1133, 1136, 1138, 1140, 1142, 1144, 1147, 1170, 1177, 1180, 1181, 1182, 1183, 1184, 1185, 1187, 1189, 1191, 1193, 1195, 1198, 1203, 1210, 1212, 1213, 1214, 1215, 1222, 1225, 1227, 1229, 1231, 1233, 1256, 1263, 1266, 1267, 1268, 1269, 1270, 1271, 1273, 1275, 1277, 1279, 1282, 1287, 1294, 1303, 1304, 1305, 1306, 1308, 1317, 1322, 1325, 1327, 1329, 1331, 1354, 1361, 1364, 1368, 1369, 1370, 1374, 1376, 1378, 1384, 1396, 1405, 1416, 1417, 1418, 1419, 1420, 1421, 1430, 1437, 1442, 1445, 1447, 1449, 1472, 1479, 1482, 1483, 1484, 1485, 1486, 1487, 1489, 1491, 1494, 1499, 1506, 1515, 1526, 1539, 1540, 1541, 1542, 1544, 1555, 1564, 1573, 1578, 1581, 1583, 1606, 1613, 1616, 1617, 1618, 1619, 1620, 1621, 1623, 1626, 1631, 1638, 1647, 1658, 1671, 1686, 1687, 1688, 1689, 1690, 1691, 1704, 1715, 1724, 1731, 1736, 1739, 1762, 1764, 1768, 1771, 1772, 1773, 1774, 1775, 1776, 1779, 1784, 1791, 1800, 1811, 1824, 1839, 1857, 1858, 1860, 1861, 1879, 1892, 1905, 1914, 1921, 1926, 1950]
[2024-05-31 22:42:57] [INFO ] Actually due to overlaps returned [197, 353, 485, 606, 705, 789, 870, 947, 1018, 1093, 1170, 1256, 1354, 1472, 1606, 1762, 1950, 4, 12, 14, 16, 18, 20, 114, 116, 120, 122, 207, 208, 209, 210, 211, 288, 289, 290, 291, 292, 363, 364, 365, 366, 367, 429, 430, 431, 432, 433, 496, 497, 498, 499, 553, 556, 616, 617, 618, 619, 620, 658, 659, 660, 661, 715, 716, 717, 718, 719, 748, 749, 750, 751, 752, 801, 802, 803, 830, 831, 832, 833, 834, 880, 881, 882, 907, 908, 909, 910, 911, 949, 956, 957, 958, 959, 960, 978, 979, 980, 981, 982, 1028, 1029, 1031, 1032, 1053, 1054, 1055, 1056, 1057, 1103, 1104, 1105, 1106, 1107, 1128, 1129, 1130, 1131, 1132, 1180, 1181, 1182, 1183, 1184, 1210, 1212, 1213, 1214, 1266, 1267, 1268, 1269, 1270, 1303, 1304, 1305, 1306, 1364, 1368, 1369, 1416, 1417, 1418, 1419, 1420, 1482, 1483, 1484, 1485, 1486, 1539, 1540, 1541, 1542, 1616, 1617, 1618, 1619, 1620, 1686, 1687, 1688, 1689, 1690, 1764, 1771, 1772, 1773, 1774, 1775, 1857, 1858, 1860]
Discarding 172 places :
Implicit Place search using SMT only with invariants took 3011 ms to find 172 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1980/4914 places, 3300/6913 transitions.
Discarding 142 places :
Symmetric choice reduction at 0 with 142 rule applications. Total rules 142 place count 1838 transition count 3158
Iterating global reduction 0 with 142 rules applied. Total rules applied 284 place count 1838 transition count 3158
Discarding 140 places :
Symmetric choice reduction at 0 with 140 rule applications. Total rules 424 place count 1698 transition count 3018
Iterating global reduction 0 with 140 rules applied. Total rules applied 564 place count 1698 transition count 3018
Discarding 139 places :
Symmetric choice reduction at 0 with 139 rule applications. Total rules 703 place count 1559 transition count 2879
Iterating global reduction 0 with 139 rules applied. Total rules applied 842 place count 1559 transition count 2879
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 859 place count 1542 transition count 2794
Iterating global reduction 0 with 17 rules applied. Total rules applied 876 place count 1542 transition count 2794
Applied a total of 876 rules in 258 ms. Remains 1542 /1980 variables (removed 438) and now considering 2794/3300 (removed 506) transitions.
[2024-05-31 22:42:58] [INFO ] Flow matrix only has 2522 transitions (discarded 272 similar events)
// Phase 1: matrix 2522 rows 1542 cols
[2024-05-31 22:42:58] [INFO ] Computed 334 invariants in 71 ms
[2024-05-31 22:42:59] [INFO ] Implicit Places using invariants in 1687 ms returned [7, 16, 21, 28, 37, 48, 61, 76, 92, 114, 127, 138, 147, 154, 159, 164, 193, 195, 198, 203, 210, 219, 230, 243, 257, 271, 282, 291, 298, 303, 306, 308, 319, 321, 323, 326, 331, 338, 347, 358, 370, 381, 390, 397, 402, 405, 407, 409, 418, 422, 424, 428, 431, 436, 443, 452, 462, 477, 487, 492, 495, 499, 501, 503, 520, 522, 524, 526, 528, 531, 536, 543, 551, 560, 565, 571, 573, 575, 577, 579, 590, 592, 594, 596, 598, 600, 603, 608, 614, 619, 622, 624, 626, 628, 630, 632, 641, 646, 650, 652, 654, 659, 661, 664, 668, 671, 673, 675, 677, 679, 681, 683, 696, 701, 705, 707, 709, 714, 716, 718, 720, 722, 724, 726, 728, 730, 732, 734, 745, 748, 750, 752, 754, 756, 758, 760, 762, 764, 766, 768, 770, 772, 774, 776, 786, 790, 795, 797, 799, 801, 803, 805, 807, 809, 811, 813, 815, 817, 819, 821, 832, 834, 836, 838, 840, 842, 844, 846, 849, 853, 856, 858, 860, 862, 864, 867, 876, 878, 880, 882, 884, 886, 888, 891, 896, 904, 911, 914, 916, 918, 920, 922, 933, 936, 938, 940, 942, 944, 947, 952, 959, 969, 978, 983, 986, 988, 990, 992, 1004, 1010, 1014, 1016, 1018, 1024, 1036, 1045, 1056, 1065, 1072, 1077, 1080, 1082, 1084, 1098, 1100, 1102, 1104, 1107, 1112, 1119, 1128, 1139, 1153, 1164, 1173, 1182, 1187, 1190, 1192, 1203, 1205, 1207, 1210, 1215, 1222, 1231, 1242, 1255, 1269, 1282, 1293, 1302, 1309, 1314, 1317, 1324, 1326, 1329, 1334, 1341, 1350, 1361, 1374, 1389, 1408, 1426, 1439, 1452, 1461, 1468, 1473]
Discarding 271 places :
Implicit Place search using SMT only with invariants took 1717 ms to find 271 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1271/4914 places, 2794/6913 transitions.
Applied a total of 0 rules in 45 ms. Remains 1271 /1271 variables (removed 0) and now considering 2794/2794 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5976 ms. Remains : 1271/4914 places, 2794/6913 transitions.
Support contains 36 out of 1271 places after structural reductions.
[2024-05-31 22:43:00] [INFO ] Flatten gal took : 269 ms
[2024-05-31 22:43:00] [INFO ] Flatten gal took : 132 ms
[2024-05-31 22:43:01] [INFO ] Input system was already deterministic with 2794 transitions.
Support contains 35 out of 1271 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (768 resets) in 2376 ms. (16 steps per ms) remains 15/22 properties
BEST_FIRST walk for 4004 steps (20 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 58 ms. (67 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (20 resets) in 81 ms. (48 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 69 ms. (57 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 62 ms. (63 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
[2024-05-31 22:43:02] [INFO ] Flow matrix only has 2522 transitions (discarded 272 similar events)
// Phase 1: matrix 2522 rows 1271 cols
[2024-05-31 22:43:02] [INFO ] Computed 63 invariants in 30 ms
[2024-05-31 22:43:02] [INFO ] State equation strengthened by 958 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 1135/1159 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 10 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/1159 variables, 1/4 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1159 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 9 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 4 (OVERLAPS) 73/1232 variables, 20/24 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1232 variables, 0/24 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 28/1260 variables, 28/52 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1260 variables, 0/52 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 11/1271 variables, 11/63 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1271 variables, 0/63 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 2522/3793 variables, 1271/1334 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3793 variables, 958/2292 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3793 variables, 0/2292 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/3793 variables, 0/2292 constraints. Problems are: Problem set: 9 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3793/3793 variables, and 2292 constraints, problems are : Problem set: 9 solved, 6 unsolved in 2527 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 1271/1271 constraints, ReadFeed: 958/958 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1141/1154 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1154 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 6 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 3 (OVERLAPS) 78/1232 variables, 21/24 constraints. Problems are: Problem set: 10 solved, 5 unsolved
[2024-05-31 22:43:06] [INFO ] Deduced a trap composed of 50 places in 923 ms of which 88 ms to minimize.
[2024-05-31 22:43:06] [INFO ] Deduced a trap composed of 222 places in 623 ms of which 10 ms to minimize.
[2024-05-31 22:43:07] [INFO ] Deduced a trap composed of 183 places in 560 ms of which 17 ms to minimize.
[2024-05-31 22:43:07] [INFO ] Deduced a trap composed of 307 places in 595 ms of which 8 ms to minimize.
[2024-05-31 22:43:08] [INFO ] Deduced a trap composed of 232 places in 623 ms of which 9 ms to minimize.
[2024-05-31 22:43:09] [INFO ] Deduced a trap composed of 316 places in 631 ms of which 9 ms to minimize.
[2024-05-31 22:43:09] [INFO ] Deduced a trap composed of 128 places in 610 ms of which 8 ms to minimize.
SMT process timed out in 7837ms, After SMT, problems are : Problem set: 10 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 1271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1271/1271 places, 2794/2794 transitions.
Graph (complete) has 5807 edges and 1271 vertex of which 1270 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 1270 transition count 2778
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 1254 transition count 2778
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 33 place count 1254 transition count 2754
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 81 place count 1230 transition count 2754
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 92 place count 1219 transition count 2739
Iterating global reduction 2 with 11 rules applied. Total rules applied 103 place count 1219 transition count 2739
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 103 place count 1219 transition count 2735
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 111 place count 1215 transition count 2735
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 121 place count 1205 transition count 2693
Iterating global reduction 2 with 10 rules applied. Total rules applied 131 place count 1205 transition count 2693
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 1203 transition count 2683
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 1203 transition count 2683
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 193 place count 1174 transition count 2654
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 201 place count 1166 transition count 2646
Iterating global reduction 2 with 8 rules applied. Total rules applied 209 place count 1166 transition count 2646
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 216 place count 1159 transition count 2611
Iterating global reduction 2 with 7 rules applied. Total rules applied 223 place count 1159 transition count 2611
Free-agglomeration rule (complex) applied 143 times.
Iterating global reduction 2 with 143 rules applied. Total rules applied 366 place count 1159 transition count 3460
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 2 with 143 rules applied. Total rules applied 509 place count 1016 transition count 3460
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 521 place count 1016 transition count 3460
Applied a total of 521 rules in 1089 ms. Remains 1016 /1271 variables (removed 255) and now considering 3460/2794 (removed -666) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1090 ms. Remains : 1016/1271 places, 3460/2794 transitions.
RANDOM walk for 40000 steps (1358 resets) in 1277 ms. (31 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (161 resets) in 151 ms. (263 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (160 resets) in 178 ms. (223 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (159 resets) in 187 ms. (212 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (159 resets) in 200 ms. (199 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (160 resets) in 163 ms. (243 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 66389 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 5
Probabilistic random walk after 66389 steps, saw 28071 distinct states, run finished after 3006 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-31 22:43:14] [INFO ] Flow matrix only has 3064 transitions (discarded 396 similar events)
// Phase 1: matrix 3064 rows 1016 cols
[2024-05-31 22:43:14] [INFO ] Computed 62 invariants in 33 ms
[2024-05-31 22:43:14] [INFO ] State equation strengthened by 1878 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 922/931 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 47/978 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:43:15] [INFO ] Deduced a trap composed of 98 places in 493 ms of which 6 ms to minimize.
[2024-05-31 22:43:15] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/978 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 28/1006 variables, 28/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1006 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 10/1016 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1016 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 3064/4080 variables, 1016/1080 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4080 variables, 1878/2958 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4080 variables, 0/2958 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/4080 variables, 0/2958 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4080/4080 variables, and 2958 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3007 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 1016/1016 constraints, ReadFeed: 1878/1878 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 922/931 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:43:18] [INFO ] Deduced a trap composed of 317 places in 541 ms of which 5 ms to minimize.
[2024-05-31 22:43:18] [INFO ] Deduced a trap composed of 274 places in 529 ms of which 6 ms to minimize.
[2024-05-31 22:43:19] [INFO ] Deduced a trap composed of 298 places in 516 ms of which 6 ms to minimize.
[2024-05-31 22:43:20] [INFO ] Deduced a trap composed of 244 places in 518 ms of which 5 ms to minimize.
[2024-05-31 22:43:20] [INFO ] Deduced a trap composed of 186 places in 539 ms of which 6 ms to minimize.
[2024-05-31 22:43:21] [INFO ] Deduced a trap composed of 286 places in 484 ms of which 5 ms to minimize.
[2024-05-31 22:43:21] [INFO ] Deduced a trap composed of 238 places in 494 ms of which 6 ms to minimize.
[2024-05-31 22:43:22] [INFO ] Deduced a trap composed of 204 places in 506 ms of which 5 ms to minimize.
[2024-05-31 22:43:22] [INFO ] Deduced a trap composed of 119 places in 514 ms of which 6 ms to minimize.
[2024-05-31 22:43:23] [INFO ] Deduced a trap composed of 368 places in 489 ms of which 5 ms to minimize.
[2024-05-31 22:43:23] [INFO ] Deduced a trap composed of 306 places in 529 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:43:24] [INFO ] Deduced a trap composed of 295 places in 490 ms of which 5 ms to minimize.
[2024-05-31 22:43:24] [INFO ] Deduced a trap composed of 305 places in 492 ms of which 6 ms to minimize.
[2024-05-31 22:43:25] [INFO ] Deduced a trap composed of 321 places in 490 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/931 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/931 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 47/978 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:43:26] [INFO ] Deduced a trap composed of 27 places in 503 ms of which 6 ms to minimize.
[2024-05-31 22:43:26] [INFO ] Deduced a trap composed of 5 places in 518 ms of which 6 ms to minimize.
[2024-05-31 22:43:27] [INFO ] Deduced a trap composed of 47 places in 497 ms of which 6 ms to minimize.
[2024-05-31 22:43:27] [INFO ] Deduced a trap composed of 64 places in 484 ms of which 6 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 64 places in 514 ms of which 6 ms to minimize.
[2024-05-31 22:43:28] [INFO ] Deduced a trap composed of 84 places in 500 ms of which 6 ms to minimize.
[2024-05-31 22:43:29] [INFO ] Deduced a trap composed of 156 places in 510 ms of which 7 ms to minimize.
[2024-05-31 22:43:29] [INFO ] Deduced a trap composed of 77 places in 467 ms of which 7 ms to minimize.
[2024-05-31 22:43:30] [INFO ] Deduced a trap composed of 141 places in 519 ms of which 9 ms to minimize.
[2024-05-31 22:43:30] [INFO ] Deduced a trap composed of 162 places in 511 ms of which 6 ms to minimize.
[2024-05-31 22:43:31] [INFO ] Deduced a trap composed of 77 places in 508 ms of which 6 ms to minimize.
[2024-05-31 22:43:31] [INFO ] Deduced a trap composed of 117 places in 466 ms of which 6 ms to minimize.
[2024-05-31 22:43:32] [INFO ] Deduced a trap composed of 47 places in 458 ms of which 6 ms to minimize.
[2024-05-31 22:43:32] [INFO ] Deduced a trap composed of 72 places in 508 ms of which 6 ms to minimize.
[2024-05-31 22:43:33] [INFO ] Deduced a trap composed of 64 places in 476 ms of which 6 ms to minimize.
[2024-05-31 22:43:33] [INFO ] Deduced a trap composed of 182 places in 466 ms of which 6 ms to minimize.
[2024-05-31 22:43:34] [INFO ] Deduced a trap composed of 112 places in 531 ms of which 7 ms to minimize.
[2024-05-31 22:43:34] [INFO ] Deduced a trap composed of 99 places in 492 ms of which 6 ms to minimize.
[2024-05-31 22:43:35] [INFO ] Deduced a trap composed of 64 places in 479 ms of which 6 ms to minimize.
[2024-05-31 22:43:35] [INFO ] Deduced a trap composed of 84 places in 528 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/978 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:43:36] [INFO ] Deduced a trap composed of 183 places in 531 ms of which 6 ms to minimize.
[2024-05-31 22:43:37] [INFO ] Deduced a trap composed of 205 places in 512 ms of which 6 ms to minimize.
[2024-05-31 22:43:37] [INFO ] Deduced a trap composed of 99 places in 496 ms of which 6 ms to minimize.
[2024-05-31 22:43:38] [INFO ] Deduced a trap composed of 218 places in 513 ms of which 6 ms to minimize.
[2024-05-31 22:43:38] [INFO ] Deduced a trap composed of 145 places in 593 ms of which 6 ms to minimize.
[2024-05-31 22:43:39] [INFO ] Deduced a trap composed of 47 places in 612 ms of which 7 ms to minimize.
[2024-05-31 22:43:40] [INFO ] Deduced a trap composed of 100 places in 600 ms of which 6 ms to minimize.
[2024-05-31 22:43:40] [INFO ] Deduced a trap composed of 64 places in 518 ms of which 7 ms to minimize.
[2024-05-31 22:43:41] [INFO ] Deduced a trap composed of 173 places in 544 ms of which 6 ms to minimize.
[2024-05-31 22:43:41] [INFO ] Deduced a trap composed of 105 places in 529 ms of which 11 ms to minimize.
[2024-05-31 22:43:42] [INFO ] Deduced a trap composed of 193 places in 524 ms of which 6 ms to minimize.
[2024-05-31 22:43:42] [INFO ] Deduced a trap composed of 221 places in 476 ms of which 6 ms to minimize.
[2024-05-31 22:43:43] [INFO ] Deduced a trap composed of 205 places in 505 ms of which 6 ms to minimize.
[2024-05-31 22:43:43] [INFO ] Deduced a trap composed of 84 places in 526 ms of which 9 ms to minimize.
[2024-05-31 22:43:44] [INFO ] Deduced a trap composed of 119 places in 526 ms of which 6 ms to minimize.
[2024-05-31 22:43:44] [INFO ] Deduced a trap composed of 105 places in 538 ms of which 6 ms to minimize.
[2024-05-31 22:43:45] [INFO ] Deduced a trap composed of 87 places in 598 ms of which 7 ms to minimize.
[2024-05-31 22:43:46] [INFO ] Deduced a trap composed of 96 places in 524 ms of which 6 ms to minimize.
[2024-05-31 22:43:46] [INFO ] Deduced a trap composed of 96 places in 531 ms of which 6 ms to minimize.
[2024-05-31 22:43:47] [INFO ] Deduced a trap composed of 77 places in 574 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/978 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:43:47] [INFO ] Deduced a trap composed of 216 places in 534 ms of which 6 ms to minimize.
[2024-05-31 22:43:48] [INFO ] Deduced a trap composed of 87 places in 596 ms of which 6 ms to minimize.
[2024-05-31 22:43:49] [INFO ] Deduced a trap composed of 87 places in 587 ms of which 6 ms to minimize.
[2024-05-31 22:43:49] [INFO ] Deduced a trap composed of 88 places in 596 ms of which 6 ms to minimize.
[2024-05-31 22:43:50] [INFO ] Deduced a trap composed of 93 places in 584 ms of which 6 ms to minimize.
[2024-05-31 22:43:50] [INFO ] Deduced a trap composed of 101 places in 572 ms of which 6 ms to minimize.
[2024-05-31 22:43:51] [INFO ] Deduced a trap composed of 96 places in 574 ms of which 6 ms to minimize.
[2024-05-31 22:43:52] [INFO ] Deduced a trap composed of 84 places in 555 ms of which 6 ms to minimize.
[2024-05-31 22:43:52] [INFO ] Deduced a trap composed of 96 places in 543 ms of which 6 ms to minimize.
[2024-05-31 22:43:53] [INFO ] Deduced a trap composed of 98 places in 585 ms of which 6 ms to minimize.
[2024-05-31 22:43:53] [INFO ] Deduced a trap composed of 95 places in 580 ms of which 7 ms to minimize.
[2024-05-31 22:43:54] [INFO ] Deduced a trap composed of 87 places in 577 ms of which 6 ms to minimize.
[2024-05-31 22:43:55] [INFO ] Deduced a trap composed of 85 places in 588 ms of which 7 ms to minimize.
[2024-05-31 22:43:55] [INFO ] Deduced a trap composed of 99 places in 505 ms of which 7 ms to minimize.
[2024-05-31 22:43:56] [INFO ] Deduced a trap composed of 89 places in 555 ms of which 6 ms to minimize.
[2024-05-31 22:43:56] [INFO ] Deduced a trap composed of 83 places in 543 ms of which 6 ms to minimize.
[2024-05-31 22:43:57] [INFO ] Deduced a trap composed of 103 places in 472 ms of which 6 ms to minimize.
[2024-05-31 22:43:57] [INFO ] Deduced a trap composed of 98 places in 540 ms of which 6 ms to minimize.
[2024-05-31 22:43:58] [INFO ] Deduced a trap composed of 77 places in 525 ms of which 6 ms to minimize.
[2024-05-31 22:43:58] [INFO ] Deduced a trap composed of 81 places in 554 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/978 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:43:59] [INFO ] Deduced a trap composed of 105 places in 473 ms of which 6 ms to minimize.
[2024-05-31 22:43:59] [INFO ] Deduced a trap composed of 94 places in 563 ms of which 6 ms to minimize.
[2024-05-31 22:44:00] [INFO ] Deduced a trap composed of 87 places in 568 ms of which 7 ms to minimize.
[2024-05-31 22:44:01] [INFO ] Deduced a trap composed of 83 places in 578 ms of which 7 ms to minimize.
[2024-05-31 22:44:01] [INFO ] Deduced a trap composed of 103 places in 517 ms of which 6 ms to minimize.
[2024-05-31 22:44:02] [INFO ] Deduced a trap composed of 83 places in 576 ms of which 8 ms to minimize.
[2024-05-31 22:44:02] [INFO ] Deduced a trap composed of 105 places in 483 ms of which 6 ms to minimize.
SMT process timed out in 48127ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 9 out of 1016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 3460/3460 transitions.
Applied a total of 0 rules in 96 ms. Remains 1016 /1016 variables (removed 0) and now considering 3460/3460 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 1016/1016 places, 3460/3460 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 3460/3460 transitions.
Applied a total of 0 rules in 92 ms. Remains 1016 /1016 variables (removed 0) and now considering 3460/3460 (removed 0) transitions.
[2024-05-31 22:44:02] [INFO ] Flow matrix only has 3064 transitions (discarded 396 similar events)
[2024-05-31 22:44:02] [INFO ] Invariant cache hit.
[2024-05-31 22:44:04] [INFO ] Implicit Places using invariants in 1156 ms returned [82, 301, 335, 336, 337, 386, 433, 434, 460, 507, 567, 627, 628, 636, 914, 915]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1161 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1000/1016 places, 3460/3460 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 990 transition count 3450
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 990 transition count 3450
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 981 transition count 3441
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 981 transition count 3441
Applied a total of 38 rules in 135 ms. Remains 981 /1000 variables (removed 19) and now considering 3441/3460 (removed 19) transitions.
[2024-05-31 22:44:04] [INFO ] Flow matrix only has 3045 transitions (discarded 396 similar events)
// Phase 1: matrix 3045 rows 981 cols
[2024-05-31 22:44:04] [INFO ] Computed 46 invariants in 32 ms
[2024-05-31 22:44:05] [INFO ] Implicit Places using invariants in 1087 ms returned []
[2024-05-31 22:44:05] [INFO ] Flow matrix only has 3045 transitions (discarded 396 similar events)
[2024-05-31 22:44:05] [INFO ] Invariant cache hit.
[2024-05-31 22:44:06] [INFO ] State equation strengthened by 1878 read => feed constraints.
[2024-05-31 22:44:32] [INFO ] Implicit Places using invariants and state equation in 26877 ms returned []
Implicit Place search using SMT with State Equation took 27990 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 981/1016 places, 3441/3460 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 29380 ms. Remains : 981/1016 places, 3441/3460 transitions.
RANDOM walk for 40000 steps (1358 resets) in 1063 ms. (37 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (161 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (158 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (160 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (159 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (164 resets) in 206 ms. (193 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 67735 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 5
Probabilistic random walk after 67735 steps, saw 28455 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-31 22:44:35] [INFO ] Flow matrix only has 3045 transitions (discarded 396 similar events)
[2024-05-31 22:44:35] [INFO ] Invariant cache hit.
[2024-05-31 22:44:35] [INFO ] State equation strengthened by 1878 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 902/911 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/911 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 32/943 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:44:36] [INFO ] Deduced a trap composed of 5 places in 504 ms of which 6 ms to minimize.
[2024-05-31 22:44:37] [INFO ] Deduced a trap composed of 72 places in 539 ms of which 6 ms to minimize.
[2024-05-31 22:44:37] [INFO ] Deduced a trap composed of 72 places in 553 ms of which 6 ms to minimize.
[2024-05-31 22:44:38] [INFO ] Deduced a trap composed of 68 places in 508 ms of which 6 ms to minimize.
[2024-05-31 22:44:38] [INFO ] Deduced a trap composed of 82 places in 494 ms of which 6 ms to minimize.
[2024-05-31 22:44:39] [INFO ] Deduced a trap composed of 77 places in 561 ms of which 6 ms to minimize.
[2024-05-31 22:44:39] [INFO ] Deduced a trap composed of 68 places in 549 ms of which 6 ms to minimize.
[2024-05-31 22:44:40] [INFO ] Deduced a trap composed of 73 places in 541 ms of which 6 ms to minimize.
[2024-05-31 22:44:41] [INFO ] Deduced a trap composed of 78 places in 547 ms of which 5 ms to minimize.
[2024-05-31 22:44:41] [INFO ] Deduced a trap composed of 79 places in 523 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/943 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/943 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 28/971 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:44:42] [INFO ] Deduced a trap composed of 73 places in 538 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/971 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/971 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 10/981 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/981 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3045/4026 variables, 981/1038 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4026 variables, 1878/2916 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4026 variables, 0/2916 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/4026 variables, 0/2916 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4026/4026 variables, and 2916 constraints, problems are : Problem set: 0 solved, 5 unsolved in 8555 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 981/981 constraints, ReadFeed: 1878/1878 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 902/911 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:44:45] [INFO ] Deduced a trap composed of 288 places in 459 ms of which 5 ms to minimize.
[2024-05-31 22:44:45] [INFO ] Deduced a trap composed of 190 places in 464 ms of which 6 ms to minimize.
[2024-05-31 22:44:46] [INFO ] Deduced a trap composed of 336 places in 477 ms of which 5 ms to minimize.
[2024-05-31 22:44:46] [INFO ] Deduced a trap composed of 309 places in 496 ms of which 6 ms to minimize.
[2024-05-31 22:44:47] [INFO ] Deduced a trap composed of 365 places in 492 ms of which 5 ms to minimize.
[2024-05-31 22:44:47] [INFO ] Deduced a trap composed of 215 places in 482 ms of which 5 ms to minimize.
[2024-05-31 22:44:48] [INFO ] Deduced a trap composed of 223 places in 483 ms of which 5 ms to minimize.
[2024-05-31 22:44:48] [INFO ] Deduced a trap composed of 243 places in 485 ms of which 7 ms to minimize.
[2024-05-31 22:44:49] [INFO ] Deduced a trap composed of 243 places in 493 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/911 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/911 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 32/943 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/943 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:44:49] [INFO ] Deduced a trap composed of 128 places in 508 ms of which 6 ms to minimize.
[2024-05-31 22:44:50] [INFO ] Deduced a trap composed of 27 places in 471 ms of which 6 ms to minimize.
[2024-05-31 22:44:50] [INFO ] Deduced a trap composed of 57 places in 485 ms of which 6 ms to minimize.
[2024-05-31 22:44:51] [INFO ] Deduced a trap composed of 128 places in 508 ms of which 6 ms to minimize.
[2024-05-31 22:44:51] [INFO ] Deduced a trap composed of 47 places in 482 ms of which 6 ms to minimize.
[2024-05-31 22:44:52] [INFO ] Deduced a trap composed of 47 places in 487 ms of which 6 ms to minimize.
[2024-05-31 22:44:52] [INFO ] Deduced a trap composed of 47 places in 497 ms of which 5 ms to minimize.
[2024-05-31 22:44:53] [INFO ] Deduced a trap composed of 89 places in 450 ms of which 6 ms to minimize.
[2024-05-31 22:44:53] [INFO ] Deduced a trap composed of 72 places in 486 ms of which 6 ms to minimize.
[2024-05-31 22:44:54] [INFO ] Deduced a trap composed of 64 places in 474 ms of which 6 ms to minimize.
[2024-05-31 22:44:54] [INFO ] Deduced a trap composed of 64 places in 460 ms of which 5 ms to minimize.
[2024-05-31 22:44:55] [INFO ] Deduced a trap composed of 87 places in 456 ms of which 5 ms to minimize.
[2024-05-31 22:44:55] [INFO ] Deduced a trap composed of 77 places in 477 ms of which 7 ms to minimize.
[2024-05-31 22:44:56] [INFO ] Deduced a trap composed of 97 places in 453 ms of which 6 ms to minimize.
[2024-05-31 22:44:56] [INFO ] Deduced a trap composed of 192 places in 445 ms of which 5 ms to minimize.
[2024-05-31 22:44:57] [INFO ] Deduced a trap composed of 96 places in 446 ms of which 5 ms to minimize.
[2024-05-31 22:44:57] [INFO ] Deduced a trap composed of 96 places in 471 ms of which 5 ms to minimize.
[2024-05-31 22:44:58] [INFO ] Deduced a trap composed of 103 places in 458 ms of which 5 ms to minimize.
[2024-05-31 22:44:58] [INFO ] Deduced a trap composed of 96 places in 482 ms of which 5 ms to minimize.
[2024-05-31 22:44:59] [INFO ] Deduced a trap composed of 108 places in 446 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/943 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:44:59] [INFO ] Deduced a trap composed of 110 places in 450 ms of which 6 ms to minimize.
[2024-05-31 22:45:00] [INFO ] Deduced a trap composed of 96 places in 439 ms of which 6 ms to minimize.
[2024-05-31 22:45:00] [INFO ] Deduced a trap composed of 235 places in 448 ms of which 6 ms to minimize.
[2024-05-31 22:45:00] [INFO ] Deduced a trap composed of 241 places in 462 ms of which 5 ms to minimize.
[2024-05-31 22:45:01] [INFO ] Deduced a trap composed of 246 places in 469 ms of which 6 ms to minimize.
[2024-05-31 22:45:01] [INFO ] Deduced a trap composed of 110 places in 444 ms of which 5 ms to minimize.
[2024-05-31 22:45:02] [INFO ] Deduced a trap composed of 77 places in 443 ms of which 5 ms to minimize.
[2024-05-31 22:45:02] [INFO ] Deduced a trap composed of 92 places in 439 ms of which 5 ms to minimize.
[2024-05-31 22:45:03] [INFO ] Deduced a trap composed of 87 places in 467 ms of which 5 ms to minimize.
[2024-05-31 22:45:03] [INFO ] Deduced a trap composed of 77 places in 485 ms of which 24 ms to minimize.
[2024-05-31 22:45:04] [INFO ] Deduced a trap composed of 84 places in 482 ms of which 5 ms to minimize.
[2024-05-31 22:45:04] [INFO ] Deduced a trap composed of 115 places in 462 ms of which 5 ms to minimize.
[2024-05-31 22:45:05] [INFO ] Deduced a trap composed of 105 places in 448 ms of which 6 ms to minimize.
[2024-05-31 22:45:05] [INFO ] Deduced a trap composed of 64 places in 453 ms of which 6 ms to minimize.
[2024-05-31 22:45:06] [INFO ] Deduced a trap composed of 77 places in 465 ms of which 6 ms to minimize.
[2024-05-31 22:45:06] [INFO ] Deduced a trap composed of 177 places in 464 ms of which 5 ms to minimize.
[2024-05-31 22:45:07] [INFO ] Deduced a trap composed of 87 places in 470 ms of which 9 ms to minimize.
[2024-05-31 22:45:07] [INFO ] Deduced a trap composed of 186 places in 471 ms of which 6 ms to minimize.
[2024-05-31 22:45:08] [INFO ] Deduced a trap composed of 193 places in 439 ms of which 6 ms to minimize.
[2024-05-31 22:45:08] [INFO ] Deduced a trap composed of 94 places in 459 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/943 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:45:09] [INFO ] Deduced a trap composed of 96 places in 511 ms of which 6 ms to minimize.
[2024-05-31 22:45:09] [INFO ] Deduced a trap composed of 76 places in 514 ms of which 6 ms to minimize.
[2024-05-31 22:45:10] [INFO ] Deduced a trap composed of 265 places in 515 ms of which 6 ms to minimize.
[2024-05-31 22:45:10] [INFO ] Deduced a trap composed of 131 places in 503 ms of which 6 ms to minimize.
[2024-05-31 22:45:11] [INFO ] Deduced a trap composed of 78 places in 545 ms of which 6 ms to minimize.
[2024-05-31 22:45:11] [INFO ] Deduced a trap composed of 77 places in 511 ms of which 6 ms to minimize.
[2024-05-31 22:45:12] [INFO ] Deduced a trap composed of 78 places in 518 ms of which 6 ms to minimize.
[2024-05-31 22:45:12] [INFO ] Deduced a trap composed of 184 places in 450 ms of which 6 ms to minimize.
[2024-05-31 22:45:13] [INFO ] Deduced a trap composed of 104 places in 514 ms of which 5 ms to minimize.
[2024-05-31 22:45:13] [INFO ] Deduced a trap composed of 100 places in 506 ms of which 5 ms to minimize.
[2024-05-31 22:45:14] [INFO ] Deduced a trap composed of 78 places in 534 ms of which 6 ms to minimize.
[2024-05-31 22:45:14] [INFO ] Deduced a trap composed of 131 places in 477 ms of which 6 ms to minimize.
[2024-05-31 22:45:15] [INFO ] Deduced a trap composed of 66 places in 509 ms of which 6 ms to minimize.
[2024-05-31 22:45:16] [INFO ] Deduced a trap composed of 124 places in 479 ms of which 5 ms to minimize.
[2024-05-31 22:45:16] [INFO ] Deduced a trap composed of 124 places in 476 ms of which 5 ms to minimize.
[2024-05-31 22:45:17] [INFO ] Deduced a trap composed of 87 places in 541 ms of which 5 ms to minimize.
[2024-05-31 22:45:17] [INFO ] Deduced a trap composed of 107 places in 517 ms of which 6 ms to minimize.
[2024-05-31 22:45:18] [INFO ] Deduced a trap composed of 223 places in 450 ms of which 6 ms to minimize.
[2024-05-31 22:45:18] [INFO ] Deduced a trap composed of 236 places in 460 ms of which 5 ms to minimize.
[2024-05-31 22:45:19] [INFO ] Deduced a trap composed of 81 places in 529 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/943 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:45:19] [INFO ] Deduced a trap composed of 108 places in 519 ms of which 6 ms to minimize.
[2024-05-31 22:45:20] [INFO ] Deduced a trap composed of 96 places in 523 ms of which 6 ms to minimize.
[2024-05-31 22:45:20] [INFO ] Deduced a trap composed of 80 places in 530 ms of which 6 ms to minimize.
[2024-05-31 22:45:21] [INFO ] Deduced a trap composed of 66 places in 546 ms of which 5 ms to minimize.
[2024-05-31 22:45:21] [INFO ] Deduced a trap composed of 86 places in 524 ms of which 6 ms to minimize.
[2024-05-31 22:45:22] [INFO ] Deduced a trap composed of 117 places in 533 ms of which 6 ms to minimize.
[2024-05-31 22:45:22] [INFO ] Deduced a trap composed of 75 places in 533 ms of which 6 ms to minimize.
[2024-05-31 22:45:23] [INFO ] Deduced a trap composed of 64 places in 476 ms of which 5 ms to minimize.
[2024-05-31 22:45:23] [INFO ] Deduced a trap composed of 189 places in 482 ms of which 6 ms to minimize.
[2024-05-31 22:45:24] [INFO ] Deduced a trap composed of 87 places in 470 ms of which 5 ms to minimize.
[2024-05-31 22:45:24] [INFO ] Deduced a trap composed of 96 places in 512 ms of which 5 ms to minimize.
[2024-05-31 22:45:25] [INFO ] Deduced a trap composed of 106 places in 551 ms of which 5 ms to minimize.
[2024-05-31 22:45:26] [INFO ] Deduced a trap composed of 80 places in 523 ms of which 6 ms to minimize.
[2024-05-31 22:45:26] [INFO ] Deduced a trap composed of 258 places in 456 ms of which 6 ms to minimize.
[2024-05-31 22:45:27] [INFO ] Deduced a trap composed of 129 places in 453 ms of which 6 ms to minimize.
[2024-05-31 22:45:27] [INFO ] Deduced a trap composed of 83 places in 512 ms of which 5 ms to minimize.
[2024-05-31 22:45:28] [INFO ] Deduced a trap composed of 138 places in 452 ms of which 6 ms to minimize.
[2024-05-31 22:45:28] [INFO ] Deduced a trap composed of 77 places in 472 ms of which 5 ms to minimize.
[2024-05-31 22:45:29] [INFO ] Deduced a trap composed of 96 places in 479 ms of which 6 ms to minimize.
[2024-05-31 22:45:29] [INFO ] Deduced a trap composed of 119 places in 462 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/943 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:45:30] [INFO ] Deduced a trap composed of 274 places in 435 ms of which 5 ms to minimize.
[2024-05-31 22:45:30] [INFO ] Deduced a trap composed of 294 places in 449 ms of which 5 ms to minimize.
[2024-05-31 22:45:31] [INFO ] Deduced a trap composed of 138 places in 460 ms of which 6 ms to minimize.
[2024-05-31 22:45:31] [INFO ] Deduced a trap composed of 113 places in 516 ms of which 5 ms to minimize.
[2024-05-31 22:45:32] [INFO ] Deduced a trap composed of 127 places in 500 ms of which 6 ms to minimize.
[2024-05-31 22:45:32] [INFO ] Deduced a trap composed of 214 places in 442 ms of which 6 ms to minimize.
[2024-05-31 22:45:33] [INFO ] Deduced a trap composed of 87 places in 463 ms of which 5 ms to minimize.
[2024-05-31 22:45:33] [INFO ] Deduced a trap composed of 103 places in 498 ms of which 5 ms to minimize.
[2024-05-31 22:45:34] [INFO ] Deduced a trap composed of 102 places in 513 ms of which 5 ms to minimize.
[2024-05-31 22:45:34] [INFO ] Deduced a trap composed of 129 places in 517 ms of which 6 ms to minimize.
[2024-05-31 22:45:35] [INFO ] Deduced a trap composed of 139 places in 491 ms of which 5 ms to minimize.
[2024-05-31 22:45:35] [INFO ] Deduced a trap composed of 90 places in 489 ms of which 5 ms to minimize.
[2024-05-31 22:45:36] [INFO ] Deduced a trap composed of 104 places in 500 ms of which 6 ms to minimize.
[2024-05-31 22:45:36] [INFO ] Deduced a trap composed of 150 places in 516 ms of which 6 ms to minimize.
[2024-05-31 22:45:37] [INFO ] Deduced a trap composed of 95 places in 503 ms of which 6 ms to minimize.
[2024-05-31 22:45:37] [INFO ] Deduced a trap composed of 84 places in 492 ms of which 5 ms to minimize.
[2024-05-31 22:45:38] [INFO ] Deduced a trap composed of 138 places in 460 ms of which 5 ms to minimize.
[2024-05-31 22:45:38] [INFO ] Deduced a trap composed of 152 places in 515 ms of which 5 ms to minimize.
[2024-05-31 22:45:39] [INFO ] Deduced a trap composed of 89 places in 507 ms of which 5 ms to minimize.
[2024-05-31 22:45:39] [INFO ] Deduced a trap composed of 69 places in 520 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/943 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:45:40] [INFO ] Deduced a trap composed of 78 places in 505 ms of which 5 ms to minimize.
[2024-05-31 22:45:41] [INFO ] Deduced a trap composed of 109 places in 505 ms of which 5 ms to minimize.
[2024-05-31 22:45:41] [INFO ] Deduced a trap composed of 298 places in 471 ms of which 5 ms to minimize.
[2024-05-31 22:45:41] [INFO ] Deduced a trap composed of 147 places in 459 ms of which 6 ms to minimize.
[2024-05-31 22:45:42] [INFO ] Deduced a trap composed of 166 places in 503 ms of which 5 ms to minimize.
[2024-05-31 22:45:43] [INFO ] Deduced a trap composed of 75 places in 503 ms of which 6 ms to minimize.
[2024-05-31 22:45:43] [INFO ] Deduced a trap composed of 134 places in 474 ms of which 6 ms to minimize.
[2024-05-31 22:45:44] [INFO ] Deduced a trap composed of 159 places in 526 ms of which 6 ms to minimize.
[2024-05-31 22:45:44] [INFO ] Deduced a trap composed of 171 places in 535 ms of which 6 ms to minimize.
[2024-05-31 22:45:45] [INFO ] Deduced a trap composed of 73 places in 534 ms of which 6 ms to minimize.
[2024-05-31 22:45:45] [INFO ] Deduced a trap composed of 114 places in 495 ms of which 5 ms to minimize.
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 87 places in 499 ms of which 5 ms to minimize.
[2024-05-31 22:45:46] [INFO ] Deduced a trap composed of 138 places in 534 ms of which 5 ms to minimize.
[2024-05-31 22:45:47] [INFO ] Deduced a trap composed of 77 places in 513 ms of which 6 ms to minimize.
[2024-05-31 22:45:47] [INFO ] Deduced a trap composed of 78 places in 515 ms of which 5 ms to minimize.
[2024-05-31 22:45:48] [INFO ] Deduced a trap composed of 85 places in 496 ms of which 6 ms to minimize.
[2024-05-31 22:45:48] [INFO ] Deduced a trap composed of 69 places in 525 ms of which 6 ms to minimize.
[2024-05-31 22:45:49] [INFO ] Deduced a trap composed of 151 places in 507 ms of which 6 ms to minimize.
[2024-05-31 22:45:50] [INFO ] Deduced a trap composed of 75 places in 567 ms of which 6 ms to minimize.
[2024-05-31 22:45:50] [INFO ] Deduced a trap composed of 79 places in 541 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/943 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:45:51] [INFO ] Deduced a trap composed of 254 places in 454 ms of which 5 ms to minimize.
[2024-05-31 22:45:51] [INFO ] Deduced a trap composed of 276 places in 430 ms of which 7 ms to minimize.
[2024-05-31 22:45:52] [INFO ] Deduced a trap composed of 255 places in 441 ms of which 6 ms to minimize.
[2024-05-31 22:45:52] [INFO ] Deduced a trap composed of 271 places in 427 ms of which 5 ms to minimize.
[2024-05-31 22:45:52] [INFO ] Deduced a trap composed of 266 places in 420 ms of which 5 ms to minimize.
[2024-05-31 22:45:53] [INFO ] Deduced a trap composed of 277 places in 448 ms of which 6 ms to minimize.
[2024-05-31 22:45:53] [INFO ] Deduced a trap composed of 267 places in 428 ms of which 5 ms to minimize.
[2024-05-31 22:45:54] [INFO ] Deduced a trap composed of 294 places in 424 ms of which 6 ms to minimize.
[2024-05-31 22:45:54] [INFO ] Deduced a trap composed of 276 places in 419 ms of which 5 ms to minimize.
[2024-05-31 22:45:55] [INFO ] Deduced a trap composed of 262 places in 413 ms of which 5 ms to minimize.
[2024-05-31 22:45:55] [INFO ] Deduced a trap composed of 277 places in 422 ms of which 5 ms to minimize.
[2024-05-31 22:45:56] [INFO ] Deduced a trap composed of 263 places in 420 ms of which 6 ms to minimize.
[2024-05-31 22:45:56] [INFO ] Deduced a trap composed of 294 places in 442 ms of which 5 ms to minimize.
[2024-05-31 22:45:57] [INFO ] Deduced a trap composed of 91 places in 516 ms of which 6 ms to minimize.
[2024-05-31 22:45:57] [INFO ] Deduced a trap composed of 278 places in 422 ms of which 5 ms to minimize.
[2024-05-31 22:45:57] [INFO ] Deduced a trap composed of 274 places in 442 ms of which 5 ms to minimize.
[2024-05-31 22:45:58] [INFO ] Deduced a trap composed of 281 places in 439 ms of which 5 ms to minimize.
[2024-05-31 22:45:58] [INFO ] Deduced a trap composed of 279 places in 555 ms of which 5 ms to minimize.
[2024-05-31 22:45:59] [INFO ] Deduced a trap composed of 117 places in 514 ms of which 11 ms to minimize.
SMT process timed out in 83636ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 9 out of 981 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 981/981 places, 3441/3441 transitions.
Applied a total of 0 rules in 80 ms. Remains 981 /981 variables (removed 0) and now considering 3441/3441 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 981/981 places, 3441/3441 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 981/981 places, 3441/3441 transitions.
Applied a total of 0 rules in 84 ms. Remains 981 /981 variables (removed 0) and now considering 3441/3441 (removed 0) transitions.
[2024-05-31 22:45:59] [INFO ] Flow matrix only has 3045 transitions (discarded 396 similar events)
[2024-05-31 22:45:59] [INFO ] Invariant cache hit.
[2024-05-31 22:46:00] [INFO ] Implicit Places using invariants in 1147 ms returned []
[2024-05-31 22:46:00] [INFO ] Flow matrix only has 3045 transitions (discarded 396 similar events)
[2024-05-31 22:46:00] [INFO ] Invariant cache hit.
[2024-05-31 22:46:01] [INFO ] State equation strengthened by 1878 read => feed constraints.
[2024-05-31 22:46:27] [INFO ] Implicit Places using invariants and state equation in 26201 ms returned []
Implicit Place search using SMT with State Equation took 27353 ms to find 0 implicit places.
[2024-05-31 22:46:27] [INFO ] Redundant transitions in 215 ms returned []
Running 3379 sub problems to find dead transitions.
[2024-05-31 22:46:27] [INFO ] Flow matrix only has 3045 transitions (discarded 396 similar events)
[2024-05-31 22:46:27] [INFO ] Invariant cache hit.
[2024-05-31 22:46:27] [INFO ] State equation strengthened by 1878 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/979 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3379 unsolved
SMT process timed out in 48940ms, After SMT, problems are : Problem set: 0 solved, 3379 unsolved
Search for dead transitions found 0 dead transitions in 49005ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76691 ms. Remains : 981/981 places, 3441/3441 transitions.
Successfully simplified 10 atomic propositions for a total of 11 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 439 stabilizing places and 1161 stable transitions
Graph (complete) has 8615 edges and 1271 vertex of which 1270 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.26 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1271/1271 places, 2794/2794 transitions.
Graph (complete) has 8615 edges and 1271 vertex of which 1270 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 1270 transition count 2778
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 1254 transition count 2778
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 33 place count 1254 transition count 2754
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 81 place count 1230 transition count 2754
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 94 place count 1217 transition count 2737
Iterating global reduction 2 with 13 rules applied. Total rules applied 107 place count 1217 transition count 2737
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 107 place count 1217 transition count 2733
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 115 place count 1213 transition count 2733
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 127 place count 1201 transition count 2681
Iterating global reduction 2 with 12 rules applied. Total rules applied 139 place count 1201 transition count 2681
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 141 place count 1199 transition count 2671
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 1199 transition count 2671
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 201 place count 1170 transition count 2642
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 209 place count 1162 transition count 2634
Iterating global reduction 2 with 8 rules applied. Total rules applied 217 place count 1162 transition count 2634
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 224 place count 1155 transition count 2599
Iterating global reduction 2 with 7 rules applied. Total rules applied 231 place count 1155 transition count 2599
Applied a total of 231 rules in 468 ms. Remains 1155 /1271 variables (removed 116) and now considering 2599/2794 (removed 195) transitions.
[2024-05-31 22:47:16] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1155 cols
[2024-05-31 22:47:16] [INFO ] Computed 62 invariants in 42 ms
[2024-05-31 22:47:18] [INFO ] Implicit Places using invariants in 1088 ms returned [93, 345, 386, 387, 388, 445, 500, 501, 531, 532, 648, 692, 718, 719, 729, 829, 1046, 1047]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1091 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1137/1271 places, 2599/2794 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1126 transition count 2588
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1126 transition count 2588
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1115 transition count 2577
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1115 transition count 2577
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 1109 transition count 2547
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 1109 transition count 2547
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 1103 transition count 2541
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 1097 transition count 2535
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 1097 transition count 2535
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 1092 transition count 2510
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 1092 transition count 2510
Applied a total of 90 rules in 285 ms. Remains 1092 /1137 variables (removed 45) and now considering 2510/2599 (removed 89) transitions.
[2024-05-31 22:47:18] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1092 cols
[2024-05-31 22:47:18] [INFO ] Computed 44 invariants in 27 ms
[2024-05-31 22:47:19] [INFO ] Implicit Places using invariants in 976 ms returned []
[2024-05-31 22:47:19] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
[2024-05-31 22:47:19] [INFO ] Invariant cache hit.
[2024-05-31 22:47:20] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-31 22:47:29] [INFO ] Implicit Places using invariants and state equation in 10295 ms returned [1084]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11275 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1091/1271 places, 2510/2794 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 1091 transition count 2509
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1090 transition count 2509
Applied a total of 2 rules in 81 ms. Remains 1090 /1091 variables (removed 1) and now considering 2509/2510 (removed 1) transitions.
[2024-05-31 22:47:29] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1090 cols
[2024-05-31 22:47:29] [INFO ] Computed 43 invariants in 33 ms
[2024-05-31 22:47:30] [INFO ] Implicit Places using invariants in 963 ms returned []
[2024-05-31 22:47:30] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-31 22:47:30] [INFO ] Invariant cache hit.
[2024-05-31 22:47:31] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-31 22:47:40] [INFO ] Implicit Places using invariants and state equation in 9776 ms returned []
Implicit Place search using SMT with State Equation took 10741 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1090/1271 places, 2509/2794 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 23943 ms. Remains : 1090/1271 places, 2509/2794 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-01
Product exploration explored 100000 steps with 2722 reset in 657 ms.
Product exploration explored 100000 steps with 2724 reset in 562 ms.
Computed a total of 275 stabilizing places and 893 stable transitions
Computed a total of 275 stabilizing places and 893 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 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32133 steps (873 resets) in 282 ms. (113 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1090/1090 places, 2509/2509 transitions.
Applied a total of 0 rules in 75 ms. Remains 1090 /1090 variables (removed 0) and now considering 2509/2509 (removed 0) transitions.
[2024-05-31 22:47:42] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-31 22:47:42] [INFO ] Invariant cache hit.
[2024-05-31 22:47:43] [INFO ] Implicit Places using invariants in 933 ms returned []
[2024-05-31 22:47:43] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-31 22:47:43] [INFO ] Invariant cache hit.
[2024-05-31 22:47:44] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-31 22:47:53] [INFO ] Implicit Places using invariants and state equation in 9905 ms returned []
Implicit Place search using SMT with State Equation took 10848 ms to find 0 implicit places.
[2024-05-31 22:47:53] [INFO ] Redundant transitions in 58 ms returned []
Running 2492 sub problems to find dead transitions.
[2024-05-31 22:47:53] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-31 22:47:53] [INFO ] Invariant cache hit.
[2024-05-31 22:47:53] [INFO ] State equation strengthened by 834 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2492 unsolved
SMT process timed out in 32997ms, After SMT, problems are : Problem set: 0 solved, 2492 unsolved
Search for dead transitions found 0 dead transitions in 33023ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44022 ms. Remains : 1090/1090 places, 2509/2509 transitions.
Computed a total of 275 stabilizing places and 893 stable transitions
Computed a total of 275 stabilizing places and 893 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 19354 steps (524 resets) in 122 ms. (157 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2726 reset in 477 ms.
Product exploration explored 100000 steps with 2728 reset in 521 ms.
Support contains 2 out of 1090 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1090/1090 places, 2509/2509 transitions.
Applied a total of 0 rules in 64 ms. Remains 1090 /1090 variables (removed 0) and now considering 2509/2509 (removed 0) transitions.
[2024-05-31 22:48:28] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-31 22:48:28] [INFO ] Invariant cache hit.
[2024-05-31 22:48:29] [INFO ] Implicit Places using invariants in 906 ms returned []
[2024-05-31 22:48:29] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-31 22:48:29] [INFO ] Invariant cache hit.
[2024-05-31 22:48:29] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-31 22:48:39] [INFO ] Implicit Places using invariants and state equation in 10677 ms returned []
Implicit Place search using SMT with State Equation took 11585 ms to find 0 implicit places.
[2024-05-31 22:48:39] [INFO ] Redundant transitions in 135 ms returned []
Running 2492 sub problems to find dead transitions.
[2024-05-31 22:48:39] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-31 22:48:39] [INFO ] Invariant cache hit.
[2024-05-31 22:48:39] [INFO ] State equation strengthened by 834 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2492 unsolved
SMT process timed out in 32811ms, After SMT, problems are : Problem set: 0 solved, 2492 unsolved
Search for dead transitions found 0 dead transitions in 32837ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44637 ms. Remains : 1090/1090 places, 2509/2509 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-01 finished in 116583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (F(p1) U p2)))'
Support contains 5 out of 1271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1271/1271 places, 2794/2794 transitions.
Graph (complete) has 8615 edges and 1271 vertex of which 1270 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 1270 transition count 2778
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 1254 transition count 2778
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 33 place count 1254 transition count 2754
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 81 place count 1230 transition count 2754
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 92 place count 1219 transition count 2739
Iterating global reduction 2 with 11 rules applied. Total rules applied 103 place count 1219 transition count 2739
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 103 place count 1219 transition count 2735
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 111 place count 1215 transition count 2735
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 121 place count 1205 transition count 2693
Iterating global reduction 2 with 10 rules applied. Total rules applied 131 place count 1205 transition count 2693
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 1203 transition count 2683
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 1203 transition count 2683
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 193 place count 1174 transition count 2654
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 201 place count 1166 transition count 2646
Iterating global reduction 2 with 8 rules applied. Total rules applied 209 place count 1166 transition count 2646
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 216 place count 1159 transition count 2611
Iterating global reduction 2 with 7 rules applied. Total rules applied 223 place count 1159 transition count 2611
Applied a total of 223 rules in 360 ms. Remains 1159 /1271 variables (removed 112) and now considering 2611/2794 (removed 183) transitions.
[2024-05-31 22:49:13] [INFO ] Flow matrix only has 2339 transitions (discarded 272 similar events)
// Phase 1: matrix 2339 rows 1159 cols
[2024-05-31 22:49:13] [INFO ] Computed 62 invariants in 68 ms
[2024-05-31 22:49:14] [INFO ] Implicit Places using invariants in 1083 ms returned [93, 345, 386, 387, 448, 503, 504, 534, 535, 581, 648, 693, 720, 721, 731, 1050, 1051]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 1085 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1142/1271 places, 2611/2794 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1132 transition count 2601
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1132 transition count 2601
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 1123 transition count 2592
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 1123 transition count 2592
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 1120 transition count 2577
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 1120 transition count 2577
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 56 place count 1114 transition count 2571
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 1108 transition count 2565
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 1108 transition count 2565
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 74 place count 1102 transition count 2535
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 1102 transition count 2535
Applied a total of 80 rules in 289 ms. Remains 1102 /1142 variables (removed 40) and now considering 2535/2611 (removed 76) transitions.
[2024-05-31 22:49:14] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1102 cols
[2024-05-31 22:49:14] [INFO ] Computed 45 invariants in 26 ms
[2024-05-31 22:49:15] [INFO ] Implicit Places using invariants in 954 ms returned []
[2024-05-31 22:49:15] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-31 22:49:15] [INFO ] Invariant cache hit.
[2024-05-31 22:49:16] [INFO ] State equation strengthened by 850 read => feed constraints.
[2024-05-31 22:49:26] [INFO ] Implicit Places using invariants and state equation in 10400 ms returned []
Implicit Place search using SMT with State Equation took 11358 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1102/1271 places, 2535/2794 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13093 ms. Remains : 1102/1271 places, 2535/2794 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-03
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-03 finished in 13291 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(F((p1||G(p2)))))))'
Support contains 5 out of 1271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1271/1271 places, 2794/2794 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1270 transition count 2794
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 1251 transition count 2771
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 1251 transition count 2771
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 57 place count 1233 transition count 2717
Iterating global reduction 1 with 18 rules applied. Total rules applied 75 place count 1233 transition count 2717
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 83 place count 1225 transition count 2677
Iterating global reduction 1 with 8 rules applied. Total rules applied 91 place count 1225 transition count 2677
Applied a total of 91 rules in 143 ms. Remains 1225 /1271 variables (removed 46) and now considering 2677/2794 (removed 117) transitions.
[2024-05-31 22:49:26] [INFO ] Flow matrix only has 2405 transitions (discarded 272 similar events)
// Phase 1: matrix 2405 rows 1225 cols
[2024-05-31 22:49:26] [INFO ] Computed 62 invariants in 32 ms
[2024-05-31 22:49:27] [INFO ] Implicit Places using invariants in 1098 ms returned [101, 370, 413, 414, 478, 536, 537, 570, 571, 621, 691, 767, 781, 884, 1104, 1105]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1100 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1209/1271 places, 2677/2794 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1194 transition count 2662
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1194 transition count 2662
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1179 transition count 2647
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1179 transition count 2647
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 74 place count 1165 transition count 2633
Iterating global reduction 0 with 14 rules applied. Total rules applied 88 place count 1165 transition count 2633
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 1157 transition count 2593
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 1157 transition count 2593
Applied a total of 104 rules in 169 ms. Remains 1157 /1209 variables (removed 52) and now considering 2593/2677 (removed 84) transitions.
[2024-05-31 22:49:27] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1157 cols
[2024-05-31 22:49:27] [INFO ] Computed 46 invariants in 26 ms
[2024-05-31 22:49:28] [INFO ] Implicit Places using invariants in 994 ms returned []
[2024-05-31 22:49:28] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
[2024-05-31 22:49:28] [INFO ] Invariant cache hit.
[2024-05-31 22:49:29] [INFO ] State equation strengthened by 854 read => feed constraints.
[2024-05-31 22:49:41] [INFO ] Implicit Places using invariants and state equation in 12504 ms returned []
Implicit Place search using SMT with State Equation took 13509 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1157/1271 places, 2593/2794 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14922 ms. Remains : 1157/1271 places, 2593/2794 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 611 ms.
Product exploration explored 100000 steps with 50000 reset in 636 ms.
Computed a total of 325 stabilizing places and 960 stable transitions
Computed a total of 325 stabilizing places and 960 stable transitions
Detected a total of 325/1157 stabilizing places and 960/2593 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-08 finished in 16321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1271/1271 places, 2794/2794 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1271 transition count 2778
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 1255 transition count 2778
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 32 place count 1255 transition count 2754
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 80 place count 1231 transition count 2754
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 93 place count 1218 transition count 2737
Iterating global reduction 2 with 13 rules applied. Total rules applied 106 place count 1218 transition count 2737
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 106 place count 1218 transition count 2733
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 114 place count 1214 transition count 2733
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 126 place count 1202 transition count 2681
Iterating global reduction 2 with 12 rules applied. Total rules applied 138 place count 1202 transition count 2681
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 1200 transition count 2671
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 1200 transition count 2671
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 200 place count 1171 transition count 2642
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 208 place count 1163 transition count 2634
Iterating global reduction 2 with 8 rules applied. Total rules applied 216 place count 1163 transition count 2634
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 223 place count 1156 transition count 2599
Iterating global reduction 2 with 7 rules applied. Total rules applied 230 place count 1156 transition count 2599
Applied a total of 230 rules in 327 ms. Remains 1156 /1271 variables (removed 115) and now considering 2599/2794 (removed 195) transitions.
[2024-05-31 22:49:42] [INFO ] Flow matrix only has 2327 transitions (discarded 272 similar events)
// Phase 1: matrix 2327 rows 1156 cols
[2024-05-31 22:49:42] [INFO ] Computed 63 invariants in 27 ms
[2024-05-31 22:49:43] [INFO ] Implicit Places using invariants in 983 ms returned [93, 345, 386, 387, 388, 445, 500, 501, 531, 532, 578, 645, 689, 715, 716, 726, 826, 1044]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 990 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1138/1271 places, 2599/2794 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1127 transition count 2588
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1127 transition count 2588
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1116 transition count 2577
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1116 transition count 2577
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 1111 transition count 2552
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 1111 transition count 2552
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 66 place count 1105 transition count 2546
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 1099 transition count 2540
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 1099 transition count 2540
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 84 place count 1093 transition count 2510
Iterating global reduction 0 with 6 rules applied. Total rules applied 90 place count 1093 transition count 2510
Applied a total of 90 rules in 291 ms. Remains 1093 /1138 variables (removed 45) and now considering 2510/2599 (removed 89) transitions.
[2024-05-31 22:49:44] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1093 cols
[2024-05-31 22:49:44] [INFO ] Computed 45 invariants in 33 ms
[2024-05-31 22:49:45] [INFO ] Implicit Places using invariants in 961 ms returned []
[2024-05-31 22:49:45] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
[2024-05-31 22:49:45] [INFO ] Invariant cache hit.
[2024-05-31 22:49:45] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-31 22:49:54] [INFO ] Implicit Places using invariants and state equation in 9822 ms returned [1071]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10792 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1092/1271 places, 2510/2794 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 1092 transition count 2509
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1091 transition count 2509
Applied a total of 2 rules in 77 ms. Remains 1091 /1092 variables (removed 1) and now considering 2509/2510 (removed 1) transitions.
[2024-05-31 22:49:55] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
// Phase 1: matrix 2237 rows 1091 cols
[2024-05-31 22:49:55] [INFO ] Computed 44 invariants in 28 ms
[2024-05-31 22:49:56] [INFO ] Implicit Places using invariants in 951 ms returned []
[2024-05-31 22:49:56] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-31 22:49:56] [INFO ] Invariant cache hit.
[2024-05-31 22:49:56] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-31 22:50:06] [INFO ] Implicit Places using invariants and state equation in 10611 ms returned []
Implicit Place search using SMT with State Equation took 11568 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1091/1271 places, 2509/2794 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 24046 ms. Remains : 1091/1271 places, 2509/2794 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-10
Product exploration explored 100000 steps with 2732 reset in 472 ms.
Product exploration explored 100000 steps with 2728 reset in 498 ms.
Computed a total of 276 stabilizing places and 893 stable transitions
Graph (complete) has 7974 edges and 1091 vertex of which 1090 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 276 stabilizing places and 893 stable transitions
Detected a total of 276/1091 stabilizing places and 893/2509 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 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 28996 steps (788 resets) in 194 ms. (148 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 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1091/1091 places, 2509/2509 transitions.
Applied a total of 0 rules in 66 ms. Remains 1091 /1091 variables (removed 0) and now considering 2509/2509 (removed 0) transitions.
[2024-05-31 22:50:08] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-31 22:50:08] [INFO ] Invariant cache hit.
[2024-05-31 22:50:09] [INFO ] Implicit Places using invariants in 919 ms returned []
[2024-05-31 22:50:09] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-31 22:50:09] [INFO ] Invariant cache hit.
[2024-05-31 22:50:09] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-31 22:50:20] [INFO ] Implicit Places using invariants and state equation in 11068 ms returned []
Implicit Place search using SMT with State Equation took 11988 ms to find 0 implicit places.
[2024-05-31 22:50:20] [INFO ] Redundant transitions in 73 ms returned []
Running 2492 sub problems to find dead transitions.
[2024-05-31 22:50:20] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-31 22:50:20] [INFO ] Invariant cache hit.
[2024-05-31 22:50:20] [INFO ] State equation strengthened by 834 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2492 unsolved
SMT process timed out in 33077ms, After SMT, problems are : Problem set: 0 solved, 2492 unsolved
Search for dead transitions found 0 dead transitions in 33101ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45244 ms. Remains : 1091/1091 places, 2509/2509 transitions.
Computed a total of 276 stabilizing places and 893 stable transitions
Graph (complete) has 7974 edges and 1091 vertex of which 1090 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 276 stabilizing places and 893 stable transitions
Detected a total of 276/1091 stabilizing places and 893/2509 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 19653 steps (534 resets) in 147 ms. (132 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 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2732 reset in 517 ms.
Product exploration explored 100000 steps with 2729 reset in 524 ms.
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1091/1091 places, 2509/2509 transitions.
Applied a total of 0 rules in 64 ms. Remains 1091 /1091 variables (removed 0) and now considering 2509/2509 (removed 0) transitions.
[2024-05-31 22:50:55] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-31 22:50:55] [INFO ] Invariant cache hit.
[2024-05-31 22:50:56] [INFO ] Implicit Places using invariants in 949 ms returned []
[2024-05-31 22:50:56] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-31 22:50:56] [INFO ] Invariant cache hit.
[2024-05-31 22:50:56] [INFO ] State equation strengthened by 834 read => feed constraints.
[2024-05-31 22:51:07] [INFO ] Implicit Places using invariants and state equation in 11242 ms returned []
Implicit Place search using SMT with State Equation took 12208 ms to find 0 implicit places.
[2024-05-31 22:51:07] [INFO ] Redundant transitions in 71 ms returned []
Running 2492 sub problems to find dead transitions.
[2024-05-31 22:51:07] [INFO ] Flow matrix only has 2237 transitions (discarded 272 similar events)
[2024-05-31 22:51:07] [INFO ] Invariant cache hit.
[2024-05-31 22:51:07] [INFO ] State equation strengthened by 834 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2492 unsolved
SMT process timed out in 32891ms, After SMT, problems are : Problem set: 0 solved, 2492 unsolved
Search for dead transitions found 0 dead transitions in 32915ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45276 ms. Remains : 1091/1091 places, 2509/2509 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-10 finished in 118058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1271/1271 places, 2794/2794 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1270 transition count 2794
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 1249 transition count 2769
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 1249 transition count 2769
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 63 place count 1229 transition count 2713
Iterating global reduction 1 with 20 rules applied. Total rules applied 83 place count 1229 transition count 2713
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 1219 transition count 2663
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 1219 transition count 2663
Applied a total of 103 rules in 138 ms. Remains 1219 /1271 variables (removed 52) and now considering 2663/2794 (removed 131) transitions.
[2024-05-31 22:51:40] [INFO ] Flow matrix only has 2391 transitions (discarded 272 similar events)
// Phase 1: matrix 2391 rows 1219 cols
[2024-05-31 22:51:40] [INFO ] Computed 62 invariants in 31 ms
[2024-05-31 22:51:41] [INFO ] Implicit Places using invariants in 1082 ms returned [101, 370, 411, 412, 413, 475, 534, 569, 570, 620, 690, 736, 764, 765, 775, 878, 1098, 1099]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 1086 ms to find 18 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1201/1271 places, 2663/2794 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1185 transition count 2647
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1185 transition count 2647
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 48 place count 1169 transition count 2631
Iterating global reduction 0 with 16 rules applied. Total rules applied 64 place count 1169 transition count 2631
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 80 place count 1153 transition count 2615
Iterating global reduction 0 with 16 rules applied. Total rules applied 96 place count 1153 transition count 2615
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 106 place count 1143 transition count 2565
Iterating global reduction 0 with 10 rules applied. Total rules applied 116 place count 1143 transition count 2565
Applied a total of 116 rules in 162 ms. Remains 1143 /1201 variables (removed 58) and now considering 2565/2663 (removed 98) transitions.
[2024-05-31 22:51:42] [INFO ] Flow matrix only has 2293 transitions (discarded 272 similar events)
// Phase 1: matrix 2293 rows 1143 cols
[2024-05-31 22:51:42] [INFO ] Computed 44 invariants in 28 ms
[2024-05-31 22:51:43] [INFO ] Implicit Places using invariants in 978 ms returned []
[2024-05-31 22:51:43] [INFO ] Flow matrix only has 2293 transitions (discarded 272 similar events)
[2024-05-31 22:51:43] [INFO ] Invariant cache hit.
[2024-05-31 22:51:43] [INFO ] State equation strengthened by 838 read => feed constraints.
[2024-05-31 22:51:55] [INFO ] Implicit Places using invariants and state equation in 12285 ms returned [1130]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 13281 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1142/1271 places, 2565/2794 transitions.
Applied a total of 0 rules in 33 ms. Remains 1142 /1142 variables (removed 0) and now considering 2565/2565 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 14701 ms. Remains : 1142/1271 places, 2565/2794 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1362 steps with 26 reset in 6 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-14 finished in 14868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-31 22:51:55] [INFO ] Flatten gal took : 114 ms
[2024-05-31 22:51:55] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-31 22:51:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1271 places, 2794 transitions and 12324 arcs took 20 ms.
Total runtime 542716 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717196332454

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-01
ltl formula formula --ltl=/tmp/1706/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1271 places, 2794 transitions and 12324 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.270 real 0.090 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1706/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1706/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1706/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1706/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1272 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1272, there are 2797 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~60 levels ~10000 states ~13076 transitions
pnml2lts-mc( 0/ 4): ~60 levels ~20000 states ~26020 transitions
pnml2lts-mc( 1/ 4): ~55 levels ~40000 states ~51688 transitions
pnml2lts-mc( 1/ 4): ~55 levels ~80000 states ~103328 transitions
pnml2lts-mc( 1/ 4): ~55 levels ~160000 states ~208260 transitions
pnml2lts-mc( 1/ 4): ~59 levels ~320000 states ~418708 transitions
pnml2lts-mc( 1/ 4): ~59 levels ~640000 states ~846020 transitions
pnml2lts-mc( 0/ 4): ~62 levels ~1280000 states ~1696836 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1940531
pnml2lts-mc( 0/ 4): unique states count: 1940531
pnml2lts-mc( 0/ 4): unique transitions count: 2581454
pnml2lts-mc( 0/ 4): - self-loop count: 8146
pnml2lts-mc( 0/ 4): - claim dead count: 634450
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1941953
pnml2lts-mc( 0/ 4): - cum. max stack depth: 244
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1941953 states 2585747 transitions, fanout: 1.332
pnml2lts-mc( 0/ 4): Total exploration time 210.650 sec (210.650 sec minimum, 210.650 sec on average)
pnml2lts-mc( 0/ 4): States per second: 9219, Transitions per second: 12275
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 16.8MB, 9.1 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 5.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 2851 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 16.8MB (~256.0MB paged-in)
ltl formula name MultiCrashLeafsetExtension-PT-S16C05-LTLCardinality-10
ltl formula formula --ltl=/tmp/1706/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1271 places, 2794 transitions and 12324 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.110 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1706/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1706/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1706/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1706/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1272 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1272, there are 2797 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~55 levels ~10000 states ~13304 transitions
pnml2lts-mc( 0/ 4): ~59 levels ~20000 states ~26104 transitions
pnml2lts-mc( 3/ 4): ~55 levels ~40000 states ~51732 transitions
pnml2lts-mc( 3/ 4): ~55 levels ~80000 states ~103284 transitions
pnml2lts-mc( 0/ 4): ~59 levels ~160000 states ~208652 transitions
pnml2lts-mc( 0/ 4): ~59 levels ~320000 states ~419896 transitions
pnml2lts-mc( 0/ 4): ~60 levels ~640000 states ~844000 transitions
pnml2lts-mc( 0/ 4): ~60 levels ~1280000 states ~1697796 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1939807
pnml2lts-mc( 0/ 4): unique states count: 1939807
pnml2lts-mc( 0/ 4): unique transitions count: 2580730
pnml2lts-mc( 0/ 4): - self-loop count: 8142
pnml2lts-mc( 0/ 4): - claim dead count: 634163
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1940938
pnml2lts-mc( 0/ 4): - cum. max stack depth: 245
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1940938 states 2584174 transitions, fanout: 1.331
pnml2lts-mc( 0/ 4): Total exploration time 203.260 sec (203.260 sec minimum, 203.260 sec on average)
pnml2lts-mc( 0/ 4): States per second: 9549, Transitions per second: 12714
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 16.8MB, 9.1 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 5.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 2851 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 16.8MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654350700027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C05.tgz
mv MultiCrashLeafsetExtension-PT-S16C05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;