fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r170-smll-158987815700329
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for FlexibleBarrier-PT-12b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.070 3600000.00 506992.00 1190.10 FTFFFTFTFTFFFFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815700329.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 FlexibleBarrier-PT-12b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815700329
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 3.7K Apr 4 18:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 4 18:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 4 07:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 4 07:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 3 21:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 3 21:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 3 13:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 3 13:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 536K 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 FlexibleBarrier-PT-12b-00
FORMULA_NAME FlexibleBarrier-PT-12b-01
FORMULA_NAME FlexibleBarrier-PT-12b-02
FORMULA_NAME FlexibleBarrier-PT-12b-03
FORMULA_NAME FlexibleBarrier-PT-12b-04
FORMULA_NAME FlexibleBarrier-PT-12b-05
FORMULA_NAME FlexibleBarrier-PT-12b-06
FORMULA_NAME FlexibleBarrier-PT-12b-07
FORMULA_NAME FlexibleBarrier-PT-12b-08
FORMULA_NAME FlexibleBarrier-PT-12b-09
FORMULA_NAME FlexibleBarrier-PT-12b-10
FORMULA_NAME FlexibleBarrier-PT-12b-11
FORMULA_NAME FlexibleBarrier-PT-12b-12
FORMULA_NAME FlexibleBarrier-PT-12b-13
FORMULA_NAME FlexibleBarrier-PT-12b-14
FORMULA_NAME FlexibleBarrier-PT-12b-15

=== Now, execution of the tool begins

