fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r245-tall-171654349000012
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for MultiCrashLeafsetExtension-PT-S16C03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15495.588 1204492.00 1790616.00 2393.00 FTTF?TFTFFTTFFFF 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.r245-tall-171654349000012.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 greatspnxred
Input is MultiCrashLeafsetExtension-PT-S16C03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349000012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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 28K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 07:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 07:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 12 07:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 07:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K 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 3.5M 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-S16C03-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716564243107

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 15:24:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 15:24:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:24:04] [INFO ] Load time of PNML (sax parser for PT used): 286 ms
[2024-05-24 15:24:04] [INFO ] Transformed 3606 places.
[2024-05-24 15:24:04] [INFO ] Transformed 5141 transitions.
[2024-05-24 15:24:04] [INFO ] Parsed PT model containing 3606 places and 5141 transitions and 20838 arcs in 445 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 3606 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3606/3606 places, 5141/5141 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 3580 transition count 5141
Discarding 805 places :
Symmetric choice reduction at 1 with 805 rule applications. Total rules 831 place count 2775 transition count 4336
Iterating global reduction 1 with 805 rules applied. Total rules applied 1636 place count 2775 transition count 4336
Discarding 702 places :
Symmetric choice reduction at 1 with 702 rule applications. Total rules 2338 place count 2073 transition count 3634
Iterating global reduction 1 with 702 rules applied. Total rules applied 3040 place count 2073 transition count 3634
Discarding 225 places :
Symmetric choice reduction at 1 with 225 rule applications. Total rules 3265 place count 1848 transition count 2959
Iterating global reduction 1 with 225 rules applied. Total rules applied 3490 place count 1848 transition count 2959
Applied a total of 3490 rules in 799 ms. Remains 1848 /3606 variables (removed 1758) and now considering 2959/5141 (removed 2182) transitions.
[2024-05-24 15:24:05] [INFO ] Flow matrix only has 2687 transitions (discarded 272 similar events)
// Phase 1: matrix 2687 rows 1848 cols
[2024-05-24 15:24:05] [INFO ] Computed 433 invariants in 124 ms
[2024-05-24 15:24:07] [INFO ] Implicit Places using invariants in 2180 ms returned [4, 8, 12, 14, 16, 18, 23, 30, 39, 50, 63, 78, 94, 110, 112, 116, 132, 143, 152, 159, 164, 167, 182, 189, 192, 193, 194, 195, 198, 203, 210, 219, 230, 243, 257, 271, 272, 273, 274, 285, 294, 301, 306, 309, 311, 326, 333, 338, 339, 340, 344, 347, 352, 359, 368, 379, 391, 403, 404, 405, 406, 415, 422, 430, 432, 434, 449, 456, 459, 460, 461, 462, 464, 466, 469, 474, 481, 490, 500, 510, 511, 512, 513, 520, 525, 528, 530, 532, 534, 549, 556, 559, 560, 561, 562, 564, 566, 568, 571, 576, 583, 591, 600, 601, 602, 607, 610, 612, 616, 618, 620, 635, 642, 646, 647, 648, 650, 652, 657, 659, 662, 667, 673, 679, 680, 681, 682, 685, 687, 689, 691, 693, 695, 710, 717, 720, 721, 722, 723, 725, 727, 729, 731, 733, 736, 740, 744, 745, 746, 747, 749, 751, 753, 755, 757, 759, 774, 781, 784, 785, 786, 787, 789, 791, 793, 795, 797, 799, 801, 804, 806, 807, 809, 811, 813, 817, 819, 821, 836, 838, 842, 845, 846, 847, 848, 850, 852, 854, 856, 858, 860, 862, 866, 867, 868, 870, 872, 874, 876, 880, 882, 897, 904, 907, 908, 909, 910, 912, 914, 916, 918, 920, 922, 924, 927, 928, 930, 932, 934, 936, 938, 940, 942, 959, 966, 969, 970, 971, 972, 974, 976, 978, 980, 982, 984, 987, 992, 993, 995, 999, 1001, 1003, 1007, 1009, 1011, 1033, 1036, 1038, 1039, 1041, 1043, 1045, 1049, 1051, 1054, 1059, 1066, 1067, 1068, 1069, 1077, 1079, 1081, 1083, 1085, 1100, 1107, 1110, 1111, 1112, 1113, 1115, 1117, 1119, 1121, 1124, 1129, 1136, 1145, 1146, 1147, 1148, 1155, 1160, 1163, 1165, 1167, 1169, 1191, 1194, 1195, 1196, 1197, 1199, 1201, 1203, 1206, 1211, 1218, 1227, 1238, 1239, 1240, 1241, 1250, 1257, 1265, 1267, 1269, 1291, 1294, 1295, 1296, 1297, 1299, 1301, 1304, 1309, 1316, 1325, 1336, 1349, 1350, 1351, 1352, 1363, 1372, 1379, 1384, 1387, 1389, 1404, 1411, 1414, 1417, 1419, 1422, 1430, 1437, 1446, 1457, 1472, 1487, 1488, 1489, 1490, 1503, 1514, 1523, 1530, 1535, 1553, 1555, 1559, 1563, 1564, 1565, 1571, 1576, 1583, 1592, 1603, 1616, 1631, 1648, 1649, 1650, 1651, 1666, 1679, 1690, 1699, 1706, 1711]
[2024-05-24 15:24:07] [INFO ] Actually due to overlaps returned [182, 326, 449, 549, 635, 710, 774, 836, 897, 959, 1100, 1404, 1553, 4, 12, 14, 16, 110, 112, 116, 143, 152, 167, 192, 193, 194, 271, 272, 273, 274, 294, 301, 311, 338, 339, 403, 404, 405, 406, 422, 434, 459, 460, 461, 510, 511, 512, 513, 525, 528, 534, 559, 560, 561, 600, 601, 602, 610, 612, 620, 646, 647, 679, 680, 681, 682, 687, 689, 695, 720, 721, 722, 744, 745, 746, 747, 751, 753, 759, 784, 785, 786, 804, 806, 807, 811, 813, 821, 838, 845, 846, 847, 866, 867, 868, 872, 874, 882, 907, 908, 909, 927, 928, 930, 934, 936, 942, 969, 970, 971, 992, 993, 1001, 1003, 1011, 1036, 1038, 1066, 1067, 1068, 1077, 1079, 1085, 1110, 1111, 1112, 1145, 1146, 1147, 1155, 1163, 1169, 1194, 1195, 1196, 1238, 1239, 1240, 1250, 1269, 1294, 1295, 1296, 1349, 1350, 1351, 1363, 1379, 1384, 1389, 1414, 1487, 1488, 1489, 1503, 1523, 1530, 1555, 1563, 1564, 1648, 1649, 1650, 1666, 1690, 1699]
Discarding 166 places :
Implicit Place search using SMT only with invariants took 2216 ms to find 166 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1682/3606 places, 2959/5141 transitions.
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 84 place count 1598 transition count 2875
Iterating global reduction 0 with 84 rules applied. Total rules applied 168 place count 1598 transition count 2875
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 252 place count 1514 transition count 2791
Iterating global reduction 0 with 84 rules applied. Total rules applied 336 place count 1514 transition count 2791
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 419 place count 1431 transition count 2708
Iterating global reduction 0 with 83 rules applied. Total rules applied 502 place count 1431 transition count 2708
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 522 place count 1411 transition count 2648
Iterating global reduction 0 with 20 rules applied. Total rules applied 542 place count 1411 transition count 2648
Applied a total of 542 rules in 278 ms. Remains 1411 /1682 variables (removed 271) and now considering 2648/2959 (removed 311) transitions.
[2024-05-24 15:24:08] [INFO ] Flow matrix only has 2376 transitions (discarded 272 similar events)
// Phase 1: matrix 2376 rows 1411 cols
[2024-05-24 15:24:08] [INFO ] Computed 267 invariants in 47 ms
[2024-05-24 15:24:09] [INFO ] Implicit Places using invariants in 1245 ms returned [7, 14, 19, 26, 35, 46, 59, 74, 90, 125, 150, 155, 178, 180, 183, 188, 195, 204, 215, 228, 242, 266, 285, 288, 300, 305, 309, 312, 317, 324, 333, 344, 356, 375, 389, 391, 403, 405, 407, 409, 412, 417, 424, 433, 443, 458, 466, 468, 478, 480, 482, 484, 486, 489, 494, 501, 509, 522, 529, 531, 543, 547, 549, 551, 556, 558, 561, 566, 572, 579, 583, 585, 597, 599, 601, 603, 605, 607, 609, 612, 616, 620, 624, 626, 636, 638, 640, 642, 644, 646, 648, 650, 652, 657, 663, 665, 675, 677, 679, 681, 683, 685, 687, 689, 691, 696, 700, 704, 716, 718, 720, 722, 724, 726, 728, 730, 732, 737, 741, 743, 757, 759, 761, 763, 765, 767, 769, 771, 774, 780, 784, 790, 792, 805, 809, 811, 813, 815, 819, 821, 824, 829, 835, 845, 847, 859, 861, 863, 865, 867, 869, 872, 877, 884, 892, 903, 907, 909, 920, 922, 924, 926, 928, 931, 936, 943, 952, 962, 977, 985, 987, 998, 1000, 1002, 1004, 1007, 1012, 1019, 1028, 1039, 1052, 1071, 1084, 1095, 1100, 1102, 1105, 1113, 1120, 1129, 1140, 1155, 1169, 1192, 1211, 1225, 1229, 1235, 1240, 1247, 1256, 1267, 1280, 1295, 1311, 1338, 1363, 1368]
Discarding 208 places :
Implicit Place search using SMT only with invariants took 1257 ms to find 208 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1203/3606 places, 2648/5141 transitions.
Applied a total of 0 rules in 55 ms. Remains 1203 /1203 variables (removed 0) and now considering 2648/2648 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 4627 ms. Remains : 1203/3606 places, 2648/5141 transitions.
Support contains 68 out of 1203 places after structural reductions.
[2024-05-24 15:24:09] [INFO ] Flatten gal took : 203 ms
[2024-05-24 15:24:10] [INFO ] Flatten gal took : 135 ms
[2024-05-24 15:24:10] [INFO ] Input system was already deterministic with 2648 transitions.
Support contains 67 out of 1203 places (down from 68) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (1267 resets) in 2535 ms. (15 steps per ms) remains 20/31 properties
BEST_FIRST walk for 4003 steps (31 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (31 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (31 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (31 resets) in 38 ms. (102 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (31 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (31 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (31 resets) in 48 ms. (81 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (31 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 47 ms. (83 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (31 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (32 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (31 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (31 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
[2024-05-24 15:24:11] [INFO ] Flow matrix only has 2376 transitions (discarded 272 similar events)
// Phase 1: matrix 2376 rows 1203 cols
[2024-05-24 15:24:11] [INFO ] Computed 59 invariants in 36 ms
[2024-05-24 15:24:11] [INFO ] State equation strengthened by 872 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 2 (OVERLAPS) 828/872 variables, 15/17 constraints. Problems are: Problem set: 4 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/872 variables, 0/17 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 2/874 variables, 2/19 constraints. Problems are: Problem set: 4 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 16 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 6 (OVERLAPS) 313/1187 variables, 24/43 constraints. Problems are: Problem set: 5 solved, 15 unsolved
[2024-05-24 15:24:13] [INFO ] Deduced a trap composed of 265 places in 602 ms of which 68 ms to minimize.
[2024-05-24 15:24:13] [INFO ] Deduced a trap composed of 256 places in 564 ms of which 9 ms to minimize.
[2024-05-24 15:24:14] [INFO ] Deduced a trap composed of 300 places in 513 ms of which 7 ms to minimize.
[2024-05-24 15:24:14] [INFO ] Deduced a trap composed of 142 places in 549 ms of which 7 ms to minimize.
[2024-05-24 15:24:15] [INFO ] Deduced a trap composed of 242 places in 516 ms of which 7 ms to minimize.
[2024-05-24 15:24:15] [INFO ] Deduced a trap composed of 306 places in 556 ms of which 8 ms to minimize.
[2024-05-24 15:24:16] [INFO ] Deduced a trap composed of 133 places in 524 ms of which 8 ms to minimize.
[2024-05-24 15:24:17] [INFO ] Deduced a trap composed of 126 places in 549 ms of which 7 ms to minimize.
SMT process timed out in 5613ms, After SMT, problems are : Problem set: 5 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 2648/2648 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1203 transition count 2639
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 1194 transition count 2639
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 18 place count 1194 transition count 2625
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 46 place count 1180 transition count 2625
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 54 place count 1172 transition count 2615
Iterating global reduction 2 with 8 rules applied. Total rules applied 62 place count 1172 transition count 2615
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 62 place count 1172 transition count 2612
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 1169 transition count 2612
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 1162 transition count 2591
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 1162 transition count 2591
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 126 place count 1140 transition count 2569
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 129 place count 1137 transition count 2566
Iterating global reduction 2 with 3 rules applied. Total rules applied 132 place count 1137 transition count 2566
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 135 place count 1134 transition count 2557
Iterating global reduction 2 with 3 rules applied. Total rules applied 138 place count 1134 transition count 2557
Free-agglomeration rule (complex) applied 141 times.
Iterating global reduction 2 with 141 rules applied. Total rules applied 279 place count 1134 transition count 2738
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 2 with 141 rules applied. Total rules applied 420 place count 993 transition count 2738
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 426 place count 993 transition count 2738
Applied a total of 426 rules in 662 ms. Remains 993 /1203 variables (removed 210) and now considering 2738/2648 (removed -90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 663 ms. Remains : 993/1203 places, 2738/2648 transitions.
RANDOM walk for 40000 steps (2041 resets) in 840 ms. (47 steps per ms) remains 14/15 properties
BEST_FIRST walk for 40003 steps (272 resets) in 138 ms. (287 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40003 steps (234 resets) in 152 ms. (261 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (271 resets) in 160 ms. (248 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (234 resets) in 161 ms. (246 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (268 resets) in 145 ms. (273 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (232 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (272 resets) in 138 ms. (287 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (273 resets) in 96 ms. (412 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (273 resets) in 83 ms. (476 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (236 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (233 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (232 resets) in 76 ms. (519 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (275 resets) in 83 ms. (476 steps per ms) remains 13/13 properties
[2024-05-24 15:24:18] [INFO ] Flow matrix only has 2342 transitions (discarded 396 similar events)
// Phase 1: matrix 2342 rows 993 cols
[2024-05-24 15:24:18] [INFO ] Computed 59 invariants in 17 ms
[2024-05-24 15:24:18] [INFO ] State equation strengthened by 1172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 878/901 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-24 15:24:19] [INFO ] Deduced a trap composed of 411 places in 434 ms of which 6 ms to minimize.
[2024-05-24 15:24:19] [INFO ] Deduced a trap composed of 116 places in 417 ms of which 6 ms to minimize.
[2024-05-24 15:24:19] [INFO ] Deduced a trap composed of 87 places in 390 ms of which 5 ms to minimize.
[2024-05-24 15:24:20] [INFO ] Deduced a trap composed of 137 places in 383 ms of which 5 ms to minimize.
[2024-05-24 15:24:20] [INFO ] Deduced a trap composed of 585 places in 369 ms of which 5 ms to minimize.
[2024-05-24 15:24:21] [INFO ] Deduced a trap composed of 584 places in 430 ms of which 5 ms to minimize.
[2024-05-24 15:24:21] [INFO ] Deduced a trap composed of 678 places in 416 ms of which 6 ms to minimize.
[2024-05-24 15:24:22] [INFO ] Deduced a trap composed of 184 places in 438 ms of which 6 ms to minimize.
[2024-05-24 15:24:22] [INFO ] Deduced a trap composed of 120 places in 433 ms of which 5 ms to minimize.
[2024-05-24 15:24:23] [INFO ] Deduced a trap composed of 145 places in 428 ms of which 6 ms to minimize.
[2024-05-24 15:24:23] [INFO ] Deduced a trap composed of 76 places in 435 ms of which 6 ms to minimize.
[2024-05-24 15:24:24] [INFO ] Deduced a trap composed of 76 places in 399 ms of which 5 ms to minimize.
[2024-05-24 15:24:24] [INFO ] Deduced a trap composed of 87 places in 401 ms of which 5 ms to minimize.
[2024-05-24 15:24:24] [INFO ] Deduced a trap composed of 92 places in 399 ms of which 6 ms to minimize.
[2024-05-24 15:24:25] [INFO ] Deduced a trap composed of 216 places in 402 ms of which 6 ms to minimize.
[2024-05-24 15:24:25] [INFO ] Deduced a trap composed of 114 places in 394 ms of which 5 ms to minimize.
[2024-05-24 15:24:26] [INFO ] Deduced a trap composed of 103 places in 395 ms of which 6 ms to minimize.
[2024-05-24 15:24:26] [INFO ] Deduced a trap composed of 119 places in 391 ms of which 6 ms to minimize.
[2024-05-24 15:24:26] [INFO ] Deduced a trap composed of 110 places in 398 ms of which 5 ms to minimize.
[2024-05-24 15:24:27] [INFO ] Deduced a trap composed of 118 places in 396 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/901 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-24 15:24:28] [INFO ] Deduced a trap composed of 87 places in 387 ms of which 5 ms to minimize.
[2024-05-24 15:24:28] [INFO ] Deduced a trap composed of 115 places in 394 ms of which 5 ms to minimize.
[2024-05-24 15:24:28] [INFO ] Deduced a trap composed of 164 places in 387 ms of which 6 ms to minimize.
[2024-05-24 15:24:29] [INFO ] Deduced a trap composed of 173 places in 397 ms of which 6 ms to minimize.
[2024-05-24 15:24:29] [INFO ] Deduced a trap composed of 515 places in 382 ms of which 5 ms to minimize.
[2024-05-24 15:24:30] [INFO ] Deduced a trap composed of 122 places in 417 ms of which 6 ms to minimize.
[2024-05-24 15:24:30] [INFO ] Deduced a trap composed of 114 places in 400 ms of which 5 ms to minimize.
[2024-05-24 15:24:31] [INFO ] Deduced a trap composed of 101 places in 449 ms of which 6 ms to minimize.
[2024-05-24 15:24:31] [INFO ] Deduced a trap composed of 175 places in 384 ms of which 5 ms to minimize.
[2024-05-24 15:24:31] [INFO ] Deduced a trap composed of 101 places in 383 ms of which 5 ms to minimize.
[2024-05-24 15:24:32] [INFO ] Deduced a trap composed of 401 places in 398 ms of which 5 ms to minimize.
[2024-05-24 15:24:32] [INFO ] Deduced a trap composed of 120 places in 399 ms of which 5 ms to minimize.
[2024-05-24 15:24:33] [INFO ] Deduced a trap composed of 392 places in 352 ms of which 5 ms to minimize.
[2024-05-24 15:24:33] [INFO ] Deduced a trap composed of 515 places in 348 ms of which 5 ms to minimize.
[2024-05-24 15:24:34] [INFO ] Deduced a trap composed of 486 places in 393 ms of which 5 ms to minimize.
[2024-05-24 15:24:34] [INFO ] Deduced a trap composed of 339 places in 396 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/901 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-24 15:24:34] [INFO ] Deduced a trap composed of 116 places in 406 ms of which 6 ms to minimize.
[2024-05-24 15:24:35] [INFO ] Deduced a trap composed of 279 places in 422 ms of which 8 ms to minimize.
[2024-05-24 15:24:35] [INFO ] Deduced a trap composed of 191 places in 443 ms of which 6 ms to minimize.
[2024-05-24 15:24:36] [INFO ] Deduced a trap composed of 126 places in 416 ms of which 5 ms to minimize.
[2024-05-24 15:24:36] [INFO ] Deduced a trap composed of 94 places in 419 ms of which 6 ms to minimize.
[2024-05-24 15:24:37] [INFO ] Deduced a trap composed of 93 places in 393 ms of which 6 ms to minimize.
[2024-05-24 15:24:37] [INFO ] Deduced a trap composed of 101 places in 409 ms of which 5 ms to minimize.
[2024-05-24 15:24:38] [INFO ] Deduced a trap composed of 85 places in 396 ms of which 7 ms to minimize.
[2024-05-24 15:24:38] [INFO ] Deduced a trap composed of 129 places in 385 ms of which 5 ms to minimize.
[2024-05-24 15:24:39] [INFO ] Deduced a trap composed of 142 places in 384 ms of which 5 ms to minimize.
[2024-05-24 15:24:39] [INFO ] Deduced a trap composed of 166 places in 392 ms of which 6 ms to minimize.
[2024-05-24 15:24:39] [INFO ] Deduced a trap composed of 86 places in 394 ms of which 5 ms to minimize.
[2024-05-24 15:24:40] [INFO ] Deduced a trap composed of 148 places in 396 ms of which 8 ms to minimize.
[2024-05-24 15:24:40] [INFO ] Deduced a trap composed of 98 places in 385 ms of which 5 ms to minimize.
[2024-05-24 15:24:41] [INFO ] Deduced a trap composed of 150 places in 389 ms of which 5 ms to minimize.
[2024-05-24 15:24:41] [INFO ] Deduced a trap composed of 420 places in 390 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/901 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-24 15:24:42] [INFO ] Deduced a trap composed of 156 places in 385 ms of which 6 ms to minimize.
[2024-05-24 15:24:42] [INFO ] Deduced a trap composed of 344 places in 385 ms of which 5 ms to minimize.
[2024-05-24 15:24:42] [INFO ] Deduced a trap composed of 91 places in 415 ms of which 6 ms to minimize.
[2024-05-24 15:24:43] [INFO ] Deduced a trap composed of 103 places in 405 ms of which 5 ms to minimize.
[2024-05-24 15:24:43] [INFO ] Deduced a trap composed of 125 places in 384 ms of which 5 ms to minimize.
[2024-05-24 15:24:44] [INFO ] Deduced a trap composed of 87 places in 390 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/901 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/901 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 2/903 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/903 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 68/971 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/971 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 16/987 variables, 16/111 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/987 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 6/993 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/993 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (OVERLAPS) 2342/3335 variables, 993/1110 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 17 (INCLUDED_ONLY) 0/3335 variables, 1172/2282 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3335 variables, 0/2282 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/3335 variables, 0/2282 constraints. Problems are: Problem set: 8 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3335/3335 variables, and 2282 constraints, problems are : Problem set: 8 solved, 5 unsolved in 31095 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 993/993 constraints, ReadFeed: 1172/1172 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 8 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 882/892 variables, 9/9 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/892 variables, 16/25 constraints. Problems are: Problem set: 8 solved, 5 unsolved
[2024-05-24 15:24:50] [INFO ] Deduced a trap composed of 119 places in 389 ms of which 5 ms to minimize.
[2024-05-24 15:24:50] [INFO ] Deduced a trap composed of 184 places in 384 ms of which 5 ms to minimize.
[2024-05-24 15:24:51] [INFO ] Deduced a trap composed of 103 places in 381 ms of which 6 ms to minimize.
[2024-05-24 15:24:51] [INFO ] Deduced a trap composed of 140 places in 388 ms of which 6 ms to minimize.
[2024-05-24 15:24:51] [INFO ] Deduced a trap composed of 178 places in 380 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/892 variables, 5/30 constraints. Problems are: Problem set: 8 solved, 5 unsolved
[2024-05-24 15:24:52] [INFO ] Deduced a trap composed of 140 places in 374 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/892 variables, 1/31 constraints. Problems are: Problem set: 8 solved, 5 unsolved
[2024-05-24 15:24:52] [INFO ] Deduced a trap composed of 151 places in 393 ms of which 5 ms to minimize.
[2024-05-24 15:24:53] [INFO ] Deduced a trap composed of 169 places in 380 ms of which 5 ms to minimize.
[2024-05-24 15:24:53] [INFO ] Deduced a trap composed of 209 places in 396 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/892 variables, 3/34 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/892 variables, 0/34 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/894 variables, 2/36 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/894 variables, 2/38 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/894 variables, 0/38 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 71/965 variables, 20/58 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/965 variables, 32/90 constraints. Problems are: Problem set: 8 solved, 5 unsolved
[2024-05-24 15:24:54] [INFO ] Deduced a trap composed of 5 places in 434 ms of which 6 ms to minimize.
[2024-05-24 15:24:54] [INFO ] Deduced a trap composed of 27 places in 427 ms of which 6 ms to minimize.
[2024-05-24 15:24:55] [INFO ] Deduced a trap composed of 46 places in 396 ms of which 6 ms to minimize.
[2024-05-24 15:24:55] [INFO ] Deduced a trap composed of 111 places in 423 ms of which 6 ms to minimize.
[2024-05-24 15:24:56] [INFO ] Deduced a trap composed of 46 places in 438 ms of which 7 ms to minimize.
[2024-05-24 15:24:56] [INFO ] Deduced a trap composed of 122 places in 422 ms of which 7 ms to minimize.
[2024-05-24 15:24:57] [INFO ] Deduced a trap composed of 27 places in 406 ms of which 6 ms to minimize.
[2024-05-24 15:24:57] [INFO ] Deduced a trap composed of 57 places in 406 ms of which 6 ms to minimize.
[2024-05-24 15:24:58] [INFO ] Deduced a trap composed of 145 places in 419 ms of which 6 ms to minimize.
[2024-05-24 15:24:58] [INFO ] Deduced a trap composed of 62 places in 428 ms of which 6 ms to minimize.
[2024-05-24 15:24:58] [INFO ] Deduced a trap composed of 75 places in 414 ms of which 6 ms to minimize.
[2024-05-24 15:24:59] [INFO ] Deduced a trap composed of 142 places in 432 ms of which 6 ms to minimize.
[2024-05-24 15:24:59] [INFO ] Deduced a trap composed of 129 places in 392 ms of which 6 ms to minimize.
[2024-05-24 15:25:00] [INFO ] Deduced a trap composed of 127 places in 394 ms of which 6 ms to minimize.
[2024-05-24 15:25:00] [INFO ] Deduced a trap composed of 139 places in 394 ms of which 5 ms to minimize.
[2024-05-24 15:25:01] [INFO ] Deduced a trap composed of 139 places in 402 ms of which 6 ms to minimize.
[2024-05-24 15:25:01] [INFO ] Deduced a trap composed of 134 places in 400 ms of which 6 ms to minimize.
[2024-05-24 15:25:01] [INFO ] Deduced a trap composed of 131 places in 395 ms of which 6 ms to minimize.
[2024-05-24 15:25:02] [INFO ] Deduced a trap composed of 152 places in 410 ms of which 5 ms to minimize.
[2024-05-24 15:25:02] [INFO ] Deduced a trap composed of 144 places in 425 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/965 variables, 20/110 constraints. Problems are: Problem set: 8 solved, 5 unsolved
[2024-05-24 15:25:03] [INFO ] Deduced a trap composed of 75 places in 382 ms of which 5 ms to minimize.
[2024-05-24 15:25:03] [INFO ] Deduced a trap composed of 147 places in 389 ms of which 6 ms to minimize.
[2024-05-24 15:25:04] [INFO ] Deduced a trap composed of 90 places in 396 ms of which 6 ms to minimize.
[2024-05-24 15:25:04] [INFO ] Deduced a trap composed of 133 places in 385 ms of which 6 ms to minimize.
[2024-05-24 15:25:04] [INFO ] Deduced a trap composed of 145 places in 393 ms of which 6 ms to minimize.
[2024-05-24 15:25:05] [INFO ] Deduced a trap composed of 178 places in 408 ms of which 6 ms to minimize.
[2024-05-24 15:25:05] [INFO ] Deduced a trap composed of 158 places in 404 ms of which 6 ms to minimize.
[2024-05-24 15:25:06] [INFO ] Deduced a trap composed of 161 places in 402 ms of which 6 ms to minimize.
[2024-05-24 15:25:06] [INFO ] Deduced a trap composed of 117 places in 416 ms of which 5 ms to minimize.
[2024-05-24 15:25:06] [INFO ] Deduced a trap composed of 88 places in 399 ms of which 6 ms to minimize.
[2024-05-24 15:25:07] [INFO ] Deduced a trap composed of 132 places in 436 ms of which 6 ms to minimize.
[2024-05-24 15:25:07] [INFO ] Deduced a trap composed of 200 places in 389 ms of which 6 ms to minimize.
[2024-05-24 15:25:08] [INFO ] Deduced a trap composed of 104 places in 407 ms of which 6 ms to minimize.
[2024-05-24 15:25:08] [INFO ] Deduced a trap composed of 169 places in 376 ms of which 5 ms to minimize.
[2024-05-24 15:25:09] [INFO ] Deduced a trap composed of 193 places in 392 ms of which 6 ms to minimize.
[2024-05-24 15:25:09] [INFO ] Deduced a trap composed of 190 places in 391 ms of which 6 ms to minimize.
[2024-05-24 15:25:09] [INFO ] Deduced a trap composed of 191 places in 397 ms of which 6 ms to minimize.
[2024-05-24 15:25:10] [INFO ] Deduced a trap composed of 198 places in 414 ms of which 6 ms to minimize.
[2024-05-24 15:25:10] [INFO ] Deduced a trap composed of 121 places in 386 ms of which 6 ms to minimize.
[2024-05-24 15:25:11] [INFO ] Deduced a trap composed of 156 places in 374 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/965 variables, 20/130 constraints. Problems are: Problem set: 8 solved, 5 unsolved
[2024-05-24 15:25:11] [INFO ] Deduced a trap composed of 128 places in 414 ms of which 6 ms to minimize.
[2024-05-24 15:25:12] [INFO ] Deduced a trap composed of 172 places in 423 ms of which 6 ms to minimize.
[2024-05-24 15:25:12] [INFO ] Deduced a trap composed of 88 places in 431 ms of which 5 ms to minimize.
[2024-05-24 15:25:12] [INFO ] Deduced a trap composed of 62 places in 409 ms of which 5 ms to minimize.
[2024-05-24 15:25:13] [INFO ] Deduced a trap composed of 104 places in 434 ms of which 6 ms to minimize.
[2024-05-24 15:25:13] [INFO ] Deduced a trap composed of 85 places in 417 ms of which 6 ms to minimize.
[2024-05-24 15:25:14] [INFO ] Deduced a trap composed of 117 places in 449 ms of which 6 ms to minimize.
[2024-05-24 15:25:14] [INFO ] Deduced a trap composed of 158 places in 405 ms of which 6 ms to minimize.
[2024-05-24 15:25:15] [INFO ] Deduced a trap composed of 85 places in 427 ms of which 6 ms to minimize.
[2024-05-24 15:25:15] [INFO ] Deduced a trap composed of 127 places in 425 ms of which 5 ms to minimize.
[2024-05-24 15:25:16] [INFO ] Deduced a trap composed of 75 places in 453 ms of which 5 ms to minimize.
[2024-05-24 15:25:16] [INFO ] Deduced a trap composed of 202 places in 413 ms of which 6 ms to minimize.
[2024-05-24 15:25:16] [INFO ] Deduced a trap composed of 117 places in 410 ms of which 6 ms to minimize.
[2024-05-24 15:25:17] [INFO ] Deduced a trap composed of 152 places in 443 ms of which 6 ms to minimize.
[2024-05-24 15:25:17] [INFO ] Deduced a trap composed of 167 places in 424 ms of which 6 ms to minimize.
[2024-05-24 15:25:18] [INFO ] Deduced a trap composed of 157 places in 426 ms of which 6 ms to minimize.
[2024-05-24 15:25:18] [INFO ] Deduced a trap composed of 99 places in 440 ms of which 6 ms to minimize.
[2024-05-24 15:25:19] [INFO ] Deduced a trap composed of 71 places in 466 ms of which 6 ms to minimize.
[2024-05-24 15:25:19] [INFO ] Deduced a trap composed of 110 places in 434 ms of which 6 ms to minimize.
[2024-05-24 15:25:20] [INFO ] Deduced a trap composed of 71 places in 451 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/965 variables, 20/150 constraints. Problems are: Problem set: 8 solved, 5 unsolved
[2024-05-24 15:25:20] [INFO ] Deduced a trap composed of 145 places in 412 ms of which 5 ms to minimize.
[2024-05-24 15:25:21] [INFO ] Deduced a trap composed of 172 places in 439 ms of which 6 ms to minimize.
[2024-05-24 15:25:21] [INFO ] Deduced a trap composed of 204 places in 431 ms of which 6 ms to minimize.
[2024-05-24 15:25:22] [INFO ] Deduced a trap composed of 192 places in 433 ms of which 6 ms to minimize.
[2024-05-24 15:25:22] [INFO ] Deduced a trap composed of 110 places in 418 ms of which 6 ms to minimize.
[2024-05-24 15:25:22] [INFO ] Deduced a trap composed of 194 places in 418 ms of which 7 ms to minimize.
[2024-05-24 15:25:23] [INFO ] Deduced a trap composed of 85 places in 437 ms of which 6 ms to minimize.
[2024-05-24 15:25:23] [INFO ] Deduced a trap composed of 171 places in 422 ms of which 6 ms to minimize.
[2024-05-24 15:25:24] [INFO ] Deduced a trap composed of 85 places in 442 ms of which 6 ms to minimize.
[2024-05-24 15:25:24] [INFO ] Deduced a trap composed of 120 places in 431 ms of which 10 ms to minimize.
[2024-05-24 15:25:25] [INFO ] Deduced a trap composed of 97 places in 425 ms of which 6 ms to minimize.
[2024-05-24 15:25:25] [INFO ] Deduced a trap composed of 97 places in 432 ms of which 6 ms to minimize.
[2024-05-24 15:25:26] [INFO ] Deduced a trap composed of 111 places in 409 ms of which 6 ms to minimize.
[2024-05-24 15:25:26] [INFO ] Deduced a trap composed of 156 places in 399 ms of which 6 ms to minimize.
[2024-05-24 15:25:26] [INFO ] Deduced a trap composed of 141 places in 399 ms of which 6 ms to minimize.
[2024-05-24 15:25:27] [INFO ] Deduced a trap composed of 135 places in 372 ms of which 6 ms to minimize.
[2024-05-24 15:25:27] [INFO ] Deduced a trap composed of 155 places in 400 ms of which 5 ms to minimize.
[2024-05-24 15:25:28] [INFO ] Deduced a trap composed of 151 places in 383 ms of which 5 ms to minimize.
[2024-05-24 15:25:28] [INFO ] Deduced a trap composed of 148 places in 396 ms of which 6 ms to minimize.
[2024-05-24 15:25:28] [INFO ] Deduced a trap composed of 144 places in 394 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/965 variables, 20/170 constraints. Problems are: Problem set: 8 solved, 5 unsolved
[2024-05-24 15:25:29] [INFO ] Deduced a trap composed of 163 places in 453 ms of which 6 ms to minimize.
[2024-05-24 15:25:29] [INFO ] Deduced a trap composed of 119 places in 498 ms of which 7 ms to minimize.
[2024-05-24 15:25:30] [INFO ] Deduced a trap composed of 104 places in 409 ms of which 6 ms to minimize.
[2024-05-24 15:25:30] [INFO ] Deduced a trap composed of 81 places in 447 ms of which 6 ms to minimize.
[2024-05-24 15:25:31] [INFO ] Deduced a trap composed of 131 places in 391 ms of which 6 ms to minimize.
[2024-05-24 15:25:31] [INFO ] Deduced a trap composed of 140 places in 393 ms of which 5 ms to minimize.
[2024-05-24 15:25:32] [INFO ] Deduced a trap composed of 167 places in 395 ms of which 6 ms to minimize.
[2024-05-24 15:25:32] [INFO ] Deduced a trap composed of 143 places in 403 ms of which 6 ms to minimize.
[2024-05-24 15:25:32] [INFO ] Deduced a trap composed of 163 places in 392 ms of which 5 ms to minimize.
[2024-05-24 15:25:33] [INFO ] Deduced a trap composed of 84 places in 443 ms of which 6 ms to minimize.
[2024-05-24 15:25:33] [INFO ] Deduced a trap composed of 150 places in 392 ms of which 6 ms to minimize.
[2024-05-24 15:25:34] [INFO ] Deduced a trap composed of 171 places in 381 ms of which 6 ms to minimize.
[2024-05-24 15:25:34] [INFO ] Deduced a trap composed of 171 places in 390 ms of which 6 ms to minimize.
SMT process timed out in 76270ms, After SMT, problems are : Problem set: 8 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 10 out of 993 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 993/993 places, 2738/2738 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 993 transition count 2736
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 991 transition count 2736
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 991 transition count 2736
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 989 transition count 2734
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 989 transition count 2734
Applied a total of 10 rules in 160 ms. Remains 989 /993 variables (removed 4) and now considering 2734/2738 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 989/993 places, 2734/2738 transitions.
RANDOM walk for 40000 steps (2047 resets) in 778 ms. (51 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (275 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (273 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (234 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (270 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (274 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 63724 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :1 out of 5
Probabilistic random walk after 63724 steps, saw 26813 distinct states, run finished after 3004 ms. (steps per millisecond=21 ) properties seen :1
[2024-05-24 15:25:38] [INFO ] Flow matrix only has 2338 transitions (discarded 396 similar events)
// Phase 1: matrix 2338 rows 989 cols
[2024-05-24 15:25:38] [INFO ] Computed 59 invariants in 17 ms
[2024-05-24 15:25:38] [INFO ] State equation strengthened by 1172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 861/869 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/869 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 22/891 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 15:25:39] [INFO ] Deduced a trap composed of 146 places in 398 ms of which 5 ms to minimize.
[2024-05-24 15:25:39] [INFO ] Deduced a trap composed of 148 places in 387 ms of which 5 ms to minimize.
[2024-05-24 15:25:39] [INFO ] Deduced a trap composed of 169 places in 393 ms of which 6 ms to minimize.
[2024-05-24 15:25:40] [INFO ] Deduced a trap composed of 133 places in 388 ms of which 5 ms to minimize.
[2024-05-24 15:25:40] [INFO ] Deduced a trap composed of 179 places in 384 ms of which 6 ms to minimize.
[2024-05-24 15:25:41] [INFO ] Deduced a trap composed of 100 places in 387 ms of which 5 ms to minimize.
[2024-05-24 15:25:41] [INFO ] Deduced a trap composed of 138 places in 400 ms of which 5 ms to minimize.
[2024-05-24 15:25:41] [INFO ] Deduced a trap composed of 204 places in 389 ms of which 5 ms to minimize.
[2024-05-24 15:25:42] [INFO ] Deduced a trap composed of 180 places in 395 ms of which 5 ms to minimize.
[2024-05-24 15:25:42] [INFO ] Deduced a trap composed of 146 places in 400 ms of which 5 ms to minimize.
[2024-05-24 15:25:43] [INFO ] Deduced a trap composed of 158 places in 401 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/891 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/891 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 70/961 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 15:25:43] [INFO ] Deduced a trap composed of 5 places in 435 ms of which 5 ms to minimize.
[2024-05-24 15:25:44] [INFO ] Deduced a trap composed of 27 places in 427 ms of which 5 ms to minimize.
[2024-05-24 15:25:44] [INFO ] Deduced a trap composed of 113 places in 409 ms of which 5 ms to minimize.
[2024-05-24 15:25:45] [INFO ] Deduced a trap composed of 46 places in 413 ms of which 6 ms to minimize.
[2024-05-24 15:25:45] [INFO ] Deduced a trap composed of 46 places in 409 ms of which 6 ms to minimize.
[2024-05-24 15:25:46] [INFO ] Deduced a trap composed of 71 places in 417 ms of which 6 ms to minimize.
[2024-05-24 15:25:46] [INFO ] Deduced a trap composed of 62 places in 428 ms of which 6 ms to minimize.
[2024-05-24 15:25:46] [INFO ] Deduced a trap composed of 138 places in 409 ms of which 6 ms to minimize.
[2024-05-24 15:25:47] [INFO ] Deduced a trap composed of 85 places in 437 ms of which 6 ms to minimize.
[2024-05-24 15:25:47] [INFO ] Deduced a trap composed of 85 places in 423 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/961 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 15:25:48] [INFO ] Deduced a trap composed of 146 places in 390 ms of which 6 ms to minimize.
[2024-05-24 15:25:48] [INFO ] Deduced a trap composed of 152 places in 392 ms of which 6 ms to minimize.
[2024-05-24 15:25:49] [INFO ] Deduced a trap composed of 151 places in 390 ms of which 6 ms to minimize.
[2024-05-24 15:25:49] [INFO ] Deduced a trap composed of 161 places in 393 ms of which 6 ms to minimize.
[2024-05-24 15:25:49] [INFO ] Deduced a trap composed of 131 places in 415 ms of which 5 ms to minimize.
[2024-05-24 15:25:50] [INFO ] Deduced a trap composed of 130 places in 390 ms of which 5 ms to minimize.
[2024-05-24 15:25:50] [INFO ] Deduced a trap composed of 154 places in 408 ms of which 6 ms to minimize.
[2024-05-24 15:25:51] [INFO ] Deduced a trap composed of 189 places in 408 ms of which 6 ms to minimize.
[2024-05-24 15:25:51] [INFO ] Deduced a trap composed of 143 places in 416 ms of which 6 ms to minimize.
[2024-05-24 15:25:52] [INFO ] Deduced a trap composed of 139 places in 409 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/961 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/961 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 22/983 variables, 22/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 15:25:52] [INFO ] Deduced a trap composed of 153 places in 392 ms of which 6 ms to minimize.
[2024-05-24 15:25:53] [INFO ] Deduced a trap composed of 143 places in 390 ms of which 5 ms to minimize.
[2024-05-24 15:25:53] [INFO ] Deduced a trap composed of 156 places in 417 ms of which 6 ms to minimize.
[2024-05-24 15:25:53] [INFO ] Deduced a trap composed of 151 places in 422 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/983 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 6/989 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 15:25:54] [INFO ] Deduced a trap composed of 62 places in 428 ms of which 6 ms to minimize.
[2024-05-24 15:25:55] [INFO ] Deduced a trap composed of 163 places in 444 ms of which 6 ms to minimize.
[2024-05-24 15:25:55] [INFO ] Deduced a trap composed of 181 places in 462 ms of which 7 ms to minimize.
[2024-05-24 15:25:56] [INFO ] Deduced a trap composed of 180 places in 422 ms of which 5 ms to minimize.
[2024-05-24 15:25:56] [INFO ] Deduced a trap composed of 97 places in 440 ms of which 6 ms to minimize.
[2024-05-24 15:25:57] [INFO ] Deduced a trap composed of 75 places in 456 ms of which 6 ms to minimize.
[2024-05-24 15:25:57] [INFO ] Deduced a trap composed of 72 places in 485 ms of which 6 ms to minimize.
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 66 places in 486 ms of which 7 ms to minimize.
[2024-05-24 15:25:58] [INFO ] Deduced a trap composed of 71 places in 499 ms of which 7 ms to minimize.
[2024-05-24 15:25:59] [INFO ] Deduced a trap composed of 72 places in 484 ms of which 6 ms to minimize.
[2024-05-24 15:25:59] [INFO ] Deduced a trap composed of 131 places in 461 ms of which 7 ms to minimize.
[2024-05-24 15:25:59] [INFO ] Deduced a trap composed of 130 places in 450 ms of which 6 ms to minimize.
[2024-05-24 15:26:00] [INFO ] Deduced a trap composed of 62 places in 441 ms of which 6 ms to minimize.
[2024-05-24 15:26:00] [INFO ] Deduced a trap composed of 71 places in 452 ms of which 6 ms to minimize.
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 87 places in 467 ms of which 6 ms to minimize.
[2024-05-24 15:26:01] [INFO ] Deduced a trap composed of 87 places in 474 ms of which 6 ms to minimize.
[2024-05-24 15:26:02] [INFO ] Deduced a trap composed of 74 places in 460 ms of which 6 ms to minimize.
[2024-05-24 15:26:02] [INFO ] Deduced a trap composed of 147 places in 435 ms of which 6 ms to minimize.
[2024-05-24 15:26:03] [INFO ] Deduced a trap composed of 76 places in 483 ms of which 6 ms to minimize.
[2024-05-24 15:26:03] [INFO ] Deduced a trap composed of 98 places in 494 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/989 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 15:26:04] [INFO ] Deduced a trap composed of 85 places in 497 ms of which 6 ms to minimize.
[2024-05-24 15:26:04] [INFO ] Deduced a trap composed of 96 places in 467 ms of which 6 ms to minimize.
[2024-05-24 15:26:05] [INFO ] Deduced a trap composed of 145 places in 389 ms of which 5 ms to minimize.
[2024-05-24 15:26:05] [INFO ] Deduced a trap composed of 140 places in 406 ms of which 6 ms to minimize.
[2024-05-24 15:26:06] [INFO ] Deduced a trap composed of 151 places in 471 ms of which 5 ms to minimize.
[2024-05-24 15:26:06] [INFO ] Deduced a trap composed of 61 places in 454 ms of which 6 ms to minimize.
[2024-05-24 15:26:07] [INFO ] Deduced a trap composed of 137 places in 417 ms of which 5 ms to minimize.
[2024-05-24 15:26:07] [INFO ] Deduced a trap composed of 142 places in 409 ms of which 6 ms to minimize.
[2024-05-24 15:26:08] [INFO ] Deduced a trap composed of 198 places in 413 ms of which 7 ms to minimize.
[2024-05-24 15:26:08] [INFO ] Deduced a trap composed of 83 places in 453 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/989 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 15:26:09] [INFO ] Deduced a trap composed of 75 places in 450 ms of which 5 ms to minimize.
[2024-05-24 15:26:09] [INFO ] Deduced a trap composed of 110 places in 174 ms of which 3 ms to minimize.
[2024-05-24 15:26:09] [INFO ] Deduced a trap composed of 87 places in 181 ms of which 3 ms to minimize.
[2024-05-24 15:26:09] [INFO ] Deduced a trap composed of 90 places in 207 ms of which 3 ms to minimize.
[2024-05-24 15:26:10] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 3 ms to minimize.
[2024-05-24 15:26:10] [INFO ] Deduced a trap composed of 57 places in 182 ms of which 3 ms to minimize.
[2024-05-24 15:26:10] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 3 ms to minimize.
[2024-05-24 15:26:10] [INFO ] Deduced a trap composed of 88 places in 173 ms of which 3 ms to minimize.
[2024-05-24 15:26:10] [INFO ] Deduced a trap composed of 62 places in 183 ms of which 3 ms to minimize.
[2024-05-24 15:26:11] [INFO ] Deduced a trap composed of 104 places in 191 ms of which 3 ms to minimize.
[2024-05-24 15:26:11] [INFO ] Deduced a trap composed of 75 places in 186 ms of which 3 ms to minimize.
[2024-05-24 15:26:11] [INFO ] Deduced a trap composed of 117 places in 172 ms of which 3 ms to minimize.
[2024-05-24 15:26:11] [INFO ] Deduced a trap composed of 82 places in 177 ms of which 3 ms to minimize.
[2024-05-24 15:26:11] [INFO ] Deduced a trap composed of 75 places in 181 ms of which 4 ms to minimize.
[2024-05-24 15:26:12] [INFO ] Deduced a trap composed of 103 places in 466 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/989 variables, 15/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 15:26:12] [INFO ] Deduced a trap composed of 72 places in 456 ms of which 6 ms to minimize.
[2024-05-24 15:26:13] [INFO ] Deduced a trap composed of 140 places in 403 ms of which 6 ms to minimize.
[2024-05-24 15:26:13] [INFO ] Deduced a trap composed of 68 places in 446 ms of which 6 ms to minimize.
[2024-05-24 15:26:14] [INFO ] Deduced a trap composed of 134 places in 406 ms of which 5 ms to minimize.
[2024-05-24 15:26:14] [INFO ] Deduced a trap composed of 146 places in 402 ms of which 6 ms to minimize.
[2024-05-24 15:26:15] [INFO ] Deduced a trap composed of 159 places in 412 ms of which 6 ms to minimize.
[2024-05-24 15:26:15] [INFO ] Deduced a trap composed of 149 places in 403 ms of which 7 ms to minimize.
[2024-05-24 15:26:15] [INFO ] Deduced a trap composed of 90 places in 446 ms of which 9 ms to minimize.
[2024-05-24 15:26:16] [INFO ] Deduced a trap composed of 152 places in 416 ms of which 6 ms to minimize.
[2024-05-24 15:26:16] [INFO ] Deduced a trap composed of 143 places in 398 ms of which 6 ms to minimize.
[2024-05-24 15:26:17] [INFO ] Deduced a trap composed of 160 places in 420 ms of which 6 ms to minimize.
[2024-05-24 15:26:17] [INFO ] Deduced a trap composed of 136 places in 422 ms of which 6 ms to minimize.
[2024-05-24 15:26:18] [INFO ] Deduced a trap composed of 152 places in 397 ms of which 6 ms to minimize.
[2024-05-24 15:26:18] [INFO ] Deduced a trap composed of 140 places in 466 ms of which 6 ms to minimize.
[2024-05-24 15:26:19] [INFO ] Deduced a trap composed of 148 places in 466 ms of which 6 ms to minimize.
[2024-05-24 15:26:19] [INFO ] Deduced a trap composed of 85 places in 458 ms of which 6 ms to minimize.
[2024-05-24 15:26:20] [INFO ] Deduced a trap composed of 73 places in 461 ms of which 6 ms to minimize.
[2024-05-24 15:26:20] [INFO ] Deduced a trap composed of 149 places in 400 ms of which 6 ms to minimize.
[2024-05-24 15:26:20] [INFO ] Deduced a trap composed of 85 places in 455 ms of which 6 ms to minimize.
[2024-05-24 15:26:21] [INFO ] Deduced a trap composed of 158 places in 406 ms of which 6 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/989 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 15:26:21] [INFO ] Deduced a trap composed of 100 places in 460 ms of which 6 ms to minimize.
[2024-05-24 15:26:22] [INFO ] Deduced a trap composed of 101 places in 448 ms of which 6 ms to minimize.
[2024-05-24 15:26:22] [INFO ] Deduced a trap composed of 98 places in 455 ms of which 6 ms to minimize.
[2024-05-24 15:26:23] [INFO ] Deduced a trap composed of 139 places in 417 ms of which 5 ms to minimize.
[2024-05-24 15:26:23] [INFO ] Deduced a trap composed of 147 places in 401 ms of which 5 ms to minimize.
[2024-05-24 15:26:24] [INFO ] Deduced a trap composed of 98 places in 435 ms of which 5 ms to minimize.
[2024-05-24 15:26:24] [INFO ] Deduced a trap composed of 100 places in 464 ms of which 6 ms to minimize.
[2024-05-24 15:26:25] [INFO ] Deduced a trap composed of 169 places in 467 ms of which 6 ms to minimize.
[2024-05-24 15:26:25] [INFO ] Deduced a trap composed of 175 places in 446 ms of which 6 ms to minimize.
[2024-05-24 15:26:26] [INFO ] Deduced a trap composed of 151 places in 452 ms of which 7 ms to minimize.
[2024-05-24 15:26:26] [INFO ] Deduced a trap composed of 83 places in 471 ms of which 6 ms to minimize.
[2024-05-24 15:26:27] [INFO ] Deduced a trap composed of 77 places in 484 ms of which 6 ms to minimize.
[2024-05-24 15:26:27] [INFO ] Deduced a trap composed of 93 places in 484 ms of which 6 ms to minimize.
[2024-05-24 15:26:28] [INFO ] Deduced a trap composed of 84 places in 485 ms of which 6 ms to minimize.
[2024-05-24 15:26:28] [INFO ] Deduced a trap composed of 83 places in 492 ms of which 6 ms to minimize.
[2024-05-24 15:26:29] [INFO ] Deduced a trap composed of 171 places in 446 ms of which 5 ms to minimize.
[2024-05-24 15:26:29] [INFO ] Deduced a trap composed of 159 places in 455 ms of which 6 ms to minimize.
[2024-05-24 15:26:30] [INFO ] Deduced a trap composed of 88 places in 474 ms of which 6 ms to minimize.
[2024-05-24 15:26:30] [INFO ] Deduced a trap composed of 94 places in 469 ms of which 6 ms to minimize.
[2024-05-24 15:26:31] [INFO ] Deduced a trap composed of 182 places in 452 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/989 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 15:26:31] [INFO ] Deduced a trap composed of 76 places in 522 ms of which 7 ms to minimize.
[2024-05-24 15:26:32] [INFO ] Deduced a trap composed of 144 places in 529 ms of which 6 ms to minimize.
[2024-05-24 15:26:32] [INFO ] Deduced a trap composed of 162 places in 432 ms of which 6 ms to minimize.
[2024-05-24 15:26:33] [INFO ] Deduced a trap composed of 175 places in 424 ms of which 6 ms to minimize.
[2024-05-24 15:26:33] [INFO ] Deduced a trap composed of 152 places in 405 ms of which 6 ms to minimize.
[2024-05-24 15:26:34] [INFO ] Deduced a trap composed of 157 places in 419 ms of which 5 ms to minimize.
[2024-05-24 15:26:34] [INFO ] Deduced a trap composed of 148 places in 429 ms of which 7 ms to minimize.
[2024-05-24 15:26:35] [INFO ] Deduced a trap composed of 200 places in 432 ms of which 6 ms to minimize.
[2024-05-24 15:26:35] [INFO ] Deduced a trap composed of 166 places in 392 ms of which 6 ms to minimize.
[2024-05-24 15:26:36] [INFO ] Deduced a trap composed of 163 places in 491 ms of which 6 ms to minimize.
[2024-05-24 15:26:36] [INFO ] Deduced a trap composed of 88 places in 498 ms of which 6 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 205 places in 437 ms of which 6 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 191 places in 437 ms of which 6 ms to minimize.
[2024-05-24 15:26:37] [INFO ] Deduced a trap composed of 97 places in 428 ms of which 6 ms to minimize.
[2024-05-24 15:26:38] [INFO ] Deduced a trap composed of 154 places in 489 ms of which 6 ms to minimize.
[2024-05-24 15:26:38] [INFO ] Deduced a trap composed of 97 places in 441 ms of which 7 ms to minimize.
[2024-05-24 15:26:39] [INFO ] Deduced a trap composed of 207 places in 495 ms of which 6 ms to minimize.
[2024-05-24 15:26:39] [INFO ] Deduced a trap composed of 80 places in 492 ms of which 6 ms to minimize.
[2024-05-24 15:26:40] [INFO ] Deduced a trap composed of 89 places in 478 ms of which 6 ms to minimize.
[2024-05-24 15:26:40] [INFO ] Deduced a trap composed of 88 places in 479 ms of which 6 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/989 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 15:26:41] [INFO ] Deduced a trap composed of 74 places in 466 ms of which 6 ms to minimize.
[2024-05-24 15:26:42] [INFO ] Deduced a trap composed of 156 places in 434 ms of which 6 ms to minimize.
[2024-05-24 15:26:42] [INFO ] Deduced a trap composed of 161 places in 414 ms of which 6 ms to minimize.
[2024-05-24 15:26:43] [INFO ] Deduced a trap composed of 73 places in 455 ms of which 6 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/989 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/989 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 22 (OVERLAPS) 2338/3327 variables, 989/1192 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 23 (INCLUDED_ONLY) 0/3327 variables, 1172/2364 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3327 variables, 0/2364 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/3327 variables, 0/2364 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3327/3327 variables, and 2364 constraints, problems are : Problem set: 3 solved, 1 unsolved in 68355 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 989/989 constraints, ReadFeed: 1172/1172 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 144/144 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 860/862 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/862 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/882 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-24 15:26:47] [INFO ] Deduced a trap composed of 183 places in 396 ms of which 6 ms to minimize.
[2024-05-24 15:26:47] [INFO ] Deduced a trap composed of 235 places in 399 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/882 variables, 2/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/882 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 73/955 variables, 20/27 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/955 variables, 86/113 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-24 15:26:48] [INFO ] Deduced a trap composed of 68 places in 477 ms of which 6 ms to minimize.
[2024-05-24 15:26:48] [INFO ] Deduced a trap composed of 62 places in 185 ms of which 3 ms to minimize.
[2024-05-24 15:26:49] [INFO ] Deduced a trap composed of 73 places in 473 ms of which 6 ms to minimize.
[2024-05-24 15:26:49] [INFO ] Deduced a trap composed of 82 places in 178 ms of which 3 ms to minimize.
[2024-05-24 15:26:49] [INFO ] Deduced a trap composed of 46 places in 445 ms of which 6 ms to minimize.
[2024-05-24 15:26:50] [INFO ] Deduced a trap composed of 75 places in 478 ms of which 6 ms to minimize.
[2024-05-24 15:26:50] [INFO ] Deduced a trap composed of 71 places in 180 ms of which 3 ms to minimize.
[2024-05-24 15:26:50] [INFO ] Deduced a trap composed of 80 places in 461 ms of which 6 ms to minimize.
[2024-05-24 15:26:51] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 4 ms to minimize.
[2024-05-24 15:26:51] [INFO ] Deduced a trap composed of 94 places in 470 ms of which 6 ms to minimize.
[2024-05-24 15:26:52] [INFO ] Deduced a trap composed of 78 places in 473 ms of which 6 ms to minimize.
[2024-05-24 15:26:52] [INFO ] Deduced a trap composed of 97 places in 471 ms of which 6 ms to minimize.
[2024-05-24 15:26:53] [INFO ] Deduced a trap composed of 79 places in 465 ms of which 6 ms to minimize.
[2024-05-24 15:26:53] [INFO ] Deduced a trap composed of 78 places in 504 ms of which 7 ms to minimize.
[2024-05-24 15:26:54] [INFO ] Deduced a trap composed of 67 places in 503 ms of which 6 ms to minimize.
[2024-05-24 15:26:54] [INFO ] Deduced a trap composed of 74 places in 517 ms of which 7 ms to minimize.
[2024-05-24 15:26:55] [INFO ] Deduced a trap composed of 84 places in 500 ms of which 6 ms to minimize.
[2024-05-24 15:26:55] [INFO ] Deduced a trap composed of 75 places in 433 ms of which 6 ms to minimize.
[2024-05-24 15:26:56] [INFO ] Deduced a trap composed of 183 places in 480 ms of which 6 ms to minimize.
[2024-05-24 15:26:56] [INFO ] Deduced a trap composed of 91 places in 481 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/955 variables, 20/133 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-24 15:26:57] [INFO ] Deduced a trap composed of 91 places in 443 ms of which 6 ms to minimize.
[2024-05-24 15:26:57] [INFO ] Deduced a trap composed of 139 places in 464 ms of which 6 ms to minimize.
[2024-05-24 15:26:58] [INFO ] Deduced a trap composed of 67 places in 458 ms of which 6 ms to minimize.
[2024-05-24 15:26:58] [INFO ] Deduced a trap composed of 68 places in 456 ms of which 7 ms to minimize.
[2024-05-24 15:26:59] [INFO ] Deduced a trap composed of 89 places in 467 ms of which 6 ms to minimize.
[2024-05-24 15:26:59] [INFO ] Deduced a trap composed of 110 places in 461 ms of which 6 ms to minimize.
[2024-05-24 15:26:59] [INFO ] Deduced a trap composed of 119 places in 398 ms of which 5 ms to minimize.
[2024-05-24 15:27:00] [INFO ] Deduced a trap composed of 125 places in 408 ms of which 6 ms to minimize.
[2024-05-24 15:27:00] [INFO ] Deduced a trap composed of 70 places in 460 ms of which 6 ms to minimize.
[2024-05-24 15:27:01] [INFO ] Deduced a trap composed of 78 places in 190 ms of which 3 ms to minimize.
[2024-05-24 15:27:01] [INFO ] Deduced a trap composed of 129 places in 415 ms of which 5 ms to minimize.
[2024-05-24 15:27:01] [INFO ] Deduced a trap composed of 153 places in 381 ms of which 6 ms to minimize.
[2024-05-24 15:27:02] [INFO ] Deduced a trap composed of 90 places in 380 ms of which 6 ms to minimize.
[2024-05-24 15:27:02] [INFO ] Deduced a trap composed of 78 places in 452 ms of which 6 ms to minimize.
[2024-05-24 15:27:03] [INFO ] Deduced a trap composed of 120 places in 450 ms of which 6 ms to minimize.
[2024-05-24 15:27:03] [INFO ] Deduced a trap composed of 78 places in 451 ms of which 6 ms to minimize.
[2024-05-24 15:27:04] [INFO ] Deduced a trap composed of 85 places in 452 ms of which 7 ms to minimize.
[2024-05-24 15:27:04] [INFO ] Deduced a trap composed of 75 places in 451 ms of which 6 ms to minimize.
[2024-05-24 15:27:05] [INFO ] Deduced a trap composed of 85 places in 435 ms of which 5 ms to minimize.
[2024-05-24 15:27:05] [INFO ] Deduced a trap composed of 74 places in 456 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/955 variables, 20/153 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-24 15:27:06] [INFO ] Deduced a trap composed of 82 places in 450 ms of which 7 ms to minimize.
[2024-05-24 15:27:06] [INFO ] Deduced a trap composed of 104 places in 462 ms of which 6 ms to minimize.
[2024-05-24 15:27:07] [INFO ] Deduced a trap composed of 117 places in 472 ms of which 6 ms to minimize.
[2024-05-24 15:27:07] [INFO ] Deduced a trap composed of 76 places in 465 ms of which 6 ms to minimize.
[2024-05-24 15:27:08] [INFO ] Deduced a trap composed of 107 places in 462 ms of which 6 ms to minimize.
[2024-05-24 15:27:08] [INFO ] Deduced a trap composed of 59 places in 444 ms of which 6 ms to minimize.
[2024-05-24 15:27:09] [INFO ] Deduced a trap composed of 103 places in 435 ms of which 6 ms to minimize.
[2024-05-24 15:27:10] [INFO ] Deduced a trap composed of 69 places in 471 ms of which 6 ms to minimize.
[2024-05-24 15:27:10] [INFO ] Deduced a trap composed of 118 places in 457 ms of which 6 ms to minimize.
[2024-05-24 15:27:11] [INFO ] Deduced a trap composed of 67 places in 510 ms of which 6 ms to minimize.
[2024-05-24 15:27:11] [INFO ] Deduced a trap composed of 119 places in 476 ms of which 6 ms to minimize.
[2024-05-24 15:27:12] [INFO ] Deduced a trap composed of 69 places in 471 ms of which 6 ms to minimize.
[2024-05-24 15:27:12] [INFO ] Deduced a trap composed of 121 places in 393 ms of which 6 ms to minimize.
[2024-05-24 15:27:13] [INFO ] Deduced a trap composed of 141 places in 430 ms of which 6 ms to minimize.
[2024-05-24 15:27:13] [INFO ] Deduced a trap composed of 68 places in 506 ms of which 6 ms to minimize.
[2024-05-24 15:27:14] [INFO ] Deduced a trap composed of 71 places in 507 ms of which 6 ms to minimize.
[2024-05-24 15:27:14] [INFO ] Deduced a trap composed of 137 places in 508 ms of which 6 ms to minimize.
[2024-05-24 15:27:15] [INFO ] Deduced a trap composed of 128 places in 470 ms of which 6 ms to minimize.
[2024-05-24 15:27:15] [INFO ] Deduced a trap composed of 72 places in 492 ms of which 6 ms to minimize.
[2024-05-24 15:27:16] [INFO ] Deduced a trap composed of 119 places in 467 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/955 variables, 20/173 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-24 15:27:16] [INFO ] Deduced a trap composed of 123 places in 486 ms of which 6 ms to minimize.
[2024-05-24 15:27:17] [INFO ] Deduced a trap composed of 117 places in 466 ms of which 6 ms to minimize.
[2024-05-24 15:27:17] [INFO ] Deduced a trap composed of 68 places in 467 ms of which 6 ms to minimize.
[2024-05-24 15:27:18] [INFO ] Deduced a trap composed of 131 places in 480 ms of which 6 ms to minimize.
[2024-05-24 15:27:18] [INFO ] Deduced a trap composed of 77 places in 500 ms of which 7 ms to minimize.
[2024-05-24 15:27:19] [INFO ] Deduced a trap composed of 87 places in 458 ms of which 6 ms to minimize.
[2024-05-24 15:27:19] [INFO ] Deduced a trap composed of 133 places in 417 ms of which 6 ms to minimize.
[2024-05-24 15:27:20] [INFO ] Deduced a trap composed of 92 places in 497 ms of which 6 ms to minimize.
[2024-05-24 15:27:20] [INFO ] Deduced a trap composed of 112 places in 436 ms of which 6 ms to minimize.
[2024-05-24 15:27:21] [INFO ] Deduced a trap composed of 131 places in 389 ms of which 6 ms to minimize.
[2024-05-24 15:27:21] [INFO ] Deduced a trap composed of 192 places in 511 ms of which 6 ms to minimize.
[2024-05-24 15:27:22] [INFO ] Deduced a trap composed of 70 places in 485 ms of which 6 ms to minimize.
[2024-05-24 15:27:22] [INFO ] Deduced a trap composed of 73 places in 460 ms of which 6 ms to minimize.
[2024-05-24 15:27:23] [INFO ] Deduced a trap composed of 83 places in 441 ms of which 6 ms to minimize.
[2024-05-24 15:27:23] [INFO ] Deduced a trap composed of 85 places in 496 ms of which 6 ms to minimize.
[2024-05-24 15:27:24] [INFO ] Deduced a trap composed of 77 places in 465 ms of which 6 ms to minimize.
[2024-05-24 15:27:24] [INFO ] Deduced a trap composed of 131 places in 380 ms of which 6 ms to minimize.
[2024-05-24 15:27:24] [INFO ] Deduced a trap composed of 139 places in 406 ms of which 5 ms to minimize.
[2024-05-24 15:27:25] [INFO ] Deduced a trap composed of 106 places in 492 ms of which 6 ms to minimize.
[2024-05-24 15:27:26] [INFO ] Deduced a trap composed of 107 places in 503 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/955 variables, 20/193 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-24 15:27:26] [INFO ] Deduced a trap composed of 148 places in 484 ms of which 6 ms to minimize.
[2024-05-24 15:27:27] [INFO ] Deduced a trap composed of 106 places in 502 ms of which 6 ms to minimize.
[2024-05-24 15:27:27] [INFO ] Deduced a trap composed of 161 places in 481 ms of which 7 ms to minimize.
[2024-05-24 15:27:28] [INFO ] Deduced a trap composed of 135 places in 512 ms of which 7 ms to minimize.
[2024-05-24 15:27:28] [INFO ] Deduced a trap composed of 134 places in 502 ms of which 6 ms to minimize.
[2024-05-24 15:27:29] [INFO ] Deduced a trap composed of 152 places in 447 ms of which 6 ms to minimize.
[2024-05-24 15:27:29] [INFO ] Deduced a trap composed of 199 places in 443 ms of which 7 ms to minimize.
[2024-05-24 15:27:30] [INFO ] Deduced a trap composed of 153 places in 416 ms of which 7 ms to minimize.
[2024-05-24 15:27:30] [INFO ] Deduced a trap composed of 116 places in 454 ms of which 7 ms to minimize.
[2024-05-24 15:27:31] [INFO ] Deduced a trap composed of 145 places in 450 ms of which 6 ms to minimize.
[2024-05-24 15:27:31] [INFO ] Deduced a trap composed of 142 places in 486 ms of which 6 ms to minimize.
[2024-05-24 15:27:32] [INFO ] Deduced a trap composed of 111 places in 444 ms of which 6 ms to minimize.
[2024-05-24 15:27:32] [INFO ] Deduced a trap composed of 163 places in 418 ms of which 5 ms to minimize.
[2024-05-24 15:27:32] [INFO ] Deduced a trap composed of 152 places in 438 ms of which 6 ms to minimize.
[2024-05-24 15:27:33] [INFO ] Deduced a trap composed of 124 places in 467 ms of which 5 ms to minimize.
[2024-05-24 15:27:33] [INFO ] Deduced a trap composed of 136 places in 437 ms of which 6 ms to minimize.
[2024-05-24 15:27:34] [INFO ] Deduced a trap composed of 149 places in 388 ms of which 6 ms to minimize.
[2024-05-24 15:27:34] [INFO ] Deduced a trap composed of 138 places in 417 ms of which 6 ms to minimize.
[2024-05-24 15:27:35] [INFO ] Deduced a trap composed of 159 places in 411 ms of which 5 ms to minimize.
[2024-05-24 15:27:35] [INFO ] Deduced a trap composed of 153 places in 406 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/955 variables, 20/213 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-24 15:27:36] [INFO ] Deduced a trap composed of 149 places in 416 ms of which 6 ms to minimize.
[2024-05-24 15:27:36] [INFO ] Deduced a trap composed of 139 places in 484 ms of which 6 ms to minimize.
[2024-05-24 15:27:37] [INFO ] Deduced a trap composed of 155 places in 454 ms of which 6 ms to minimize.
[2024-05-24 15:27:37] [INFO ] Deduced a trap composed of 154 places in 409 ms of which 6 ms to minimize.
[2024-05-24 15:27:37] [INFO ] Deduced a trap composed of 124 places in 458 ms of which 6 ms to minimize.
[2024-05-24 15:27:38] [INFO ] Deduced a trap composed of 145 places in 421 ms of which 6 ms to minimize.
[2024-05-24 15:27:38] [INFO ] Deduced a trap composed of 143 places in 423 ms of which 6 ms to minimize.
[2024-05-24 15:27:39] [INFO ] Deduced a trap composed of 146 places in 429 ms of which 6 ms to minimize.
[2024-05-24 15:27:39] [INFO ] Deduced a trap composed of 161 places in 412 ms of which 6 ms to minimize.
[2024-05-24 15:27:40] [INFO ] Deduced a trap composed of 155 places in 440 ms of which 6 ms to minimize.
[2024-05-24 15:27:40] [INFO ] Deduced a trap composed of 86 places in 507 ms of which 6 ms to minimize.
[2024-05-24 15:27:41] [INFO ] Deduced a trap composed of 145 places in 462 ms of which 6 ms to minimize.
[2024-05-24 15:27:41] [INFO ] Deduced a trap composed of 104 places in 478 ms of which 6 ms to minimize.
[2024-05-24 15:27:42] [INFO ] Deduced a trap composed of 150 places in 450 ms of which 6 ms to minimize.
[2024-05-24 15:27:42] [INFO ] Deduced a trap composed of 169 places in 426 ms of which 6 ms to minimize.
[2024-05-24 15:27:43] [INFO ] Deduced a trap composed of 77 places in 470 ms of which 7 ms to minimize.
[2024-05-24 15:27:43] [INFO ] Deduced a trap composed of 111 places in 452 ms of which 6 ms to minimize.
[2024-05-24 15:27:44] [INFO ] Deduced a trap composed of 92 places in 477 ms of which 6 ms to minimize.
[2024-05-24 15:27:44] [INFO ] Deduced a trap composed of 88 places in 460 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/955 variables, 19/232 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/955 variables, 0/232 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 28/983 variables, 28/260 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/983 variables, 27/287 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-24 15:27:45] [INFO ] Deduced a trap composed of 176 places in 437 ms of which 6 ms to minimize.
[2024-05-24 15:27:45] [INFO ] Deduced a trap composed of 77 places in 480 ms of which 6 ms to minimize.
[2024-05-24 15:27:46] [INFO ] Deduced a trap composed of 94 places in 502 ms of which 7 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/983 variables, 3/290 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/983 variables, 0/290 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/989 variables, 6/296 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/989 variables, 31/327 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/989 variables, 0/327 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Int declared 3327/3327 variables, and 1316 constraints, problems are : Problem set: 4 solved, 0 unsolved in 62840 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 989/989 constraints, ReadFeed: 0/1172 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 268/268 constraints]
After SMT, in 131252ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 18 atomic propositions for a total of 14 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 371 stabilizing places and 1015 stable transitions
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 2648/2648 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1189 transition count 2632
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1189 transition count 2632
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 41 place count 1176 transition count 2603
Iterating global reduction 0 with 13 rules applied. Total rules applied 54 place count 1176 transition count 2603
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 1171 transition count 2588
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 1171 transition count 2588
Applied a total of 64 rules in 140 ms. Remains 1171 /1203 variables (removed 32) and now considering 2588/2648 (removed 60) transitions.
[2024-05-24 15:27:50] [INFO ] Flow matrix only has 2316 transitions (discarded 272 similar events)
// Phase 1: matrix 2316 rows 1171 cols
[2024-05-24 15:27:50] [INFO ] Computed 59 invariants in 27 ms
[2024-05-24 15:27:51] [INFO ] Implicit Places using invariants in 1019 ms returned [99, 275, 346, 454, 477, 551, 576, 603, 633, 654, 733, 791, 798, 890, 891, 990, 1003, 1134]
[2024-05-24 15:27:51] [INFO ] Actually due to overlaps returned [733, 798, 1134, 99, 275, 454, 477, 551, 576, 603, 633, 654, 890, 891, 1003]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1020 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1156/1203 places, 2588/2648 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1144 transition count 2576
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1144 transition count 2576
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1132 transition count 2564
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1132 transition count 2564
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1120 transition count 2552
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1120 transition count 2552
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 83 place count 1109 transition count 2519
Iterating global reduction 0 with 11 rules applied. Total rules applied 94 place count 1109 transition count 2519
Applied a total of 94 rules in 178 ms. Remains 1109 /1156 variables (removed 47) and now considering 2519/2588 (removed 69) transitions.
[2024-05-24 15:27:51] [INFO ] Flow matrix only has 2247 transitions (discarded 272 similar events)
// Phase 1: matrix 2247 rows 1109 cols
[2024-05-24 15:27:51] [INFO ] Computed 44 invariants in 30 ms
[2024-05-24 15:27:52] [INFO ] Implicit Places using invariants in 951 ms returned [340, 754, 949]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 953 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1106/1203 places, 2519/2648 transitions.
Applied a total of 0 rules in 33 ms. Remains 1106 /1106 variables (removed 0) and now considering 2519/2519 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2324 ms. Remains : 1106/1203 places, 2519/2648 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-00
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-00 finished in 2583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 4 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 2648/2648 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1189 transition count 2632
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1189 transition count 2632
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 41 place count 1176 transition count 2603
Iterating global reduction 0 with 13 rules applied. Total rules applied 54 place count 1176 transition count 2603
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 1171 transition count 2588
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 1171 transition count 2588
Applied a total of 64 rules in 139 ms. Remains 1171 /1203 variables (removed 32) and now considering 2588/2648 (removed 60) transitions.
[2024-05-24 15:27:52] [INFO ] Flow matrix only has 2316 transitions (discarded 272 similar events)
// Phase 1: matrix 2316 rows 1171 cols
[2024-05-24 15:27:52] [INFO ] Computed 59 invariants in 41 ms
[2024-05-24 15:27:53] [INFO ] Implicit Places using invariants in 1038 ms returned [99, 275, 346, 454, 477, 551, 576, 603, 633, 645, 654, 675, 798, 890, 891, 990, 1003, 1134]
[2024-05-24 15:27:53] [INFO ] Actually due to overlaps returned [645, 798, 1134, 99, 275, 454, 477, 551, 576, 603, 633, 654, 890, 891, 1003]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1040 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1156/1203 places, 2588/2648 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1144 transition count 2576
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1144 transition count 2576
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1132 transition count 2564
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1132 transition count 2564
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1120 transition count 2552
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1120 transition count 2552
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 83 place count 1109 transition count 2519
Iterating global reduction 0 with 11 rules applied. Total rules applied 94 place count 1109 transition count 2519
Applied a total of 94 rules in 168 ms. Remains 1109 /1156 variables (removed 47) and now considering 2519/2588 (removed 69) transitions.
[2024-05-24 15:27:53] [INFO ] Flow matrix only has 2247 transitions (discarded 272 similar events)
// Phase 1: matrix 2247 rows 1109 cols
[2024-05-24 15:27:53] [INFO ] Computed 44 invariants in 32 ms
[2024-05-24 15:27:54] [INFO ] Implicit Places using invariants in 943 ms returned [340, 640, 949]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 945 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1106/1203 places, 2519/2648 transitions.
Applied a total of 0 rules in 36 ms. Remains 1106 /1106 variables (removed 0) and now considering 2519/2519 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2329 ms. Remains : 1106/1203 places, 2519/2648 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-03 finished in 2466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0))||G(p1)))'
Support contains 4 out of 1203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1203/1203 places, 2648/2648 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 1203 transition count 2637
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 1192 transition count 2637
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 22 place count 1192 transition count 2623
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 50 place count 1178 transition count 2623
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 57 place count 1171 transition count 2616
Iterating global reduction 2 with 7 rules applied. Total rules applied 64 place count 1171 transition count 2616
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 64 place count 1171 transition count 2614
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 1169 transition count 2614
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 1162 transition count 2593
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 1162 transition count 2593
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
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 130 place count 1138 transition count 2569
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 135 place count 1133 transition count 2564
Iterating global reduction 2 with 5 rules applied. Total rules applied 140 place count 1133 transition count 2564
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 145 place count 1128 transition count 2549
Iterating global reduction 2 with 5 rules applied. Total rules applied 150 place count 1128 transition count 2549
Applied a total of 150 rules in 371 ms. Remains 1128 /1203 variables (removed 75) and now considering 2549/2648 (removed 99) transitions.
[2024-05-24 15:27:55] [INFO ] Flow matrix only has 2277 transitions (discarded 272 similar events)
// Phase 1: matrix 2277 rows 1128 cols
[2024-05-24 15:27:55] [INFO ] Computed 59 invariants in 31 ms
[2024-05-24 15:27:56] [INFO ] Implicit Places using invariants in 1032 ms returned [94, 260, 331, 436, 457, 554, 579, 607, 619, 627, 648, 704, 761, 768, 858, 859, 958, 968, 1098]
[2024-05-24 15:27:56] [INFO ] Actually due to overlaps returned [619, 704, 768, 1098, 94, 260, 436, 457, 554, 579, 607, 627, 858, 859, 968]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1034 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1113/1203 places, 2549/2648 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1105 transition count 2541
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1105 transition count 2541
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 1097 transition count 2533
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 1097 transition count 2533
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 1090 transition count 2512
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 1090 transition count 2512
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 1087 transition count 2509
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 1084 transition count 2506
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 1084 transition count 2506
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 1081 transition count 2497
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 1081 transition count 2497
Applied a total of 64 rules in 302 ms. Remains 1081 /1113 variables (removed 32) and now considering 2497/2549 (removed 52) transitions.
[2024-05-24 15:27:56] [INFO ] Flow matrix only has 2225 transitions (discarded 272 similar events)
// Phase 1: matrix 2225 rows 1081 cols
[2024-05-24 15:27:56] [INFO ] Computed 44 invariants in 27 ms
[2024-05-24 15:27:57] [INFO ] Implicit Places using invariants in 970 ms returned [326, 624, 735, 928]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 972 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1077/1203 places, 2497/2648 transitions.
Applied a total of 0 rules in 62 ms. Remains 1077 /1077 variables (removed 0) and now considering 2497/2497 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2742 ms. Remains : 1077/1203 places, 2497/2648 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) p0), p0]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-04
Product exploration explored 100000 steps with 4463 reset in 579 ms.
Product exploration explored 100000 steps with 4456 reset in 557 ms.
Computed a total of 262 stabilizing places and 881 stable transitions
Computed a total of 262 stabilizing places and 881 stable transitions
Detected a total of 262/1077 stabilizing places and 881/2497 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 132 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[p0]
RANDOM walk for 16292 steps (724 resets) in 131 ms. (123 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 164 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[p0]
Stuttering acceptance computed with spot in 45 ms :[p0]
Support contains 2 out of 1077 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1077/1077 places, 2497/2497 transitions.
Applied a total of 0 rules in 63 ms. Remains 1077 /1077 variables (removed 0) and now considering 2497/2497 (removed 0) transitions.
[2024-05-24 15:27:59] [INFO ] Flow matrix only has 2225 transitions (discarded 272 similar events)
// Phase 1: matrix 2225 rows 1077 cols
[2024-05-24 15:27:59] [INFO ] Computed 40 invariants in 30 ms
[2024-05-24 15:28:00] [INFO ] Implicit Places using invariants in 1000 ms returned []
[2024-05-24 15:28:00] [INFO ] Flow matrix only has 2225 transitions (discarded 272 similar events)
[2024-05-24 15:28:00] [INFO ] Invariant cache hit.
[2024-05-24 15:28:01] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-24 15:28:10] [INFO ] Implicit Places using invariants and state equation in 9826 ms returned [1064]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10832 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1076/1077 places, 2497/2497 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 1076 transition count 2496
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 1075 transition count 2496
Applied a total of 2 rules in 79 ms. Remains 1075 /1076 variables (removed 1) and now considering 2496/2497 (removed 1) transitions.
[2024-05-24 15:28:10] [INFO ] Flow matrix only has 2224 transitions (discarded 272 similar events)
// Phase 1: matrix 2224 rows 1075 cols
[2024-05-24 15:28:10] [INFO ] Computed 39 invariants in 31 ms
[2024-05-24 15:28:11] [INFO ] Implicit Places using invariants in 974 ms returned []
[2024-05-24 15:28:11] [INFO ] Flow matrix only has 2224 transitions (discarded 272 similar events)
[2024-05-24 15:28:11] [INFO ] Invariant cache hit.
[2024-05-24 15:28:12] [INFO ] State equation strengthened by 828 read => feed constraints.
[2024-05-24 15:28:21] [INFO ] Implicit Places using invariants and state equation in 10052 ms returned []
Implicit Place search using SMT with State Equation took 11029 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1075/1077 places, 2496/2497 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22004 ms. Remains : 1075/1077 places, 2496/2497 transitions.
Computed a total of 260 stabilizing places and 880 stable transitions
Computed a total of 260 stabilizing places and 880 stable transitions
Detected a total of 260/1075 stabilizing places and 880/2496 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[p0]
RANDOM walk for 14746 steps (659 resets) in 103 ms. (141 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[p0]
Stuttering acceptance computed with spot in 35 ms :[p0]
Stuttering acceptance computed with spot in 44 ms :[p0]
Product exploration explored 100000 steps with 4478 reset in 473 ms.
Product exploration explored 100000 steps with 4484 reset in 485 ms.
Support contains 2 out of 1075 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1075/1075 places, 2496/2496 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1074 transition count 2493
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1074 transition count 2493
Applied a total of 2 rules in 101 ms. Remains 1074 /1075 variables (removed 1) and now considering 2493/2496 (removed 3) transitions.
[2024-05-24 15:28:22] [INFO ] Flow matrix only has 2221 transitions (discarded 272 similar events)
// Phase 1: matrix 2221 rows 1074 cols
[2024-05-24 15:28:22] [INFO ] Computed 39 invariants in 27 ms
[2024-05-24 15:28:23] [INFO ] Implicit Places using invariants in 958 ms returned []
[2024-05-24 15:28:23] [INFO ] Flow matrix only has 2221 transitions (discarded 272 similar events)
[2024-05-24 15:28:23] [INFO ] Invariant cache hit.
[2024-05-24 15:28:24] [INFO ] State equation strengthened by 826 read => feed constraints.
[2024-05-24 15:28:33] [INFO ] Implicit Places using invariants and state equation in 9888 ms returned []
Implicit Place search using SMT with State Equation took 10848 ms to find 0 implicit places.
[2024-05-24 15:28:33] [INFO ] Redundant transitions in 113 ms returned []
Running 2476 sub problems to find dead transitions.
[2024-05-24 15:28:33] [INFO ] Flow matrix only has 2221 transitions (discarded 272 similar events)
[2024-05-24 15:28:33] [INFO ] Invariant cache hit.
[2024-05-24 15:28:33] [INFO ] State equation strengthened by 826 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 0.0)
(s405 1.0)timeout

(s406 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1072 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2476 unsolved
SMT process timed out in 33173ms, After SMT, problems are : Problem set: 0 solved, 2476 unsolved
Search for dead transitions found 0 dead transitions in 33202ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1074/1075 places, 2493/2496 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44290 ms. Remains : 1074/1075 places, 2493/2496 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-04 finished in 72486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 2648/2648 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1190 transition count 2633
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1190 transition count 2633
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 38 place count 1178 transition count 2605
Iterating global reduction 0 with 12 rules applied. Total rules applied 50 place count 1178 transition count 2605
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 1174 transition count 2593
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 1174 transition count 2593
Applied a total of 58 rules in 166 ms. Remains 1174 /1203 variables (removed 29) and now considering 2593/2648 (removed 55) transitions.
[2024-05-24 15:29:07] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1174 cols
[2024-05-24 15:29:07] [INFO ] Computed 59 invariants in 22 ms
[2024-05-24 15:29:08] [INFO ] Implicit Places using invariants in 1075 ms returned [99, 275, 346, 454, 477, 551, 576, 603, 633, 645, 654, 675, 733, 791, 798, 890, 891, 990, 1137]
[2024-05-24 15:29:08] [INFO ] Actually due to overlaps returned [645, 733, 798, 1137, 99, 275, 454, 477, 551, 576, 603, 633, 654, 890, 891]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1091 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1159/1203 places, 2593/2648 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1148 transition count 2582
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1148 transition count 2582
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1137 transition count 2571
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1137 transition count 2571
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1126 transition count 2560
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1126 transition count 2560
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 1116 transition count 2530
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 1116 transition count 2530
Applied a total of 86 rules in 186 ms. Remains 1116 /1159 variables (removed 43) and now considering 2530/2593 (removed 63) transitions.
[2024-05-24 15:29:08] [INFO ] Flow matrix only has 2258 transitions (discarded 272 similar events)
// Phase 1: matrix 2258 rows 1116 cols
[2024-05-24 15:29:08] [INFO ] Computed 44 invariants in 25 ms
[2024-05-24 15:29:09] [INFO ] Implicit Places using invariants in 947 ms returned [340, 640, 753, 948]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 949 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1112/1203 places, 2530/2648 transitions.
Applied a total of 0 rules in 33 ms. Remains 1112 /1112 variables (removed 0) and now considering 2530/2530 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2426 ms. Remains : 1112/1203 places, 2530/2648 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 595 ms.
Product exploration explored 100000 steps with 50000 reset in 578 ms.
Computed a total of 280 stabilizing places and 897 stable transitions
Computed a total of 280 stabilizing places and 897 stable transitions
Detected a total of 280/1112 stabilizing places and 897/2530 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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-05 finished in 3789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 6 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 2648/2648 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1189 transition count 2632
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1189 transition count 2632
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 41 place count 1176 transition count 2603
Iterating global reduction 0 with 13 rules applied. Total rules applied 54 place count 1176 transition count 2603
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 1171 transition count 2588
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 1171 transition count 2588
Applied a total of 64 rules in 144 ms. Remains 1171 /1203 variables (removed 32) and now considering 2588/2648 (removed 60) transitions.
[2024-05-24 15:29:11] [INFO ] Flow matrix only has 2316 transitions (discarded 272 similar events)
// Phase 1: matrix 2316 rows 1171 cols
[2024-05-24 15:29:11] [INFO ] Computed 59 invariants in 23 ms
[2024-05-24 15:29:12] [INFO ] Implicit Places using invariants in 959 ms returned [99, 275, 454, 477, 551, 576, 603, 633, 645, 654, 675, 733, 791, 890, 891, 990, 1003, 1134]
[2024-05-24 15:29:12] [INFO ] Actually due to overlaps returned [645, 733, 1134, 99, 275, 454, 477, 551, 576, 603, 633, 654, 890, 891, 1003]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 961 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1156/1203 places, 2588/2648 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1144 transition count 2576
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1144 transition count 2576
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1132 transition count 2564
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1132 transition count 2564
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 60 place count 1120 transition count 2552
Iterating global reduction 0 with 12 rules applied. Total rules applied 72 place count 1120 transition count 2552
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 83 place count 1109 transition count 2519
Iterating global reduction 0 with 11 rules applied. Total rules applied 94 place count 1109 transition count 2519
Applied a total of 94 rules in 168 ms. Remains 1109 /1156 variables (removed 47) and now considering 2519/2588 (removed 69) transitions.
[2024-05-24 15:29:12] [INFO ] Flow matrix only has 2247 transitions (discarded 272 similar events)
// Phase 1: matrix 2247 rows 1109 cols
[2024-05-24 15:29:12] [INFO ] Computed 44 invariants in 34 ms
[2024-05-24 15:29:13] [INFO ] Implicit Places using invariants in 863 ms returned [640, 753, 949]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 865 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1106/1203 places, 2519/2648 transitions.
Applied a total of 0 rules in 33 ms. Remains 1106 /1106 variables (removed 0) and now considering 2519/2519 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2174 ms. Remains : 1106/1203 places, 2519/2648 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-13 finished in 2287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||F(p1)) U p1)))'
Support contains 1 out of 1203 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 2648/2648 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1190 transition count 2633
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1190 transition count 2633
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 38 place count 1178 transition count 2605
Iterating global reduction 0 with 12 rules applied. Total rules applied 50 place count 1178 transition count 2605
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 1174 transition count 2593
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 1174 transition count 2593
Applied a total of 58 rules in 137 ms. Remains 1174 /1203 variables (removed 29) and now considering 2593/2648 (removed 55) transitions.
[2024-05-24 15:29:13] [INFO ] Flow matrix only has 2321 transitions (discarded 272 similar events)
// Phase 1: matrix 2321 rows 1174 cols
[2024-05-24 15:29:13] [INFO ] Computed 59 invariants in 30 ms
[2024-05-24 15:29:14] [INFO ] Implicit Places using invariants in 1031 ms returned [99, 275, 346, 454, 554, 579, 606, 636, 648, 657, 678, 736, 794, 801, 893, 894, 993, 1006, 1137]
[2024-05-24 15:29:14] [INFO ] Actually due to overlaps returned [648, 736, 801, 1137, 99, 275, 454, 554, 579, 606, 636, 657, 893, 894, 1006]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 1033 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1159/1203 places, 2593/2648 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1148 transition count 2582
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1148 transition count 2582
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1137 transition count 2571
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1137 transition count 2571
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 1126 transition count 2560
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 1126 transition count 2560
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 1116 transition count 2530
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 1116 transition count 2530
Applied a total of 86 rules in 166 ms. Remains 1116 /1159 variables (removed 43) and now considering 2530/2593 (removed 63) transitions.
[2024-05-24 15:29:14] [INFO ] Flow matrix only has 2258 transitions (discarded 272 similar events)
// Phase 1: matrix 2258 rows 1116 cols
[2024-05-24 15:29:14] [INFO ] Computed 44 invariants in 31 ms
[2024-05-24 15:29:15] [INFO ] Implicit Places using invariants in 934 ms returned [340, 647, 760, 955]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 936 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1112/1203 places, 2530/2648 transitions.
Applied a total of 0 rules in 32 ms. Remains 1112 /1112 variables (removed 0) and now considering 2530/2530 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2306 ms. Remains : 1112/1203 places, 2530/2648 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-14
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C03-LTLFireability-14 finished in 2401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0))||G(p1)))'
[2024-05-24 15:29:16] [INFO ] Flatten gal took : 100 ms
[2024-05-24 15:29:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-24 15:29:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1203 places, 2648 transitions and 11849 arcs took 18 ms.
Total runtime 311905 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MultiCrashLeafsetExtension-PT-S16C03

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/421/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1203
TRANSITIONS: 2648
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.059s, Sys 0.003s]


SAVING FILE /home/mcc/execution/421/model (.net / .def) ...
EXPORT TIME: [User 0.008s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2107
MODEL NAME: /home/mcc/execution/421/model
1203 places, 2648 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
EXITCODE: 80
----------------------------------------------------------------------

BK_STOP 1716565447599

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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-S16C03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r245-tall-171654349000012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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