Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r132-oct2-155403939200082.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is QuasiCertifProtocol-COL-32, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-oct2-155403939200082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 3.2K Feb 12 10:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 12 10:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 8 12:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K Feb 8 12:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 00:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.4K Feb 5 00:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K Feb 4 22:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 4 14:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 4 14:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 1 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 1 10:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 131K Mar 10 17:31 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1554073735161

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-COL-32 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-COL-32 formula UpperBounds into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking UpperBounds @ QuasiCertifProtocol-COL-32 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 4312/65536 symbol table entries, 765 collisions
lola: preprocessing...
lola: Size of bit vector: 121792
lola: finding significant places
lola: 3806 places, 506 transitions, 505 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 671 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-32-UpperBounds.task
lola: MAX(p3804 + p3803 + p3802 + p3801 + p3800 + p3799 + p3798 + p3797 + p3796 + p3795 + p3794 + p3793 + p3792 + p3791 + p3790 + p3789 + p3788 + p3787 + p3786 + p3785 + p3784 + p3783 + p3782 + p3781 + p3780 + p3779 + p3778 + p3777 + p3776 + p3775 + p3774 + p3773 + p3772) : MAX(p1322 + p1321 + p1320 + p1319 + p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1307 + p1306 + p1305 + p1304 + p1303 + p1302 + p1301 + p1300 + p1299 + p1298 + p1297 + p1296 + p1295 + p1294 + p1293 + p1292 + p1291 + p1290) : MAX(p3738 + p3737 + p3736 + p3735 + p3734 + p3733 + p3732 + p3731 + p3730 + p3729 + p3728 + p3727 + p3726 + p3725 + p3724 + p3723 + p3722 + p3721 + p3720 + p3719 + p3718 + p3717 + p3716 + p3715 + p3714 + p3713 + p3712 + p3711 + p3710 + p3709 + p3708 + p3707 + p3706) : MAX(p3704) : MAX(p66) : MAX(p1900 + p1901 + p1902 + p1903 + p1904 + p1905 + p1906 + p1907 + p1908 + p1909 + p1910 + p1911 + p1912 + p1913 + p1914 + p1915 + p1916 + p1917 + p1918 + p1919 + p1920 + p1921 + p1922 + p1923 + p1924 + p1925 + p1926 + p1927 + p1928 + p1929 + p1930 + p1931 + p1932 + p1933 + p1955 + p1988 + p2549 + p2516 + p2483 + p2450 + p2417 + p2384 + p2351 + p2318 + p2285 + p2252 + p2021 + p2219 + p2186 + p2153 + p2120 + p2087 + p2054 + p2032 + p2033 + p2034 + p2035 + p2036 + p2037 + p2038 + p2039 + p2040 + p2041 + p2042 + p2031 + p2043 + p2044 + p2045 + p2046 + p2047 + p2048 + p2049 + p2050 + p2051 + p2052 + p2053 + p2055 + p2056 + p2057 + p2058 + p2059 + p2060 + p2061 + p2062 + p2063 + p2064 + p2065 + p2066 + p2067 + p2068 + p2069 + p2070 + p2071 + p2072 + p2073 + p2074 + p2075 + p2076 + p2077 + p2078 + p2079 + p2080 + p2081 + p2082 + p2083 + p2084 + p2085 + p2086 + p2030 + p2088 + p2089 + p2090 + p2091 + p2092 + p2093 + p2094 + p2095 + p2096 + p2097 + p2098 + p2099 + p2029 + p2028 + p2100 + p2101 + p2102 + p2103 + p2104 + p2105 + p2106 + p2107 + p2108 + p2109 + p2027 + p2110 + p2111 + p2112 + p2113 + p2114 + p2115 + p2116 + p2117 + p2118 + p2119 + p2121 + p2122 + p2123 + p2124 + p2125 + p2126 + p2127 + p2128 + p2129 + p2130 + p2131 + p2132 + p2133 + p2134 + p2135 + p2136 + p2137 + p2138 + p2139 + p2140 + p2141 + p2026 + p2142 + p2143 + p2144 + p2145 + p2146 + p2147 + p2148 + p2149 + p2150 + p2151 + p2152 + p2154 + p2155 + p2156 + p2157 + p2158 + p2159 + p2160 + p2161 + p2162 + p2163 + p2164 + p2165 + p2166 + p2167 + p2168 + p2169 + p2170 + p2171 + p2172 + p2173 + p2174 + p2175 + p2176 + p2177 + p2178 + p2179 + p2180 + p2181 + p2182 + p2183 + p2184 + p2185 + p2025 + p2187 + p2188 + p2189 + p2190 + p2191 + p2192 + p2193 + p2194 + p2195 + p2196 + p2197 + p2198 + p2199 + p2024 + p2200 + p2201 + p2202 + p2203 + p2204 + p2205 + p2206 + p2207 + p2023 + p2208 + p2209 + p2210 + p2211 + p2212 + p2213 + p2214 + p2215 + p2216 + p2217 + p2218 + p2022 + p2220 + p2221 + p2222 + p2223 + p2224 + p2225 + p2226 + p2227 + p2228 + p2229 + p2230 + p2231 + p2232 + p2233 + p2234 + p2235 + p2236 + p2237 + p2238 + p2239 + p2240 + p2241 + p2242 + p2243 + p2244 + p2245 + p2246 + p2247 + p2248 + p2249 + p2250 + p2251 + p2253 + p2254 + p2255 + p2256 + p2257 + p2258 + p2259 + p2260 + p2261 + p2262 + p2263 + p2264 + p2265 + p2266 + p2267 + p2268 + p2269 + p2270 + p2271 + p2272 + p2273 + p2274 + p2275 + p2276 + p2277 + p2278 + p2279 + p2280 + p2281 + p2282 + p2283 + p2284 + p2020 + p2286 + p2287 + p2288 + p2289 + p2290 + p2291 + p2292 + p2293 + p2294 + p2295 + p2296 + p2297 + p2298 + p2299 + p2019 + p2300 + p2301 + p2302 + p2303 + p2304 + p2305 + p2306 + p2018 + p2307 + p2308 + p2309 + p2310 + p2311 + p2312 + p2313 + p2314 + p2315 + p2316 + p2317 + p2017 + p2319 + p2320 + p2321 + p2322 + p2323 + p2324 + p2325 + p2326 + p2327 + p2328 + p2329 + p2330 + p2331 + p2332 + p2333 + p2334 + p2335 + p2336 + p2337 + p2338 + p2339 + p2016 + p2340 + p2341 + p2342 + p2343 + p2344 + p2345 + p2346 + p2347 + p2348 + p2349 + p2350 + p2352 + p2353 + p2354 + p2355 + p2015 + p2356 + p2357 + p2358 + p2359 + p2360 + p2361 + p2362 + p2363 + p2364 + p2365 + p2366 + p2367 + p2368 + p2369 + p2370 + p2371 + p2372 + p2373 + p2374 + p2375 + p2376 + p2377 + p2378 + p2379 + p2380 + p2381 + p2382 + p2383 + p2385 + p2386 + p2387 + p2388 + p2014 + p2389 + p2390 + p2391 + p2392 + p2393 + p2394 + p2395 + p2396 + p2397 + p2398 + p2399 + p2013 + p2012 + p2011 + p2010 + p2009 + p2008 + p2007 + p2006 + p2005 + p2004 + p2003 + p2002 + p2001 + p2000 + p2400 + p2401 + p2402 + p2403 + p2404 + p2405 + p2406 + p2407 + p2408 + p2409 + p2410 + p2411 + p2412 + p2413 + p2414 + p2415 + p2416 + p2418 + p2419 + p2420 + p2421 + p2422 + p2423 + p2424 + p2425 + p2426 + p2427 + p2428 + p2429 + p2430 + p2431 + p2432 + p2433 + p2434 + p2435 + p2436 + p2437 + p2438 + p2439 + p2440 + p2441 + p2442 + p2443 + p2444 + p2445 + p2446 + p2447 + p2448 + p2449 + p2451 + p2452 + p2453 + p2454 + p2455 + p2456 + p2457 + p2458 + p2459 + p2460 + p2461 + p2462 + p2463 + p2464 + p2465 + p2466 + p2467 + p2468 + p2469 + p2470 + p2471 + p2472 + p2473 + p2474 + p2475 + p2476 + p2477 + p2478 + p2479 + p2480 + p2481 + p2482 + p2484 + p2485 + p2486 + p2487 + p2488 + p2489 + p2490 + p2491 + p2492 + p2493 + p2494 + p2495 + p2496 + p2497 + p2498 + p2499 + p2500 + p2501 + p2502 + p2503 + p2504 + p2505 + p2506 + p2507 + p2508 + p2509 + p2510 + p2511 + p2512 + p2513 + p2514 + p2515 + p2517 + p2518 + p2519 + p2520 + p2521 + p2522 + p2523 + p2524 + p2525 + p2526 + p2527 + p2528 + p2529 + p2530 + p2531 + p2532 + p2533 + p2534 + p2535 + p2536 + p2537 + p2538 + p2539 + p2540 + p2541 + p2542 + p2543 + p2544 + p2545 + p2546 + p2547 + p2548 + p2550 + p2551 + p2552 + p2553 + p2554 + p2555 + p2556 + p2557 + p2558 + p2559 + p2560 + p2561 + p2562 + p2563 + p2564 + p2565 + p2566 + p2567 + p2568 + p2569 + p2570 + p2571 + p2572 + p2573 + p2574 + p2575 + p2576 + p2577 + p2578 + p2579 + p2580 + p2581 + p1493 + p1494 + p1495 + p1496 + p1497 + p1498 + p1499 + p1999 + p1998 + p1500 + p1501 + p1502 + p1503 + p1504 + p1505 + p1506 + p1507 + p1508 + p1509 + p1510 + p1511 + p1512 + p1513 + p1514 + p1997 + p1515 + p1516 + p1517 + p1518 + p1519 + p1520 + p1521 + p1522 + p1523 + p1524 + p1525 + p1526 + p1527 + p1528 + p1529 + p1530 + p1531 + p1532 + p1533 + p1534 + p1535 + p1536 + p1537 + p1538 + p1539 + p1540 + p1541 + p1542 + p1543 + p1544 + p1545 + p1546 + p1547 + p1996 + p1548 + p1549 + p1550 + p1551 + p1552 + p1553 + p1554 + p1555 + p1556 + p1557 + p1558 + p1559 + p1560 + p1561 + p1562 + p1563 + p1564 + p1565 + p1566 + p1567 + p1568 + p1569 + p1570 + p1571 + p1572 + p1573 + p1574 + p1575 + p1576 + p1577 + p1578 + p1579 + p1580 + p1581 + p1582 + p1583 + p1584 + p1585 + p1586 + p1587 + p1588 + p1589 + p1590 + p1591 + p1592 + p1593 + p1594 + p1595 + p1596 + p1597 + p1598 + p1599 + p1995 + p1994 + p1993 + p1992 + p1991 + p1990 + p1989 + p1987 + p1986 + p1985 + p1984 + p1983 + p1982 + p1981 + p1980 + p1979 + p1978 + p1977 + p1976 + p1975 + p1974 + p1973 + p1972 + p1971 + p1970 + p1969 + p1968 + p1967 + p1966 + p1965 + p1964 + p1963 + p1962 + p1961 + p1960 + p1959 + p1958 + p1957 + p1956 + p1954 + p1953 + p1952 + p1951 + p1950 + p1949 + p1948 + p1947 + p1946 + p1945 + p1944 + p1943 + p1942 + p1941 + p1940 + p1939 + p1938 + p1937 + p1936 + p1935 + p1600 + p1601 + p1602 + p1603 + p1604 + p1605 + p1606 + p1607 + p1608 + p1609 + p1610 + p1611 + p1612 + p1613 + p1934 + p1614 + p1615 + p1616 + p1617 + p1618 + p1619 + p1620 + p1621 + p1622 + p1623 + p1624 + p1625 + p1626 + p1627 + p1628 + p1629 + p1630 + p1631 + p1632 + p1633 + p1634 + p1635 + p1636 + p1637 + p1638 + p1639 + p1640 + p1641 + p1642 + p1643 + p1644 + p1645 + p1646 + p1647 + p1648 + p1649 + p1650 + p1651 + p1652 + p1653 + p1654 + p1655 + p1656 + p1657 + p1658 + p1659 + p1660 + p1661 + p1662 + p1663 + p1664 + p1665 + p1666 + p1667 + p1668 + p1669 + p1670 + p1671 + p1672 + p1673 + p1674 + p1675 + p1676 + p1677 + p1678 + p1679 + p1680 + p1681 + p1682 + p1683 + p1684 + p1685 + p1686 + p1687 + p1688 + p1689 + p1690 + p1691 + p1692 + p1693 + p1694 + p1695 + p1696 + p1697 + p1698 + p1699 + p1700 + p1701 + p1702 + p1703 + p1704 + p1705 + p1706 + p1707 + p1708 + p1709 + p1710 + p1711 + p1712 + p1713 + p1714 + p1715 + p1716 + p1717 + p1718 + p1719 + p1720 + p1721 + p1722 + p1723 + p1724 + p1725 + p1726 + p1727 + p1728 + p1729 + p1730 + p1731 + p1732 + p1733 + p1734 + p1735 + p1736 + p1737 + p1738 + p1739 + p1740 + p1741 + p1742 + p1743 + p1744 + p1745 + p1746 + p1747 + p1748 + p1749 + p1750 + p1751 + p1752 + p1753 + p1754 + p1755 + p1756 + p1757 + p1758 + p1759 + p1760 + p1761 + p1762 + p1763 + p1764 + p1765 + p1766 + p1767 + p1768 + p1769 + p1770 + p1771 + p1772 + p1773 + p1774 + p1775 + p1776 + p1777 + p1778 + p1779 + p1780 + p1781 + p1782 + p1783 + p1784 + p1785 + p1786 + p1787 + p1788 + p1789 + p1790 + p1791 + p1792 + p1793 + p1794 + p1795 + p1796 + p1797 + p1798 + p1799 + p1800 + p1801 + p1802 + p1803 + p1804 + p1805 + p1806 + p1807 + p1808 + p1809 + p1810 + p1811 + p1812 + p1813 + p1814 + p1815 + p1816 + p1817 + p1818 + p1819 + p1820 + p1821 + p1822 + p1823 + p1824 + p1825 + p1826 + p1827 + p1828 + p1829 + p1830 + p1831 + p1832 + p1833 + p1834 + p1835 + p1836 + p1837 + p1838 + p1839 + p1840 + p1841 + p1842 + p1843 + p1844 + p1845 + p1846 + p1847 + p1848 + p1849 + p1850 + p1851 + p1852 + p1853 + p1854 + p1855 + p1856 + p1857 + p1858 + p1859 + p1860 + p1861 + p1862 + p1863 + p1864 + p1865 + p1866 + p1867 + p1868 + p1869 + p1870 + p1871 + p1872 + p1873 + p1874 + p1875 + p1876 + p1877 + p1878 + p1879 + p1880 + p1881 + p1882 + p1883 + p1884 + p1885 + p1886 + p1887 + p1888 + p1889 + p1890 + p1891 + p1892 + p1893 + p1894 + p1895 + p1896 + p1897 + p1898 + p1899) : MAX(p1190 + p1189 + p1188 + p1187 + p1186 + p1185 + p1184 + p1183 + p1182 + p1181 + p1180 + p1179 + p1178 + p1177 + p1176 + p1175 + p1174 + p1173 + p1172 + p1171 + p1170 + p1169 + p1168 + p1167 + p1166 + p1165 + p1164 + p1163 + p1162 + p1161 + p1160 + p1159 + p1158) : MAX(p3671 + p3672 + p3673 + p3674 + p3675 + p3676 + p3677 + p3678 + p3679 + p3680 + p3681 + p3682 + p3683 + p3684 + p3685 + p3686 + p3687 + p3688 + p3689 + p3690 + p3691 + p3692 + p3693 + p3694 + p3695 + p3696 + p3697 + p3698 + p3699 + p3700 + p3701 + p3702 + p3703) : MAX(p3804 + p3803 + p3802 + p3801 + p3800 + p3799 + p3798 + p3797 + p3796 + p3795 + p3794 + p3793 + p3792 + p3791 + p3790 + p3789 + p3788 + p3787 + p3786 + p3785 + p3784 + p3783 + p3782 + p3781 + p3780 + p3779 + p3778 + p3777 + p3776 + p3775 + p3774 + p3773 + p3772) : MAX(p1425) : MAX(p1492) : MAX(p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1378 + p1377 + p1376 + p1375 + p1374 + p1373 + p1372 + p1371 + p1370 + p1369 + p1368 + p1367 + p1366 + p1365 + p1364 + p1363 + p1362 + p1361 + p1360 + p1359 + p1358 + p1357 + p1356) : MAX(p1425) : MAX(p1157) : MAX(p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1378 + p1377 + p1376 + p1375 + p1374 + p1373 + p1372 + p1371 + p1370 + p1369 + p1368 + p1367 + p1366 + p1365 + p1364 + p1363 + p1362 + p1361 + p1360 + p1359 + p1358 + p1357 + p1356) : MAX(p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1378 + p1377 + p1376 + p1375 + p1374 + p1373 + p1372 + p1371 + p1370 + p1369 + p1368 + p1367 + p1366 + p1365 + p1364 + p1363 + p1362 + p1361 + p1360 + p1359 + p1358 + p1357 + p1356)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3704)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3704)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-32-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 72 markings, 71 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-32-UpperBounds-3 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p66)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p66)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-32-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 36 markings, 35 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-32-UpperBounds-4 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1425)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1425)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-32-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 20 markings, 19 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-32-UpperBounds-9 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1492)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1492)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-32-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 3 markings, 2 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-32-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1425)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1425)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-32-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 20 markings, 19 edges

