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-162124156700604.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-S16C06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156700604
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 37K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.3K May 11 18:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 11 18:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 11 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 11 15:54 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 11M 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-S16C06-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C06-15

=== Now, execution of the tool begins

BK_START 1621329654309

Running Version 0
[2021-05-18 09:21:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 09:21:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 09:21:03] [INFO ] Load time of PNML (sax parser for PT used): 354 ms
[2021-05-18 09:21:03] [INFO ] Transformed 5568 places.
[2021-05-18 09:21:03] [INFO ] Transformed 7799 transitions.
[2021-05-18 09:21:03] [INFO ] Parsed PT model containing 5568 places and 7799 transitions in 431 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-18 09:21:03] [INFO ] Initial state test concluded for 6 properties.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 5568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 5536 transition count 7799
Discarding 1610 places :
Symmetric choice reduction at 1 with 1610 rule applications. Total rules 1642 place count 3926 transition count 6189
Iterating global reduction 1 with 1610 rules applied. Total rules applied 3252 place count 3926 transition count 6189
Discarding 1404 places :
Symmetric choice reduction at 1 with 1404 rule applications. Total rules 4656 place count 2522 transition count 4785
Iterating global reduction 1 with 1404 rules applied. Total rules applied 6060 place count 2522 transition count 4785
Discarding 211 places :
Symmetric choice reduction at 1 with 211 rule applications. Total rules 6271 place count 2311 transition count 3519
Iterating global reduction 1 with 211 rules applied. Total rules applied 6482 place count 2311 transition count 3519
Applied a total of 6482 rules in 1100 ms. Remains 2311 /5568 variables (removed 3257) and now considering 3519/7799 (removed 4280) transitions.
[2021-05-18 09:21:05] [INFO ] Flow matrix only has 3247 transitions (discarded 272 similar events)
// Phase 1: matrix 3247 rows 2311 cols
[2021-05-18 09:21:05] [INFO ] Computed 541 place invariants in 314 ms
[2021-05-18 09:21:08] [INFO ] Implicit Places using invariants in 3311 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 24, 29, 36, 45, 56, 69, 84, 100, 116, 120, 122, 124, 126, 128, 141, 152, 161, 168, 173, 178, 205, 212, 215, 216, 217, 218, 219, 220, 221, 224, 229, 236, 245, 256, 269, 283, 297, 298, 300, 301, 302, 303, 314, 326, 336, 341, 344, 346, 373, 380, 383, 386, 387, 388, 389, 391, 394, 399, 408, 417, 428, 442, 454, 456, 457, 458, 459, 460, 471, 478, 483, 486, 488, 490, 517, 524, 527, 528, 529, 530, 531, 532, 533, 535, 537, 540, 545, 552, 561, 571, 581, 582, 583, 584, 587, 594, 599, 602, 604, 606, 611, 641, 648, 651, 652, 653, 655, 656, 657, 660, 664, 666, 670, 675, 682, 690, 698, 699, 700, 701, 703, 704, 711, 714, 716, 718, 720, 722, 749, 756, 759, 760, 761, 762, 763, 764, 765, 767, 769, 771, 773, 776, 781, 787, 794, 795, 796, 797, 798, 799, 802, 804, 806, 808, 812, 814, 841, 848, 851, 852, 853, 854, 855, 856, 857, 859, 861, 863, 865, 867, 870, 878, 879, 880, 881, 882, 883, 886, 888, 890, 892, 894, 896, 930, 933, 934, 935, 936, 937, 938, 939, 941, 943, 945, 947, 949, 951, 953, 956, 957, 958, 959, 960, 961, 962, 964, 966, 968, 970, 972, 974, 1001, 1003, 1007, 1010, 1011, 1012, 1013, 1014, 1015, 1016, 1018, 1020, 1022, 1024, 1026, 1028, 1030, 1033, 1034, 1035, 1038, 1039, 1040, 1044, 1046, 1048, 1050, 1052, 1054, 1081, 1088, 1091, 1092, 1093, 1094, 1096, 1097, 1101, 1103, 1105, 1107, 1109, 1111, 1114, 1117, 1118, 1119, 1120, 1122, 1123, 1125, 1127, 1129, 1131, 1133, 1138, 1165, 1172, 1175, 1176, 1177, 1179, 1180, 1181, 1183, 1185, 1187, 1191, 1193, 1195, 1198, 1203, 1204, 1205, 1207, 1208, 1209, 1214, 1216, 1218, 1220, 1222, 1224, 1251, 1258, 1261, 1262, 1263, 1264, 1265, 1266, 1269, 1271, 1273, 1275, 1277, 1280, 1285, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1303, 1306, 1308, 1310, 1312, 1314, 1341, 1348, 1351, 1352, 1353, 1354, 1356, 1357, 1359, 1361, 1365, 1367, 1370, 1375, 1382, 1391, 1393, 1394, 1395, 1396, 1397, 1404, 1409, 1412, 1417, 1419, 1421, 1448, 1455, 1459, 1462, 1463, 1464, 1465, 1470, 1472, 1474, 1477, 1482, 1489, 1498, 1509, 1510, 1511, 1512, 1513, 1514, 1515, 1524, 1531, 1536, 1539, 1541, 1543, 1570, 1577, 1580, 1581, 1582, 1583, 1584, 1586, 1588, 1590, 1595, 1600, 1607, 1616, 1627, 1641, 1642, 1643, 1644, 1646, 1657, 1669, 1676, 1681, 1684, 1688, 1716, 1723, 1726, 1727, 1728, 1729, 1730, 1732, 1734, 1737, 1742, 1749, 1761, 1772, 1785, 1800, 1801, 1802, 1803, 1804, 1805, 1806, 1819, 1830, 1839, 1846, 1851, 1854, 1881, 1883, 1887, 1890, 1891, 1892, 1893, 1894, 1895, 1896, 1899, 1904, 1911, 1920, 1931, 1944, 1959, 1976, 1977, 1978, 1979, 1980, 1981, 1982, 1997, 2010, 2021, 2030, 2037, 2042, 2070]
Discarding 469 places :
Implicit Place search using SMT only with invariants took 3343 ms to find 469 implicit places.
[2021-05-18 09:21:08] [INFO ] Flow matrix only has 3247 transitions (discarded 272 similar events)
// Phase 1: matrix 3247 rows 1842 cols
[2021-05-18 09:21:08] [INFO ] Computed 72 place invariants in 54 ms
[2021-05-18 09:21:16] [INFO ] Dead Transitions using invariants and state equation in 7546 ms returned []
Starting structural reductions, iteration 1 : 1842/5568 places, 3519/7799 transitions.
Discarding 169 places :
Symmetric choice reduction at 0 with 169 rule applications. Total rules 169 place count 1673 transition count 3350
Iterating global reduction 0 with 169 rules applied. Total rules applied 338 place count 1673 transition count 3350
Discarding 168 places :
Symmetric choice reduction at 0 with 168 rule applications. Total rules 506 place count 1505 transition count 3182
Iterating global reduction 0 with 168 rules applied. Total rules applied 674 place count 1505 transition count 3182
Discarding 166 places :
Symmetric choice reduction at 0 with 166 rule applications. Total rules 840 place count 1339 transition count 3016
Iterating global reduction 0 with 166 rules applied. Total rules applied 1006 place count 1339 transition count 3016
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 1016 place count 1329 transition count 2956
Iterating global reduction 0 with 10 rules applied. Total rules applied 1026 place count 1329 transition count 2956
Applied a total of 1026 rules in 325 ms. Remains 1329 /1842 variables (removed 513) and now considering 2956/3519 (removed 563) transitions.
[2021-05-18 09:21:16] [INFO ] Flow matrix only has 2684 transitions (discarded 272 similar events)
// Phase 1: matrix 2684 rows 1329 cols
[2021-05-18 09:21:16] [INFO ] Computed 72 place invariants in 39 ms
[2021-05-18 09:21:17] [INFO ] Implicit Places using invariants in 1215 ms returned []
[2021-05-18 09:21:17] [INFO ] Flow matrix only has 2684 transitions (discarded 272 similar events)
// Phase 1: matrix 2684 rows 1329 cols
[2021-05-18 09:21:17] [INFO ] Computed 72 place invariants in 24 ms
[2021-05-18 09:21:18] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2021-05-18 09:21:43] [INFO ] Implicit Places using invariants and state equation in 25702 ms returned []
Implicit Place search using SMT with State Equation took 26919 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1329/5568 places, 2956/7799 transitions.
[2021-05-18 09:21:48] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-18 09:21:48] [INFO ] Flatten gal took : 262 ms
FORMULA MultiCrashLeafsetExtension-PT-S16C06-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 09:21:48] [INFO ] Flatten gal took : 140 ms
[2021-05-18 09:21:49] [INFO ] Input system was already deterministic with 2956 transitions.
Incomplete random walk after 100000 steps, including 1601 resets, run finished after 847 ms. (steps per millisecond=118 ) properties (out of 19) seen :8
Running SMT prover for 11 properties.
[2021-05-18 09:21:49] [INFO ] Flow matrix only has 2684 transitions (discarded 272 similar events)
// Phase 1: matrix 2684 rows 1329 cols
[2021-05-18 09:21:49] [INFO ] Computed 72 place invariants in 25 ms
[2021-05-18 09:21:50] [INFO ] [Real]Absence check using 32 positive place invariants in 25 ms returned sat
[2021-05-18 09:21:50] [INFO ] [Real]Absence check using 32 positive and 40 generalized place invariants in 5 ms returned unsat
[2021-05-18 09:21:50] [INFO ] [Real]Absence check using 32 positive place invariants in 25 ms returned sat
[2021-05-18 09:21:50] [INFO ] [Real]Absence check using 32 positive and 40 generalized place invariants in 5 ms returned unsat
[2021-05-18 09:21:50] [INFO ] [Real]Absence check using 32 positive place invariants in 25 ms returned sat
[2021-05-18 09:21:50] [INFO ] [Real]Absence check using 32 positive and 40 generalized place invariants in 12 ms returned unsat
[2021-05-18 09:21:50] [INFO ] [Real]Absence check using 32 positive place invariants in 25 ms returned sat
[2021-05-18 09:21:50] [INFO ] [Real]Absence check using 32 positive and 40 generalized place invariants in 6 ms returned sat
[2021-05-18 09:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:21:51] [INFO ] [Real]Absence check using state equation in 815 ms returned sat
[2021-05-18 09:21:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:21:51] [INFO ] [Nat]Absence check using 32 positive place invariants in 25 ms returned sat
[2021-05-18 09:21:51] [INFO ] [Nat]Absence check using 32 positive and 40 generalized place invariants in 8 ms returned sat
[2021-05-18 09:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:21:52] [INFO ] [Nat]Absence check using state equation in 698 ms returned sat
[2021-05-18 09:21:52] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2021-05-18 09:21:55] [INFO ] [Nat]Added 1090 Read/Feed constraints in 3005 ms returned sat
[2021-05-18 09:21:56] [INFO ] Deduced a trap composed of 330 places in 660 ms of which 5 ms to minimize.
[2021-05-18 09:21:56] [INFO ] Deduced a trap composed of 202 places in 704 ms of which 2 ms to minimize.
[2021-05-18 09:21:57] [INFO ] Deduced a trap composed of 234 places in 586 ms of which 2 ms to minimize.
[2021-05-18 09:21:58] [INFO ] Deduced a trap composed of 225 places in 601 ms of which 4 ms to minimize.
[2021-05-18 09:21:59] [INFO ] Deduced a trap composed of 223 places in 619 ms of which 1 ms to minimize.
[2021-05-18 09:21:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3737 ms
[2021-05-18 09:21:59] [INFO ] Computed and/alt/rep : 2289/4639/2289 causal constraints (skipped 378 transitions) in 197 ms.
[2021-05-18 09:22:12] [INFO ] Deduced a trap composed of 2 places in 683 ms of which 1 ms to minimize.
[2021-05-18 09:22:12] [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 3
[2021-05-18 09:22:12] [INFO ] [Real]Absence check using 32 positive place invariants in 26 ms returned sat
[2021-05-18 09:22:12] [INFO ] [Real]Absence check using 32 positive and 40 generalized place invariants in 8 ms returned sat
[2021-05-18 09:22:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:22:13] [INFO ] [Real]Absence check using state equation in 764 ms returned sat
[2021-05-18 09:22:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:22:13] [INFO ] [Nat]Absence check using 32 positive place invariants in 27 ms returned sat
[2021-05-18 09:22:13] [INFO ] [Nat]Absence check using 32 positive and 40 generalized place invariants in 7 ms returned sat
[2021-05-18 09:22:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:22:14] [INFO ] [Nat]Absence check using state equation in 702 ms returned sat
[2021-05-18 09:22:16] [INFO ] [Nat]Added 1090 Read/Feed constraints in 2219 ms returned sat
[2021-05-18 09:22:16] [INFO ] Deduced a trap composed of 335 places in 616 ms of which 1 ms to minimize.
[2021-05-18 09:22:17] [INFO ] Deduced a trap composed of 393 places in 580 ms of which 1 ms to minimize.
[2021-05-18 09:22:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1419 ms
[2021-05-18 09:22:17] [INFO ] Computed and/alt/rep : 2289/4639/2289 causal constraints (skipped 378 transitions) in 153 ms.
[2021-05-18 09:22:20] [INFO ] Added : 92 causal constraints over 19 iterations in 2585 ms. Result :sat
[2021-05-18 09:22:20] [INFO ] [Real]Absence check using 32 positive place invariants in 24 ms returned sat
[2021-05-18 09:22:20] [INFO ] [Real]Absence check using 32 positive and 40 generalized place invariants in 4 ms returned unsat
[2021-05-18 09:22:20] [INFO ] [Real]Absence check using 32 positive place invariants in 25 ms returned sat
[2021-05-18 09:22:20] [INFO ] [Real]Absence check using 32 positive and 40 generalized place invariants in 6 ms returned sat
[2021-05-18 09:22:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:22:21] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2021-05-18 09:22:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:22:21] [INFO ] [Nat]Absence check using 32 positive place invariants in 25 ms returned sat
[2021-05-18 09:22:21] [INFO ] [Nat]Absence check using 32 positive and 40 generalized place invariants in 7 ms returned sat
[2021-05-18 09:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:22:22] [INFO ] [Nat]Absence check using state equation in 874 ms returned sat
[2021-05-18 09:22:24] [INFO ] [Nat]Added 1090 Read/Feed constraints in 1686 ms returned sat
[2021-05-18 09:22:24] [INFO ] Deduced a trap composed of 394 places in 583 ms of which 1 ms to minimize.
[2021-05-18 09:22:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 732 ms
[2021-05-18 09:22:24] [INFO ] Computed and/alt/rep : 2289/4639/2289 causal constraints (skipped 378 transitions) in 142 ms.
[2021-05-18 09:22:32] [INFO ] Deduced a trap composed of 356 places in 573 ms of which 1 ms to minimize.
[2021-05-18 09:22:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 752 ms
[2021-05-18 09:22:32] [INFO ] Added : 244 causal constraints over 49 iterations in 7905 ms. Result :sat
[2021-05-18 09:22:32] [INFO ] [Real]Absence check using 32 positive place invariants in 12 ms returned unsat
[2021-05-18 09:22:32] [INFO ] [Real]Absence check using 32 positive place invariants in 24 ms returned sat
[2021-05-18 09:22:32] [INFO ] [Real]Absence check using 32 positive and 40 generalized place invariants in 6 ms returned sat
[2021-05-18 09:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:22:33] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2021-05-18 09:22:34] [INFO ] [Real]Added 1090 Read/Feed constraints in 684 ms returned sat
[2021-05-18 09:22:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:22:34] [INFO ] [Nat]Absence check using 32 positive place invariants in 25 ms returned sat
[2021-05-18 09:22:34] [INFO ] [Nat]Absence check using 32 positive and 40 generalized place invariants in 7 ms returned sat
[2021-05-18 09:22:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:22:35] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2021-05-18 09:22:35] [INFO ] [Nat]Added 1090 Read/Feed constraints in 426 ms returned unsat
[2021-05-18 09:22:35] [INFO ] [Real]Absence check using 32 positive place invariants in 25 ms returned sat
[2021-05-18 09:22:35] [INFO ] [Real]Absence check using 32 positive and 40 generalized place invariants in 7 ms returned sat
[2021-05-18 09:22:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:22:36] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2021-05-18 09:22:36] [INFO ] [Real]Added 1090 Read/Feed constraints in 536 ms returned sat
[2021-05-18 09:22:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:22:37] [INFO ] [Nat]Absence check using 32 positive place invariants in 24 ms returned sat
[2021-05-18 09:22:37] [INFO ] [Nat]Absence check using 32 positive and 40 generalized place invariants in 6 ms returned sat
[2021-05-18 09:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:22:37] [INFO ] [Nat]Absence check using state equation in 609 ms returned sat
[2021-05-18 09:22:38] [INFO ] [Nat]Added 1090 Read/Feed constraints in 472 ms returned unsat
[2021-05-18 09:22:38] [INFO ] [Real]Absence check using 32 positive place invariants in 12 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 8 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C06-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1329 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1329/1329 places, 2956/2956 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 1329 transition count 2936
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 1309 transition count 2936
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 40 place count 1309 transition count 2908
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 96 place count 1281 transition count 2908
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 117 place count 1260 transition count 2872
Iterating global reduction 2 with 21 rules applied. Total rules applied 138 place count 1260 transition count 2872
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 138 place count 1260 transition count 2868
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 146 place count 1256 transition count 2868
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 163 place count 1239 transition count 2771
Iterating global reduction 2 with 17 rules applied. Total rules applied 180 place count 1239 transition count 2771
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 1238 transition count 2765
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 1238 transition count 2765
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 248 place count 1205 transition count 2732
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 256 place count 1197 transition count 2724
Iterating global reduction 2 with 8 rules applied. Total rules applied 264 place count 1197 transition count 2724
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 272 place count 1189 transition count 2676
Iterating global reduction 2 with 8 rules applied. Total rules applied 280 place count 1189 transition count 2676
Applied a total of 280 rules in 756 ms. Remains 1189 /1329 variables (removed 140) and now considering 2676/2956 (removed 280) transitions.
[2021-05-18 09:22:39] [INFO ] Flow matrix only has 2404 transitions (discarded 272 similar events)
// Phase 1: matrix 2404 rows 1189 cols
[2021-05-18 09:22:39] [INFO ] Computed 72 place invariants in 22 ms
[2021-05-18 09:22:40] [INFO ] Implicit Places using invariants in 1052 ms returned [93, 224, 267, 268, 322, 396, 397, 424, 455, 496, 523, 527, 536, 572, 589, 599, 617, 630, 648, 684, 739, 740, 806, 851, 852, 896]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 1055 ms to find 26 implicit places.
[2021-05-18 09:22:40] [INFO ] Redundant transitions in 151 ms returned []
[2021-05-18 09:22:40] [INFO ] Flow matrix only has 2404 transitions (discarded 272 similar events)
// Phase 1: matrix 2404 rows 1163 cols
[2021-05-18 09:22:40] [INFO ] Computed 46 place invariants in 19 ms
[2021-05-18 09:22:41] [INFO ] Dead Transitions using invariants and state equation in 1115 ms returned []
Starting structural reductions, iteration 1 : 1163/1329 places, 2676/2956 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1149 transition count 2662
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1149 transition count 2662
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 42 place count 1135 transition count 2648
Iterating global reduction 0 with 14 rules applied. Total rules applied 56 place count 1135 transition count 2648
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 1126 transition count 2594
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 1126 transition count 2594
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 90 place count 1118 transition count 2586
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 98 place count 1110 transition count 2578
Iterating global reduction 0 with 8 rules applied. Total rules applied 106 place count 1110 transition count 2578
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 115 place count 1101 transition count 2524
Iterating global reduction 0 with 9 rules applied. Total rules applied 124 place count 1101 transition count 2524
Applied a total of 124 rules in 292 ms. Remains 1101 /1163 variables (removed 62) and now considering 2524/2676 (removed 152) transitions.
[2021-05-18 09:22:41] [INFO ] Flow matrix only has 2252 transitions (discarded 272 similar events)
// Phase 1: matrix 2252 rows 1101 cols
[2021-05-18 09:22:41] [INFO ] Computed 46 place invariants in 26 ms
[2021-05-18 09:22:42] [INFO ] Implicit Places using invariants in 938 ms returned []
[2021-05-18 09:22:42] [INFO ] Flow matrix only has 2252 transitions (discarded 272 similar events)
// Phase 1: matrix 2252 rows 1101 cols
[2021-05-18 09:22:42] [INFO ] Computed 46 place invariants in 19 ms
[2021-05-18 09:22:43] [INFO ] State equation strengthened by 860 read => feed constraints.
[2021-05-18 09:22:43] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1101/1329 places, 2524/2956 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s676 s408)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2274 reset in 667 ms.
Product exploration explored 100000 steps with 2273 reset in 627 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2278 reset in 561 ms.
Product exploration explored 100000 steps with 2275 reset in 573 ms.
[2021-05-18 09:22:46] [INFO ] Flatten gal took : 85 ms
[2021-05-18 09:22:46] [INFO ] Flatten gal took : 85 ms
[2021-05-18 09:22:46] [INFO ] Time to serialize gal into /tmp/LTL14498172364695510026.gal : 46 ms
[2021-05-18 09:22:46] [INFO ] Time to serialize properties into /tmp/LTL12989197288755265521.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/LTL14498172364695510026.gal, -t, CGAL, -LTL, /tmp/LTL12989197288755265521.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/LTL14498172364695510026.gal -t CGAL -LTL /tmp/LTL12989197288755265521.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(Node12HasTheLeafSetOfRx1ToReplaceNode13<=Node4ManageTheCrashOfNode5)"))))
Formula 0 simplified : !FG"(Node12HasTheLeafSetOfRx1ToReplaceNode13<=Node4ManageTheCrashOfNode5)"
Detected timeout of ITS tools.
[2021-05-18 09:23:01] [INFO ] Flatten gal took : 89 ms
[2021-05-18 09:23:01] [INFO ] Applying decomposition
[2021-05-18 09:23:01] [INFO ] Flatten gal took : 76 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/graph9229361310779833467.txt, -o, /tmp/graph9229361310779833467.bin, -w, /tmp/graph9229361310779833467.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/graph9229361310779833467.bin, -l, -1, -v, -w, /tmp/graph9229361310779833467.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 09:23:02] [INFO ] Decomposing Gal with order
[2021-05-18 09:23:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 09:23:02] [INFO ] Removed a total of 378 redundant transitions.
[2021-05-18 09:23:02] [INFO ] Flatten gal took : 208 ms
[2021-05-18 09:23:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 12 ms.
[2021-05-18 09:23:02] [INFO ] Time to serialize gal into /tmp/LTL15832226171684685617.gal : 14 ms
[2021-05-18 09:23:02] [INFO ] Time to serialize properties into /tmp/LTL14439815924560708688.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/LTL15832226171684685617.gal, -t, CGAL, -LTL, /tmp/LTL14439815924560708688.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/LTL15832226171684685617.gal -t CGAL -LTL /tmp/LTL14439815924560708688.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu18.Node12HasTheLeafSetOfRx1ToReplaceNode13<=gu18.Node4ManageTheCrashOfNode5)"))))
Formula 0 simplified : !FG"(gu18.Node12HasTheLeafSetOfRx1ToReplaceNode13<=gu18.Node4ManageTheCrashOfNode5)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18256638880889079012
[2021-05-18 09:23:17] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18256638880889079012
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/ltsmin18256638880889079012]
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/ltsmin18256638880889079012] 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/ltsmin18256638880889079012] 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-S16C06-01 finished in 40333 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 4 out of 1329 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1329/1329 places, 2956/2956 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 1329 transition count 2935
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1308 transition count 2935
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 42 place count 1308 transition count 2908
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 96 place count 1281 transition count 2908
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 115 place count 1262 transition count 2869
Iterating global reduction 2 with 19 rules applied. Total rules applied 134 place count 1262 transition count 2869
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 134 place count 1262 transition count 2865
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 142 place count 1258 transition count 2865
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 156 place count 1244 transition count 2786
Iterating global reduction 2 with 14 rules applied. Total rules applied 170 place count 1244 transition count 2786
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 171 place count 1243 transition count 2780
Iterating global reduction 2 with 1 rules applied. Total rules applied 172 place count 1243 transition count 2780
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 238 place count 1210 transition count 2747
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 247 place count 1201 transition count 2738
Iterating global reduction 2 with 9 rules applied. Total rules applied 256 place count 1201 transition count 2738
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 265 place count 1192 transition count 2684
Iterating global reduction 2 with 9 rules applied. Total rules applied 274 place count 1192 transition count 2684
Applied a total of 274 rules in 381 ms. Remains 1192 /1329 variables (removed 137) and now considering 2684/2956 (removed 272) transitions.
[2021-05-18 09:23:19] [INFO ] Flow matrix only has 2412 transitions (discarded 272 similar events)
// Phase 1: matrix 2412 rows 1192 cols
[2021-05-18 09:23:19] [INFO ] Computed 72 place invariants in 20 ms
[2021-05-18 09:23:20] [INFO ] Implicit Places using invariants in 970 ms returned [226, 269, 326, 400, 401, 428, 501, 528, 532, 541, 577, 594, 604, 623, 636, 654, 690, 715, 742, 743, 809, 854, 855, 899]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 972 ms to find 24 implicit places.
[2021-05-18 09:23:20] [INFO ] Redundant transitions in 125 ms returned []
[2021-05-18 09:23:20] [INFO ] Flow matrix only has 2412 transitions (discarded 272 similar events)
// Phase 1: matrix 2412 rows 1168 cols
[2021-05-18 09:23:20] [INFO ] Computed 48 place invariants in 19 ms
[2021-05-18 09:23:21] [INFO ] Dead Transitions using invariants and state equation in 1207 ms returned []
Starting structural reductions, iteration 1 : 1168/1329 places, 2684/2956 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1168 transition count 2683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1167 transition count 2683
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 13 place count 1156 transition count 2672
Iterating global reduction 2 with 11 rules applied. Total rules applied 24 place count 1156 transition count 2672
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 35 place count 1145 transition count 2661
Iterating global reduction 2 with 11 rules applied. Total rules applied 46 place count 1145 transition count 2661
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 53 place count 1138 transition count 2619
Iterating global reduction 2 with 7 rules applied. Total rules applied 60 place count 1138 transition count 2619
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 76 place count 1130 transition count 2611
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 84 place count 1122 transition count 2603
Iterating global reduction 2 with 8 rules applied. Total rules applied 92 place count 1122 transition count 2603
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 1114 transition count 2555
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 1114 transition count 2555
Applied a total of 108 rules in 456 ms. Remains 1114 /1168 variables (removed 54) and now considering 2555/2684 (removed 129) transitions.
[2021-05-18 09:23:21] [INFO ] Flow matrix only has 2283 transitions (discarded 272 similar events)
// Phase 1: matrix 2283 rows 1114 cols
[2021-05-18 09:23:21] [INFO ] Computed 48 place invariants in 18 ms
[2021-05-18 09:23:22] [INFO ] Implicit Places using invariants in 910 ms returned []
[2021-05-18 09:23:22] [INFO ] Flow matrix only has 2283 transitions (discarded 272 similar events)
// Phase 1: matrix 2283 rows 1114 cols
[2021-05-18 09:23:22] [INFO ] Computed 48 place invariants in 30 ms
[2021-05-18 09:23:23] [INFO ] State equation strengthened by 880 read => feed constraints.
[2021-05-18 09:23:23] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1758 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1114/1329 places, 2555/2956 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-05 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:(LEQ s1102 s137), p1:(LEQ s311 s444)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2270 reset in 638 ms.
Product exploration explored 100000 steps with 2275 reset in 631 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2272 reset in 617 ms.
Product exploration explored 100000 steps with 2275 reset in 641 ms.
[2021-05-18 09:23:26] [INFO ] Flatten gal took : 73 ms
[2021-05-18 09:23:26] [INFO ] Flatten gal took : 71 ms
[2021-05-18 09:23:26] [INFO ] Time to serialize gal into /tmp/LTL1921242883603034009.gal : 9 ms
[2021-05-18 09:23:26] [INFO ] Time to serialize properties into /tmp/LTL6593508821431998538.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/LTL1921242883603034009.gal, -t, CGAL, -LTL, /tmp/LTL6593508821431998538.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/LTL1921242883603034009.gal -t CGAL -LTL /tmp/LTL6593508821431998538.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("(Rx4HasReceivedTheRequestOfNode9<=Node0HasAskedItsLeafSetToRx1ToReplaceNode15)"))&&(F(G("(Node2HasAskedItsLeafSetToLx2ToReplaceNode8<=Node4HasAskedItsLeafSetToRx4ToReplaceNode9)"))))))
Formula 0 simplified : !G(F"(Rx4HasReceivedTheRequestOfNode9<=Node0HasAskedItsLeafSetToRx1ToReplaceNode15)" & FG"(Node2HasAskedItsLeafSetToLx2ToReplaceNode8<=Node4HasAskedItsLeafSetToRx4ToReplaceNode9)")
Detected timeout of ITS tools.
[2021-05-18 09:23:41] [INFO ] Flatten gal took : 70 ms
[2021-05-18 09:23:41] [INFO ] Applying decomposition
[2021-05-18 09:23:41] [INFO ] Flatten gal took : 70 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/graph3568158665639392212.txt, -o, /tmp/graph3568158665639392212.bin, -w, /tmp/graph3568158665639392212.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/graph3568158665639392212.bin, -l, -1, -v, -w, /tmp/graph3568158665639392212.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 09:23:41] [INFO ] Decomposing Gal with order
[2021-05-18 09:23:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 09:23:42] [INFO ] Removed a total of 104 redundant transitions.
[2021-05-18 09:23:42] [INFO ] Flatten gal took : 105 ms
[2021-05-18 09:23:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2021-05-18 09:23:42] [INFO ] Time to serialize gal into /tmp/LTL4882414690671106154.gal : 9 ms
[2021-05-18 09:23:42] [INFO ] Time to serialize properties into /tmp/LTL12417471110724959614.ltl : 0 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/LTL4882414690671106154.gal, -t, CGAL, -LTL, /tmp/LTL12417471110724959614.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/LTL4882414690671106154.gal -t CGAL -LTL /tmp/LTL12417471110724959614.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("(gu21.Rx4HasReceivedTheRequestOfNode9<=gu21.Node0HasAskedItsLeafSetToRx1ToReplaceNode15)"))&&(F(G("(gu8.Node2HasAskedItsLeafSetToLx2ToReplaceNode8<=gu8.Node4HasAskedItsLeafSetToRx4ToReplaceNode9)"))))))
Formula 0 simplified : !G(F"(gu21.Rx4HasReceivedTheRequestOfNode9<=gu21.Node0HasAskedItsLeafSetToRx1ToReplaceNode15)" & FG"(gu8.Node2HasAskedItsLeafSetToLx2ToReplaceNode8<=gu8.Node4HasAskedItsLeafSetToRx4ToReplaceNode9)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16889583468279731542
[2021-05-18 09:23:57] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16889583468279731542
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/ltsmin16889583468279731542]
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/ltsmin16889583468279731542] 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/ltsmin16889583468279731542] 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-S16C06-05 finished in 39663 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 1329 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1329/1329 places, 2956/2956 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1300 transition count 2907
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1300 transition count 2907
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 82 place count 1276 transition count 2813
Iterating global reduction 0 with 24 rules applied. Total rules applied 106 place count 1276 transition count 2813
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 116 place count 1266 transition count 2753
Iterating global reduction 0 with 10 rules applied. Total rules applied 126 place count 1266 transition count 2753
Applied a total of 126 rules in 220 ms. Remains 1266 /1329 variables (removed 63) and now considering 2753/2956 (removed 203) transitions.
[2021-05-18 09:23:58] [INFO ] Flow matrix only has 2481 transitions (discarded 272 similar events)
// Phase 1: matrix 2481 rows 1266 cols
[2021-05-18 09:23:58] [INFO ] Computed 72 place invariants in 20 ms
[2021-05-18 09:23:59] [INFO ] Implicit Places using invariants in 1008 ms returned [101, 250, 296, 297, 351, 429, 430, 460, 490, 534, 563, 567, 576, 614, 633, 643, 664, 700, 737, 762, 792, 793, 862, 907, 908]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 1015 ms to find 25 implicit places.
[2021-05-18 09:23:59] [INFO ] Flow matrix only has 2481 transitions (discarded 272 similar events)
// Phase 1: matrix 2481 rows 1241 cols
[2021-05-18 09:23:59] [INFO ] Computed 47 place invariants in 24 ms
[2021-05-18 09:24:00] [INFO ] Dead Transitions using invariants and state equation in 1209 ms returned []
Starting structural reductions, iteration 1 : 1241/1329 places, 2753/2956 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1220 transition count 2732
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1220 transition count 2732
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 63 place count 1199 transition count 2711
Iterating global reduction 0 with 21 rules applied. Total rules applied 84 place count 1199 transition count 2711
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 105 place count 1178 transition count 2690
Iterating global reduction 0 with 21 rules applied. Total rules applied 126 place count 1178 transition count 2690
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 143 place count 1161 transition count 2588
Iterating global reduction 0 with 17 rules applied. Total rules applied 160 place count 1161 transition count 2588
Applied a total of 160 rules in 214 ms. Remains 1161 /1241 variables (removed 80) and now considering 2588/2753 (removed 165) transitions.
[2021-05-18 09:24:01] [INFO ] Flow matrix only has 2316 transitions (discarded 272 similar events)
// Phase 1: matrix 2316 rows 1161 cols
[2021-05-18 09:24:01] [INFO ] Computed 47 place invariants in 19 ms
[2021-05-18 09:24:02] [INFO ] Implicit Places using invariants in 984 ms returned []
[2021-05-18 09:24:02] [INFO ] Flow matrix only has 2316 transitions (discarded 272 similar events)
// Phase 1: matrix 2316 rows 1161 cols
[2021-05-18 09:24:02] [INFO ] Computed 47 place invariants in 24 ms
[2021-05-18 09:24:02] [INFO ] State equation strengthened by 865 read => feed constraints.
[2021-05-18 09:24:15] [INFO ] Implicit Places using invariants and state equation in 13597 ms returned []
Implicit Place search using SMT with State Equation took 14590 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1161/1329 places, 2588/2956 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s622 s896)], 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 2 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-06 finished in 17356 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 1329 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1329/1329 places, 2956/2956 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1303 transition count 2920
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1303 transition count 2920
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 75 place count 1280 transition count 2832
Iterating global reduction 0 with 23 rules applied. Total rules applied 98 place count 1280 transition count 2832
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 108 place count 1270 transition count 2772
Iterating global reduction 0 with 10 rules applied. Total rules applied 118 place count 1270 transition count 2772
Applied a total of 118 rules in 152 ms. Remains 1270 /1329 variables (removed 59) and now considering 2772/2956 (removed 184) transitions.
[2021-05-18 09:24:15] [INFO ] Flow matrix only has 2500 transitions (discarded 272 similar events)
// Phase 1: matrix 2500 rows 1270 cols
[2021-05-18 09:24:15] [INFO ] Computed 72 place invariants in 33 ms
[2021-05-18 09:24:17] [INFO ] Implicit Places using invariants in 1146 ms returned [101, 250, 296, 297, 351, 430, 463, 494, 538, 567, 571, 580, 618, 637, 647, 668, 681, 702, 766, 796, 797, 866, 911, 963]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 1149 ms to find 24 implicit places.
[2021-05-18 09:24:17] [INFO ] Flow matrix only has 2500 transitions (discarded 272 similar events)
// Phase 1: matrix 2500 rows 1246 cols
[2021-05-18 09:24:17] [INFO ] Computed 48 place invariants in 27 ms
[2021-05-18 09:24:18] [INFO ] Dead Transitions using invariants and state equation in 1365 ms returned []
Starting structural reductions, iteration 1 : 1246/1329 places, 2772/2956 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1226 transition count 2752
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1226 transition count 2752
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 60 place count 1206 transition count 2732
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 1206 transition count 2732
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 100 place count 1186 transition count 2712
Iterating global reduction 0 with 20 rules applied. Total rules applied 120 place count 1186 transition count 2712
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 136 place count 1170 transition count 2616
Iterating global reduction 0 with 16 rules applied. Total rules applied 152 place count 1170 transition count 2616
Applied a total of 152 rules in 196 ms. Remains 1170 /1246 variables (removed 76) and now considering 2616/2772 (removed 156) transitions.
[2021-05-18 09:24:18] [INFO ] Flow matrix only has 2344 transitions (discarded 272 similar events)
// Phase 1: matrix 2344 rows 1170 cols
[2021-05-18 09:24:18] [INFO ] Computed 48 place invariants in 21 ms
[2021-05-18 09:24:19] [INFO ] Implicit Places using invariants in 945 ms returned []
[2021-05-18 09:24:19] [INFO ] Flow matrix only has 2344 transitions (discarded 272 similar events)
// Phase 1: matrix 2344 rows 1170 cols
[2021-05-18 09:24:19] [INFO ] Computed 48 place invariants in 21 ms
[2021-05-18 09:24:20] [INFO ] State equation strengthened by 885 read => feed constraints.
[2021-05-18 09:24:36] [INFO ] Implicit Places using invariants and state equation in 17078 ms returned []
Implicit Place search using SMT with State Equation took 18026 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1170/1329 places, 2616/2956 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ s873 s430) (LEQ s888 s441)), p1:(GT s686 s874)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1433 ms.
Product exploration explored 100000 steps with 50000 reset in 1427 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 1388 ms.
Product exploration explored 100000 steps with 50000 reset in 1406 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 1170 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1170/1170 places, 2616/2616 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1170 transition count 2616
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 21 place count 1170 transition count 2619
Deduced a syphon composed of 35 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 35 place count 1170 transition count 2619
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 44 place count 1161 transition count 2610
Deduced a syphon composed of 26 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 53 place count 1161 transition count 2610
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 2 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 74 place count 1161 transition count 2610
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 1157 transition count 2606
Deduced a syphon composed of 43 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 1157 transition count 2606
Deduced a syphon composed of 43 places in 1 ms
Applied a total of 82 rules in 530 ms. Remains 1157 /1170 variables (removed 13) and now considering 2606/2616 (removed 10) transitions.
[2021-05-18 09:24:43] [INFO ] Redundant transitions in 59 ms returned []
[2021-05-18 09:24:43] [INFO ] Flow matrix only has 2334 transitions (discarded 272 similar events)
// Phase 1: matrix 2334 rows 1157 cols
[2021-05-18 09:24:43] [INFO ] Computed 48 place invariants in 18 ms
[2021-05-18 09:24:44] [INFO ] Dead Transitions using invariants and state equation in 1137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1157/1170 places, 2606/2616 transitions.
Product exploration explored 100000 steps with 50000 reset in 1385 ms.
Product exploration explored 100000 steps with 50000 reset in 1411 ms.
[2021-05-18 09:24:47] [INFO ] Flatten gal took : 76 ms
[2021-05-18 09:24:47] [INFO ] Flatten gal took : 75 ms
[2021-05-18 09:24:47] [INFO ] Time to serialize gal into /tmp/LTL17188163954007912155.gal : 8 ms
[2021-05-18 09:24:47] [INFO ] Time to serialize properties into /tmp/LTL17228701673410177809.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/LTL17188163954007912155.gal, -t, CGAL, -LTL, /tmp/LTL17228701673410177809.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/LTL17188163954007912155.gal -t CGAL -LTL /tmp/LTL17228701673410177809.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(Node12HasAskedItsLeafSetToLx4ToReplaceNode3>Node14ManageTheCrashOfNode16)"))||("((Node14HasAskedItsLeafSetToRx5ToReplaceNode15<=Node3HasTheLeafSetOfRx4ToReplaceNode16)&&(Node15ThinksNode14ShouldBeNodeMasterToReplaceNode2<=Node4ManageTheCrashOfNode1))")))))
Formula 0 simplified : !XF("((Node14HasAskedItsLeafSetToRx5ToReplaceNode15<=Node3HasTheLeafSetOfRx4ToReplaceNode16)&&(Node15ThinksNode14ShouldBeNodeMasterToReplaceNode2<=Node4ManageTheCrashOfNode1))" | X"(Node12HasAskedItsLeafSetToLx4ToReplaceNode3>Node14ManageTheCrashOfNode16)")
Detected timeout of ITS tools.
[2021-05-18 09:25:02] [INFO ] Flatten gal took : 82 ms
[2021-05-18 09:25:02] [INFO ] Applying decomposition
[2021-05-18 09:25:02] [INFO ] Flatten gal took : 80 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/graph7128834146807309030.txt, -o, /tmp/graph7128834146807309030.bin, -w, /tmp/graph7128834146807309030.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/graph7128834146807309030.bin, -l, -1, -v, -w, /tmp/graph7128834146807309030.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 09:25:02] [INFO ] Decomposing Gal with order
[2021-05-18 09:25:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 09:25:02] [INFO ] Removed a total of 1758 redundant transitions.
[2021-05-18 09:25:03] [INFO ] Flatten gal took : 219 ms
[2021-05-18 09:25:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 37 ms.
[2021-05-18 09:25:03] [INFO ] Time to serialize gal into /tmp/LTL15660714769781638601.gal : 12 ms
[2021-05-18 09:25:03] [INFO ] Time to serialize properties into /tmp/LTL11789183293713233993.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/LTL15660714769781638601.gal, -t, CGAL, -LTL, /tmp/LTL11789183293713233993.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/LTL15660714769781638601.gal -t CGAL -LTL /tmp/LTL11789183293713233993.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((X("(gu103.Node12HasAskedItsLeafSetToLx4ToReplaceNode3>gu103.Node14ManageTheCrashOfNode16)"))||("((gu80.Node14HasAskedItsLeafSetToRx5ToReplaceNode15<=gu80.Node3HasTheLeafSetOfRx4ToReplaceNode16)&&(gu83.Node15ThinksNode14ShouldBeNodeMasterToReplaceNode2<=gu83.Node4ManageTheCrashOfNode1))")))))
Formula 0 simplified : !XF("((gu80.Node14HasAskedItsLeafSetToRx5ToReplaceNode15<=gu80.Node3HasTheLeafSetOfRx4ToReplaceNode16)&&(gu83.Node15ThinksNode14ShouldBeNodeMasterToReplaceNode2<=gu83.Node4ManageTheCrashOfNode1))" | X"(gu103.Node12HasAskedItsLeafSetToLx4ToReplaceNode3>gu103.Node14ManageTheCrashOfNode16)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11445256944192851262
[2021-05-18 09:25:18] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11445256944192851262
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/ltsmin11445256944192851262]
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/ltsmin11445256944192851262] 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/ltsmin11445256944192851262] 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-S16C06-07 finished in 63636 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1329 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1329/1329 places, 2956/2956 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1300 transition count 2907
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1300 transition count 2907
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 82 place count 1276 transition count 2818
Iterating global reduction 0 with 24 rules applied. Total rules applied 106 place count 1276 transition count 2818
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 117 place count 1265 transition count 2752
Iterating global reduction 0 with 11 rules applied. Total rules applied 128 place count 1265 transition count 2752
Applied a total of 128 rules in 219 ms. Remains 1265 /1329 variables (removed 64) and now considering 2752/2956 (removed 204) transitions.
[2021-05-18 09:25:19] [INFO ] Flow matrix only has 2480 transitions (discarded 272 similar events)
// Phase 1: matrix 2480 rows 1265 cols
[2021-05-18 09:25:19] [INFO ] Computed 72 place invariants in 19 ms
[2021-05-18 09:25:20] [INFO ] Implicit Places using invariants in 1091 ms returned [101, 250, 296, 297, 351, 429, 430, 460, 490, 534, 563, 567, 576, 614, 645, 666, 679, 700, 737, 762, 792, 793, 862, 907, 908, 956]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 1094 ms to find 26 implicit places.
[2021-05-18 09:25:20] [INFO ] Flow matrix only has 2480 transitions (discarded 272 similar events)
// Phase 1: matrix 2480 rows 1239 cols
[2021-05-18 09:25:20] [INFO ] Computed 46 place invariants in 20 ms
[2021-05-18 09:25:21] [INFO ] Dead Transitions using invariants and state equation in 1283 ms returned []
Starting structural reductions, iteration 1 : 1239/1329 places, 2752/2956 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1217 transition count 2730
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1217 transition count 2730
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 1195 transition count 2708
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 1195 transition count 2708
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 110 place count 1173 transition count 2686
Iterating global reduction 0 with 22 rules applied. Total rules applied 132 place count 1173 transition count 2686
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 150 place count 1155 transition count 2578
Iterating global reduction 0 with 18 rules applied. Total rules applied 168 place count 1155 transition count 2578
Applied a total of 168 rules in 227 ms. Remains 1155 /1239 variables (removed 84) and now considering 2578/2752 (removed 174) transitions.
[2021-05-18 09:25:22] [INFO ] Flow matrix only has 2306 transitions (discarded 272 similar events)
// Phase 1: matrix 2306 rows 1155 cols
[2021-05-18 09:25:22] [INFO ] Computed 46 place invariants in 18 ms
[2021-05-18 09:25:23] [INFO ] Implicit Places using invariants in 965 ms returned []
[2021-05-18 09:25:23] [INFO ] Flow matrix only has 2306 transitions (discarded 272 similar events)
// Phase 1: matrix 2306 rows 1155 cols
[2021-05-18 09:25:23] [INFO ] Computed 46 place invariants in 18 ms
[2021-05-18 09:25:23] [INFO ] State equation strengthened by 860 read => feed constraints.
[2021-05-18 09:25:40] [INFO ] Implicit Places using invariants and state equation in 17004 ms returned []
Implicit Place search using SMT with State Equation took 17969 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1155/1329 places, 2578/2956 transitions.
Stuttering acceptance computed with spot in 2011 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-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: 2}]], initial=1, aps=[p0:(GT s591 s1104)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C06-08 finished in 22819 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 1329 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1329/1329 places, 2956/2956 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1298 transition count 2905
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1298 transition count 2905
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 88 place count 1272 transition count 2804
Iterating global reduction 0 with 26 rules applied. Total rules applied 114 place count 1272 transition count 2804
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 125 place count 1261 transition count 2738
Iterating global reduction 0 with 11 rules applied. Total rules applied 136 place count 1261 transition count 2738
Applied a total of 136 rules in 194 ms. Remains 1261 /1329 variables (removed 68) and now considering 2738/2956 (removed 218) transitions.
[2021-05-18 09:25:42] [INFO ] Flow matrix only has 2466 transitions (discarded 272 similar events)
// Phase 1: matrix 2466 rows 1261 cols
[2021-05-18 09:25:42] [INFO ] Computed 72 place invariants in 20 ms
[2021-05-18 09:25:43] [INFO ] Implicit Places using invariants in 1015 ms returned [101, 250, 296, 297, 351, 429, 430, 460, 490, 534, 563, 567, 614, 633, 643, 664, 677, 698, 735, 760, 790, 791, 860, 905, 906, 954]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 1030 ms to find 26 implicit places.
[2021-05-18 09:25:43] [INFO ] Flow matrix only has 2466 transitions (discarded 272 similar events)
// Phase 1: matrix 2466 rows 1235 cols
[2021-05-18 09:25:43] [INFO ] Computed 46 place invariants in 23 ms
[2021-05-18 09:25:44] [INFO ] Dead Transitions using invariants and state equation in 1323 ms returned []
Starting structural reductions, iteration 1 : 1235/1329 places, 2738/2956 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1212 transition count 2715
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1212 transition count 2715
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 1189 transition count 2692
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 1189 transition count 2692
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 115 place count 1166 transition count 2669
Iterating global reduction 0 with 23 rules applied. Total rules applied 138 place count 1166 transition count 2669
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 157 place count 1147 transition count 2555
Iterating global reduction 0 with 19 rules applied. Total rules applied 176 place count 1147 transition count 2555
Applied a total of 176 rules in 227 ms. Remains 1147 /1235 variables (removed 88) and now considering 2555/2738 (removed 183) transitions.
[2021-05-18 09:25:44] [INFO ] Flow matrix only has 2283 transitions (discarded 272 similar events)
// Phase 1: matrix 2283 rows 1147 cols
[2021-05-18 09:25:44] [INFO ] Computed 46 place invariants in 20 ms
[2021-05-18 09:25:45] [INFO ] Implicit Places using invariants in 965 ms returned []
[2021-05-18 09:25:45] [INFO ] Flow matrix only has 2283 transitions (discarded 272 similar events)
// Phase 1: matrix 2283 rows 1147 cols
[2021-05-18 09:25:45] [INFO ] Computed 46 place invariants in 20 ms
[2021-05-18 09:25:46] [INFO ] State equation strengthened by 845 read => feed constraints.
[2021-05-18 09:26:04] [INFO ] Implicit Places using invariants and state equation in 18292 ms returned []
Implicit Place search using SMT with State Equation took 19258 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1147/1329 places, 2555/2956 transitions.
Stuttering acceptance computed with spot in 6424 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C06-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s536 s296)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 45821 reset in 1323 ms.
Product exploration explored 100000 steps with 45855 reset in 1345 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 45950 reset in 1316 ms.
Product exploration explored 100000 steps with 46020 reset in 1341 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1147 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1147/1147 places, 2555/2555 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1147 transition count 2555
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 24 place count 1147 transition count 2555
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 36 place count 1147 transition count 2555
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 48 place count 1135 transition count 2543
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 60 place count 1135 transition count 2543
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 41 places in 2 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 77 place count 1135 transition count 2543
Deduced a syphon composed of 41 places in 1 ms
Applied a total of 77 rules in 212 ms. Remains 1135 /1147 variables (removed 12) and now considering 2543/2555 (removed 12) transitions.
[2021-05-18 09:26:25] [INFO ] Redundant transitions in 58 ms returned []
[2021-05-18 09:26:25] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1135 cols
[2021-05-18 09:26:25] [INFO ] Computed 46 place invariants in 25 ms
[2021-05-18 09:26:26] [INFO ] Dead Transitions using invariants and state equation in 1218 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1135/1147 places, 2543/2555 transitions.
Product exploration explored 100000 steps with 45974 reset in 8269 ms.
Product exploration explored 100000 steps with 45864 reset in 8205 ms.
[2021-05-18 09:26:43] [INFO ] Flatten gal took : 85 ms
[2021-05-18 09:26:43] [INFO ] Flatten gal took : 74 ms
[2021-05-18 09:26:43] [INFO ] Time to serialize gal into /tmp/LTL7066997022649503440.gal : 7 ms
[2021-05-18 09:26:43] [INFO ] Time to serialize properties into /tmp/LTL6023260950110336336.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/LTL7066997022649503440.gal, -t, CGAL, -LTL, /tmp/LTL6023260950110336336.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/LTL7066997022649503440.gal -t CGAL -LTL /tmp/LTL6023260950110336336.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(NoNodeManageTheCrashOfNode6<=Node2ThinksNode11ShouldBeNodeMasterToReplaceNode5)"))))
Formula 0 simplified : !XF"(NoNodeManageTheCrashOfNode6<=Node2ThinksNode11ShouldBeNodeMasterToReplaceNode5)"
Detected timeout of ITS tools.
[2021-05-18 09:26:58] [INFO ] Flatten gal took : 73 ms
[2021-05-18 09:26:58] [INFO ] Applying decomposition
[2021-05-18 09:26:58] [INFO ] Flatten gal took : 73 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/graph10417702423125415408.txt, -o, /tmp/graph10417702423125415408.bin, -w, /tmp/graph10417702423125415408.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/graph10417702423125415408.bin, -l, -1, -v, -w, /tmp/graph10417702423125415408.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 09:26:58] [INFO ] Decomposing Gal with order
[2021-05-18 09:26:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 09:26:59] [INFO ] Removed a total of 1672 redundant transitions.
[2021-05-18 09:26:59] [INFO ] Flatten gal took : 206 ms
[2021-05-18 09:26:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 27 ms.
[2021-05-18 09:26:59] [INFO ] Time to serialize gal into /tmp/LTL12271485769435055958.gal : 10 ms
[2021-05-18 09:26:59] [INFO ] Time to serialize properties into /tmp/LTL1856706933716791019.ltl : 0 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/LTL12271485769435055958.gal, -t, CGAL, -LTL, /tmp/LTL1856706933716791019.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/LTL12271485769435055958.gal -t CGAL -LTL /tmp/LTL1856706933716791019.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(gu54.NoNodeManageTheCrashOfNode6<=gu54.Node2ThinksNode11ShouldBeNodeMasterToReplaceNode5)"))))
Formula 0 simplified : !XF"(gu54.NoNodeManageTheCrashOfNode6<=gu54.Node2ThinksNode11ShouldBeNodeMasterToReplaceNode5)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11278672615332922927
[2021-05-18 09:27:14] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11278672615332922927
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/ltsmin11278672615332922927]
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/ltsmin11278672615332922927] 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/ltsmin11278672615332922927] 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-S16C06-12 finished in 93349 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15077420601967085311
[2021-05-18 09:27:15] [INFO ] Too many transitions (2956) to apply POR reductions. Disabling POR matrices.
[2021-05-18 09:27:15] [INFO ] Applying decomposition
[2021-05-18 09:27:15] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15077420601967085311
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/ltsmin15077420601967085311]
[2021-05-18 09:27:15] [INFO ] Flatten gal took : 83 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/graph10074758378251454323.txt, -o, /tmp/graph10074758378251454323.bin, -w, /tmp/graph10074758378251454323.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/graph10074758378251454323.bin, -l, -1, -v, -w, /tmp/graph10074758378251454323.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 09:27:15] [INFO ] Decomposing Gal with order
[2021-05-18 09:27:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 09:27:16] [INFO ] Removed a total of 2577 redundant transitions.
[2021-05-18 09:27:16] [INFO ] Flatten gal took : 471 ms
[2021-05-18 09:27:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 149 labels/synchronizations in 51 ms.
[2021-05-18 09:27:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality10145971260295455257.gal : 17 ms
[2021-05-18 09:27:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality13917008893915989717.ltl : 5 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/LTLCardinality10145971260295455257.gal, -t, CGAL, -LTL, /tmp/LTLCardinality13917008893915989717.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/LTLCardinality10145971260295455257.gal -t CGAL -LTL /tmp/LTLCardinality13917008893915989717.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 4 LTL properties
Checking formula 0 : !((F(G(("(gu154.Node12HasTheLeafSetOfRx1ToReplaceNode13<=gu154.Node4ManageTheCrashOfNode5)")||(X(("(gi0.gi0.gu0.Node6WantsToManageTheCrashOfNode10>=2)")U("((gi0.gi0.gu0.Node6WantsToManageTheCrashOfNode10>=2)&&(gu154.Node12HasTheLeafSetOfRx1ToReplaceNode13<=gu154.Node4ManageTheCrashOfNode5))")))))))
Formula 0 simplified : !FG("(gu154.Node12HasTheLeafSetOfRx1ToReplaceNode13<=gu154.Node4ManageTheCrashOfNode5)" | X("(gi0.gi0.gu0.Node6WantsToManageTheCrashOfNode10>=2)" U "((gi0.gi0.gu0.Node6WantsToManageTheCrashOfNode10>=2)&&(gu154.Node12HasTheLeafSetOfRx1ToReplaceNode13<=gu154.Node4ManageTheCrashOfNode5))"))
Compilation finished in 29727 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15077420601967085311]
Link finished in 66 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15077420601967085311]
WARNING : LTSmin timed out (>450 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15077420601967085311]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((<>((LTLAPp1==true))&&<>([]((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15077420601967085311]
WARNING : LTSmin timed out (>450 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((<>((LTLAPp1==true))&&<>([]((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15077420601967085311]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((LTLAPp3==true)||X((LTLAPp4==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15077420601967085311]
LTSmin run took 655 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp5==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15077420601967085311]
LTSmin run took 754 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 3600 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15077420601967085311]
Detected timeout of ITS tools.
[2021-05-18 09:49:34] [INFO ] Flatten gal took : 686 ms
[2021-05-18 09:49:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality1450182207336177331.gal : 47 ms
[2021-05-18 09:49:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality11087769268586657827.ltl : 2 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/LTLCardinality1450182207336177331.gal, -t, CGAL, -LTL, /tmp/LTLCardinality11087769268586657827.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/LTLCardinality1450182207336177331.gal -t CGAL -LTL /tmp/LTLCardinality11087769268586657827.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !((F(G(("(Node12HasTheLeafSetOfRx1ToReplaceNode13<=Node4ManageTheCrashOfNode5)")||(X(("(Node6WantsToManageTheCrashOfNode10>=2)")U("((Node6WantsToManageTheCrashOfNode10>=2)&&(Node12HasTheLeafSetOfRx1ToReplaceNode13<=Node4ManageTheCrashOfNode5))")))))))
Formula 0 simplified : !FG("(Node12HasTheLeafSetOfRx1ToReplaceNode13<=Node4ManageTheCrashOfNode5)" | X("(Node6WantsToManageTheCrashOfNode10>=2)" U "((Node6WantsToManageTheCrashOfNode10>=2)&&(Node12HasTheLeafSetOfRx1ToReplaceNode13<=Node4ManageTheCrashOfNode5))"))
LTSmin run took 1102503 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((<>((LTLAPp1==true))&&<>([]((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin15077420601967085311]
Detected timeout of ITS tools.
[2021-05-18 10:11:41] [INFO ] Flatten gal took : 1073 ms
[2021-05-18 10:11:43] [INFO ] Input system was already deterministic with 2956 transitions.
[2021-05-18 10:11:43] [INFO ] Transformed 1329 places.
[2021-05-18 10:11:43] [INFO ] Transformed 2956 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 10:12:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality17132554133819189502.gal : 9 ms
[2021-05-18 10:12:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality10367588256181476920.ltl : 0 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/LTLCardinality17132554133819189502.gal, -t, CGAL, -LTL, /tmp/LTLCardinality10367588256181476920.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/LTLCardinality17132554133819189502.gal -t CGAL -LTL /tmp/LTLCardinality10367588256181476920.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 : !((G((F("(Rx4HasReceivedTheRequestOfNode9<=Node0HasAskedItsLeafSetToRx1ToReplaceNode15)"))&&(F(G("(Node2HasAskedItsLeafSetToLx2ToReplaceNode8<=Node4HasAskedItsLeafSetToRx4ToReplaceNode9)"))))))
Formula 0 simplified : !G(F"(Rx4HasReceivedTheRequestOfNode9<=Node0HasAskedItsLeafSetToRx1ToReplaceNode15)" & FG"(Node2HasAskedItsLeafSetToLx2ToReplaceNode8<=Node4HasAskedItsLeafSetToRx4ToReplaceNode9)")
LTSmin run took 1168425 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C06-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621333241327

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-S16C06"
export BK_EXAMINATION="LTLCardinality"
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-S16C06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124156700604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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