Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446200052.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PhilosophersDyn-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446200052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 26K Apr 11 14:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 11 14:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 219K Apr 11 14:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 14:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 208K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 814K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 86K Apr 11 15:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 422K Apr 11 15:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 847K Apr 11 15:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.4M Apr 11 15:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.8M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717247890027

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:18:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:18:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:18:11] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2024-06-01 13:18:11] [INFO ] Transformed 170 places.
[2024-06-01 13:18:11] [INFO ] Transformed 2310 transitions.
[2024-06-01 13:18:11] [INFO ] Parsed PT model containing 170 places and 2310 transitions and 18190 arcs in 348 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 64 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2024-06-01 13:18:11] [INFO ] Reduced 89 identical enabling conditions.
[2024-06-01 13:18:11] [INFO ] Reduced 89 identical enabling conditions.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA PhilosophersDyn-PT-10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 170 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 36 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
Running 2220 sub problems to find dead transitions.
[2024-06-01 13:18:12] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2024-06-01 13:18:12] [INFO ] Computed 39 invariants in 85 ms
[2024-06-01 13:18:12] [INFO ] State equation strengthened by 1030 read => feed constraints.
Problem TDEAD16 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2228 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 27/27 constraints. Problems are: Problem set: 134 solved, 2086 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1406 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2008 is UNSAT
Problem TDEAD2010 is UNSAT
Problem TDEAD2032 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2039 is UNSAT
Problem TDEAD2065 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2079 is UNSAT
Problem TDEAD2080 is UNSAT
Problem TDEAD2096 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2163 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2200 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2220 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2233 is UNSAT
Problem TDEAD2242 is UNSAT
Problem TDEAD2259 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 12/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
SMT process timed out in 34512ms, After SMT, problems are : Problem set: 380 solved, 1840 unsolved
Search for dead transitions found 380 dead transitions in 34575ms
Found 380 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2024-06-01 13:18:47] [INFO ] Computed 39 invariants in 100 ms
[2024-06-01 13:18:47] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 13:18:47] [INFO ] Invariant cache hit.
[2024-06-01 13:18:48] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-06-01 13:18:48] [INFO ] Implicit Places using invariants and state equation in 1524 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 11 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36430 ms. Remains : 170/170 places, 1885/2265 transitions.
Support contains 170 out of 170 places after structural reductions.
[2024-06-01 13:18:49] [INFO ] Flatten gal took : 377 ms
[2024-06-01 13:18:51] [INFO ] Flatten gal took : 432 ms
[2024-06-01 13:18:53] [INFO ] Input system was already deterministic with 1885 transitions.
RANDOM walk for 40000 steps (4774 resets) in 2823 ms. (14 steps per ms) remains 1/19 properties
BEST_FIRST walk for 620 steps (2 resets) in 7 ms. (77 steps per ms) remains 0/1 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p0)&&G(F(!p1)))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 190 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:18:55] [INFO ] Invariant cache hit.
[2024-06-01 13:18:55] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33186ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33211ms
[2024-06-01 13:19:28] [INFO ] Invariant cache hit.
[2024-06-01 13:19:28] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 13:19:28] [INFO ] Invariant cache hit.
[2024-06-01 13:19:29] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-06-01 13:20:00] [INFO ] Performed 24/170 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 13:20:32] [INFO ] Performed 38/170 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-06-01 13:21:15] [INFO ] Performed 71/170 implicitness test of which 0 returned IMPLICIT in 105 seconds.
[2024-06-01 13:21:47] [INFO ] Performed 77/170 implicitness test of which 0 returned IMPLICIT in 137 seconds.
[2024-06-01 13:21:47] [INFO ] Timeout of Implicit test with SMT after 137 seconds.
[2024-06-01 13:21:47] [INFO ] Implicit Places using invariants and state equation in 138477 ms returned []
Implicit Place search using SMT with State Equation took 138620 ms to find 0 implicit places.
[2024-06-01 13:21:47] [INFO ] Redundant transitions in 119 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:21:47] [INFO ] Invariant cache hit.
[2024-06-01 13:21:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 41914ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 41932ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 214093 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-00
Product exploration explored 100000 steps with 19250 reset in 4516 ms.
Product exploration explored 100000 steps with 19259 reset in 4405 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 143 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 4 steps (0 resets) in 8 ms. (0 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 321 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2024-06-01 13:22:43] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) p1)
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 120 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:22:58] [INFO ] Invariant cache hit.
[2024-06-01 13:22:58] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34193ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34211ms
[2024-06-01 13:23:33] [INFO ] Invariant cache hit.
[2024-06-01 13:23:33] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 13:23:33] [INFO ] Invariant cache hit.
[2024-06-01 13:23:33] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-06-01 13:24:06] [INFO ] Performed 12/170 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 13:24:38] [INFO ] Performed 24/170 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 13:25:10] [INFO ] Performed 30/170 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 13:25:49] [INFO ] Performed 66/170 implicitness test of which 0 returned IMPLICIT in 134 seconds.
[2024-06-01 13:25:49] [INFO ] Timeout of Implicit test with SMT after 134 seconds.
[2024-06-01 13:25:49] [INFO ] Implicit Places using invariants and state equation in 136227 ms returned []
Implicit Place search using SMT with State Equation took 136307 ms to find 0 implicit places.
[2024-06-01 13:25:49] [INFO ] Redundant transitions in 114 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:25:49] [INFO ] Invariant cache hit.
[2024-06-01 13:25:49] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42752ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42778ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 213566 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 304 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2024-06-01 13:26:38] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 19346 reset in 4147 ms.
Product exploration explored 100000 steps with 19304 reset in 4448 ms.
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 201 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:27:01] [INFO ] Invariant cache hit.
[2024-06-01 13:27:01] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 33058ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 33078ms
[2024-06-01 13:27:34] [INFO ] Invariant cache hit.
[2024-06-01 13:27:35] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 13:27:35] [INFO ] Invariant cache hit.
[2024-06-01 13:27:35] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-06-01 13:28:14] [INFO ] Performed 16/170 implicitness test of which 0 returned IMPLICIT in 38 seconds.
[2024-06-01 13:28:47] [INFO ] Performed 26/170 implicitness test of which 0 returned IMPLICIT in 70 seconds.
[2024-06-01 13:29:19] [INFO ] Performed 38/170 implicitness test of which 0 returned IMPLICIT in 102 seconds.
[2024-06-01 13:29:49] [INFO ] Performed 96/170 implicitness test of which 0 returned IMPLICIT in 133 seconds.
[2024-06-01 13:29:49] [INFO ] Timeout of Implicit test with SMT after 133 seconds.
[2024-06-01 13:29:49] [INFO ] Implicit Places using invariants and state equation in 134431 ms returned []
Implicit Place search using SMT with State Equation took 134550 ms to find 0 implicit places.
[2024-06-01 13:29:49] [INFO ] Redundant transitions in 78 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:29:49] [INFO ] Invariant cache hit.
[2024-06-01 13:29:49] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 43701ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 43719ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 211644 ms. Remains : 170/170 places, 1885/1885 transitions.
Treatment of property PhilosophersDyn-PT-10-LTLFireability-00 finished in 699101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U p1)&&(p2 U G(p3))) U (X(p2) U !p0))))'
Support contains 160 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 10 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:30:34] [INFO ] Invariant cache hit.
[2024-06-01 13:30:34] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 32594ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 32627ms
[2024-06-01 13:31:06] [INFO ] Invariant cache hit.
[2024-06-01 13:31:06] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 13:31:06] [INFO ] Invariant cache hit.
[2024-06-01 13:31:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-06-01 13:31:49] [INFO ] Performed 77/170 implicitness test of which 0 returned IMPLICIT in 40 seconds.
[2024-06-01 13:32:21] [INFO ] Performed 102/170 implicitness test of which 0 returned IMPLICIT in 72 seconds.
[2024-06-01 13:32:53] [INFO ] Performed 116/170 implicitness test of which 0 returned IMPLICIT in 105 seconds.
[2024-06-01 13:33:25] [INFO ] Performed 166/170 implicitness test of which 0 returned IMPLICIT in 137 seconds.
[2024-06-01 13:33:25] [INFO ] Timeout of Implicit test with SMT after 137 seconds.
[2024-06-01 13:33:25] [INFO ] Implicit Places using invariants and state equation in 138495 ms returned []
Implicit Place search using SMT with State Equation took 138549 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:33:25] [INFO ] Invariant cache hit.
[2024-06-01 13:33:25] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42402ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42435ms
Finished structural reductions in LTL mode , in 1 iterations and 213653 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 509 ms :[p0, p0, (OR (NOT p2) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), true, (NOT p1), (NOT p3)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 3242 ms.
Product exploration explored 100000 steps with 50000 reset in 2988 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X p2), (X p3), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (OR (AND p0 p3) (AND p0 p2)))), (X (NOT p0)), (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (OR (AND p0 p3) (AND p0 p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND p0 p3 p2)))), (X (X (NOT p0))), (X (X (NOT (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2))))), (X (X (NOT (AND p0 (NOT p3) p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 48 ms. Reduced automaton from 9 states, 21 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-PT-10-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-10-LTLFireability-01 finished in 220627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((!p0||G(F(!p1))))) U G(p2)))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 96 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:34:14] [INFO ] Invariant cache hit.
[2024-06-01 13:34:14] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 31640ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 31657ms
[2024-06-01 13:34:46] [INFO ] Invariant cache hit.
[2024-06-01 13:34:46] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 13:34:46] [INFO ] Invariant cache hit.
[2024-06-01 13:34:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-06-01 13:35:20] [INFO ] Performed 12/170 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 13:35:52] [INFO ] Performed 24/170 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 13:36:24] [INFO ] Performed 30/170 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 13:36:56] [INFO ] Performed 39/170 implicitness test of which 0 returned IMPLICIT in 128 seconds.
[2024-06-01 13:36:56] [INFO ] Timeout of Implicit test with SMT after 128 seconds.
[2024-06-01 13:36:56] [INFO ] Implicit Places using invariants and state equation in 129762 ms returned []
Implicit Place search using SMT with State Equation took 129857 ms to find 0 implicit places.
[2024-06-01 13:36:56] [INFO ] Redundant transitions in 99 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:36:56] [INFO ] Invariant cache hit.
[2024-06-01 13:36:56] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42380ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42402ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 204138 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (AND p1 p0), (AND p1 p0 p2)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-03
Stuttering criterion allowed to conclude after 194 steps with 32 reset in 23 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-03 finished in 204377 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(!p1)||(G(F(p0)) U p2))))'
Support contains 150 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 149 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:37:39] [INFO ] Invariant cache hit.
[2024-06-01 13:37:39] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34266ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34286ms
[2024-06-01 13:38:13] [INFO ] Invariant cache hit.
[2024-06-01 13:38:13] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 13:38:13] [INFO ] Invariant cache hit.
[2024-06-01 13:38:14] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-06-01 13:38:46] [INFO ] Performed 16/170 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 13:39:19] [INFO ] Performed 43/170 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 13:39:45] [INFO ] Implicit Places using invariants and state equation in 92258 ms returned []
Implicit Place search using SMT with State Equation took 92399 ms to find 0 implicit places.
[2024-06-01 13:39:45] [INFO ] Redundant transitions in 44 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:39:46] [INFO ] Invariant cache hit.
[2024-06-01 13:39:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42546ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42579ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 169480 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND p1 (NOT p2)), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-04
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-04 finished in 169642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||X(!p1))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 12 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:40:28] [INFO ] Invariant cache hit.
[2024-06-01 13:40:28] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 34535ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 34558ms
[2024-06-01 13:41:03] [INFO ] Invariant cache hit.
[2024-06-01 13:41:03] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 13:41:03] [INFO ] Invariant cache hit.
[2024-06-01 13:41:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-06-01 13:41:36] [INFO ] Performed 12/170 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 13:42:08] [INFO ] Performed 19/170 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 13:42:42] [INFO ] Performed 39/170 implicitness test of which 0 returned IMPLICIT in 98 seconds.
[2024-06-01 13:43:14] [INFO ] Performed 107/170 implicitness test of which 0 returned IMPLICIT in 129 seconds.
[2024-06-01 13:43:14] [INFO ] Timeout of Implicit test with SMT after 129 seconds.
[2024-06-01 13:43:14] [INFO ] Implicit Places using invariants and state equation in 130908 ms returned []
Implicit Place search using SMT with State Equation took 131042 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:43:14] [INFO ] Invariant cache hit.
[2024-06-01 13:43:14] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42683ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42716ms
Finished structural reductions in LTL mode , in 1 iterations and 208340 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, p1, (AND p1 p0), (AND p1 p0), (AND p0 p1), p0]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-05
Entered a terminal (fully accepting) state of product in 20 steps with 6 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-05 finished in 208607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||G(!p1))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:43:57] [INFO ] Invariant cache hit.
[2024-06-01 13:43:57] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 32851ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 32872ms
[2024-06-01 13:44:30] [INFO ] Invariant cache hit.
[2024-06-01 13:44:30] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-01 13:44:30] [INFO ] Invariant cache hit.
[2024-06-01 13:44:30] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-06-01 13:45:03] [INFO ] Performed 12/170 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 13:45:35] [INFO ] Performed 24/170 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 13:46:07] [INFO ] Performed 30/170 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 13:46:39] [INFO ] Performed 39/170 implicitness test of which 0 returned IMPLICIT in 128 seconds.
[2024-06-01 13:46:39] [INFO ] Timeout of Implicit test with SMT after 128 seconds.
[2024-06-01 13:46:39] [INFO ] Implicit Places using invariants and state equation in 129652 ms returned []
Implicit Place search using SMT with State Equation took 129760 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-06-01 13:46:40] [INFO ] Invariant cache hit.
[2024-06-01 13:46:40] [INFO ] State equation strengthened by 1010 read => feed constraints.
Could not compute solution for formula : PhilosophersDyn-PT-10-LTLFireability-00
Could not compute solution for formula : PhilosophersDyn-PT-10-LTLFireability-01
Could not compute solution for formula : PhilosophersDyn-PT-10-LTLFireability-02
Could not compute solution for formula : PhilosophersDyn-PT-10-LTLFireability-03
Could not compute solution for formula : PhilosophersDyn-PT-10-LTLFireability-04
Could not compute solution for formula : PhilosophersDyn-PT-10-LTLFireability-05
Could not compute solution for formula : PhilosophersDyn-PT-10-LTLFireability-06
Could not compute solution for formula : PhilosophersDyn-PT-10-LTLFireability-07
FORMULA PhilosophersDyn-PT-10-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PhilosophersDyn-PT-10-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PhilosophersDyn-PT-10-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PhilosophersDyn-PT-10-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PhilosophersDyn-PT-10-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PhilosophersDyn-PT-10-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PhilosophersDyn-PT-10-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA PhilosophersDyn-PT-10-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717249942514

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name PhilosophersDyn-PT-10-LTLFireability-00
ltl formula formula --ltl=/tmp/965/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 2310 transitions and 18190 arcs
pnml2lts-mc( 0/ 4): Petri net PhilosophersDyn-PT-10 analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/965/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.440 real 0.140 user 0.110 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/965/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/965/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/965/ltl_0_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PhilosophersDyn-PT-10-LTLFireability-01
ltl formula formula --ltl=/tmp/965/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 2310 transitions and 18190 arcs
pnml2lts-mc( 0/ 4): Petri net PhilosophersDyn-PT-10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.100 user 0.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/965/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/965/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/965/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/965/ltl_1_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name PhilosophersDyn-PT-10-LTLFireability-02
ltl formula formula --ltl=/tmp/965/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 2310 transitions and 18190 arcs
pnml2lts-mc( 0/ 4): Petri net PhilosophersDyn-PT-10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.120 user 0.090 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/965/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/965/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/965/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/965/ltl_2_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PhilosophersDyn-PT-10-LTLFireability-03
ltl formula formula --ltl=/tmp/965/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 2310 transitions and 18190 arcs
pnml2lts-mc( 0/ 4): Petri net PhilosophersDyn-PT-10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.280 real 0.080 user 0.120 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/965/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/965/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/965/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/965/ltl_3_
ltl formula name PhilosophersDyn-PT-10-LTLFireability-04
ltl formula formula --ltl=/tmp/965/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 2310 transitions and 18190 arcs
pnml2lts-mc( 0/ 4): Petri net PhilosophersDyn-PT-10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.100 user 0.090 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/965/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/965/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/965/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/965/ltl_4_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PhilosophersDyn-PT-10-LTLFireability-05
ltl formula formula --ltl=/tmp/965/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 2310 transitions and 18190 arcs
pnml2lts-mc( 0/ 4): Petri net PhilosophersDyn-PT-10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.090 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/965/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/965/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/965/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/965/ltl_5_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PhilosophersDyn-PT-10-LTLFireability-06
ltl formula formula --ltl=/tmp/965/ltl_6_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 2310 transitions and 18190 arcs
pnml2lts-mc( 0/ 4): Petri net PhilosophersDyn-PT-10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.100 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/965/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/965/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/965/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/965/ltl_6_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name PhilosophersDyn-PT-10-LTLFireability-07
ltl formula formula --ltl=/tmp/965/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 2310 transitions and 18190 arcs
pnml2lts-mc( 0/ 4): Petri net PhilosophersDyn-PT-10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.290 real 0.100 user 0.110 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/965/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/965/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/965/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/965/ltl_7_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
ltl formula name PhilosophersDyn-PT-10-LTLFireability-08
ltl formula formula --ltl=/tmp/965/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 2310 transitions and 18190 arcs
pnml2lts-mc( 0/ 4): Petri net PhilosophersDyn-PT-10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.120 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/965/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/965/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/965/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/965/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 192 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 171, there are 2321 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~7!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 20
pnml2lts-mc( 0/ 4): unique transitions count: 268
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 24
pnml2lts-mc( 0/ 4): - cum. max stack depth: 24
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 24 states 562 transitions, fanout: 23.417
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 52.6 B/state, compr.: 7.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2367 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PhilosophersDyn-PT-10-LTLFireability-09
ltl formula formula --ltl=/tmp/965/ltl_9_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 2310 transitions and 18190 arcs
pnml2lts-mc( 0/ 4): Petri net PhilosophersDyn-PT-10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.090 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/965/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/965/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/965/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/965/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 192 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 171, there are 2313 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~8!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 27
pnml2lts-mc( 0/ 4): unique transitions count: 309
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 30
pnml2lts-mc( 0/ 4): - cum. max stack depth: 30
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 30 states 583 transitions, fanout: 19.433
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3000, Transitions per second: 58300
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 51.4 B/state, compr.: 7.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2367 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PhilosophersDyn-PT-10-LTLFireability-10
ltl formula formula --ltl=/tmp/965/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 2310 transitions and 18190 arcs
pnml2lts-mc( 0/ 4): Petri net PhilosophersDyn-PT-10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.100 user 0.100 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/965/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/965/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/965/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/965/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 192 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 171, there are 2313 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~7!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 19
pnml2lts-mc( 0/ 4): unique transitions count: 258
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 22
pnml2lts-mc( 0/ 4): - cum. max stack depth: 22
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 22 states 532 transitions, fanout: 24.182
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 55.5 B/state, compr.: 8.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2367 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PhilosophersDyn-PT-10-LTLFireability-11
ltl formula formula --ltl=/tmp/965/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 2310 transitions and 18190 arcs
pnml2lts-mc( 0/ 4): Petri net PhilosophersDyn-PT-10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.100 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/965/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/965/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/965/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/965/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 192 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 171, there are 2314 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~8!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 39
pnml2lts-mc( 0/ 4): unique states count: 61
pnml2lts-mc( 0/ 4): unique transitions count: 286
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 64
pnml2lts-mc( 0/ 4): - cum. max stack depth: 25
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 64 states 560 transitions, fanout: 8.750
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 57.5 B/state, compr.: 8.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2367 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PhilosophersDyn-PT-10-LTLFireability-12
ltl formula formula --ltl=/tmp/965/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 2310 transitions and 18190 arcs
pnml2lts-mc( 0/ 4): Petri net PhilosophersDyn-PT-10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.090 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/965/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/965/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/965/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/965/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 191 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 171, there are 2317 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~6!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 16
pnml2lts-mc( 0/ 4): unique transitions count: 245
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 19
pnml2lts-mc( 0/ 4): - cum. max stack depth: 19
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 19 states 519 transitions, fanout: 27.316
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 55.3 B/state, compr.: 8.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2367 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name PhilosophersDyn-PT-10-LTLFireability-13
ltl formula formula --ltl=/tmp/965/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 2310 transitions and 18190 arcs
pnml2lts-mc( 0/ 4): Petri net PhilosophersDyn-PT-10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.110 user 0.080 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/965/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/965/ltl_13_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/965/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/965/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 191 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 171, there are 2318 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~14 levels ~10000 states ~29132 transitions
pnml2lts-mc( 0/ 4): ~18 levels ~20000 states ~59292 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~10!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 30140
pnml2lts-mc( 0/ 4): unique states count: 31323
pnml2lts-mc( 0/ 4): unique transitions count: 94904
pnml2lts-mc( 0/ 4): - self-loop count: 2278
pnml2lts-mc( 0/ 4): - claim dead count: 60406
pnml2lts-mc( 0/ 4): - claim found count: 606
pnml2lts-mc( 0/ 4): - claim success count: 31326
pnml2lts-mc( 0/ 4): - cum. max stack depth: 78
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 31326 states 95178 transitions, fanout: 3.038
pnml2lts-mc( 0/ 4): Total exploration time 0.860 sec (0.860 sec minimum, 0.860 sec on average)
pnml2lts-mc( 0/ 4): States per second: 36426, Transitions per second: 110672
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.7MB, 24.8 B/state, compr.: 3.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2367 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.7MB (~256.0MB paged-in)
ltl formula name PhilosophersDyn-PT-10-LTLFireability-14
ltl formula formula --ltl=/tmp/965/ltl_14_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 2310 transitions and 18190 arcs
pnml2lts-mc( 0/ 4): Petri net PhilosophersDyn-PT-10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.310 real 0.110 user 0.100 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/965/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/965/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/965/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/965/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 191 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 171, there are 2314 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~14 levels ~10000 states ~27748 transitions
pnml2lts-mc( 3/ 4): ~17 levels ~20000 states ~55980 transitions
pnml2lts-mc( 1/ 4): ~18 levels ~40000 states ~115376 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~12!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 56863
pnml2lts-mc( 0/ 4): unique states count: 59981
pnml2lts-mc( 0/ 4): unique transitions count: 181152
pnml2lts-mc( 0/ 4): - self-loop count: 4793
pnml2lts-mc( 0/ 4): - claim dead count: 114528
pnml2lts-mc( 0/ 4): - claim found count: 1636
pnml2lts-mc( 0/ 4): - claim success count: 60034
pnml2lts-mc( 0/ 4): - cum. max stack depth: 79
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 60042 states 181773 transitions, fanout: 3.027
pnml2lts-mc( 0/ 4): Total exploration time 1.780 sec (1.780 sec minimum, 1.780 sec on average)
pnml2lts-mc( 0/ 4): States per second: 33731, Transitions per second: 102120
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.4MB, 24.9 B/state, compr.: 3.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 2367 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.4MB (~256.0MB paged-in)
ltl formula name PhilosophersDyn-PT-10-LTLFireability-15
ltl formula formula --ltl=/tmp/965/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 2310 transitions and 18190 arcs
pnml2lts-mc( 0/ 4): Petri net PhilosophersDyn-PT-10 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.110 user 0.110 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/965/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/965/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/965/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/965/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 192 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 171, there are 2317 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~7!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 21
pnml2lts-mc( 0/ 4): unique transitions count: 275
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 24
pnml2lts-mc( 0/ 4): - cum. max stack depth: 24
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 24 states 549 transitions, fanout: 22.875
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2400, Transitions per second: 54900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 54.5 B/state, compr.: 7.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 2367 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PhilosophersDyn-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446200052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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