FORMULA QuasiCertifProtocol-COL-32-UpperBounds-12 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1157)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1157)
lola: processed formula length: 10
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-32-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 176 markings, 175 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-32-UpperBounds-13 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3671 + p3672 + p3673 + p3674 + p3675 + p3676 + p3677 + p3678 + p3679 + p3680 + p3681 + p3682 + p3683 + p3684 + p3685 + p3686 + p3687 + p3688 + p3689 + p3690 + p3691 + p3692 + p3693 + p3694 + p3695 + p3696 + p3697 + p3698 + p3699 + p3700 + p3701 + p3702 + p3703)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3671 + p3672 + p3673 + p3674 + p3675 + p3676 + p3677 + p3678 + p3679 + p3680 + p3681 + p3682 + p3683 + p3684 + p3685 + p3686 + p3687 + p3688 + p3689 + p3690 + p3691 + p3692 + p3693 + p3694 + p3695 + p3696 + p3697 + p3698 + p3699 + p3700 + p3701 + p3702 + p3703)
lola: processed formula length: 266
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-32-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-32-UpperBounds-7 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3804 + p3803 + p3802 + p3801 + p3800 + p3799 + p3798 + p3797 + p3796 + p3795 + p3794 + p3793 + p3792 + p3791 + p3790 + p3789 + p3788 + p3787 + p3786 + p3785 + p3784 + p3783 + p3782 + p3781 + p3780 + p3779 + p3778 + p3777 + p3776 + p3775 + p3774 + p3773 + p3772)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3804 + p3803 + p3802 + p3801 + p3800 + p3799 + p3798 + p3797 + p3796 + p3795 + p3794 + p3793 + p3792 + p3791 + p3790 + p3789 + p3788 + p3787 + p3786 + p3785 + p3784 + p3783 + p3782 + p3781 + p3780 + p3779 + p3778 + p3777 + p3776 + p3775 + p3774 + p3773 + p3772)
lola: processed formula length: 266
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-32-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 2 markings, 1 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-32-UpperBounds-8 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3738 + p3737 + p3736 + p3735 + p3734 + p3733 + p3732 + p3731 + p3730 + p3729 + p3728 + p3727 + p3726 + p3725 + p3724 + p3723 + p3722 + p3721 + p3720 + p3719 + p3718 + p3717 + p3716 + p3715 + p3714 + p3713 + p3712 + p3711 + p3710 + p3709 + p3708 + p3707 + p3706)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3738 + p3737 + p3736 + p3735 + p3734 + p3733 + p3732 + p3731 + p3730 + p3729 + p3728 + p3727 + p3726 + p3725 + p3724 + p3723 + p3722 + p3721 + p3720 + p3719 + p3718 + p3717 + p3716 + p3715 + p3714 + p3713 + p3712 + p3711 + p3710 + p3709 + p3708 + p3707 + p3706)
lola: processed formula length: 266
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-32-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 70 markings, 69 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-32-UpperBounds-2 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3804 + p3803 + p3802 + p3801 + p3800 + p3799 + p3798 + p3797 + p3796 + p3795 + p3794 + p3793 + p3792 + p3791 + p3790 + p3789 + p3788 + p3787 + p3786 + p3785 + p3784 + p3783 + p3782 + p3781 + p3780 + p3779 + p3778 + p3777 + p3776 + p3775 + p3774 + p3773 + p3772)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3804 + p3803 + p3802 + p3801 + p3800 + p3799 + p3798 + p3797 + p3796 + p3795 + p3794 + p3793 + p3792 + p3791 + p3790 + p3789 + p3788 + p3787 + p3786 + p3785 + p3784 + p3783 + p3782 + p3781 + p3780 + p3779 + p3778 + p3777 + p3776 + p3775 + p3774 + p3773 + p3772)
lola: processed formula length: 266
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-32-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 2 markings, 1 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-32-UpperBounds-0 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1378 + p1377 + p1376 + p1375 + p1374 + p1373 + p1372 + p1371 + p1370 + p1369 + p1368 + p1367 + p1366 + p1365 + p1364 + p1363 + p1362 + p1361 + p1360 + p1359 + p1358 + p1357 + p1356)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1378 + p1377 + p1376 + p1375 + p1374 + p1373 + p1372 + p1371 + p1370 + p1369 + p1368 + p1367 + p1366 + p1365 + p1364 + p1363 + p1362 + p1361 + p1360 + p1359 + p1358 + p1357 + p1356)
lola: processed formula length: 266
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-32-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 70 markings, 69 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-32-UpperBounds-11 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1322 + p1321 + p1320 + p1319 + p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1307 + p1306 + p1305 + p1304 + p1303 + p1302 + p1301 + p1300 + p1299 + p1298 + p1297 + p1296 + p1295 + p1294 + p1293 + p1292 + p1291 + p1290)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1322 + p1321 + p1320 + p1319 + p1318 + p1317 + p1316 + p1315 + p1314 + p1313 + p1312 + p1311 + p1310 + p1309 + p1308 + p1307 + p1306 + p1305 + p1304 + p1303 + p1302 + p1301 + p1300 + p1299 + p1298 + p1297 + p1296 + p1295 + p1294 + p1293 + p1292 + p1291 + p1290)
lola: processed formula length: 266
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-32-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 105 markings, 104 edges

