fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r292-tall-162124156700597
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16246.831 3600000.00 2484367.00 667969.00 FFFTT?FTFFFTFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156700597.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156700597
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.7M
-rw-r--r-- 1 mcc users 54K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 189K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 45K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 154K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 6.2K May 11 18:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 11 18:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 11 15:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 11 15:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 9.1M May 12 08:13 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-15

=== Now, execution of the tool begins

BK_START 1621326691102

Running Version 0
[2021-05-18 08:31:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 08:31:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 08:31:33] [INFO ] Load time of PNML (sax parser for PT used): 365 ms
[2021-05-18 08:31:33] [INFO ] Transformed 4914 places.
[2021-05-18 08:31:33] [INFO ] Transformed 6913 transitions.
[2021-05-18 08:31:33] [INFO ] Parsed PT model containing 4914 places and 6913 transitions in 436 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-18 08:31:33] [INFO ] Initial state test concluded for 2 properties.
Support contains 78 out of 4914 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 4884 transition count 6913
Discarding 1338 places :
Symmetric choice reduction at 1 with 1338 rule applications. Total rules 1368 place count 3546 transition count 5575
Iterating global reduction 1 with 1338 rules applied. Total rules applied 2706 place count 3546 transition count 5575
Discarding 1170 places :
Symmetric choice reduction at 1 with 1170 rule applications. Total rules 3876 place count 2376 transition count 4405
Iterating global reduction 1 with 1170 rules applied. Total rules applied 5046 place count 2376 transition count 4405
Discarding 209 places :
Symmetric choice reduction at 1 with 209 rule applications. Total rules 5255 place count 2167 transition count 3360
Iterating global reduction 1 with 209 rules applied. Total rules applied 5464 place count 2167 transition count 3360
Applied a total of 5464 rules in 1095 ms. Remains 2167 /4914 variables (removed 2747) and now considering 3360/6913 (removed 3553) transitions.
[2021-05-18 08:31:35] [INFO ] Flow matrix only has 3088 transitions (discarded 272 similar events)
// Phase 1: matrix 3088 rows 2167 cols
[2021-05-18 08:31:35] [INFO ] Computed 505 place invariants in 188 ms
[2021-05-18 08:31:37] [INFO ] Implicit Places using invariants in 2628 ms returned [4, 8, 14, 16, 18, 20, 22, 27, 34, 43, 56, 69, 84, 100, 116, 122, 124, 126, 141, 152, 161, 168, 173, 176, 201, 208, 211, 212, 213, 214, 215, 216, 219, 224, 231, 240, 251, 264, 278, 292, 293, 294, 296, 297, 308, 317, 324, 330, 333, 335, 361, 368, 371, 372, 373, 375, 376, 378, 381, 389, 396, 405, 416, 428, 441, 442, 443, 444, 445, 454, 464, 469, 472, 474, 476, 506, 509, 510, 511, 513, 514, 516, 518, 521, 526, 535, 544, 554, 564, 565, 566, 567, 568, 569, 576, 581, 584, 586, 588, 590, 613, 620, 623, 624, 625, 626, 629, 633, 635, 637, 640, 645, 652, 660, 669, 670, 671, 672, 673, 678, 681, 683, 685, 690, 693, 716, 723, 726, 727, 728, 729, 730, 731, 734, 736, 738, 741, 744, 749, 755, 761, 762, 763, 764, 765, 766, 769, 771, 773, 775, 777, 779, 802, 809, 812, 813, 814, 817, 822, 824, 826, 828, 830, 833, 840, 844, 845, 846, 847, 848, 849, 851, 853, 855, 857, 859, 861, 884, 891, 894, 895, 896, 897, 898, 899, 903, 905, 907, 909, 911, 914, 917, 918, 919, 920, 921, 922, 924, 926, 928, 930, 932, 934, 957, 959, 963, 966, 967, 968, 969, 971, 973, 975, 977, 979, 981, 983, 988, 991, 992, 993, 994, 995, 996, 998, 1000, 1002, 1004, 1006, 1008, 1031, 1038, 1041, 1042, 1043, 1045, 1046, 1048, 1050, 1052, 1055, 1057, 1062, 1064, 1067, 1068, 1069, 1071, 1072, 1076, 1078, 1080, 1082, 1084, 1086, 1109, 1116, 1119, 1120, 1123, 1124, 1125, 1129, 1131, 1133, 1135, 1137, 1139, 1142, 1147, 1148, 1149, 1150, 1151, 1152, 1155, 1157, 1159, 1161, 1163, 1165, 1188, 1195, 1198, 1199, 1200, 1201, 1202, 1203, 1205, 1207, 1209, 1211, 1213, 1216, 1221, 1228, 1229, 1230, 1231, 1232, 1233, 1238, 1241, 1243, 1245, 1247, 1249, 1272, 1279, 1282, 1283, 1285, 1286, 1287, 1289, 1291, 1293, 1295, 1298, 1305, 1312, 1321, 1322, 1323, 1324, 1326, 1333, 1338, 1341, 1345, 1347, 1349, 1372, 1379, 1382, 1383, 1384, 1385, 1386, 1387, 1390, 1392, 1394, 1397, 1402, 1409, 1418, 1429, 1430, 1431, 1432, 1433, 1434, 1443, 1450, 1455, 1458, 1460, 1462, 1485, 1492, 1495, 1496, 1497, 1498, 1499, 1500, 1502, 1504, 1507, 1512, 1519, 1528, 1539, 1552, 1553, 1556, 1557, 1558, 1571, 1581, 1588, 1593, 1596, 1598, 1621, 1628, 1631, 1633, 1634, 1635, 1636, 1638, 1642, 1647, 1657, 1666, 1677, 1690, 1705, 1706, 1707, 1708, 1709, 1710, 1723, 1734, 1743, 1750, 1755, 1758, 1781, 1787, 1791, 1792, 1793, 1794, 1795, 1800, 1805, 1812, 1821, 1832, 1845, 1860, 1877, 1878, 1879, 1880, 1881, 1882, 1897, 1910, 1921, 1930, 1937, 1942, 1966]
Discarding 439 places :
Implicit Place search using SMT only with invariants took 2660 ms to find 439 implicit places.
[2021-05-18 08:31:37] [INFO ] Flow matrix only has 3088 transitions (discarded 272 similar events)
// Phase 1: matrix 3088 rows 1728 cols
[2021-05-18 08:31:37] [INFO ] Computed 66 place invariants in 49 ms
[2021-05-18 08:31:39] [INFO ] Dead Transitions using invariants and state equation in 1579 ms returned []
Starting structural reductions, iteration 1 : 1728/4914 places, 3360/6913 transitions.
Discarding 140 places :
Symmetric choice reduction at 0 with 140 rule applications. Total rules 140 place count 1588 transition count 3220
Iterating global reduction 0 with 140 rules applied. Total rules applied 280 place count 1588 transition count 3220
Discarding 140 places :
Symmetric choice reduction at 0 with 140 rule applications. Total rules 420 place count 1448 transition count 3080
Iterating global reduction 0 with 140 rules applied. Total rules applied 560 place count 1448 transition count 3080
Discarding 140 places :
Symmetric choice reduction at 0 with 140 rule applications. Total rules 700 place count 1308 transition count 2940
Iterating global reduction 0 with 140 rules applied. Total rules applied 840 place count 1308 transition count 2940
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 854 place count 1294 transition count 2870
Iterating global reduction 0 with 14 rules applied. Total rules applied 868 place count 1294 transition count 2870
Applied a total of 868 rules in 213 ms. Remains 1294 /1728 variables (removed 434) and now considering 2870/3360 (removed 490) transitions.
[2021-05-18 08:31:39] [INFO ] Flow matrix only has 2598 transitions (discarded 272 similar events)
// Phase 1: matrix 2598 rows 1294 cols
[2021-05-18 08:31:39] [INFO ] Computed 66 place invariants in 42 ms
[2021-05-18 08:31:40] [INFO ] Implicit Places using invariants in 989 ms returned []
[2021-05-18 08:31:40] [INFO ] Flow matrix only has 2598 transitions (discarded 272 similar events)
// Phase 1: matrix 2598 rows 1294 cols
[2021-05-18 08:31:40] [INFO ] Computed 66 place invariants in 37 ms
[2021-05-18 08:31:41] [INFO ] State equation strengthened by 1031 read => feed constraints.
[2021-05-18 08:32:05] [INFO ] Implicit Places using invariants and state equation in 25274 ms returned []
Implicit Place search using SMT with State Equation took 26267 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1294/4914 places, 2870/6913 transitions.
[2021-05-18 08:32:06] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-18 08:32:06] [INFO ] Flatten gal took : 254 ms
FORMULA MultiCrashLeafsetExtension-PT-S16C05-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 08:32:06] [INFO ] Flatten gal took : 146 ms
[2021-05-18 08:32:06] [INFO ] Input system was already deterministic with 2870 transitions.
Incomplete random walk after 100000 steps, including 1923 resets, run finished after 927 ms. (steps per millisecond=107 ) properties (out of 36) seen :20
Running SMT prover for 16 properties.
[2021-05-18 08:32:07] [INFO ] Flow matrix only has 2598 transitions (discarded 272 similar events)
// Phase 1: matrix 2598 rows 1294 cols
[2021-05-18 08:32:07] [INFO ] Computed 66 place invariants in 33 ms
[2021-05-18 08:32:07] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2021-05-18 08:32:07] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 5 ms returned sat
[2021-05-18 08:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:32:08] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2021-05-18 08:32:08] [INFO ] State equation strengthened by 1031 read => feed constraints.
[2021-05-18 08:32:09] [INFO ] [Real]Added 1031 Read/Feed constraints in 637 ms returned sat
[2021-05-18 08:32:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:32:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2021-05-18 08:32:09] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 5 ms returned sat
[2021-05-18 08:32:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:32:10] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2021-05-18 08:32:12] [INFO ] [Nat]Added 1031 Read/Feed constraints in 1985 ms returned sat
[2021-05-18 08:32:12] [INFO ] Computed and/alt/rep : 2207/4216/2207 causal constraints (skipped 374 transitions) in 216 ms.
[2021-05-18 08:32:15] [INFO ] Added : 88 causal constraints over 18 iterations in 2552 ms. Result :sat
[2021-05-18 08:32:15] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2021-05-18 08:32:15] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 5 ms returned sat
[2021-05-18 08:32:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:32:15] [INFO ] [Real]Absence check using state equation in 713 ms returned sat
[2021-05-18 08:32:16] [INFO ] [Real]Added 1031 Read/Feed constraints in 489 ms returned sat
[2021-05-18 08:32:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:32:16] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2021-05-18 08:32:16] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 6 ms returned sat
[2021-05-18 08:32:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:32:17] [INFO ] [Nat]Absence check using state equation in 718 ms returned sat
[2021-05-18 08:32:19] [INFO ] [Nat]Added 1031 Read/Feed constraints in 1846 ms returned sat
[2021-05-18 08:32:19] [INFO ] Deduced a trap composed of 428 places in 568 ms of which 4 ms to minimize.
[2021-05-18 08:32:20] [INFO ] Deduced a trap composed of 201 places in 711 ms of which 2 ms to minimize.
[2021-05-18 08:32:21] [INFO ] Deduced a trap composed of 170 places in 583 ms of which 2 ms to minimize.
[2021-05-18 08:32:22] [INFO ] Deduced a trap composed of 208 places in 594 ms of which 2 ms to minimize.
[2021-05-18 08:32:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3007 ms
[2021-05-18 08:32:22] [INFO ] Computed and/alt/rep : 2207/4216/2207 causal constraints (skipped 374 transitions) in 157 ms.
[2021-05-18 08:32:29] [INFO ] Deduced a trap composed of 192 places in 580 ms of which 1 ms to minimize.
[2021-05-18 08:32:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 770 ms
[2021-05-18 08:32:30] [INFO ] Added : 242 causal constraints over 49 iterations in 7753 ms. Result :sat
[2021-05-18 08:32:30] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2021-05-18 08:32:30] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 6 ms returned sat
[2021-05-18 08:32:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:32:30] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2021-05-18 08:32:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:32:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2021-05-18 08:32:31] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 6 ms returned sat
[2021-05-18 08:32:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:32:31] [INFO ] [Nat]Absence check using state equation in 695 ms returned sat
[2021-05-18 08:32:33] [INFO ] [Nat]Added 1031 Read/Feed constraints in 1301 ms returned sat
[2021-05-18 08:32:33] [INFO ] Computed and/alt/rep : 2207/4216/2207 causal constraints (skipped 374 transitions) in 133 ms.
[2021-05-18 08:32:35] [INFO ] Added : 83 causal constraints over 17 iterations in 2168 ms. Result :sat
[2021-05-18 08:32:35] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2021-05-18 08:32:35] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 6 ms returned sat
[2021-05-18 08:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:32:36] [INFO ] [Real]Absence check using state equation in 692 ms returned sat
[2021-05-18 08:32:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:32:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2021-05-18 08:32:36] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 6 ms returned sat
[2021-05-18 08:32:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:32:37] [INFO ] [Nat]Absence check using state equation in 740 ms returned sat
[2021-05-18 08:32:37] [INFO ] [Nat]Added 1031 Read/Feed constraints in 260 ms returned unsat
[2021-05-18 08:32:37] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2021-05-18 08:32:37] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 6 ms returned sat
[2021-05-18 08:32:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:32:38] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2021-05-18 08:32:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:32:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 30 ms returned sat
[2021-05-18 08:32:38] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 6 ms returned sat
[2021-05-18 08:32:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:32:39] [INFO ] [Nat]Absence check using state equation in 725 ms returned sat
[2021-05-18 08:32:41] [INFO ] [Nat]Added 1031 Read/Feed constraints in 2276 ms returned sat
[2021-05-18 08:32:41] [INFO ] Computed and/alt/rep : 2207/4216/2207 causal constraints (skipped 374 transitions) in 165 ms.
[2021-05-18 08:32:44] [INFO ] Added : 84 causal constraints over 17 iterations in 2623 ms. Result :sat
[2021-05-18 08:32:44] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2021-05-18 08:32:44] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 19 ms returned sat
[2021-05-18 08:32:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:32:44] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2021-05-18 08:32:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:32:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2021-05-18 08:32:44] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 6 ms returned sat
[2021-05-18 08:32:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:32:45] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2021-05-18 08:32:47] [INFO ] [Nat]Added 1031 Read/Feed constraints in 2171 ms returned sat
[2021-05-18 08:32:48] [INFO ] Deduced a trap composed of 387 places in 538 ms of which 1 ms to minimize.
[2021-05-18 08:32:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 670 ms
[2021-05-18 08:32:48] [INFO ] Computed and/alt/rep : 2207/4216/2207 causal constraints (skipped 374 transitions) in 148 ms.
[2021-05-18 08:32:50] [INFO ] Added : 84 causal constraints over 17 iterations in 2183 ms. Result :sat
[2021-05-18 08:32:50] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2021-05-18 08:32:50] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 5 ms returned sat
[2021-05-18 08:32:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:32:51] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2021-05-18 08:32:51] [INFO ] [Real]Added 1031 Read/Feed constraints in 561 ms returned sat
[2021-05-18 08:32:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:32:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2021-05-18 08:32:52] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 5 ms returned sat
[2021-05-18 08:32:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:32:52] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2021-05-18 08:32:53] [INFO ] [Nat]Added 1031 Read/Feed constraints in 319 ms returned unsat
[2021-05-18 08:32:53] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2021-05-18 08:32:53] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 5 ms returned sat
[2021-05-18 08:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:32:53] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2021-05-18 08:32:54] [INFO ] [Real]Added 1031 Read/Feed constraints in 526 ms returned sat
[2021-05-18 08:32:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:32:54] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2021-05-18 08:32:54] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 5 ms returned sat
[2021-05-18 08:32:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:32:55] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2021-05-18 08:32:56] [INFO ] [Nat]Added 1031 Read/Feed constraints in 1215 ms returned sat
[2021-05-18 08:32:57] [INFO ] Deduced a trap composed of 505 places in 555 ms of which 1 ms to minimize.
[2021-05-18 08:32:57] [INFO ] Deduced a trap composed of 321 places in 563 ms of which 2 ms to minimize.
[2021-05-18 08:32:59] [INFO ] Deduced a trap composed of 190 places in 566 ms of which 1 ms to minimize.
[2021-05-18 08:33:00] [INFO ] Deduced a trap composed of 131 places in 571 ms of which 1 ms to minimize.
[2021-05-18 08:33:00] [INFO ] Deduced a trap composed of 281 places in 563 ms of which 2 ms to minimize.
[2021-05-18 08:33:01] [INFO ] Deduced a trap composed of 166 places in 611 ms of which 1 ms to minimize.
[2021-05-18 08:33:02] [INFO ] Deduced a trap composed of 280 places in 544 ms of which 1 ms to minimize.
[2021-05-18 08:33:03] [INFO ] Deduced a trap composed of 293 places in 548 ms of which 1 ms to minimize.
[2021-05-18 08:33:03] [INFO ] Deduced a trap composed of 310 places in 552 ms of which 1 ms to minimize.
[2021-05-18 08:33:05] [INFO ] Deduced a trap composed of 139 places in 588 ms of which 2 ms to minimize.
[2021-05-18 08:33:05] [INFO ] Deduced a trap composed of 546 places in 539 ms of which 1 ms to minimize.
[2021-05-18 08:33:06] [INFO ] Deduced a trap composed of 143 places in 565 ms of which 1 ms to minimize.
[2021-05-18 08:33:07] [INFO ] Deduced a trap composed of 379 places in 567 ms of which 1 ms to minimize.
[2021-05-18 08:33:08] [INFO ] Deduced a trap composed of 347 places in 569 ms of which 1 ms to minimize.
[2021-05-18 08:33:09] [INFO ] Deduced a trap composed of 190 places in 561 ms of which 8 ms to minimize.
[2021-05-18 08:33:09] [INFO ] Deduced a trap composed of 347 places in 569 ms of which 1 ms to minimize.
[2021-05-18 08:33:10] [INFO ] Deduced a trap composed of 154 places in 566 ms of which 1 ms to minimize.
[2021-05-18 08:33:11] [INFO ] Deduced a trap composed of 163 places in 568 ms of which 1 ms to minimize.
[2021-05-18 08:33:12] [INFO ] Deduced a trap composed of 328 places in 549 ms of which 1 ms to minimize.
[2021-05-18 08:33:12] [INFO ] Deduced a trap composed of 206 places in 563 ms of which 1 ms to minimize.
[2021-05-18 08:33:13] [INFO ] Deduced a trap composed of 234 places in 588 ms of which 1 ms to minimize.
[2021-05-18 08:33:14] [INFO ] Deduced a trap composed of 303 places in 549 ms of which 1 ms to minimize.
[2021-05-18 08:33:15] [INFO ] Deduced a trap composed of 196 places in 575 ms of which 2 ms to minimize.
[2021-05-18 08:33:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-05-18 08:33:15] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2021-05-18 08:33:15] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 5 ms returned sat
[2021-05-18 08:33:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:33:15] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2021-05-18 08:33:16] [INFO ] [Real]Added 1031 Read/Feed constraints in 285 ms returned sat
[2021-05-18 08:33:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:33:16] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2021-05-18 08:33:16] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 6 ms returned sat
[2021-05-18 08:33:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:33:17] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2021-05-18 08:33:17] [INFO ] [Nat]Added 1031 Read/Feed constraints in 589 ms returned sat
[2021-05-18 08:33:17] [INFO ] Computed and/alt/rep : 2207/4216/2207 causal constraints (skipped 374 transitions) in 130 ms.
[2021-05-18 08:33:19] [INFO ] Added : 86 causal constraints over 18 iterations in 2113 ms. Result :sat
[2021-05-18 08:33:20] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2021-05-18 08:33:20] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 5 ms returned sat
[2021-05-18 08:33:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:33:20] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2021-05-18 08:33:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:33:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2021-05-18 08:33:20] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 5 ms returned sat
[2021-05-18 08:33:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:33:21] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2021-05-18 08:33:23] [INFO ] [Nat]Added 1031 Read/Feed constraints in 1461 ms returned unsat
[2021-05-18 08:33:23] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2021-05-18 08:33:23] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 5 ms returned sat
[2021-05-18 08:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:33:23] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2021-05-18 08:33:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:33:24] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2021-05-18 08:33:24] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 5 ms returned sat
[2021-05-18 08:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:33:24] [INFO ] [Nat]Absence check using state equation in 737 ms returned sat
[2021-05-18 08:33:25] [INFO ] [Nat]Added 1031 Read/Feed constraints in 1041 ms returned sat
[2021-05-18 08:33:26] [INFO ] Deduced a trap composed of 418 places in 541 ms of which 1 ms to minimize.
[2021-05-18 08:33:27] [INFO ] Deduced a trap composed of 152 places in 568 ms of which 1 ms to minimize.
[2021-05-18 08:33:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1338 ms
[2021-05-18 08:33:27] [INFO ] Computed and/alt/rep : 2207/4216/2207 causal constraints (skipped 374 transitions) in 137 ms.
[2021-05-18 08:33:33] [INFO ] Deduced a trap composed of 164 places in 571 ms of which 1 ms to minimize.
[2021-05-18 08:33:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 758 ms
[2021-05-18 08:33:33] [INFO ] Added : 254 causal constraints over 51 iterations in 6669 ms. Result :sat
[2021-05-18 08:33:34] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2021-05-18 08:33:34] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 5 ms returned sat
[2021-05-18 08:33:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:33:34] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2021-05-18 08:33:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:33:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2021-05-18 08:33:34] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 6 ms returned sat
[2021-05-18 08:33:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:33:35] [INFO ] [Nat]Absence check using state equation in 726 ms returned sat
[2021-05-18 08:33:36] [INFO ] [Nat]Added 1031 Read/Feed constraints in 1042 ms returned sat
[2021-05-18 08:33:37] [INFO ] Deduced a trap composed of 418 places in 552 ms of which 1 ms to minimize.
[2021-05-18 08:33:38] [INFO ] Deduced a trap composed of 152 places in 568 ms of which 2 ms to minimize.
[2021-05-18 08:33:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1358 ms
[2021-05-18 08:33:38] [INFO ] Computed and/alt/rep : 2207/4216/2207 causal constraints (skipped 374 transitions) in 160 ms.
[2021-05-18 08:33:44] [INFO ] Deduced a trap composed of 164 places in 573 ms of which 1 ms to minimize.
[2021-05-18 08:33:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 763 ms
[2021-05-18 08:33:44] [INFO ] Added : 254 causal constraints over 51 iterations in 6710 ms. Result :sat
[2021-05-18 08:33:44] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2021-05-18 08:33:44] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 5 ms returned sat
[2021-05-18 08:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:33:45] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2021-05-18 08:33:46] [INFO ] [Real]Added 1031 Read/Feed constraints in 292 ms returned sat
[2021-05-18 08:33:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:33:46] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2021-05-18 08:33:46] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 6 ms returned sat
[2021-05-18 08:33:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:33:46] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2021-05-18 08:33:47] [INFO ] [Nat]Added 1031 Read/Feed constraints in 520 ms returned sat
[2021-05-18 08:33:47] [INFO ] Deduced a trap composed of 263 places in 518 ms of which 1 ms to minimize.
[2021-05-18 08:33:48] [INFO ] Deduced a trap composed of 313 places in 525 ms of which 1 ms to minimize.
[2021-05-18 08:33:49] [INFO ] Deduced a trap composed of 279 places in 520 ms of which 1 ms to minimize.
[2021-05-18 08:33:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1996 ms
[2021-05-18 08:33:49] [INFO ] Computed and/alt/rep : 2207/4216/2207 causal constraints (skipped 374 transitions) in 130 ms.
[2021-05-18 08:33:53] [INFO ] Deduced a trap composed of 290 places in 516 ms of which 1 ms to minimize.
[2021-05-18 08:33:53] [INFO ] Deduced a trap composed of 262 places in 560 ms of which 1 ms to minimize.
[2021-05-18 08:33:54] [INFO ] Deduced a trap composed of 252 places in 570 ms of which 1 ms to minimize.
[2021-05-18 08:33:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2125 ms
[2021-05-18 08:33:55] [INFO ] Deduced a trap composed of 367 places in 547 ms of which 1 ms to minimize.
[2021-05-18 08:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 705 ms
[2021-05-18 08:33:56] [INFO ] Added : 145 causal constraints over 32 iterations in 6712 ms. Result :sat
[2021-05-18 08:33:56] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned unsat
[2021-05-18 08:33:56] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2021-05-18 08:33:56] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 5 ms returned sat
[2021-05-18 08:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:33:57] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2021-05-18 08:33:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:33:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2021-05-18 08:33:57] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 6 ms returned sat
[2021-05-18 08:33:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:33:57] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2021-05-18 08:33:59] [INFO ] [Nat]Added 1031 Read/Feed constraints in 1461 ms returned sat
[2021-05-18 08:33:59] [INFO ] Deduced a trap composed of 276 places in 518 ms of which 1 ms to minimize.
[2021-05-18 08:34:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 727 ms
[2021-05-18 08:34:00] [INFO ] Computed and/alt/rep : 2207/4216/2207 causal constraints (skipped 374 transitions) in 138 ms.
[2021-05-18 08:34:02] [INFO ] Added : 114 causal constraints over 23 iterations in 2838 ms. Result :sat
[2021-05-18 08:34:03] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2021-05-18 08:34:03] [INFO ] [Real]Absence check using 33 positive and 33 generalized place invariants in 5 ms returned sat
[2021-05-18 08:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:34:03] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2021-05-18 08:34:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:34:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2021-05-18 08:34:03] [INFO ] [Nat]Absence check using 33 positive and 33 generalized place invariants in 14 ms returned sat
[2021-05-18 08:34:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:34:04] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2021-05-18 08:34:06] [INFO ] [Nat]Added 1031 Read/Feed constraints in 2277 ms returned sat
[2021-05-18 08:34:07] [INFO ] Deduced a trap composed of 252 places in 524 ms of which 1 ms to minimize.
[2021-05-18 08:34:08] [INFO ] Deduced a trap composed of 264 places in 512 ms of which 1 ms to minimize.
[2021-05-18 08:34:08] [INFO ] Deduced a trap composed of 262 places in 540 ms of which 1 ms to minimize.
[2021-05-18 08:34:09] [INFO ] Deduced a trap composed of 299 places in 530 ms of which 1 ms to minimize.
[2021-05-18 08:34:10] [INFO ] Deduced a trap composed of 299 places in 532 ms of which 1 ms to minimize.
[2021-05-18 08:34:10] [INFO ] Deduced a trap composed of 316 places in 516 ms of which 2 ms to minimize.
[2021-05-18 08:34:11] [INFO ] Deduced a trap composed of 305 places in 561 ms of which 1 ms to minimize.
[2021-05-18 08:34:12] [INFO ] Deduced a trap composed of 152 places in 554 ms of which 1 ms to minimize.
[2021-05-18 08:34:13] [INFO ] Deduced a trap composed of 285 places in 563 ms of which 1 ms to minimize.
[2021-05-18 08:34:14] [INFO ] Deduced a trap composed of 286 places in 572 ms of which 2 ms to minimize.
[2021-05-18 08:34:15] [INFO ] Deduced a trap composed of 290 places in 576 ms of which 1 ms to minimize.
[2021-05-18 08:34:16] [INFO ] Deduced a trap composed of 417 places in 560 ms of which 1 ms to minimize.
[2021-05-18 08:34:17] [INFO ] Deduced a trap composed of 322 places in 516 ms of which 2 ms to minimize.
[2021-05-18 08:34:17] [INFO ] Deduced a trap composed of 267 places in 549 ms of which 2 ms to minimize.
[2021-05-18 08:34:18] [INFO ] Deduced a trap composed of 286 places in 546 ms of which 1 ms to minimize.
[2021-05-18 08:34:19] [INFO ] Deduced a trap composed of 276 places in 540 ms of which 1 ms to minimize.
[2021-05-18 08:34:20] [INFO ] Deduced a trap composed of 292 places in 520 ms of which 1 ms to minimize.
[2021-05-18 08:34:20] [INFO ] Deduced a trap composed of 289 places in 537 ms of which 1 ms to minimize.
[2021-05-18 08:34:21] [INFO ] Deduced a trap composed of 274 places in 540 ms of which 1 ms to minimize.
[2021-05-18 08:34:22] [INFO ] Deduced a trap composed of 279 places in 530 ms of which 2 ms to minimize.
[2021-05-18 08:34:22] [INFO ] Deduced a trap composed of 319 places in 520 ms of which 1 ms to minimize.
[2021-05-18 08:34:24] [INFO ] Deduced a trap composed of 160 places in 558 ms of which 1 ms to minimize.
[2021-05-18 08:34:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 15
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
[2021-05-18 08:34:24] [INFO ] Initial state test concluded for 3 properties.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(G(p1))&&p0) U p2))], workingDir=/home/mcc/execution]
Support contains 8 out of 1294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1294/1294 places, 2870/2870 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1267 transition count 2811
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1267 transition count 2811
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 72 place count 1249 transition count 2769
Iterating global reduction 0 with 18 rules applied. Total rules applied 90 place count 1249 transition count 2769
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 102 place count 1237 transition count 2709
Iterating global reduction 0 with 12 rules applied. Total rules applied 114 place count 1237 transition count 2709
Applied a total of 114 rules in 173 ms. Remains 1237 /1294 variables (removed 57) and now considering 2709/2870 (removed 161) transitions.
[2021-05-18 08:34:24] [INFO ] Flow matrix only has 2437 transitions (discarded 272 similar events)
// Phase 1: matrix 2437 rows 1237 cols
[2021-05-18 08:34:24] [INFO ] Computed 66 place invariants in 32 ms
[2021-05-18 08:34:25] [INFO ] Implicit Places using invariants in 1042 ms returned [10, 103, 249, 299, 353, 382, 391, 459, 489, 550, 551, 584, 606, 633, 643, 664, 730, 755, 891, 935, 1039, 1045]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 1044 ms to find 22 implicit places.
[2021-05-18 08:34:25] [INFO ] Flow matrix only has 2437 transitions (discarded 272 similar events)
// Phase 1: matrix 2437 rows 1215 cols
[2021-05-18 08:34:25] [INFO ] Computed 44 place invariants in 20 ms
[2021-05-18 08:34:26] [INFO ] Dead Transitions using invariants and state equation in 1143 ms returned []
Starting structural reductions, iteration 1 : 1215/1294 places, 2709/2870 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1196 transition count 2690
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1196 transition count 2690
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 1177 transition count 2671
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 1177 transition count 2671
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 95 place count 1158 transition count 2652
Iterating global reduction 0 with 19 rules applied. Total rules applied 114 place count 1158 transition count 2652
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 131 place count 1141 transition count 2567
Iterating global reduction 0 with 17 rules applied. Total rules applied 148 place count 1141 transition count 2567
Applied a total of 148 rules in 198 ms. Remains 1141 /1215 variables (removed 74) and now considering 2567/2709 (removed 142) transitions.
[2021-05-18 08:34:26] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1141 cols
[2021-05-18 08:34:26] [INFO ] Computed 44 place invariants in 19 ms
[2021-05-18 08:34:27] [INFO ] Implicit Places using invariants in 893 ms returned []
[2021-05-18 08:34:27] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1141 cols
[2021-05-18 08:34:27] [INFO ] Computed 44 place invariants in 31 ms
[2021-05-18 08:34:28] [INFO ] State equation strengthened by 859 read => feed constraints.
[2021-05-18 08:34:43] [INFO ] Implicit Places using invariants and state equation in 16269 ms returned []
Implicit Place search using SMT with State Equation took 17162 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1141/1294 places, 2567/2870 transitions.
Stuttering acceptance computed with spot in 805 ms :[(NOT p2), true, (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-00 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s484 1) (GEQ s1111 1)), p0:(AND (OR (LT s100 1) (LT s157 1)) (OR (LT s971 1) (LT s1102 1))), p1:(AND (GEQ s513 1) (GEQ s679 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-00 finished in 25602 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 1294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1294/1294 places, 2870/2870 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 1294 transition count 2848
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 1272 transition count 2848
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 44 place count 1272 transition count 2825
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 90 place count 1249 transition count 2825
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 106 place count 1233 transition count 2777
Iterating global reduction 2 with 16 rules applied. Total rules applied 122 place count 1233 transition count 2777
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 122 place count 1233 transition count 2774
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 128 place count 1230 transition count 2774
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 136 place count 1222 transition count 2734
Iterating global reduction 2 with 8 rules applied. Total rules applied 144 place count 1222 transition count 2734
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 204 place count 1192 transition count 2704
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 216 place count 1180 transition count 2692
Iterating global reduction 2 with 12 rules applied. Total rules applied 228 place count 1180 transition count 2692
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 240 place count 1168 transition count 2632
Iterating global reduction 2 with 12 rules applied. Total rules applied 252 place count 1168 transition count 2632
Applied a total of 252 rules in 558 ms. Remains 1168 /1294 variables (removed 126) and now considering 2632/2870 (removed 238) transitions.
[2021-05-18 08:34:50] [INFO ] Flow matrix only has 2360 transitions (discarded 272 similar events)
// Phase 1: matrix 2360 rows 1168 cols
[2021-05-18 08:34:50] [INFO ] Computed 66 place invariants in 47 ms
[2021-05-18 08:34:51] [INFO ] Implicit Places using invariants in 1067 ms returned [9, 94, 95, 225, 270, 324, 351, 359, 425, 455, 511, 512, 542, 563, 588, 599, 617, 681, 706, 838, 880, 988]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 1069 ms to find 22 implicit places.
[2021-05-18 08:34:51] [INFO ] Redundant transitions in 160 ms returned []
[2021-05-18 08:34:51] [INFO ] Flow matrix only has 2360 transitions (discarded 272 similar events)
// Phase 1: matrix 2360 rows 1146 cols
[2021-05-18 08:34:51] [INFO ] Computed 44 place invariants in 19 ms
[2021-05-18 08:34:52] [INFO ] Dead Transitions using invariants and state equation in 1111 ms returned []
Starting structural reductions, iteration 1 : 1146/1294 places, 2632/2870 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1133 transition count 2619
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1133 transition count 2619
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 39 place count 1120 transition count 2606
Iterating global reduction 0 with 13 rules applied. Total rules applied 52 place count 1120 transition count 2606
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 1110 transition count 2556
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 1110 transition count 2556
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 86 place count 1103 transition count 2549
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 93 place count 1096 transition count 2542
Iterating global reduction 0 with 7 rules applied. Total rules applied 100 place count 1096 transition count 2542
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 108 place count 1088 transition count 2502
Iterating global reduction 0 with 8 rules applied. Total rules applied 116 place count 1088 transition count 2502
Applied a total of 116 rules in 373 ms. Remains 1088 /1146 variables (removed 58) and now considering 2502/2632 (removed 130) transitions.
[2021-05-18 08:34:52] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1088 cols
[2021-05-18 08:34:53] [INFO ] Computed 44 place invariants in 19 ms
[2021-05-18 08:34:53] [INFO ] Implicit Places using invariants in 842 ms returned []
[2021-05-18 08:34:53] [INFO ] Flow matrix only has 2230 transitions (discarded 272 similar events)
// Phase 1: matrix 2230 rows 1088 cols
[2021-05-18 08:34:53] [INFO ] Computed 44 place invariants in 19 ms
[2021-05-18 08:34:54] [INFO ] State equation strengthened by 847 read => feed constraints.
[2021-05-18 08:34:54] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1088/1294 places, 2502/2870 transitions.
Stuttering acceptance computed with spot in 432 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s925 1) (GEQ s926 1)), p1:(AND (GEQ s562 1) (GEQ s631 1) (OR (LT s554 1) (LT s1064 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-01 finished in 5457 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&F(((F(p1)&&(p0 U (p2||G(p0))))||G(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1294 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1294/1294 places, 2870/2870 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1267 transition count 2811
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1267 transition count 2811
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 73 place count 1248 transition count 2760
Iterating global reduction 0 with 19 rules applied. Total rules applied 92 place count 1248 transition count 2760
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 103 place count 1237 transition count 2705
Iterating global reduction 0 with 11 rules applied. Total rules applied 114 place count 1237 transition count 2705
Applied a total of 114 rules in 160 ms. Remains 1237 /1294 variables (removed 57) and now considering 2705/2870 (removed 165) transitions.
[2021-05-18 08:34:55] [INFO ] Flow matrix only has 2433 transitions (discarded 272 similar events)
// Phase 1: matrix 2433 rows 1237 cols
[2021-05-18 08:34:55] [INFO ] Computed 66 place invariants in 30 ms
[2021-05-18 08:34:56] [INFO ] Implicit Places using invariants in 1014 ms returned [10, 101, 103, 247, 297, 351, 380, 389, 457, 487, 548, 549, 582, 604, 631, 641, 662, 728, 753, 936, 1040, 1046]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 1016 ms to find 22 implicit places.
[2021-05-18 08:34:56] [INFO ] Flow matrix only has 2433 transitions (discarded 272 similar events)
// Phase 1: matrix 2433 rows 1215 cols
[2021-05-18 08:34:56] [INFO ] Computed 44 place invariants in 22 ms
[2021-05-18 08:34:57] [INFO ] Dead Transitions using invariants and state equation in 1132 ms returned []
Starting structural reductions, iteration 1 : 1215/1294 places, 2705/2870 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1196 transition count 2686
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1196 transition count 2686
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 1177 transition count 2667
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 1177 transition count 2667
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 95 place count 1158 transition count 2648
Iterating global reduction 0 with 19 rules applied. Total rules applied 114 place count 1158 transition count 2648
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 131 place count 1141 transition count 2563
Iterating global reduction 0 with 17 rules applied. Total rules applied 148 place count 1141 transition count 2563
Applied a total of 148 rules in 199 ms. Remains 1141 /1215 variables (removed 74) and now considering 2563/2705 (removed 142) transitions.
[2021-05-18 08:34:57] [INFO ] Flow matrix only has 2291 transitions (discarded 272 similar events)
// Phase 1: matrix 2291 rows 1141 cols
[2021-05-18 08:34:57] [INFO ] Computed 44 place invariants in 29 ms
[2021-05-18 08:34:58] [INFO ] Implicit Places using invariants in 904 ms returned []
[2021-05-18 08:34:58] [INFO ] Flow matrix only has 2291 transitions (discarded 272 similar events)
// Phase 1: matrix 2291 rows 1141 cols
[2021-05-18 08:34:58] [INFO ] Computed 44 place invariants in 47 ms
[2021-05-18 08:34:59] [INFO ] State equation strengthened by 855 read => feed constraints.
[2021-05-18 08:35:15] [INFO ] Implicit Places using invariants and state equation in 16503 ms returned []
Implicit Place search using SMT with State Equation took 17408 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1141/1294 places, 2563/2870 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s465 1) (LT s1127 1)), p1:(LT s822 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1920 reset in 534 ms.
Entered a terminal (fully accepting) state of product in 72518 steps with 1394 reset in 361 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-02 finished in 20920 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U p1))], workingDir=/home/mcc/execution]
Support contains 3 out of 1294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1294/1294 places, 2870/2870 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1294 transition count 2849
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1273 transition count 2849
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 42 place count 1273 transition count 2826
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 88 place count 1250 transition count 2826
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 105 place count 1233 transition count 2773
Iterating global reduction 2 with 17 rules applied. Total rules applied 122 place count 1233 transition count 2773
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 122 place count 1233 transition count 2770
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 128 place count 1230 transition count 2770
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 136 place count 1222 transition count 2730
Iterating global reduction 2 with 8 rules applied. Total rules applied 144 place count 1222 transition count 2730
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 206 place count 1191 transition count 2699
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 217 place count 1180 transition count 2688
Iterating global reduction 2 with 11 rules applied. Total rules applied 228 place count 1180 transition count 2688
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 239 place count 1169 transition count 2633
Iterating global reduction 2 with 11 rules applied. Total rules applied 250 place count 1169 transition count 2633
Applied a total of 250 rules in 369 ms. Remains 1169 /1294 variables (removed 125) and now considering 2633/2870 (removed 237) transitions.
[2021-05-18 08:35:16] [INFO ] Flow matrix only has 2361 transitions (discarded 272 similar events)
// Phase 1: matrix 2361 rows 1169 cols
[2021-05-18 08:35:16] [INFO ] Computed 66 place invariants in 36 ms
[2021-05-18 08:35:17] [INFO ] Implicit Places using invariants in 1078 ms returned [9, 94, 95, 225, 270, 324, 351, 359, 425, 455, 511, 545, 566, 591, 601, 619, 682, 707, 839, 881, 984, 989]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 1080 ms to find 22 implicit places.
[2021-05-18 08:35:17] [INFO ] Redundant transitions in 130 ms returned []
[2021-05-18 08:35:17] [INFO ] Flow matrix only has 2361 transitions (discarded 272 similar events)
// Phase 1: matrix 2361 rows 1147 cols
[2021-05-18 08:35:17] [INFO ] Computed 44 place invariants in 18 ms
[2021-05-18 08:35:18] [INFO ] Dead Transitions using invariants and state equation in 1098 ms returned []
Starting structural reductions, iteration 1 : 1147/1294 places, 2633/2870 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1135 transition count 2621
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1135 transition count 2621
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1123 transition count 2609
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1123 transition count 2609
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 58 place count 1113 transition count 2559
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 1113 transition count 2559
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 82 place count 1106 transition count 2552
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 89 place count 1099 transition count 2545
Iterating global reduction 0 with 7 rules applied. Total rules applied 96 place count 1099 transition count 2545
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 103 place count 1092 transition count 2510
Iterating global reduction 0 with 7 rules applied. Total rules applied 110 place count 1092 transition count 2510
Applied a total of 110 rules in 331 ms. Remains 1092 /1147 variables (removed 55) and now considering 2510/2633 (removed 123) transitions.
[2021-05-18 08:35:19] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1092 cols
[2021-05-18 08:35:19] [INFO ] Computed 44 place invariants in 19 ms
[2021-05-18 08:35:19] [INFO ] Implicit Places using invariants in 846 ms returned []
[2021-05-18 08:35:19] [INFO ] Flow matrix only has 2238 transitions (discarded 272 similar events)
// Phase 1: matrix 2238 rows 1092 cols
[2021-05-18 08:35:19] [INFO ] Computed 44 place invariants in 24 ms
[2021-05-18 08:35:20] [INFO ] State equation strengthened by 851 read => feed constraints.
[2021-05-18 08:35:20] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 1633 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1092/1294 places, 2510/2870 transitions.
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(OR (LT s488 1) (AND (GEQ s317 1) (GEQ s337 1))), p0:(GEQ s488 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-04 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-04 finished in 4701 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X((p1||(p2 U p3)))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 1294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1294/1294 places, 2870/2870 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1268 transition count 2816
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1268 transition count 2816
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 71 place count 1249 transition count 2765
Iterating global reduction 0 with 19 rules applied. Total rules applied 90 place count 1249 transition count 2765
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 101 place count 1238 transition count 2710
Iterating global reduction 0 with 11 rules applied. Total rules applied 112 place count 1238 transition count 2710
Applied a total of 112 rules in 166 ms. Remains 1238 /1294 variables (removed 56) and now considering 2710/2870 (removed 160) transitions.
[2021-05-18 08:35:20] [INFO ] Flow matrix only has 2438 transitions (discarded 272 similar events)
// Phase 1: matrix 2438 rows 1238 cols
[2021-05-18 08:35:20] [INFO ] Computed 66 place invariants in 22 ms
[2021-05-18 08:35:21] [INFO ] Implicit Places using invariants in 998 ms returned [10, 101, 103, 247, 297, 351, 380, 389, 457, 487, 547, 548, 581, 604, 644, 665, 731, 756, 893, 937, 1041, 1047]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 1001 ms to find 22 implicit places.
[2021-05-18 08:35:21] [INFO ] Flow matrix only has 2438 transitions (discarded 272 similar events)
// Phase 1: matrix 2438 rows 1216 cols
[2021-05-18 08:35:21] [INFO ] Computed 44 place invariants in 18 ms
[2021-05-18 08:35:23] [INFO ] Dead Transitions using invariants and state equation in 1119 ms returned []
Starting structural reductions, iteration 1 : 1216/1294 places, 2710/2870 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1197 transition count 2691
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1197 transition count 2691
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 1178 transition count 2672
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 1178 transition count 2672
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 95 place count 1159 transition count 2653
Iterating global reduction 0 with 19 rules applied. Total rules applied 114 place count 1159 transition count 2653
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 131 place count 1142 transition count 2568
Iterating global reduction 0 with 17 rules applied. Total rules applied 148 place count 1142 transition count 2568
Applied a total of 148 rules in 200 ms. Remains 1142 /1216 variables (removed 74) and now considering 2568/2710 (removed 142) transitions.
[2021-05-18 08:35:23] [INFO ] Flow matrix only has 2296 transitions (discarded 272 similar events)
// Phase 1: matrix 2296 rows 1142 cols
[2021-05-18 08:35:23] [INFO ] Computed 44 place invariants in 19 ms
[2021-05-18 08:35:24] [INFO ] Implicit Places using invariants in 902 ms returned []
[2021-05-18 08:35:24] [INFO ] Flow matrix only has 2296 transitions (discarded 272 similar events)
// Phase 1: matrix 2296 rows 1142 cols
[2021-05-18 08:35:24] [INFO ] Computed 44 place invariants in 18 ms
[2021-05-18 08:35:24] [INFO ] State equation strengthened by 859 read => feed constraints.
[2021-05-18 08:35:41] [INFO ] Implicit Places using invariants and state equation in 17317 ms returned []
Implicit Place search using SMT with State Equation took 18221 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1142/1294 places, 2568/2870 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s424 1) (GEQ s642 1)), p1:(LT s592 1), p3:(AND (GEQ s721 1) (GEQ s1103 1)), p2:(AND (GEQ s543 1) (GEQ s1116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33543 reset in 1182 ms.
Product exploration explored 100000 steps with 33246 reset in 1127 ms.
Knowledge obtained : [(NOT p0), p1, (NOT p3), (NOT p2)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 33456 reset in 1097 ms.
Product exploration explored 100000 steps with 33398 reset in 1099 ms.
[2021-05-18 08:35:46] [INFO ] Flatten gal took : 108 ms
[2021-05-18 08:35:46] [INFO ] Flatten gal took : 97 ms
[2021-05-18 08:35:46] [INFO ] Time to serialize gal into /tmp/LTL2199965492329319433.gal : 43 ms
[2021-05-18 08:35:46] [INFO ] Time to serialize properties into /tmp/LTL3617127691301820650.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2199965492329319433.gal, -t, CGAL, -LTL, /tmp/LTL3617127691301820650.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2199965492329319433.gal -t CGAL -LTL /tmp/LTL3617127691301820650.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G((X(("(Node9HasTheLeafSetOfLx3ToReplaceNode6<1)")||(("((Node7ManageTheCrashOfNode8>=1)&&(Lx4IsAtTheLeftExtremityOfTheLeafSet>=1))")U("((Node13ManageTheCrashOfNode1>=1)&&(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))"))))||("((Node4IsTheNodeMaster>=1)&&(Node11HasDetectedCrashOfNode4>=1))")))))
Formula 0 simplified : !FG("((Node4IsTheNodeMaster>=1)&&(Node11HasDetectedCrashOfNode4>=1))" | X("(Node9HasTheLeafSetOfLx3ToReplaceNode6<1)" | ("((Node7ManageTheCrashOfNode8>=1)&&(Lx4IsAtTheLeftExtremityOfTheLeafSet>=1))" U "((Node13ManageTheCrashOfNode1>=1)&&(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))")))
Detected timeout of ITS tools.
[2021-05-18 08:36:02] [INFO ] Flatten gal took : 89 ms
[2021-05-18 08:36:02] [INFO ] Applying decomposition
[2021-05-18 08:36:02] [INFO ] Flatten gal took : 86 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1645960769878958331.txt, -o, /tmp/graph1645960769878958331.bin, -w, /tmp/graph1645960769878958331.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1645960769878958331.bin, -l, -1, -v, -w, /tmp/graph1645960769878958331.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 08:36:02] [INFO ] Decomposing Gal with order
[2021-05-18 08:36:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 08:36:02] [INFO ] Removed a total of 3071 redundant transitions.
[2021-05-18 08:36:02] [INFO ] Flatten gal took : 408 ms
[2021-05-18 08:36:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 1142 labels/synchronizations in 115 ms.
[2021-05-18 08:36:03] [INFO ] Time to serialize gal into /tmp/LTL785326915456347619.gal : 19 ms
[2021-05-18 08:36:03] [INFO ] Time to serialize properties into /tmp/LTL16000747556745069403.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL785326915456347619.gal, -t, CGAL, -LTL, /tmp/LTL16000747556745069403.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL785326915456347619.gal -t CGAL -LTL /tmp/LTL16000747556745069403.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G((X(("(i4.u188.Node9HasTheLeafSetOfLx3ToReplaceNode6<1)")||(("((i4.u96.Node7ManageTheCrashOfNode8>=1)&&(i4.u35.Lx4IsAtTheLeftExtremityOfTheLeafSet>=1))")U("((i4.u123.Node13ManageTheCrashOfNode1>=1)&&(i4.u26.Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))"))))||("((i0.u1.Node4IsTheNodeMaster>=1)&&(i8.u107.Node11HasDetectedCrashOfNode4>=1))")))))
Formula 0 simplified : !FG("((i0.u1.Node4IsTheNodeMaster>=1)&&(i8.u107.Node11HasDetectedCrashOfNode4>=1))" | X("(i4.u188.Node9HasTheLeafSetOfLx3ToReplaceNode6<1)" | ("((i4.u96.Node7ManageTheCrashOfNode8>=1)&&(i4.u35.Lx4IsAtTheLeftExtremityOfTheLeafSet>=1))" U "((i4.u123.Node13ManageTheCrashOfNode1>=1)&&(i4.u26.Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6119966943396532186
[2021-05-18 08:36:18] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6119966943396532186
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6119966943396532186]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6119966943396532186] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6119966943396532186] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-05 finished in 58410 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 1294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1294/1294 places, 2870/2870 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1268 transition count 2812
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1268 transition count 2812
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 70 place count 1250 transition count 2766
Iterating global reduction 0 with 18 rules applied. Total rules applied 88 place count 1250 transition count 2766
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 99 place count 1239 transition count 2711
Iterating global reduction 0 with 11 rules applied. Total rules applied 110 place count 1239 transition count 2711
Applied a total of 110 rules in 173 ms. Remains 1239 /1294 variables (removed 55) and now considering 2711/2870 (removed 159) transitions.
[2021-05-18 08:36:19] [INFO ] Flow matrix only has 2439 transitions (discarded 272 similar events)
// Phase 1: matrix 2439 rows 1239 cols
[2021-05-18 08:36:19] [INFO ] Computed 66 place invariants in 30 ms
[2021-05-18 08:36:20] [INFO ] Implicit Places using invariants in 1104 ms returned [10, 101, 103, 300, 354, 383, 392, 460, 490, 550, 551, 584, 606, 633, 643, 664, 730, 755, 891, 935, 1040]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 1106 ms to find 21 implicit places.
[2021-05-18 08:36:20] [INFO ] Flow matrix only has 2439 transitions (discarded 272 similar events)
// Phase 1: matrix 2439 rows 1218 cols
[2021-05-18 08:36:20] [INFO ] Computed 45 place invariants in 27 ms
[2021-05-18 08:36:21] [INFO ] Dead Transitions using invariants and state equation in 1160 ms returned []
Starting structural reductions, iteration 1 : 1218/1294 places, 2711/2870 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1200 transition count 2693
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1200 transition count 2693
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 1182 transition count 2675
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 1182 transition count 2675
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 1164 transition count 2657
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 1164 transition count 2657
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 124 place count 1148 transition count 2577
Iterating global reduction 0 with 16 rules applied. Total rules applied 140 place count 1148 transition count 2577
Applied a total of 140 rules in 207 ms. Remains 1148 /1218 variables (removed 70) and now considering 2577/2711 (removed 134) transitions.
[2021-05-18 08:36:21] [INFO ] Flow matrix only has 2305 transitions (discarded 272 similar events)
// Phase 1: matrix 2305 rows 1148 cols
[2021-05-18 08:36:21] [INFO ] Computed 45 place invariants in 18 ms
[2021-05-18 08:36:22] [INFO ] Implicit Places using invariants in 921 ms returned []
[2021-05-18 08:36:22] [INFO ] Flow matrix only has 2305 transitions (discarded 272 similar events)
// Phase 1: matrix 2305 rows 1148 cols
[2021-05-18 08:36:22] [INFO ] Computed 45 place invariants in 31 ms
[2021-05-18 08:36:23] [INFO ] State equation strengthened by 863 read => feed constraints.
[2021-05-18 08:36:39] [INFO ] Implicit Places using invariants and state equation in 16467 ms returned []
Implicit Place search using SMT with State Equation took 17402 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1148/1294 places, 2577/2870 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (LT s867 1) (LT s1112 1)), p0:(OR (GEQ s278 1) (AND (GEQ s977 1) (GEQ s1104 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-06 finished in 20201 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G(p1))&&p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 1294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1294/1294 places, 2870/2870 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1266 transition count 2806
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1266 transition count 2806
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 75 place count 1247 transition count 2759
Iterating global reduction 0 with 19 rules applied. Total rules applied 94 place count 1247 transition count 2759
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 106 place count 1235 transition count 2699
Iterating global reduction 0 with 12 rules applied. Total rules applied 118 place count 1235 transition count 2699
Applied a total of 118 rules in 155 ms. Remains 1235 /1294 variables (removed 59) and now considering 2699/2870 (removed 171) transitions.
[2021-05-18 08:36:39] [INFO ] Flow matrix only has 2427 transitions (discarded 272 similar events)
// Phase 1: matrix 2427 rows 1235 cols
[2021-05-18 08:36:39] [INFO ] Computed 66 place invariants in 19 ms
[2021-05-18 08:36:40] [INFO ] Implicit Places using invariants in 1041 ms returned [10, 101, 103, 247, 297, 351, 380, 389, 457, 487, 547, 548, 581, 603, 630, 663, 729, 754, 890, 934, 1038, 1044]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 1052 ms to find 22 implicit places.
[2021-05-18 08:36:40] [INFO ] Flow matrix only has 2427 transitions (discarded 272 similar events)
// Phase 1: matrix 2427 rows 1213 cols
[2021-05-18 08:36:40] [INFO ] Computed 44 place invariants in 21 ms
[2021-05-18 08:36:41] [INFO ] Dead Transitions using invariants and state equation in 1173 ms returned []
Starting structural reductions, iteration 1 : 1213/1294 places, 2699/2870 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1194 transition count 2680
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1194 transition count 2680
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 1175 transition count 2661
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 1175 transition count 2661
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 95 place count 1156 transition count 2642
Iterating global reduction 0 with 19 rules applied. Total rules applied 114 place count 1156 transition count 2642
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 131 place count 1139 transition count 2557
Iterating global reduction 0 with 17 rules applied. Total rules applied 148 place count 1139 transition count 2557
Applied a total of 148 rules in 202 ms. Remains 1139 /1213 variables (removed 74) and now considering 2557/2699 (removed 142) transitions.
[2021-05-18 08:36:41] [INFO ] Flow matrix only has 2285 transitions (discarded 272 similar events)
// Phase 1: matrix 2285 rows 1139 cols
[2021-05-18 08:36:42] [INFO ] Computed 44 place invariants in 17 ms
[2021-05-18 08:36:42] [INFO ] Implicit Places using invariants in 872 ms returned []
[2021-05-18 08:36:42] [INFO ] Flow matrix only has 2285 transitions (discarded 272 similar events)
// Phase 1: matrix 2285 rows 1139 cols
[2021-05-18 08:36:42] [INFO ] Computed 44 place invariants in 18 ms
[2021-05-18 08:36:43] [INFO ] State equation strengthened by 851 read => feed constraints.
[2021-05-18 08:36:58] [INFO ] Implicit Places using invariants and state equation in 15524 ms returned []
Implicit Place search using SMT with State Equation took 16397 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1139/1294 places, 2557/2870 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s590 1) (GEQ s601 1)), p1:(AND (GEQ s472 1) (GEQ s553 1) (GEQ s554 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-08 finished in 19079 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((((p2 U G(p3))&&G(p4))||p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 6 out of 1294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1294/1294 places, 2870/2870 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1268 transition count 2812
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1268 transition count 2812
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 70 place count 1250 transition count 2762
Iterating global reduction 0 with 18 rules applied. Total rules applied 88 place count 1250 transition count 2762
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 98 place count 1240 transition count 2712
Iterating global reduction 0 with 10 rules applied. Total rules applied 108 place count 1240 transition count 2712
Applied a total of 108 rules in 191 ms. Remains 1240 /1294 variables (removed 54) and now considering 2712/2870 (removed 158) transitions.
[2021-05-18 08:36:58] [INFO ] Flow matrix only has 2440 transitions (discarded 272 similar events)
// Phase 1: matrix 2440 rows 1240 cols
[2021-05-18 08:36:58] [INFO ] Computed 66 place invariants in 26 ms
[2021-05-18 08:36:59] [INFO ] Implicit Places using invariants in 983 ms returned [10, 101, 103, 247, 297, 383, 392, 460, 490, 550, 587, 609, 636, 646, 667, 733, 758, 894, 939, 1043, 1049]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 985 ms to find 21 implicit places.
[2021-05-18 08:36:59] [INFO ] Flow matrix only has 2440 transitions (discarded 272 similar events)
// Phase 1: matrix 2440 rows 1219 cols
[2021-05-18 08:36:59] [INFO ] Computed 45 place invariants in 21 ms
[2021-05-18 08:37:00] [INFO ] Dead Transitions using invariants and state equation in 1150 ms returned []
Starting structural reductions, iteration 1 : 1219/1294 places, 2712/2870 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1201 transition count 2694
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1201 transition count 2694
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 54 place count 1183 transition count 2676
Iterating global reduction 0 with 18 rules applied. Total rules applied 72 place count 1183 transition count 2676
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 1165 transition count 2658
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 1165 transition count 2658
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 124 place count 1149 transition count 2578
Iterating global reduction 0 with 16 rules applied. Total rules applied 140 place count 1149 transition count 2578
Applied a total of 140 rules in 195 ms. Remains 1149 /1219 variables (removed 70) and now considering 2578/2712 (removed 134) transitions.
[2021-05-18 08:37:01] [INFO ] Flow matrix only has 2306 transitions (discarded 272 similar events)
// Phase 1: matrix 2306 rows 1149 cols
[2021-05-18 08:37:01] [INFO ] Computed 45 place invariants in 27 ms
[2021-05-18 08:37:01] [INFO ] Implicit Places using invariants in 892 ms returned []
[2021-05-18 08:37:01] [INFO ] Flow matrix only has 2306 transitions (discarded 272 similar events)
// Phase 1: matrix 2306 rows 1149 cols
[2021-05-18 08:37:01] [INFO ] Computed 45 place invariants in 16 ms
[2021-05-18 08:37:02] [INFO ] State equation strengthened by 863 read => feed constraints.
[2021-05-18 08:37:17] [INFO ] Implicit Places using invariants and state equation in 15408 ms returned []
Implicit Place search using SMT with State Equation took 16301 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1149/1294 places, 2578/2870 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4)))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p4))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) p2 p4), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p3 p2 p4), acceptance={1} source=1 dest: 2}, { cond=(OR (AND p0 (NOT p1) p3 p4) (AND p0 (NOT p1) p2 p4)), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p1) p3 (NOT p2) p4), acceptance={1} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p2))), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) p2) (AND (NOT p1) (NOT p3) p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p1) p3 p2)), acceptance={1} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p1) p3 (NOT p2))), acceptance={1} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND (NOT p0) p4) (AND (NOT p1) p4)), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3) (NOT p2)) (AND (NOT p1) (NOT p3) (NOT p4))), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) p2 p4), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p3 p2 p4), acceptance={1} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3) p2 p4), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p1) p3 (NOT p2)) (AND (NOT p1) p3 (NOT p4))), acceptance={1} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p3 p2 p4), acceptance={} source=4 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), acceptance={0, 1} source=5 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p1) (NOT p3) p4)), acceptance={0} source=5 dest: 3}, { cond=(OR (AND (NOT p0) p3 (NOT p4)) (AND (NOT p1) p3 (NOT p4))), acceptance={1} source=5 dest: 4}, { cond=(OR (AND (NOT p0) p3 p4) (AND (NOT p1) p3 p4)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s198 1) (GEQ s640 1)), p1:(OR (GEQ s352 1) (AND (GEQ s843 1) (GEQ s1132 1))), p3:(AND (GEQ s198 1) (GEQ s640 1)), p2:(GEQ s522 1), p4:(GEQ s352 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-09 finished in 19127 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 1294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1294/1294 places, 2870/2870 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1294 transition count 2849
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1273 transition count 2849
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 42 place count 1273 transition count 2827
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 86 place count 1251 transition count 2827
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 102 place count 1235 transition count 2775
Iterating global reduction 2 with 16 rules applied. Total rules applied 118 place count 1235 transition count 2775
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 118 place count 1235 transition count 2772
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 124 place count 1232 transition count 2772
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 131 place count 1225 transition count 2737
Iterating global reduction 2 with 7 rules applied. Total rules applied 138 place count 1225 transition count 2737
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 200 place count 1194 transition count 2706
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 211 place count 1183 transition count 2695
Iterating global reduction 2 with 11 rules applied. Total rules applied 222 place count 1183 transition count 2695
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 233 place count 1172 transition count 2640
Iterating global reduction 2 with 11 rules applied. Total rules applied 244 place count 1172 transition count 2640
Applied a total of 244 rules in 455 ms. Remains 1172 /1294 variables (removed 122) and now considering 2640/2870 (removed 230) transitions.
[2021-05-18 08:37:18] [INFO ] Flow matrix only has 2368 transitions (discarded 272 similar events)
// Phase 1: matrix 2368 rows 1172 cols
[2021-05-18 08:37:18] [INFO ] Computed 66 place invariants in 30 ms
[2021-05-18 08:37:19] [INFO ] Implicit Places using invariants in 976 ms returned [9, 94, 228, 273, 327, 354, 362, 428, 458, 514, 515, 545, 566, 591, 601, 619, 682, 707, 839, 987, 992]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 977 ms to find 21 implicit places.
[2021-05-18 08:37:19] [INFO ] Redundant transitions in 56 ms returned []
[2021-05-18 08:37:19] [INFO ] Flow matrix only has 2368 transitions (discarded 272 similar events)
// Phase 1: matrix 2368 rows 1151 cols
[2021-05-18 08:37:19] [INFO ] Computed 45 place invariants in 18 ms
[2021-05-18 08:37:20] [INFO ] Dead Transitions using invariants and state equation in 1088 ms returned []
Starting structural reductions, iteration 1 : 1151/1294 places, 2640/2870 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1139 transition count 2628
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1139 transition count 2628
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 1127 transition count 2616
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 1127 transition count 2616
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 1118 transition count 2571
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 1118 transition count 2571
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 78 place count 1112 transition count 2565
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 84 place count 1106 transition count 2559
Iterating global reduction 0 with 6 rules applied. Total rules applied 90 place count 1106 transition count 2559
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 1099 transition count 2524
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 1099 transition count 2524
Applied a total of 104 rules in 323 ms. Remains 1099 /1151 variables (removed 52) and now considering 2524/2640 (removed 116) transitions.
[2021-05-18 08:37:20] [INFO ] Flow matrix only has 2252 transitions (discarded 272 similar events)
// Phase 1: matrix 2252 rows 1099 cols
[2021-05-18 08:37:20] [INFO ] Computed 45 place invariants in 19 ms
[2021-05-18 08:37:21] [INFO ] Implicit Places using invariants in 890 ms returned []
[2021-05-18 08:37:21] [INFO ] Flow matrix only has 2252 transitions (discarded 272 similar events)
// Phase 1: matrix 2252 rows 1099 cols
[2021-05-18 08:37:21] [INFO ] Computed 45 place invariants in 18 ms
[2021-05-18 08:37:22] [INFO ] State equation strengthened by 859 read => feed constraints.
[2021-05-18 08:37:22] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1733 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1099/1294 places, 2524/2870 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-10 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s846 1), p1:(AND (GEQ s138 1) (GEQ s145 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-10 finished in 4725 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((p1&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 1294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1294/1294 places, 2870/2870 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1268 transition count 2816
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1268 transition count 2816
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 71 place count 1249 transition count 2769
Iterating global reduction 0 with 19 rules applied. Total rules applied 90 place count 1249 transition count 2769
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 102 place count 1237 transition count 2709
Iterating global reduction 0 with 12 rules applied. Total rules applied 114 place count 1237 transition count 2709
Applied a total of 114 rules in 171 ms. Remains 1237 /1294 variables (removed 57) and now considering 2709/2870 (removed 161) transitions.
[2021-05-18 08:37:22] [INFO ] Flow matrix only has 2437 transitions (discarded 272 similar events)
// Phase 1: matrix 2437 rows 1237 cols
[2021-05-18 08:37:22] [INFO ] Computed 66 place invariants in 25 ms
[2021-05-18 08:37:23] [INFO ] Implicit Places using invariants in 1001 ms returned [103, 105, 249, 300, 354, 383, 392, 460, 490, 551, 552, 585, 607, 634, 644, 665, 731, 756, 892, 936, 1040, 1046]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 1002 ms to find 22 implicit places.
[2021-05-18 08:37:23] [INFO ] Flow matrix only has 2437 transitions (discarded 272 similar events)
// Phase 1: matrix 2437 rows 1215 cols
[2021-05-18 08:37:23] [INFO ] Computed 44 place invariants in 20 ms
[2021-05-18 08:37:24] [INFO ] Dead Transitions using invariants and state equation in 1126 ms returned []
Starting structural reductions, iteration 1 : 1215/1294 places, 2709/2870 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1196 transition count 2690
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1196 transition count 2690
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 57 place count 1177 transition count 2671
Iterating global reduction 0 with 19 rules applied. Total rules applied 76 place count 1177 transition count 2671
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 95 place count 1158 transition count 2652
Iterating global reduction 0 with 19 rules applied. Total rules applied 114 place count 1158 transition count 2652
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 131 place count 1141 transition count 2567
Iterating global reduction 0 with 17 rules applied. Total rules applied 148 place count 1141 transition count 2567
Applied a total of 148 rules in 199 ms. Remains 1141 /1215 variables (removed 74) and now considering 2567/2709 (removed 142) transitions.
[2021-05-18 08:37:24] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1141 cols
[2021-05-18 08:37:24] [INFO ] Computed 44 place invariants in 25 ms
[2021-05-18 08:37:25] [INFO ] Implicit Places using invariants in 898 ms returned []
[2021-05-18 08:37:25] [INFO ] Flow matrix only has 2295 transitions (discarded 272 similar events)
// Phase 1: matrix 2295 rows 1141 cols
[2021-05-18 08:37:25] [INFO ] Computed 44 place invariants in 21 ms
[2021-05-18 08:37:26] [INFO ] State equation strengthened by 859 read => feed constraints.
[2021-05-18 08:37:40] [INFO ] Implicit Places using invariants and state equation in 14665 ms returned []
Implicit Place search using SMT with State Equation took 15564 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1141/1294 places, 2567/2870 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s481 1) (GEQ s1115 1)), p1:(OR (LT s270 1) (LT s1121 1)), p2:(AND (GEQ s45 1) (GEQ s151 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-12 finished in 18199 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1294/1294 places, 2870/2870 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 1294 transition count 2850
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 1274 transition count 2850
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 40 place count 1274 transition count 2827
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 86 place count 1251 transition count 2827
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 103 place count 1234 transition count 2774
Iterating global reduction 2 with 17 rules applied. Total rules applied 120 place count 1234 transition count 2774
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 120 place count 1234 transition count 2771
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 126 place count 1231 transition count 2771
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 134 place count 1223 transition count 2731
Iterating global reduction 2 with 8 rules applied. Total rules applied 142 place count 1223 transition count 2731
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 204 place count 1192 transition count 2700
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 214 place count 1182 transition count 2690
Iterating global reduction 2 with 10 rules applied. Total rules applied 224 place count 1182 transition count 2690
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 234 place count 1172 transition count 2640
Iterating global reduction 2 with 10 rules applied. Total rules applied 244 place count 1172 transition count 2640
Applied a total of 244 rules in 330 ms. Remains 1172 /1294 variables (removed 122) and now considering 2640/2870 (removed 230) transitions.
[2021-05-18 08:37:40] [INFO ] Flow matrix only has 2368 transitions (discarded 272 similar events)
// Phase 1: matrix 2368 rows 1172 cols
[2021-05-18 08:37:40] [INFO ] Computed 66 place invariants in 25 ms
[2021-05-18 08:37:41] [INFO ] Implicit Places using invariants in 982 ms returned [9, 94, 95, 225, 327, 354, 362, 428, 458, 514, 515, 545, 594, 604, 622, 685, 710, 842, 884, 987, 992]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 984 ms to find 21 implicit places.
[2021-05-18 08:37:41] [INFO ] Redundant transitions in 58 ms returned []
[2021-05-18 08:37:41] [INFO ] Flow matrix only has 2368 transitions (discarded 272 similar events)
// Phase 1: matrix 2368 rows 1151 cols
[2021-05-18 08:37:41] [INFO ] Computed 45 place invariants in 20 ms
[2021-05-18 08:37:43] [INFO ] Dead Transitions using invariants and state equation in 1104 ms returned []
Starting structural reductions, iteration 1 : 1151/1294 places, 2640/2870 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1140 transition count 2629
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1140 transition count 2629
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 1129 transition count 2618
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 1129 transition count 2618
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 1121 transition count 2578
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 1121 transition count 2578
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 74 place count 1114 transition count 2571
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 1107 transition count 2564
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 1107 transition count 2564
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 1099 transition count 2524
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 1099 transition count 2524
Applied a total of 104 rules in 333 ms. Remains 1099 /1151 variables (removed 52) and now considering 2524/2640 (removed 116) transitions.
[2021-05-18 08:37:43] [INFO ] Flow matrix only has 2252 transitions (discarded 272 similar events)
// Phase 1: matrix 2252 rows 1099 cols
[2021-05-18 08:37:43] [INFO ] Computed 45 place invariants in 16 ms
[2021-05-18 08:37:44] [INFO ] Implicit Places using invariants in 867 ms returned []
[2021-05-18 08:37:44] [INFO ] Flow matrix only has 2252 transitions (discarded 272 similar events)
// Phase 1: matrix 2252 rows 1099 cols
[2021-05-18 08:37:44] [INFO ] Computed 45 place invariants in 20 ms
[2021-05-18 08:37:44] [INFO ] State equation strengthened by 859 read => feed constraints.
[2021-05-18 08:37:45] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1772 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1099/1294 places, 2524/2870 transitions.
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C05-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s546 1), p1:(GEQ s270 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C05-14 finished in 4622 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin583893020033409975
[2021-05-18 08:37:45] [INFO ] Too many transitions (2870) to apply POR reductions. Disabling POR matrices.
[2021-05-18 08:37:45] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin583893020033409975
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin583893020033409975]
[2021-05-18 08:37:45] [INFO ] Applying decomposition
[2021-05-18 08:37:45] [INFO ] Flatten gal took : 89 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6567235166994582137.txt, -o, /tmp/graph6567235166994582137.bin, -w, /tmp/graph6567235166994582137.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6567235166994582137.bin, -l, -1, -v, -w, /tmp/graph6567235166994582137.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 08:37:45] [INFO ] Decomposing Gal with order
[2021-05-18 08:37:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 08:37:45] [INFO ] Removed a total of 2324 redundant transitions.
[2021-05-18 08:37:45] [INFO ] Flatten gal took : 234 ms
[2021-05-18 08:37:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1275 labels/synchronizations in 83 ms.
[2021-05-18 08:37:45] [INFO ] Time to serialize gal into /tmp/LTLFireability17035095446958688494.gal : 19 ms
[2021-05-18 08:37:45] [INFO ] Time to serialize properties into /tmp/LTLFireability14972791508927655381.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability17035095446958688494.gal, -t, CGAL, -LTL, /tmp/LTLFireability14972791508927655381.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability17035095446958688494.gal -t CGAL -LTL /tmp/LTLFireability14972791508927655381.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i7.u66.Node4IsTheNodeMaster>=1)&&(i7.u66.Node11HasDetectedCrashOfNode4>=1))")||(X(("(i6.u208.Node9HasTheLeafSetOfLx3ToReplaceNode6<1)")||(("((i6.u100.Node7ManageTheCrashOfNode8>=1)&&(i6.u197.Lx4IsAtTheLeftExtremityOfTheLeafSet>=1))")U("((i6.u131.Node13ManageTheCrashOfNode1>=1)&&(i6.u187.Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))"))))))))
Formula 0 simplified : !FG("((i7.u66.Node4IsTheNodeMaster>=1)&&(i7.u66.Node11HasDetectedCrashOfNode4>=1))" | X("(i6.u208.Node9HasTheLeafSetOfLx3ToReplaceNode6<1)" | ("((i6.u100.Node7ManageTheCrashOfNode8>=1)&&(i6.u197.Lx4IsAtTheLeftExtremityOfTheLeafSet>=1))" U "((i6.u131.Node13ManageTheCrashOfNode1>=1)&&(i6.u187.Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))")))
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin583893020033409975] killed by timeout after 25 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin583893020033409975] killed by timeout after 25 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-18 08:59:55] [INFO ] Flatten gal took : 1187 ms
[2021-05-18 08:59:55] [INFO ] Time to serialize gal into /tmp/LTLFireability10796857245014392675.gal : 79 ms
[2021-05-18 08:59:55] [INFO ] Time to serialize properties into /tmp/LTLFireability1661553918107761798.ltl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability10796857245014392675.gal, -t, CGAL, -LTL, /tmp/LTLFireability1661553918107761798.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability10796857245014392675.gal -t CGAL -LTL /tmp/LTLFireability1661553918107761798.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("((Node4IsTheNodeMaster>=1)&&(Node11HasDetectedCrashOfNode4>=1))")||(X(("(Node9HasTheLeafSetOfLx3ToReplaceNode6<1)")||(("((Node7ManageTheCrashOfNode8>=1)&&(Lx4IsAtTheLeftExtremityOfTheLeafSet>=1))")U("((Node13ManageTheCrashOfNode1>=1)&&(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))"))))))))
Formula 0 simplified : !FG("((Node4IsTheNodeMaster>=1)&&(Node11HasDetectedCrashOfNode4>=1))" | X("(Node9HasTheLeafSetOfLx3ToReplaceNode6<1)" | ("((Node7ManageTheCrashOfNode8>=1)&&(Lx4IsAtTheLeftExtremityOfTheLeafSet>=1))" U "((Node13ManageTheCrashOfNode1>=1)&&(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))")))
Detected timeout of ITS tools.
[2021-05-18 09:22:03] [INFO ] Flatten gal took : 1263 ms
[2021-05-18 09:22:05] [INFO ] Input system was already deterministic with 2870 transitions.
[2021-05-18 09:22:05] [INFO ] Transformed 1294 places.
[2021-05-18 09:22:05] [INFO ] Transformed 2870 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-18 09:22:35] [INFO ] Time to serialize gal into /tmp/LTLFireability956384512431276073.gal : 72 ms
[2021-05-18 09:22:35] [INFO ] Time to serialize properties into /tmp/LTLFireability10717999281195859639.ltl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability956384512431276073.gal, -t, CGAL, -LTL, /tmp/LTLFireability10717999281195859639.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability956384512431276073.gal -t CGAL -LTL /tmp/LTLFireability10717999281195859639.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("((Node4IsTheNodeMaster>=1)&&(Node11HasDetectedCrashOfNode4>=1))")||(X(("(Node9HasTheLeafSetOfLx3ToReplaceNode6<1)")||(("((Node7ManageTheCrashOfNode8>=1)&&(Lx4IsAtTheLeftExtremityOfTheLeafSet>=1))")U("((Node13ManageTheCrashOfNode1>=1)&&(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))"))))))))
Formula 0 simplified : !FG("((Node4IsTheNodeMaster>=1)&&(Node11HasDetectedCrashOfNode4>=1))" | X("(Node9HasTheLeafSetOfLx3ToReplaceNode6<1)" | ("((Node7ManageTheCrashOfNode8>=1)&&(Lx4IsAtTheLeftExtremityOfTheLeafSet>=1))" U "((Node13ManageTheCrashOfNode1>=1)&&(Lx0IsAtTheLeftExtremityOfTheLeafSet>=1))")))

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, 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 r292-tall-162124156700597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C05.tgz
mv MultiCrashLeafsetExtension-PT-S16C05 execution
cd execution
if [ "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 ;