fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r176-tajo-158987872000502
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for PolyORBLF-PT-S04J06T10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.890 3600000.00 465738.00 109.00 TFFTFFFFFTTTF?FT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987872000502.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is PolyORBLF-PT-S04J06T10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872000502
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 12K Apr 12 05:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 12 05:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 11 05:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 11 05:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 10 12:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 10 12:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 9 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 9 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K Apr 10 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 6.2M Mar 24 05:37 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 PolyORBLF-PT-S04J06T10-ReachabilityCardinality-00
FORMULA_NAME PolyORBLF-PT-S04J06T10-ReachabilityCardinality-01
FORMULA_NAME PolyORBLF-PT-S04J06T10-ReachabilityCardinality-02
FORMULA_NAME PolyORBLF-PT-S04J06T10-ReachabilityCardinality-03
FORMULA_NAME PolyORBLF-PT-S04J06T10-ReachabilityCardinality-04
FORMULA_NAME PolyORBLF-PT-S04J06T10-ReachabilityCardinality-05
FORMULA_NAME PolyORBLF-PT-S04J06T10-ReachabilityCardinality-06
FORMULA_NAME PolyORBLF-PT-S04J06T10-ReachabilityCardinality-07
FORMULA_NAME PolyORBLF-PT-S04J06T10-ReachabilityCardinality-08
FORMULA_NAME PolyORBLF-PT-S04J06T10-ReachabilityCardinality-09
FORMULA_NAME PolyORBLF-PT-S04J06T10-ReachabilityCardinality-10
FORMULA_NAME PolyORBLF-PT-S04J06T10-ReachabilityCardinality-11
FORMULA_NAME PolyORBLF-PT-S04J06T10-ReachabilityCardinality-12
FORMULA_NAME PolyORBLF-PT-S04J06T10-ReachabilityCardinality-13
FORMULA_NAME PolyORBLF-PT-S04J06T10-ReachabilityCardinality-14
FORMULA_NAME PolyORBLF-PT-S04J06T10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591159310385

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:41:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 04:41:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:41:52] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2020-06-03 04:41:52] [INFO ] Transformed 966 places.
[2020-06-03 04:41:52] [INFO ] Transformed 5354 transitions.
[2020-06-03 04:41:52] [INFO ] Parsed PT model containing 966 places and 5354 transitions in 437 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 73 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 1 resets, run finished after 144 ms. (steps per millisecond=69 ) properties seen :[1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0]
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 60 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2020-06-03 04:41:53] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 966 cols
[2020-06-03 04:41:53] [INFO ] Computed 62 place invariants in 190 ms
[2020-06-03 04:41:53] [INFO ] [Real]Absence check using 16 positive place invariants in 54 ms returned sat
[2020-06-03 04:41:53] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 22 ms returned unsat
[2020-06-03 04:41:53] [INFO ] [Real]Absence check using 16 positive place invariants in 59 ms returned sat
[2020-06-03 04:41:53] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 72 ms returned unsat
[2020-06-03 04:41:54] [INFO ] [Real]Absence check using 16 positive place invariants in 28 ms returned sat
[2020-06-03 04:41:54] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 55 ms returned unsat
[2020-06-03 04:41:54] [INFO ] [Real]Absence check using 16 positive place invariants in 18 ms returned sat
[2020-06-03 04:41:54] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 66 ms returned sat
[2020-06-03 04:41:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:41:59] [INFO ] [Real]Absence check using state equation in 4857 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 04:41:59] [INFO ] [Real]Absence check using 16 positive place invariants in 41 ms returned sat
[2020-06-03 04:41:59] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 94 ms returned unsat
[2020-06-03 04:41:59] [INFO ] [Real]Absence check using 16 positive place invariants in 24 ms returned sat
[2020-06-03 04:41:59] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 83 ms returned sat
[2020-06-03 04:41:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:42:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:42:04] [INFO ] [Real]Absence check using state equation in 4808 ms returned unknown
[2020-06-03 04:42:04] [INFO ] [Real]Absence check using 16 positive place invariants in 29 ms returned sat
[2020-06-03 04:42:04] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 70 ms returned unsat
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 14 out of 966 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 966/966 places, 2644/2644 transitions.
Ensure Unique test removed 4 places
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 962 transition count 2555
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 182 place count 873 transition count 2555
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 182 place count 873 transition count 2440
Deduced a syphon composed of 115 places in 5 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 412 place count 758 transition count 2440
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 4 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 610 place count 659 transition count 2341
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 630 place count 659 transition count 2321
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 650 place count 639 transition count 2321
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 651 place count 639 transition count 2321
Applied a total of 651 rules in 492 ms. Remains 639 /966 variables (removed 327) and now considering 2321/2644 (removed 323) transitions.
[2020-06-03 04:42:05] [INFO ] Flow matrix only has 2281 transitions (discarded 40 similar events)
// Phase 1: matrix 2281 rows 639 cols
[2020-06-03 04:42:05] [INFO ] Computed 58 place invariants in 71 ms
[2020-06-03 04:42:10] [INFO ] Dead Transitions using invariants and state equation in 5437 ms returned [1590, 1591, 1592, 1594, 1595, 1597, 1598, 1599, 1601, 1602, 1603, 1605, 1607, 1609, 1610, 1612, 1614, 1617, 1618, 1619, 1620, 1621, 1622, 1623, 1624, 1625, 1626, 1627, 1628, 1629, 1631, 1632, 1633, 1634, 1636, 1637, 1638, 1639, 1640, 1643, 1644, 1645, 1646, 1647, 1648, 1649, 1651, 1652, 1653, 1654, 1655, 1656, 1657, 1658, 1664, 1665, 1666, 1668, 1669, 1670, 1672, 1673, 1674, 1676, 1677, 1678, 1679, 1681, 1682, 1683, 1684, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1699, 1700, 1701, 1702, 1703, 1704, 1705, 1709, 1712, 1713, 1714, 1715, 1716, 1717, 1719, 1721, 1722, 1723, 1724, 1725, 1726, 1727, 1728, 1729, 1731, 1736, 1739, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748, 1749, 1750, 1751, 1754, 1755, 1757, 1758, 1759, 1760, 1762, 1763, 1765, 1767, 1768, 1770, 1772, 1773, 1774, 1775, 1776, 1777, 1778, 1780, 1781, 1782, 1784, 1785, 1786, 1787, 1788, 1789, 1790, 1793, 1794, 1795, 1796, 1797, 1798, 1800, 1801, 1802, 1803, 1804, 1809, 1810, 1811, 1812, 1813, 1815, 1816, 1817, 1819, 1820, 1821, 1822, 1823, 1824, 1826, 1827, 1828, 1830, 1831, 1832, 1834, 1839, 1840, 1841, 1842, 1844, 1845, 1846, 1847, 1849, 1850, 1851, 1853, 1854, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1863, 1864, 1866, 1867, 1870, 1871, 1872, 1873, 1874, 1875, 1876, 1877, 1878, 1879, 1880, 1882, 1883, 1884, 1885, 1886, 1888, 1889, 1890, 1894, 1895, 1896, 1897, 1900, 1901, 1903, 1906, 1907, 1908, 1909, 1910, 1911, 1913, 1914, 1915, 1916, 1917, 1918, 1921, 1922, 1924, 1925, 1926, 1927, 1928, 1929, 1930, 1931, 1932, 1933, 1934, 1935, 1937, 1938, 1939, 1940, 1941, 1942, 1943, 1944, 1945, 1946, 1952, 1953, 1954, 1955, 1956, 1958, 1959, 1960, 1962, 1964, 1965, 1966, 1968, 1969, 1970, 1971, 1972, 1973, 1974, 1975, 1976, 1977, 1979, 1980, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2003, 2004, 2005, 2006, 2007, 2010, 2011, 2012, 2017, 2018, 2019, 2024, 2026, 2027, 2032, 2033, 2034, 2035, 2036, 2037, 2038, 2039, 2041, 2042, 2043, 2044, 2045, 2046, 2047, 2048, 2049, 2050, 2051, 2052, 2054, 2055, 2056, 2058, 2059, 2060, 2062, 2063, 2064, 2065, 2066, 2067, 2068, 2069, 2070, 2072, 2073, 2074, 2077, 2078, 2079, 2081, 2082, 2083, 2084, 2086, 2087, 2088, 2089, 2090, 2092, 2095, 2098, 2100, 2102, 2104, 2105, 2107, 2108, 2109, 2110, 2112, 2113, 2114, 2115, 2116, 2117, 2118, 2119, 2120, 2123, 2124, 2125, 2126, 2128, 2129, 2130, 2131, 2132, 2133, 2134, 2135, 2136, 2138, 2139, 2140, 2141, 2142, 2143, 2144, 2145, 2147, 2148, 2149, 2150, 2151, 2152, 2153, 2154, 2155, 2156, 2157, 2159, 2160, 2161, 2166, 2167, 2168, 2169, 2171, 2172, 2173, 2175, 2177, 2179, 2180, 2183, 2184, 2185, 2186, 2188, 2189, 2190, 2191, 2192, 2194, 2197, 2198, 2199, 2200, 2201, 2202, 2203, 2204, 2205, 2206, 2208, 2210, 2211, 2212, 2213, 2214, 2216, 2217, 2218, 2220, 2221, 2222, 2223, 2224, 2225, 2226, 2227, 2228, 2229, 2230, 2232, 2233, 2234, 2239, 2242, 2244, 2245, 2246, 2248, 2249, 2251, 2252, 2253, 2254, 2255, 2256, 2258, 2259, 2260, 2262, 2263, 2264, 2265, 2266, 2267, 2268, 2270, 2271, 2272, 2273, 2274, 2275, 2276, 2277, 2278, 2280, 2281, 2283, 2284, 2286, 2287, 2288, 2289, 2290, 2291, 2292, 2293, 2294, 2296, 2299, 2301, 2302, 2303, 2304, 2305, 2306, 2307]
Found 540 dead transitions using SMT.
Drop transitions removed 540 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 540 transitions :[2307, 2306, 2305, 2304, 2303, 2302, 2301, 2299, 2296, 2294, 2293, 2292, 2291, 2290, 2289, 2288, 2287, 2286, 2284, 2283, 2281, 2280, 2278, 2277, 2276, 2275, 2274, 2273, 2272, 2271, 2270, 2268, 2267, 2266, 2265, 2264, 2263, 2262, 2260, 2259, 2258, 2256, 2255, 2254, 2253, 2252, 2251, 2249, 2248, 2246, 2245, 2244, 2242, 2239, 2234, 2233, 2232, 2230, 2229, 2228, 2227, 2226, 2225, 2224, 2223, 2222, 2221, 2220, 2218, 2217, 2216, 2214, 2213, 2212, 2211, 2210, 2208, 2206, 2205, 2204, 2203, 2202, 2201, 2200, 2199, 2198, 2197, 2194, 2192, 2191, 2190, 2189, 2188, 2186, 2185, 2184, 2183, 2180, 2179, 2177, 2175, 2173, 2172, 2171, 2169, 2168, 2167, 2166, 2161, 2160, 2159, 2157, 2156, 2155, 2154, 2153, 2152, 2151, 2150, 2149, 2148, 2147, 2145, 2144, 2143, 2142, 2141, 2140, 2139, 2138, 2136, 2135, 2134, 2133, 2132, 2131, 2130, 2129, 2128, 2126, 2125, 2124, 2123, 2120, 2119, 2118, 2117, 2116, 2115, 2114, 2113, 2112, 2110, 2109, 2108, 2107, 2105, 2104, 2102, 2100, 2098, 2095, 2092, 2090, 2089, 2088, 2087, 2086, 2084, 2083, 2082, 2081, 2079, 2078, 2077, 2074, 2073, 2072, 2070, 2069, 2068, 2067, 2066, 2065, 2064, 2063, 2062, 2060, 2059, 2058, 2056, 2055, 2054, 2052, 2051, 2050, 2049, 2048, 2047, 2046, 2045, 2044, 2043, 2042, 2041, 2039, 2038, 2037, 2036, 2035, 2034, 2033, 2032, 2027, 2026, 2024, 2019, 2018, 2017, 2012, 2011, 2010, 2007, 2006, 2005, 2004, 2003, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1990, 1989, 1988, 1987, 1986, 1985, 1984, 1983, 1982, 1980, 1979, 1977, 1976, 1975, 1974, 1973, 1972, 1971, 1970, 1969, 1968, 1966, 1965, 1964, 1962, 1960, 1959, 1958, 1956, 1955, 1954, 1953, 1952, 1946, 1945, 1944, 1943, 1942, 1941, 1940, 1939, 1938, 1937, 1935, 1934, 1933, 1932, 1931, 1930, 1929, 1928, 1927, 1926, 1925, 1924, 1922, 1921, 1918, 1917, 1916, 1915, 1914, 1913, 1911, 1910, 1909, 1908, 1907, 1906, 1903, 1901, 1900, 1897, 1896, 1895, 1894, 1890, 1889, 1888, 1886, 1885, 1884, 1883, 1882, 1880, 1879, 1878, 1877, 1876, 1875, 1874, 1873, 1872, 1871, 1870, 1867, 1866, 1864, 1863, 1862, 1861, 1860, 1859, 1858, 1857, 1856, 1855, 1854, 1853, 1851, 1850, 1849, 1847, 1846, 1845, 1844, 1842, 1841, 1840, 1839, 1834, 1832, 1831, 1830, 1828, 1827, 1826, 1824, 1823, 1822, 1821, 1820, 1819, 1817, 1816, 1815, 1813, 1812, 1811, 1810, 1809, 1804, 1803, 1802, 1801, 1800, 1798, 1797, 1796, 1795, 1794, 1793, 1790, 1789, 1788, 1787, 1786, 1785, 1784, 1782, 1781, 1780, 1778, 1777, 1776, 1775, 1774, 1773, 1772, 1770, 1768, 1767, 1765, 1763, 1762, 1760, 1759, 1758, 1757, 1755, 1754, 1751, 1750, 1749, 1748, 1747, 1746, 1745, 1744, 1743, 1742, 1741, 1740, 1739, 1736, 1731, 1729, 1728, 1727, 1726, 1725, 1724, 1723, 1722, 1721, 1719, 1717, 1716, 1715, 1714, 1713, 1712, 1709, 1705, 1704, 1703, 1702, 1701, 1700, 1699, 1697, 1696, 1695, 1694, 1693, 1692, 1691, 1690, 1689, 1688, 1687, 1686, 1684, 1683, 1682, 1681, 1679, 1678, 1677, 1676, 1674, 1673, 1672, 1670, 1669, 1668, 1666, 1665, 1664, 1658, 1657, 1656, 1655, 1654, 1653, 1652, 1651, 1649, 1648, 1647, 1646, 1645, 1644, 1643, 1640, 1639, 1638, 1637, 1636, 1634, 1633, 1632, 1631, 1629, 1628, 1627, 1626, 1625, 1624, 1623, 1622, 1621, 1620, 1619, 1618, 1617, 1614, 1612, 1610, 1609, 1607, 1605, 1603, 1602, 1601, 1599, 1598, 1597, 1595, 1594, 1592, 1591, 1590]
Starting structural reductions, iteration 1 : 639/966 places, 1781/2644 transitions.
Applied a total of 0 rules in 42 ms. Remains 639 /639 variables (removed 0) and now considering 1781/1781 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 639/966 places, 1781/2644 transitions.
Incomplete random walk after 1000000 steps, including 75 resets, run finished after 5972 ms. (steps per millisecond=167 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 16 resets, run finished after 2039 ms. (steps per millisecond=490 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2039 ms. (steps per millisecond=490 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 1965871 steps, run timeout after 30001 ms. (steps per millisecond=65 ) properties seen :[0, 0]
Probabilistic random walk after 1965871 steps, saw 409735 distinct states, run finished after 30001 ms. (steps per millisecond=65 ) properties seen :[0, 0]
[2020-06-03 04:42:50] [INFO ] Flow matrix only has 1741 transitions (discarded 40 similar events)
// Phase 1: matrix 1741 rows 639 cols
[2020-06-03 04:42:50] [INFO ] Computed 58 place invariants in 67 ms
[2020-06-03 04:42:50] [INFO ] [Real]Absence check using 16 positive place invariants in 15 ms returned sat
[2020-06-03 04:42:50] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 55 ms returned sat
[2020-06-03 04:42:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:42:54] [INFO ] [Real]Absence check using state equation in 3975 ms returned sat
[2020-06-03 04:42:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:42:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 18 ms returned sat
[2020-06-03 04:42:55] [INFO ] [Nat]Absence check using 16 positive and 42 generalized place invariants in 51 ms returned unsat
[2020-06-03 04:42:55] [INFO ] [Real]Absence check using 16 positive place invariants in 56 ms returned sat
[2020-06-03 04:42:55] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 57 ms returned sat
[2020-06-03 04:42:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:42:57] [INFO ] [Real]Absence check using state equation in 2349 ms returned sat
[2020-06-03 04:42:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:42:57] [INFO ] [Nat]Absence check using 16 positive place invariants in 21 ms returned sat
[2020-06-03 04:42:57] [INFO ] [Nat]Absence check using 16 positive and 42 generalized place invariants in 41 ms returned sat
[2020-06-03 04:42:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:43:10] [INFO ] [Nat]Absence check using state equation in 12813 ms returned sat
[2020-06-03 04:43:10] [INFO ] State equation strengthened by 210 read => feed constraints.
[2020-06-03 04:43:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:43:14] [INFO ] [Nat]Added 210 Read/Feed constraints in 3883 ms returned sat
[2020-06-03 04:43:15] [INFO ] Deduced a trap composed of 83 places in 576 ms
[2020-06-03 04:43:15] [INFO ] Deduced a trap composed of 53 places in 540 ms
[2020-06-03 04:43:16] [INFO ] Deduced a trap composed of 109 places in 503 ms
[2020-06-03 04:43:16] [INFO ] Deduced a trap composed of 51 places in 506 ms
[2020-06-03 04:43:17] [INFO ] Deduced a trap composed of 51 places in 456 ms
[2020-06-03 04:43:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:43:43] [INFO ] Deduced a trap composed of 2 places in 739 ms
[2020-06-03 04:43:43] [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 closed (> (+ s251 s516) 0)") while checking expression at index 1
FORMULA PolyORBLF-PT-S04J06T10-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 8 out of 639 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 639/639 places, 1781/1781 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 639 transition count 1779
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 637 transition count 1779
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 635 transition count 1777
Applied a total of 8 rules in 60 ms. Remains 635 /639 variables (removed 4) and now considering 1777/1781 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 635/639 places, 1777/1781 transitions.
Incomplete random walk after 1000000 steps, including 74 resets, run finished after 5887 ms. (steps per millisecond=169 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 17 resets, run finished after 2032 ms. (steps per millisecond=492 ) properties seen :[0]
Interrupted probabilistic random walk after 2407131 steps, run timeout after 30001 ms. (steps per millisecond=80 ) properties seen :[0]
Probabilistic random walk after 2407131 steps, saw 501809 distinct states, run finished after 30001 ms. (steps per millisecond=80 ) properties seen :[0]
[2020-06-03 04:44:21] [INFO ] Flow matrix only has 1737 transitions (discarded 40 similar events)
// Phase 1: matrix 1737 rows 635 cols
[2020-06-03 04:44:21] [INFO ] Computed 58 place invariants in 30 ms
[2020-06-03 04:44:21] [INFO ] [Real]Absence check using 17 positive place invariants in 61 ms returned sat
[2020-06-03 04:44:21] [INFO ] [Real]Absence check using 17 positive and 41 generalized place invariants in 35 ms returned sat
[2020-06-03 04:44:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:44:25] [INFO ] [Real]Absence check using state equation in 4172 ms returned sat
[2020-06-03 04:44:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:44:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2020-06-03 04:44:26] [INFO ] [Nat]Absence check using 17 positive and 41 generalized place invariants in 45 ms returned sat
[2020-06-03 04:44:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:44:35] [INFO ] [Nat]Absence check using state equation in 9172 ms returned sat
[2020-06-03 04:44:35] [INFO ] State equation strengthened by 210 read => feed constraints.
[2020-06-03 04:44:36] [INFO ] [Nat]Added 210 Read/Feed constraints in 1055 ms returned sat
[2020-06-03 04:44:36] [INFO ] Deduced a trap composed of 51 places in 607 ms
[2020-06-03 04:44:37] [INFO ] Deduced a trap composed of 101 places in 581 ms
[2020-06-03 04:44:38] [INFO ] Deduced a trap composed of 51 places in 533 ms
[2020-06-03 04:44:38] [INFO ] Deduced a trap composed of 83 places in 543 ms
[2020-06-03 04:44:39] [INFO ] Deduced a trap composed of 50 places in 431 ms
[2020-06-03 04:44:39] [INFO ] Deduced a trap composed of 290 places in 347 ms
[2020-06-03 04:44:40] [INFO ] Deduced a trap composed of 50 places in 367 ms
[2020-06-03 04:44:40] [INFO ] Deduced a trap composed of 51 places in 468 ms
[2020-06-03 04:44:41] [INFO ] Deduced a trap composed of 282 places in 377 ms
[2020-06-03 04:44:41] [INFO ] Deduced a trap composed of 148 places in 481 ms
[2020-06-03 04:44:42] [INFO ] Deduced a trap composed of 50 places in 442 ms
[2020-06-03 04:44:42] [INFO ] Deduced a trap composed of 289 places in 416 ms
[2020-06-03 04:44:43] [INFO ] Deduced a trap composed of 163 places in 498 ms
[2020-06-03 04:44:43] [INFO ] Deduced a trap composed of 178 places in 527 ms
[2020-06-03 04:44:44] [INFO ] Deduced a trap composed of 149 places in 551 ms
[2020-06-03 04:44:44] [INFO ] Deduced a trap composed of 113 places in 446 ms
[2020-06-03 04:44:45] [INFO ] Deduced a trap composed of 134 places in 467 ms
[2020-06-03 04:44:45] [INFO ] Deduced a trap composed of 170 places in 413 ms
[2020-06-03 04:44:46] [INFO ] Deduced a trap composed of 153 places in 414 ms
[2020-06-03 04:44:46] [INFO ] Deduced a trap composed of 172 places in 415 ms
[2020-06-03 04:44:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:44:51] [INFO ] Deduced a trap composed of 52 places in 70 ms
[2020-06-03 04:44:52] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 15944 ms
[2020-06-03 04:44:52] [INFO ] Computed and/alt/rep : 1773/43351/1733 causal constraints in 180 ms.
[2020-06-03 04:45:10] [INFO ] Added : 90 causal constraints over 18 iterations in 18694 ms. Result :(error "Solver has unexpectedly terminated")
Support contains 8 out of 635 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 635/635 places, 1777/1777 transitions.
Applied a total of 0 rules in 65 ms. Remains 635 /635 variables (removed 0) and now considering 1777/1777 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 635/635 places, 1777/1777 transitions.
Starting structural reductions, iteration 0 : 635/635 places, 1777/1777 transitions.
Applied a total of 0 rules in 110 ms. Remains 635 /635 variables (removed 0) and now considering 1777/1777 (removed 0) transitions.
[2020-06-03 04:45:11] [INFO ] Flow matrix only has 1737 transitions (discarded 40 similar events)
// Phase 1: matrix 1737 rows 635 cols
[2020-06-03 04:45:11] [INFO ] Computed 58 place invariants in 68 ms
[2020-06-03 04:45:13] [INFO ] Implicit Places using invariants in 2120 ms returned [66, 146, 181, 224, 307, 343, 365, 438, 476, 555]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 2124 ms to find 10 implicit places.
[2020-06-03 04:45:13] [INFO ] Redundant transitions in 121 ms returned []
[2020-06-03 04:45:13] [INFO ] Flow matrix only has 1737 transitions (discarded 40 similar events)
// Phase 1: matrix 1737 rows 625 cols
[2020-06-03 04:45:13] [INFO ] Computed 48 place invariants in 37 ms
[2020-06-03 04:45:18] [INFO ] Dead Transitions using invariants and state equation in 5529 ms returned []
Starting structural reductions, iteration 1 : 625/635 places, 1777/1777 transitions.
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 625 transition count 1777
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 27 place count 616 transition count 1768
Applied a total of 27 rules in 60 ms. Remains 616 /625 variables (removed 9) and now considering 1768/1777 (removed 9) transitions.
[2020-06-03 04:45:18] [INFO ] Flow matrix only has 1728 transitions (discarded 40 similar events)
// Phase 1: matrix 1728 rows 616 cols
[2020-06-03 04:45:18] [INFO ] Computed 48 place invariants in 34 ms
[2020-06-03 04:45:20] [INFO ] Implicit Places using invariants in 1941 ms returned []
[2020-06-03 04:45:20] [INFO ] Flow matrix only has 1728 transitions (discarded 40 similar events)
// Phase 1: matrix 1728 rows 616 cols
[2020-06-03 04:45:20] [INFO ] Computed 48 place invariants in 59 ms
[2020-06-03 04:45:22] [INFO ] State equation strengthened by 210 read => feed constraints.
[2020-06-03 04:45:36] [INFO ] Implicit Places using invariants and state equation in 15291 ms returned []
Implicit Place search using SMT with State Equation took 17235 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 616/635 places, 1768/1777 transitions.
Incomplete random walk after 1000000 steps, including 79 resets, run finished after 5458 ms. (steps per millisecond=183 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 21 resets, run finished after 1992 ms. (steps per millisecond=502 ) properties seen :[0]
Interrupted probabilistic random walk after 2316788 steps, run timeout after 30001 ms. (steps per millisecond=77 ) properties seen :[0]
Probabilistic random walk after 2316788 steps, saw 490505 distinct states, run finished after 30001 ms. (steps per millisecond=77 ) properties seen :[0]
[2020-06-03 04:46:13] [INFO ] Flow matrix only has 1728 transitions (discarded 40 similar events)
// Phase 1: matrix 1728 rows 616 cols
[2020-06-03 04:46:13] [INFO ] Computed 48 place invariants in 28 ms
[2020-06-03 04:46:13] [INFO ] [Real]Absence check using 17 positive place invariants in 27 ms returned sat
[2020-06-03 04:46:13] [INFO ] [Real]Absence check using 17 positive and 31 generalized place invariants in 52 ms returned sat
[2020-06-03 04:46:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:46:16] [INFO ] [Real]Absence check using state equation in 3090 ms returned sat
[2020-06-03 04:46:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:46:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 30 ms returned sat
[2020-06-03 04:46:17] [INFO ] [Nat]Absence check using 17 positive and 31 generalized place invariants in 77 ms returned sat
[2020-06-03 04:46:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:46:20] [INFO ] [Nat]Absence check using state equation in 3484 ms returned sat
[2020-06-03 04:46:20] [INFO ] State equation strengthened by 210 read => feed constraints.
[2020-06-03 04:46:21] [INFO ] [Nat]Added 210 Read/Feed constraints in 736 ms returned sat
[2020-06-03 04:46:21] [INFO ] Deduced a trap composed of 50 places in 567 ms
[2020-06-03 04:46:22] [INFO ] Deduced a trap composed of 50 places in 542 ms
[2020-06-03 04:46:23] [INFO ] Deduced a trap composed of 99 places in 478 ms
[2020-06-03 04:46:23] [INFO ] Deduced a trap composed of 129 places in 506 ms
[2020-06-03 04:46:24] [INFO ] Deduced a trap composed of 154 places in 542 ms
[2020-06-03 04:46:25] [INFO ] Deduced a trap composed of 212 places in 515 ms
[2020-06-03 04:46:25] [INFO ] Deduced a trap composed of 89 places in 431 ms
[2020-06-03 04:46:25] [INFO ] Deduced a trap composed of 129 places in 386 ms
[2020-06-03 04:46:26] [INFO ] Deduced a trap composed of 234 places in 534 ms
[2020-06-03 04:46:27] [INFO ] Deduced a trap composed of 260 places in 516 ms
[2020-06-03 04:46:27] [INFO ] Deduced a trap composed of 309 places in 467 ms
[2020-06-03 04:46:28] [INFO ] Deduced a trap composed of 234 places in 446 ms
[2020-06-03 04:46:29] [INFO ] Deduced a trap composed of 76 places in 540 ms
[2020-06-03 04:46:29] [INFO ] Deduced a trap composed of 228 places in 528 ms
[2020-06-03 04:46:30] [INFO ] Deduced a trap composed of 247 places in 491 ms
[2020-06-03 04:46:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:46:34] [INFO ] Deduced a trap composed of 99 places in 507 ms
[2020-06-03 04:46:35] [INFO ] Deduced a trap composed of 129 places in 503 ms
[2020-06-03 04:46:35] [INFO ] Deduced a trap composed of 50 places in 381 ms
[2020-06-03 04:46:36] [INFO ] Deduced a trap composed of 51 places in 398 ms
[2020-06-03 04:46:36] [INFO ] Deduced a trap composed of 228 places in 464 ms
[2020-06-03 04:46:37] [INFO ] Deduced a trap composed of 168 places in 377 ms
[2020-06-03 04:46:38] [INFO ] Deduced a trap composed of 109 places in 519 ms
[2020-06-03 04:46:39] [INFO ] Deduced a trap composed of 50 places in 489 ms
[2020-06-03 04:46:39] [INFO ] Deduced a trap composed of 147 places in 494 ms
[2020-06-03 04:46:39] [INFO ] Deduced a trap composed of 123 places in 374 ms
[2020-06-03 04:46:40] [INFO ] Deduced a trap composed of 116 places in 482 ms
[2020-06-03 04:46:41] [INFO ] Deduced a trap composed of 106 places in 463 ms
[2020-06-03 04:46:41] [INFO ] Deduced a trap composed of 98 places in 487 ms
[2020-06-03 04:46:42] [INFO ] Deduced a trap composed of 99 places in 482 ms
[2020-06-03 04:46:42] [INFO ] Deduced a trap composed of 147 places in 503 ms
[2020-06-03 04:46:43] [INFO ] Deduced a trap composed of 187 places in 502 ms
[2020-06-03 04:46:44] [INFO ] Deduced a trap composed of 50 places in 433 ms
[2020-06-03 04:46:45] [INFO ] Deduced a trap composed of 286 places in 443 ms
[2020-06-03 04:46:45] [INFO ] Deduced a trap composed of 245 places in 388 ms
[2020-06-03 04:46:46] [INFO ] Deduced a trap composed of 288 places in 554 ms
[2020-06-03 04:46:47] [INFO ] Deduced a trap composed of 263 places in 397 ms
[2020-06-03 04:46:49] [INFO ] Deduced a trap composed of 50 places in 487 ms
[2020-06-03 04:46:50] [INFO ] Deduced a trap composed of 83 places in 531 ms
[2020-06-03 04:46:50] [INFO ] Deduced a trap composed of 169 places in 534 ms
[2020-06-03 04:46:51] [INFO ] Deduced a trap composed of 137 places in 536 ms
[2020-06-03 04:46:52] [INFO ] Deduced a trap composed of 135 places in 518 ms
[2020-06-03 04:46:52] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 31372 ms
[2020-06-03 04:46:52] [INFO ] Computed and/alt/rep : 1764/43323/1724 causal constraints in 158 ms.
[2020-06-03 04:47:01] [INFO ] Added : 80 causal constraints over 16 iterations in 9233 ms. Result :unknown
Incomplete Parikh walk after 556900 steps, including 1000 resets, run finished after 3643 ms. (steps per millisecond=152 ) properties seen :[0] could not realise parikh vector
Support contains 8 out of 616 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 616/616 places, 1768/1768 transitions.
Applied a total of 0 rules in 27 ms. Remains 616 /616 variables (removed 0) and now considering 1768/1768 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 616/616 places, 1768/1768 transitions.
Starting structural reductions, iteration 0 : 616/616 places, 1768/1768 transitions.
Applied a total of 0 rules in 26 ms. Remains 616 /616 variables (removed 0) and now considering 1768/1768 (removed 0) transitions.
[2020-06-03 04:47:05] [INFO ] Flow matrix only has 1728 transitions (discarded 40 similar events)
// Phase 1: matrix 1728 rows 616 cols
[2020-06-03 04:47:05] [INFO ] Computed 48 place invariants in 28 ms
[2020-06-03 04:47:07] [INFO ] Implicit Places using invariants in 2087 ms returned []
[2020-06-03 04:47:07] [INFO ] Flow matrix only has 1728 transitions (discarded 40 similar events)
// Phase 1: matrix 1728 rows 616 cols
[2020-06-03 04:47:07] [INFO ] Computed 48 place invariants in 32 ms
[2020-06-03 04:47:09] [INFO ] State equation strengthened by 210 read => feed constraints.
[2020-06-03 04:47:22] [INFO ] Implicit Places using invariants and state equation in 14853 ms returned []
Implicit Place search using SMT with State Equation took 16942 ms to find 0 implicit places.
[2020-06-03 04:47:22] [INFO ] Redundant transitions in 53 ms returned []
[2020-06-03 04:47:22] [INFO ] Flow matrix only has 1728 transitions (discarded 40 similar events)
// Phase 1: matrix 1728 rows 616 cols
[2020-06-03 04:47:22] [INFO ] Computed 48 place invariants in 85 ms
[2020-06-03 04:47:27] [INFO ] Dead Transitions using invariants and state equation in 5165 ms returned []
Finished structural reductions, in 1 iterations. Remains : 616/616 places, 1768/1768 transitions.
Incomplete random walk after 100000 steps, including 10 resets, run finished after 644 ms. (steps per millisecond=155 ) properties seen :[0]
[2020-06-03 04:47:28] [INFO ] Flow matrix only has 1728 transitions (discarded 40 similar events)
// Phase 1: matrix 1728 rows 616 cols
[2020-06-03 04:47:28] [INFO ] Computed 48 place invariants in 28 ms
[2020-06-03 04:47:28] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2020-06-03 04:47:28] [INFO ] [Real]Absence check using 17 positive and 31 generalized place invariants in 32 ms returned sat
[2020-06-03 04:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:47:31] [INFO ] [Real]Absence check using state equation in 2758 ms returned sat
[2020-06-03 04:47:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:47:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 25 ms returned sat
[2020-06-03 04:47:31] [INFO ] [Nat]Absence check using 17 positive and 31 generalized place invariants in 71 ms returned sat
[2020-06-03 04:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:47:34] [INFO ] [Nat]Absence check using state equation in 3369 ms returned sat
[2020-06-03 04:47:34] [INFO ] State equation strengthened by 210 read => feed constraints.
[2020-06-03 04:47:35] [INFO ] [Nat]Added 210 Read/Feed constraints in 734 ms returned sat
[2020-06-03 04:47:36] [INFO ] Deduced a trap composed of 50 places in 395 ms
[2020-06-03 04:47:36] [INFO ] Deduced a trap composed of 50 places in 371 ms
[2020-06-03 04:47:37] [INFO ] Deduced a trap composed of 99 places in 492 ms
[2020-06-03 04:47:37] [INFO ] Deduced a trap composed of 129 places in 387 ms
[2020-06-03 04:47:38] [INFO ] Deduced a trap composed of 154 places in 438 ms
[2020-06-03 04:47:38] [INFO ] Deduced a trap composed of 212 places in 404 ms
[2020-06-03 04:47:39] [INFO ] Deduced a trap composed of 89 places in 474 ms
[2020-06-03 04:47:39] [INFO ] Deduced a trap composed of 129 places in 401 ms
[2020-06-03 04:47:40] [INFO ] Deduced a trap composed of 234 places in 435 ms
[2020-06-03 04:47:40] [INFO ] Deduced a trap composed of 260 places in 403 ms
[2020-06-03 04:47:41] [INFO ] Deduced a trap composed of 309 places in 368 ms
[2020-06-03 04:47:41] [INFO ] Deduced a trap composed of 234 places in 378 ms
[2020-06-03 04:47:42] [INFO ] Deduced a trap composed of 76 places in 517 ms
[2020-06-03 04:47:43] [INFO ] Deduced a trap composed of 228 places in 409 ms
[2020-06-03 04:47:43] [INFO ] Deduced a trap composed of 247 places in 494 ms
[2020-06-03 04:47:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:47:47] [INFO ] Deduced a trap composed of 51 places in 97 ms
[2020-06-03 04:47:47] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 11901 ms
[2020-06-03 04:47:47] [INFO ] Computed and/alt/rep : 1764/43323/1724 causal constraints in 127 ms.
[2020-06-03 04:47:51] [INFO ] Added : 35 causal constraints over 7 iterations in 3815 ms. Result :unknown
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 616 transition count 1728
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -90
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 58 place count 607 transition count 1818
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 68 place count 607 transition count 1808
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 78 place count 597 transition count 1808
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 2 with 14 rules applied. Total rules applied 92 place count 597 transition count 1794
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 106 place count 583 transition count 1794
Drop transitions removed 76 transitions
Redundant transition composition rules discarded 76 transitions
Iterating global reduction 3 with 76 rules applied. Total rules applied 182 place count 583 transition count 1718
Applied a total of 182 rules in 179 ms. Remains 583 /616 variables (removed 33) and now considering 1718/1768 (removed 50) transitions.
// Phase 1: matrix 1718 rows 583 cols
[2020-06-03 04:47:51] [INFO ] Computed 48 place invariants in 34 ms
[2020-06-03 04:47:51] [INFO ] [Real]Absence check using 15 positive place invariants in 23 ms returned sat
[2020-06-03 04:47:51] [INFO ] [Real]Absence check using 15 positive and 33 generalized place invariants in 52 ms returned sat
[2020-06-03 04:47:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:47:55] [INFO ] [Real]Absence check using state equation in 3758 ms returned sat
[2020-06-03 04:47:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:47:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 32 ms returned sat
[2020-06-03 04:47:55] [INFO ] [Nat]Absence check using 15 positive and 33 generalized place invariants in 62 ms returned sat
[2020-06-03 04:47:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:48:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:48:09] [INFO ] [Nat]Absence check using state equation in 13467 ms returned sat
[2020-06-03 04:48:09] [INFO ] Deduced a trap composed of 47 places in 169 ms
[2020-06-03 04:48:09] [INFO ] Deduced a trap composed of 47 places in 120 ms
[2020-06-03 04:48:09] [INFO ] Deduced a trap composed of 48 places in 132 ms
[2020-06-03 04:48:09] [INFO ] Deduced a trap composed of 47 places in 84 ms
[2020-06-03 04:48:10] [INFO ] Deduced a trap composed of 47 places in 88 ms
[2020-06-03 04:48:10] [INFO ] Deduced a trap composed of 48 places in 52 ms
[2020-06-03 04:48:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1067 ms
[2020-06-03 04:48:10] [INFO ] Computed and/alt/rep : 1703/40415/1703 causal constraints in 127 ms.
[2020-06-03 04:48:19] [INFO ] Added : 15 causal constraints over 3 iterations in 9198 ms. Result :unknown
[2020-06-03 04:48:19] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2020-06-03 04:48:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 33 ms.
[2020-06-03 04:48:20] [INFO ] Flatten gal took : 262 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ PolyORBLF-PT-S04J06T10 @ 3570 seconds
vrfy: finished
info: timeLeft: 3517
rslt: Output for ReachabilityCardinality @ PolyORBLF-PT-S04J06T10

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 04:48:20 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 50164,
"runtime": 53.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G ((((p381 <= 0) AND (p407 <= 2)) OR ((p62 <= p126) AND ((p434 <= p359) OR (p560 <= p16))))))",
"processed_size": 98,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 9169,
"conflict_clusters": 46,
"places": 616,
"places_significant": 568,
"singleton_clusters": 0,
"transitions": 1768
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2384/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 19712
lola: finding significant places
lola: 616 places, 1768 transitions, 568 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: A (G ((((p381 <= 0) AND (p407 <= 2)) OR ((p62 <= p126) AND ((p434 <= p359) OR (p560 <= p16))))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p381 <= 0) AND (p407 <= 2)) OR ((p62 <= p126) AND ((p434 <= p359) OR (p560 <= p16))))))
lola: processed formula length: 98
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p381) OR (3 <= p407)) AND ((p126 + 1 <= p62) OR ((p359 + 1 <= p434) AND (p16 + 1 <= p560))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 50164 KB
lola: time consumption: 53 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

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

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="PolyORBLF-PT-S04J06T10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is PolyORBLF-PT-S04J06T10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987872000502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T10.tgz
mv PolyORBLF-PT-S04J06T10 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;