FORMULA QuasiCertifProtocol-COL-32-UpperBounds-1 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1190 + p1189 + p1188 + p1187 + p1186 + p1185 + p1184 + p1183 + p1182 + p1181 + p1180 + p1179 + p1178 + p1177 + p1176 + p1175 + p1174 + p1173 + p1172 + p1171 + p1170 + p1169 + p1168 + p1167 + p1166 + p1165 + p1164 + p1163 + p1162 + p1161 + p1160 + p1159 + p1158)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1190 + p1189 + p1188 + p1187 + p1186 + p1185 + p1184 + p1183 + p1182 + p1181 + p1180 + p1179 + p1178 + p1177 + p1176 + p1175 + p1174 + p1173 + p1172 + p1171 + p1170 + p1169 + p1168 + p1167 + p1166 + p1165 + p1164 + p1163 + p1162 + p1161 + p1160 + p1159 + p1158)
lola: processed formula length: 266
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-32-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 171 markings, 170 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-32-UpperBounds-6 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1378 + p1377 + p1376 + p1375 + p1374 + p1373 + p1372 + p1371 + p1370 + p1369 + p1368 + p1367 + p1366 + p1365 + p1364 + p1363 + p1362 + p1361 + p1360 + p1359 + p1358 + p1357 + p1356)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1378 + p1377 + p1376 + p1375 + p1374 + p1373 + p1372 + p1371 + p1370 + p1369 + p1368 + p1367 + p1366 + p1365 + p1364 + p1363 + p1362 + p1361 + p1360 + p1359 + p1358 + p1357 + p1356)
lola: processed formula length: 266
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-32-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 70 markings, 69 edges