BK_START 1591361307830

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 12:48:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 12:48:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 12:48:31] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2020-06-05 12:48:31] [INFO ] Transformed 1988 places.
[2020-06-05 12:48:31] [INFO ] Transformed 2289 transitions.
[2020-06-05 12:48:31] [INFO ] Found NUPN structural information;
[2020-06-05 12:48:31] [INFO ] Parsed PT model containing 1988 places and 2289 transitions in 348 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 89 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1159 resets, run finished after 960 ms. (steps per millisecond=104 ) properties seen :[0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0]
// Phase 1: matrix 2289 rows 1988 cols
[2020-06-05 12:48:32] [INFO ] Computed 14 place invariants in 113 ms
[2020-06-05 12:48:33] [INFO ] [Real]Absence check using 14 positive place invariants in 180 ms returned sat
[2020-06-05 12:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:48:45] [INFO ] [Real]Absence check using state equation in 12287 ms returned sat
[2020-06-05 12:48:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:48:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 12:48:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 11133 ms returned unknown
[2020-06-05 12:48:57] [INFO ] [Real]Absence check using 14 positive place invariants in 175 ms returned sat
[2020-06-05 12:48:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:49:09] [INFO ] [Real]Absence check using state equation in 11433 ms returned sat
[2020-06-05 12:49:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:49:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 12:49:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 10960 ms returned unknown
[2020-06-05 12:49:21] [INFO ] [Real]Absence check using 14 positive place invariants in 172 ms returned sat
[2020-06-05 12:49:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:49:33] [INFO ] [Real]Absence check using state equation in 11863 ms returned sat
[2020-06-05 12:49:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:49:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 12:49:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 10976 ms returned unknown
[2020-06-05 12:49:45] [INFO ] [Real]Absence check using 14 positive place invariants in 175 ms returned sat
[2020-06-05 12:49:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:49:57] [INFO ] [Real]Absence check using state equation in 11588 ms returned sat
[2020-06-05 12:49:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:50:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 12:50:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 10906 ms returned unknown
[2020-06-05 12:50:09] [INFO ] [Real]Absence check using 14 positive place invariants in 173 ms returned sat
[2020-06-05 12:50:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:50:21] [INFO ] [Real]Absence check using state equation in 12024 ms returned sat
[2020-06-05 12:50:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:50:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 12:50:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 11045 ms returned unknown
[2020-06-05 12:50:33] [INFO ] [Real]Absence check using 14 positive place invariants in 111 ms returned sat
[2020-06-05 12:50:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:50:42] [INFO ] [Real]Absence check using state equation in 9540 ms returned sat
[2020-06-05 12:50:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:50:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 1166 ms returned unsat
[2020-06-05 12:50:45] [INFO ] [Real]Absence check using 14 positive place invariants in 108 ms returned sat
[2020-06-05 12:50:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:50:56] [INFO ] [Real]Absence check using state equation in 10819 ms returned sat
[2020-06-05 12:50:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:51:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 12:51:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 11137 ms returned unknown
[2020-06-05 12:51:08] [INFO ] [Real]Absence check using 14 positive place invariants in 106 ms returned sat
[2020-06-05 12:51:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:51:18] [INFO ] [Real]Absence check using state equation in 10012 ms returned sat
[2020-06-05 12:51:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:51:26] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 12:51:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 11115 ms returned unknown
[2020-06-05 12:51:30] [INFO ] [Real]Absence check using 14 positive place invariants in 111 ms returned sat
[2020-06-05 12:51:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:51:39] [INFO ] [Real]Absence check using state equation in 9614 ms returned sat
[2020-06-05 12:51:40] [INFO ] Computed and/alt/rep : 2288/22199/2288 causal constraints in 309 ms.
[2020-06-05 12:51:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:51:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 12:51:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 11104 ms returned unknown
[2020-06-05 12:51:53] [INFO ] [Real]Absence check using 14 positive place invariants in 107 ms returned sat
[2020-06-05 12:51:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:52:03] [INFO ] [Real]Absence check using state equation in 10187 ms returned sat
[2020-06-05 12:52:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:52:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 12:52:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 11106 ms returned unknown
[2020-06-05 12:52:15] [INFO ] [Real]Absence check using 14 positive place invariants in 118 ms returned sat
[2020-06-05 12:52:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:52:27] [INFO ] [Real]Absence check using state equation in 12519 ms returned sat
[2020-06-05 12:52:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:52:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 1046 ms returned unsat
[2020-06-05 12:52:30] [INFO ] [Real]Absence check using 14 positive place invariants in 172 ms returned sat
[2020-06-05 12:52:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:52:41] [INFO ] [Real]Absence check using state equation in 11172 ms returned sat
[2020-06-05 12:52:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:52:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 1230 ms returned unsat
[2020-06-05 12:52:43] [INFO ] [Real]Absence check using 14 positive place invariants in 180 ms returned sat
[2020-06-05 12:52:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:52:54] [INFO ] [Real]Absence check using state equation in 11214 ms returned sat
[2020-06-05 12:52:56] [INFO ] Deduced a trap composed of 767 places in 1725 ms
[2020-06-05 12:52:58] [INFO ] Deduced a trap composed of 682 places in 1729 ms
[2020-06-05 12:53:00] [INFO ] Deduced a trap composed of 666 places in 2040 ms
[2020-06-05 12:53:03] [INFO ] Deduced a trap composed of 645 places in 2095 ms
[2020-06-05 12:53:03] [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 (> (+ s0 s593 s636 s637 s639 s640 s641 s642 s643 s644 s645 s646 s647 s648 s649 s650 s651 s653 s654 s655 s656 s657 s658 s659 s661 s662 s663 s665 s667 s669 s671 s672 s673 s674 s675 s676 s677 s678 s679 s680 s681 s683 s684 s689 s690 s691 s692 s693 s694 s695 s696 s699 s704 s705 s706 s1363 s1364 s1365 s1366 s1367 s1368 s1369 s1370 s1371 s1372 s1373 s1374 s1375 s1376 s1377 s1378 s1379 s1380 s1381 s1382 s1383 s1384 s1385 s1386 s1387 s1388 s1389 s1390 s1391 s1392 s1393 s1394 s1395 s1396 s1397 s1398 s1399 s1400 s1401 s1402 s1403 s1404 s1405 s1406 s1407 s1408 s1409 s1410 s1411 s1412 s1413 s1414 s1415 s1416 s1417 s1418 s1419 s1420 s1421 s1422 s1423 s1424 s1425 s1426 s1427 s1428 s1429 s1430 s1431 s1432 s1433 s1434 s1435 s1436 s1437 s1438 s1439 s1440 s1441 s1442 s1443 s1444 s1445 s1446 s1447 s1448 s1449 s1450 s1451 s1452 s1453 s1454 s1455 s1456 s1457 s1458 s1459 s1460 s1461 s1462 s1463 s1464 s1465 s1466 s1467 s1468 s1469 s1470 s1471 s1472 s1473 s1474 s1475 s1476 s1477 s1478 s1479 s1480 s1481 s1482 s1483 s1484 s1485 s1486 s1487 s1488 s1489 s1490 s1491 s1492 s1493 s1494 s1495 s1496 s1497 s1498 s1499 s1500 s1501 s1502 s1503 s1504 s1505 s1506 s1507 s1508 s1509 s1510 s1511 s1512 s1513 s1514 s1515 s1516 s1517 s1518 s1519 s1520 s1521 s1522 s1523 s1524 s1525 s1526 s1527 s1528 s1529 s1530 s1531 s1532 s1533 s1534 s1535 s1536 s1537 s1538 s1539 s1540 s1541 s1542 s1543 s1544 s1545 s1546 s1547 s1548 s1549 s1550 s1551 s1552 s1553 s1554 s1555 s1556 s1557 s1558 s1559 s1560 s1561 s1562 s1563 s1564 s1565 s1566 s1567 s1568 s1569 s1570 s1571 s1572 s1573 s1574 s1575 s1576 s1577 s1578 s1579 s1580 s1581 s1582 s1583 s1584 s1585 s1586 s1587 s1588 s1589 s1590 s1591 s1592 s1593 s1594 s1595 s1596 s1597 s1598 s1599 s1600 s1601 s1602 s1603 s1604 s1605 s1606 s1607 s1608 s1609 s1610 s1611 s1612 s1613 s1614 s1616 s1617 s1618 s1619 s1624 s1629 s1634 s1635 s1636 s1637 s1639 s1644 s1645 s1646 s1647 s1649 s1650 s1651 s1652 s1653 s1654 s1655 s1656 s1657 s1658 s1659 s1664 s1665 s1666 s1667 s1668 s1669 s1670 s1671 s1672 s1673 s1674 s1675 s1676 s1677 s1678 s1679 s1680 s1681 s1682 s1683 s1684 s1685 s1686 s1687 s1688 s1689 s1690 s1691 s1692 s1693 s1694 s1695 s1696 s1697 s1698 s1699 s1700 s1701 s1702 s1703 s1704 s1705 s1706 s1707 s1708 s1709 s1710 s1711 s1712 s1713 s1714 s1715 s1716 s1717 s1718 s1719 s1720 s1721 s1722 s1723 s1724 s1725 s1726 s1727 s1728 s1729 s1730 s1731 s1732 s1733 s1734 s1735 s1736 s1737 s1738 s1739 s1740 s1741 s1742 s1743 s1744 s1745 s1746 s1747 s1748 s1749 s1750 s1751 s1752 s1753 s1754 s1755 s1756 s1757 s1758 s1759 s1760 s1761 s1762 s1763 s1764 s1765 s1766 s1767 s1768 s1769 s1770 s1771 s1772 s1773 s1774 s1775 s1776 s1777 s1778 s1779 s1780 s1781 s1782 s1783 s1784 s1785 s1786 s1787 s1788 s1789 s1790 s1791 s1792 s1793 s1794 s1795 s1796 s1797 s1798 s1799 s1800 s1801 s1802 s1803 s1804 s1805 s1806 s1807 s1808 s1809 s1810 s1811 s1812 s1813 s1814 s1815 s1816 s1817 s1818 s1819 s1820 s1821 s1822 s1823 s1824 s1825 s1826 s1827 s1828 s1829 s1830 s1831 s1832 s1833 s1834 s1835 s1836 s1837 s1838 s1839 s1840 s1841 s1842 s1843 s1844 s1845 s1846 s1847 s1848 s1849 s1850 s1851 s1852 s1853 s1854 s1855 s1856 s1857 s1858 s1859 s1860 s1861 s1862 s1863 s1864 s1865 s1866 s1867 s1868 s1869 s1870 s1871 s1872 s1873 s1874 s1875 s1876 s1877 s1878 s1879 s1880 s1881 s1882 s1883 s1884 s1885 s1886 s1887 s1888 s1889 s1890 s1891 s1892 s1893 s1894 s1895 s1896 s1897 s1898 s1899 s1900 s1901 s1902 s1903 s1904 s1905 s1906 s1907 s1908 s1909 s1910 s1911 s1912 s1913 s1914 s1915 s1916 s1917 s1918 s1919 s1920 s1921 s1922 s1923 s1924 s1925 s1926 s1927 s1928 s1929 s1930 s1931 s1932 s1933 s1934 s1935 s1936 s1937 s1938 s1939 s1940 s1941 s1942 s1943 s1944 s1945 s1946 s1947 s1948 s1949 s1950 s1951 s1952 s1953 s1954 s1955 s1956 s1957 s1958 s1959 s1960 s1961 s1962 s1963 s1964 s1965 s1966 s1967 s1968 s1969 s1970 s1971 s1972 s1973 s1974 s1975) 0)") while checking expression at index 12
[2020-06-05 12:53:03] [INFO ] [Real]Absence check using 14 positive place invariants in 173 ms returned sat
[2020-06-05 12:53:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:53:15] [INFO ] [Real]Absence check using state equation in 12086 ms returned sat
[2020-06-05 12:53:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:53:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 12:53:27] [INFO ] [Nat]Absence check using 14 positive place invariants in 11018 ms returned unknown
[2020-06-05 12:53:27] [INFO ] [Real]Absence check using 14 positive place invariants in 114 ms returned sat
[2020-06-05 12:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:53:37] [INFO ] [Real]Absence check using state equation in 9892 ms returned sat
[2020-06-05 12:53:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:53:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 12:53:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 10306 ms returned unknown
[2020-06-05 12:53:49] [INFO ] [Real]Absence check using 14 positive place invariants in 139 ms returned sat
[2020-06-05 12:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:53:59] [INFO ] [Real]Absence check using state equation in 10330 ms returned sat
[2020-06-05 12:53:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:54:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 12:54:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 11099 ms returned unknown
[2020-06-05 12:54:11] [INFO ] [Real]Absence check using 14 positive place invariants in 131 ms returned sat
[2020-06-05 12:54:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:54:22] [INFO ] [Real]Absence check using state equation in 10617 ms returned sat
[2020-06-05 12:54:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:54:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 12:54:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 11012 ms returned unknown
[2020-06-05 12:54:34] [INFO ] [Real]Absence check using 14 positive place invariants in 123 ms returned sat
[2020-06-05 12:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:54:46] [INFO ] [Real]Absence check using state equation in 12011 ms returned sat
[2020-06-05 12:54:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:54:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 12:54:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 11137 ms returned unknown
[2020-06-05 12:54:58] [INFO ] [Real]Absence check using 14 positive place invariants in 172 ms returned sat
[2020-06-05 12:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:55:09] [INFO ] [Real]Absence check using state equation in 11242 ms returned sat
[2020-06-05 12:55:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:55:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 12:55:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 10986 ms returned unknown
[2020-06-05 12:55:21] [INFO ] [Real]Absence check using 14 positive place invariants in 107 ms returned sat
[2020-06-05 12:55:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:55:32] [INFO ] [Real]Absence check using state equation in 10924 ms returned sat
[2020-06-05 12:55:33] [INFO ] Deduced a trap composed of 295 places in 1419 ms
[2020-06-05 12:55:36] [INFO ] Deduced a trap composed of 727 places in 2234 ms
[2020-06-05 12:55:38] [INFO ] Deduced a trap composed of 642 places in 1544 ms
[2020-06-05 12:55:39] [INFO ] Deduced a trap composed of 716 places in 1639 ms
[2020-06-05 12:55:41] [INFO ] Deduced a trap composed of 233 places in 1956 ms
[2020-06-05 12:55:41] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s592 s593 s594 s595 s596 s597 s598 s599 s600 s601 s602 s603 s604 s605 s606 s607 s608 s609 s610 s611 s612 s613 s614 s615 s616 s617 s620 s621 s622 s623 s624 s625 s626 s627 s628 s629 s630 s631 s632 s633 s634 s635 s636 s637 s638 s639 s640 s641 s642 s643 s644 s645 s646 s647 s648 s649 s650 s651 s652 s653 s654 s655 s656 s657 s658 s659 s661 s663 s664 s665 s666 s667 s668 s669 s670 s671 s672 s673 s674 s675 s676 s677 s678 s679 s680 s681 s682 s683 s684 s685 s686 s687 s688 s689 s690 s691 s692 s693 s694 s695 s696 s697 s698 s699 s700 s701 s702 s703 s704 s705 s706 s707 s825 s826 s827 s828 s829 s830 s831 s832 s833 s834 s835 s836 s837 s838 s839 s840 s841 s842 s843 s844 s845 s846 s847 s848 s849 s850 s851 s852 s853 s854 s855 s856 s857 s858 s859 s860 s861 s862 s863 s864 s865 s866 s867 s868 s869 s870 s871 s872 s873 s874 s875 s876 s877 s878 s879 s880 s881 s882 s883 s884 s885 s886 s887 s888 s889 s891 s892 s893 s894 s895 s896 s897 s898 s899 s900 s901 s902 s903 s904 s905 s906 s907 s908 s909 s910 s911 s912 s913 s914 s915 s916 s917 s918 s919 s920 s921 s922 s923 s924 s925 s926 s927 s928 s929 s930 s931 s932 s933 s934 s935 s936 s937 s938) 0)") while checking expression at index 19
[2020-06-05 12:55:42] [INFO ] [Real]Absence check using 14 positive place invariants in 173 ms returned sat
[2020-06-05 12:55:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 12:55:52] [INFO ] [Real]Absence check using state equation in 9852 ms returned sat
[2020-06-05 12:55:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 12:56:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 12:56:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 11156 ms returned unknown
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-05 12:56:04] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-05 12:56:04] [INFO ] Flatten gal took : 251 ms
FORMULA FlexibleBarrier-PT-12b-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 12:56:04] [INFO ] Applying decomposition
[2020-06-05 12:56:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 12:56:04] [INFO ] Flatten gal took : 144 ms
[2020-06-05 12:56:05] [INFO ] Decomposing Gal with order
[2020-06-05 12:56:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 12:56:05] [INFO ] Removed a total of 77 redundant transitions.
[2020-06-05 12:56:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 12:56:05] [INFO ] Flatten gal took : 540 ms
[2020-06-05 12:56:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 532 labels/synchronizations in 212 ms.
[2020-06-05 12:56:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FlexibleBarrier-PT-12b-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 12:56:07] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-05 12:56:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 26 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ FlexibleBarrier-PT-12b @ 3570 seconds

FORMULA FlexibleBarrier-PT-12b-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-12b-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-12b-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-12b-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-12b-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3549
rslt: Output for LTLCardinality @ FlexibleBarrier-PT-12b

{
"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",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 12:56:08 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 709
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 8,
"adisj": 4,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G (((((1 <= p96)) AND ((p112 <= 0))) OR ((((p358 <= 0)) OR ((1 <= p1471))) OR (G ((((p96 <= 0)) OR ((1 <= p112)))) AND F ((((p358 <= 0)) OR ((1 <= p1471)))))))))",
"processed_size": 167,
"rewrites": 23
},
"result":
{
"edges": 2845,
"markings": 2067,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 887
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 6,
"adisj": 2,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (F ((((p1853 <= 0)) OR ((1 <= p1310))))) OR G ((((1 <= p1670)) AND ((p990 <= 0)) AND ((1 <= p1853)) AND ((p1310 <= 0))))))",
"processed_size": 129,
"rewrites": 23
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1183
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1183
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((((p1105 <= 0)) OR ((1 <= p145))) AND (((p1161 <= 0)) OR ((1 <= p338))))",
"processed_size": 75,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1774
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 2,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((G ((((1 <= p60)) AND ((p870 <= 0)))) AND (((p1161 <= 0)) OR ((1 <= p338))))))",
"processed_size": 85,
"rewrites": 23
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1774
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p265 <= 0)) OR ((1 <= p1343)))",
"processed_size": 34,
"rewrites": 25
},
"result":
{
"edges": 86,
"markings": 87,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3549
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((((1 <= p1159)) AND ((p238 <= 0)))))",
"processed_size": 42,
"rewrites": 23
},
"result":
{
"edges": 87,
"markings": 87,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 59276,
"runtime": 21.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((* OR (** OR (G(**) AND F(**)))))) : X((X(F(**)) OR G(*))) : F(*) : (X(F((G(*) AND **))) AND (** AND **)) : G(F(**))"
},
"net":
{
"arcs": 5727,
"conflict_clusters": 1541,
"places": 1988,
"places_significant": 1974,
"singleton_clusters": 0,
"transitions": 2289
},
"result":
{
"preliminary_value": "no yes no no no ",
"value": "no yes no no no "
},
"task":
{
"type": "compound"
}
}
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: 4277/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1988
lola: finding significant places
lola: 1988 places, 2289 transitions, 1974 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 LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p1471 <= 1)
lola: LP says that atomic proposition is always true: (p1310 <= 1)
lola: LP says that atomic proposition is always true: (p990 <= 1)
lola: LP says that atomic proposition is always true: (p1310 <= 1)
lola: LP says that atomic proposition is always true: (p1343 <= 1)
lola: LP says that atomic proposition is always true: (p870 <= 1)
lola: LP says that atomic proposition is always true: (p338 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p338 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: G ((NOT(X ((((p96 <= 0)) OR ((1 <= p112))))) OR ((1 <= 0) U X ((G ((((p96 <= 0)) OR ((1 <= p112)))) U (((p358 <= 0)) OR ((1 <= p1471)))))))) : X ((X (F ((((p1853 <= 0)) OR ((1 <= p1310))))) OR G (NOT(F ((((p1670 <= 0)) OR ((1 <= p990)) OR ((p1853 <= 0)) OR ((1 <= p1310)))))))) : ((1 <= 0) U NOT(G ((((p265 <= 0)) OR ((1 <= p1343)))))) : ((F (X ((NOT(F ((((p60 <= 0)) OR ((1 <= p870))))) AND (((p1161 <= 0)) OR ((1 <= p338)))))) AND (((p1105 <= 0)) OR ((1 <= p145)))) AND (((p1161 <= 0)) OR ((1 <= p338)))) : G (X (F (((0 <= 0) U (((1 <= p1159)) AND ((p238 <= 0)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((((1 <= p96)) AND ((p112 <= 0))) OR ((((p358 <= 0)) OR ((1 <= p1471))) OR (G ((((p96 <= 0)) OR ((1 <= p112)))) AND F ((((p358 <= 0)) OR ((1 <= p1471)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((((1 <= p96)) AND ((p112 <= 0))) OR ((((p358 <= 0)) OR ((1 <= p1471))) OR (G ((((p96 <= 0)) OR ((1 <= p112)))) AND F ((((p358 <= 0)) OR ((1 <= p1471)))))))))
lola: processed formula length: 167
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2067 markings, 2845 edges
lola: ========================================
lola: subprocess 1 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((((p1853 <= 0)) OR ((1 <= p1310))))) OR G ((((1 <= p1670)) AND ((p990 <= 0)) AND ((1 <= p1853)) AND ((p1310 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((((p1853 <= 0)) OR ((1 <= p1310))))) OR G ((((1 <= p1670)) AND ((p990 <= 0)) AND ((1 <= p1853)) AND ((p1310 <= 0))))))
lola: processed formula length: 129
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 2 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((G ((((1 <= p60)) AND ((p870 <= 0)))) AND (((p1161 <= 0)) OR ((1 <= p338)))))) AND ((((p1105 <= 0)) OR ((1 <= p145))) AND (((p1161 <= 0)) OR ((1 <= p338)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p1105 <= 0)) OR ((1 <= p145))) AND (((p1161 <= 0)) OR ((1 <= p338))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((((p1105 <= 0)) OR ((1 <= p145))) AND (((p1161 <= 0)) OR ((1 <= p338))))
lola: processed formula length: 75
lola: 24 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 1774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((((1 <= p60)) AND ((p870 <= 0)))) AND (((p1161 <= 0)) OR ((1 <= p338))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((((1 <= p60)) AND ((p870 <= 0)))) AND (((p1161 <= 0)) OR ((1 <= p338))))))
lola: processed formula length: 85
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 1774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p265)) AND ((p1343 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (((p265 <= 0)) OR ((1 <= p1343)))
lola: processed formula length: 34
lola: 25 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 87 markings, 86 edges
lola: ========================================
lola: subprocess 4 will run for 3549 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((1 <= p1159)) AND ((p238 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((1 <= p1159)) AND ((p238 <= 0)))))
lola: processed formula length: 42
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 87 markings, 87 edges
lola: RESULT
lola:
SUMMARY: no yes no no no
lola:
preliminary result: no yes no no no
lola: ========================================
lola: memory consumption: 59276 KB
lola: time consumption: 21 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="FlexibleBarrier-PT-12b"
export BK_EXAMINATION="LTLCardinality"
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 FlexibleBarrier-PT-12b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-smll-158987815700329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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