FORMULA QuasiCertifProtocol-COL-32-UpperBounds-14 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1378 + p1377 + p1376 + p1375 + p1374 + p1373 + p1372 + p1371 + p1370 + p1369 + p1368 + p1367 + p1366 + p1365 + p1364 + p1363 + p1362 + p1361 + p1360 + p1359 + p1358 + p1357 + p1356)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1388 + p1387 + p1386 + p1385 + p1384 + p1383 + p1382 + p1381 + p1380 + p1379 + p1378 + p1377 + p1376 + p1375 + p1374 + p1373 + p1372 + p1371 + p1370 + p1369 + p1368 + p1367 + p1366 + p1365 + p1364 + p1363 + p1362 + p1361 + p1360 + p1359 + p1358 + p1357 + p1356)
lola: processed formula length: 266
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-32-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 70 markings, 69 edges

FORMULA QuasiCertifProtocol-COL-32-UpperBounds-15 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1900 + p1901 + p1902 + p1903 + p1904 + p1905 + p1906 + p1907 + p1908 + p1909 + p1910 + p1911 + p1912 + p1913 + p1914 + p1915 + p1916 + p1917 + p1918 + p1919 + p1920 + p1921 + p1922 + p1923 + p1924 + p1925 + p1926 + p1927 + p1928 + p1929 + p1930 + p1931 + p1932 + p1933 + p1955 + p1988 + p2549 + p2516 + p2483 + p2450 + p2417 + p2384 + p2351 + p2318 + p2285 + p2252 + p2021 + p2219 + p2186 + p215... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1900 + p1901 + p1902 + p1903 + p1904 + p1905 + p1906 + p1907 + p1908 + p1909 + p1910 + p1911 + p1912 + p1913 + p1914 + p1915 + p1916 + p1917 + p1918 + p1919 + p1920 + p1921 + p1922 + p1923 + p1924 + p1925 + p1926 + p1927 + p1928 + p1929 + p1930 + p1931 + p1932 + p1933 + p1955 + p1988 + p2549 + p2516 + p2483 + p2450 + p2417 + p2384 + p2351 + p2318 + p2285 + p2252 + p2021 + p2219 + p2186 + p215... (shortened)
lola: processed formula length: 8714
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-COL-32-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1089
lola: SUBRESULT
lola: result: 1089
lola: produced by: state space
lola: The maximum value of the given expression is 1089
lola: 237 markings, 236 edges

FORMULA QuasiCertifProtocol-COL-32-UpperBounds-5 1089 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 33 33 33 1 1 1089 33 33 33 19 1 33 19 19 33 33
lola:
preliminary result: 33 33 33 1 1 1089 33 33 33 19 1 33 19 19 33 33
lola: ========================================
lola: memory consumption: 24980 KB
lola: time consumption: 14 seconds

BK_STOP 1554073749777

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

grep: GenericPropertiesVerdict.xml: No such file or directory

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="QuasiCertifProtocol-COL-32"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="win2018"
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-3954"
echo " Executing tool win2018"
echo " Input is QuasiCertifProtocol-COL-32, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-oct2-155403939200082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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