Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 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 BugTracking-PT-q3m002-LTLCardinality-00
FORMULA_NAME BugTracking-PT-q3m002-LTLCardinality-01
FORMULA_NAME BugTracking-PT-q3m002-LTLCardinality-02
FORMULA_NAME BugTracking-PT-q3m002-LTLCardinality-03
FORMULA_NAME BugTracking-PT-q3m002-LTLCardinality-04
FORMULA_NAME BugTracking-PT-q3m002-LTLCardinality-05
FORMULA_NAME BugTracking-PT-q3m002-LTLCardinality-06
FORMULA_NAME BugTracking-PT-q3m002-LTLCardinality-07
FORMULA_NAME BugTracking-PT-q3m002-LTLCardinality-08
FORMULA_NAME BugTracking-PT-q3m002-LTLCardinality-09
FORMULA_NAME BugTracking-PT-q3m002-LTLCardinality-10
FORMULA_NAME BugTracking-PT-q3m002-LTLCardinality-11
FORMULA_NAME BugTracking-PT-q3m002-LTLCardinality-12
FORMULA_NAME BugTracking-PT-q3m002-LTLCardinality-13
FORMULA_NAME BugTracking-PT-q3m002-LTLCardinality-14
FORMULA_NAME BugTracking-PT-q3m002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717222747088

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:19:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:19:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:19:10] [INFO ] Load time of PNML (sax parser for PT used): 1294 ms
[2024-06-01 06:19:10] [INFO ] Transformed 754 places.
[2024-06-01 06:19:11] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:19:11] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1651 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 514 places in 171 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q3m002-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 80 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2024-06-01 06:19:11] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2024-06-01 06:19:11] [INFO ] Computed 8 invariants in 79 ms
[2024-06-01 06:19:16] [INFO ] Implicit Places using invariants in 4779 ms returned []
[2024-06-01 06:19:16] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-06-01 06:19:16] [INFO ] Invariant cache hit.
[2024-06-01 06:19:19] [INFO ] State equation strengthened by 240 read => feed constraints.
[2024-06-01 06:19:21] [INFO ] Implicit Places using invariants and state equation in 5045 ms returned []
Implicit Place search using SMT with State Equation took 9877 ms to find 0 implicit places.
Running 2748 sub problems to find dead transitions.
[2024-06-01 06:19:21] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2024-06-01 06:19:21] [INFO ] Invariant cache hit.
[2024-06-01 06:19:21] [INFO ] State equation strengthened by 240 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2748 unsolved
[2024-06-01 06:20:05] [INFO ] Deduced a trap composed of 10 places in 292 ms of which 13 ms to minimize.
[2024-06-01 06:20:05] [INFO ] Deduced a trap composed of 7 places in 327 ms of which 2 ms to minimize.
[2024-06-01 06:20:05] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 1 ms to minimize.
[2024-06-01 06:20:14] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
Problem TDEAD1005 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/2863 variables, and 12 constraints, problems are : Problem set: 14 solved, 2734 unsolved in 30127 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/237 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 2748/2748 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 14 solved, 2734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 2734 unsolved
Problem TDEAD2310 is UNSAT
Problem TDEAD2318 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2333 is UNSAT
Problem TDEAD2341 is UNSAT
Problem TDEAD2352 is UNSAT
Problem TDEAD2356 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 4/12 constraints. Problems are: Problem set: 43 solved, 2705 unsolved
[2024-06-01 06:20:44] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
Problem TDEAD2319 is UNSAT
Problem TDEAD2330 is UNSAT
[2024-06-01 06:20:45] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
Problem TDEAD2334 is UNSAT
Problem TDEAD2335 is UNSAT
Problem TDEAD2336 is UNSAT
Problem TDEAD2337 is UNSAT
Problem TDEAD2338 is UNSAT
Problem TDEAD2339 is UNSAT
Problem TDEAD2340 is UNSAT
[2024-06-01 06:20:45] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
Problem TDEAD2342 is UNSAT
[2024-06-01 06:20:45] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 1 ms to minimize.
Problem TDEAD2343 is UNSAT
Problem TDEAD2344 is UNSAT
Problem TDEAD2345 is UNSAT
Problem TDEAD2346 is UNSAT
Problem TDEAD2347 is UNSAT
Problem TDEAD2348 is UNSAT
Problem TDEAD2349 is UNSAT
Problem TDEAD2350 is UNSAT
Problem TDEAD2351 is UNSAT
Problem TDEAD2365 is UNSAT
Problem TDEAD2376 is UNSAT
[2024-06-01 06:20:47] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-06-01 06:20:47] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 1 ms to minimize.
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
[2024-06-01 06:20:47] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
Problem TDEAD2677 is UNSAT
[2024-06-01 06:20:47] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
Problem TDEAD2678 is UNSAT
[2024-06-01 06:20:47] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2681 is UNSAT
Problem TDEAD2682 is UNSAT
Problem TDEAD2683 is UNSAT
Problem TDEAD2684 is UNSAT
Problem TDEAD2685 is UNSAT
Problem TDEAD2686 is UNSAT
Problem TDEAD2687 is UNSAT
Problem TDEAD2688 is UNSAT
Problem TDEAD2691 is UNSAT
Problem TDEAD2692 is UNSAT
[2024-06-01 06:20:47] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
Problem TDEAD2693 is UNSAT
Problem TDEAD2694 is UNSAT
Problem TDEAD2695 is UNSAT
Problem TDEAD2696 is UNSAT
Problem TDEAD2697 is UNSAT
Problem TDEAD2698 is UNSAT
Problem TDEAD2699 is UNSAT
Problem TDEAD2700 is UNSAT
Problem TDEAD2701 is UNSAT
Problem TDEAD2702 is UNSAT
Problem TDEAD2703 is UNSAT
Problem TDEAD2704 is UNSAT
[2024-06-01 06:20:47] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
Problem TDEAD2705 is UNSAT
[2024-06-01 06:20:47] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
Problem TDEAD2708 is UNSAT
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2711 is UNSAT
Problem TDEAD2712 is UNSAT
Problem TDEAD2713 is UNSAT
Problem TDEAD2714 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2718 is UNSAT
Problem TDEAD2719 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2722 is UNSAT
Problem TDEAD2723 is UNSAT
Problem TDEAD2724 is UNSAT
Problem TDEAD2725 is UNSAT
Problem TDEAD2726 is UNSAT
Problem TDEAD2729 is UNSAT
Problem TDEAD2730 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2738 is UNSAT
Problem TDEAD2739 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2741 is UNSAT
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2747 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1963 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1965 is UNSAT
Problem TDEAD1966 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1968 is UNSAT
Problem TDEAD1969 is UNSAT
Problem TDEAD1970 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1973 is UNSAT
Problem TDEAD1974 is UNSAT
Problem TDEAD1975 is UNSAT
Problem TDEAD1976 is UNSAT
Problem TDEAD1977 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1979 is UNSAT
Problem TDEAD1980 is UNSAT
Problem TDEAD1981 is UNSAT
Problem TDEAD1982 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1985 is UNSAT
Problem TDEAD1986 is UNSAT
Problem TDEAD1987 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD1989 is UNSAT
Problem TDEAD1990 is UNSAT
Problem TDEAD1991 is UNSAT
Problem TDEAD1992 is UNSAT
Problem TDEAD1993 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD1995 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD1997 is UNSAT
Problem TDEAD1998 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2002 is UNSAT
Problem TDEAD2003 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2005 is UNSAT
Problem TDEAD2006 is UNSAT
Problem TDEAD2007 is UNSAT
Problem TDEAD2008 is UNSAT
Problem TDEAD2009 is UNSAT
Problem TDEAD2010 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2012 is UNSAT
Problem TDEAD2013 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2015 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2017 is UNSAT
Problem TDEAD2018 is UNSAT
Problem TDEAD2019 is UNSAT
Problem TDEAD2020 is UNSAT
Problem TDEAD2021 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2023 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2026 is UNSAT
Problem TDEAD2027 is UNSAT
Problem TDEAD2028 is UNSAT
Problem TDEAD2029 is UNSAT
Problem TDEAD2030 is UNSAT
Problem TDEAD2031 is UNSAT
Problem TDEAD2032 is UNSAT
Problem TDEAD2033 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2035 is UNSAT
Problem TDEAD2036 is UNSAT
Problem TDEAD2037 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2113 is UNSAT
Problem TDEAD2114 is UNSAT
Problem TDEAD2115 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2128 is UNSAT
Problem TDEAD2129 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2131 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2141 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD2143 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2148 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2150 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2163 is UNSAT
Problem TDEAD2164 is UNSAT
Problem TDEAD2165 is UNSAT
Problem TDEAD2166 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2183 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2185 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2198 is UNSAT
Problem TDEAD2199 is UNSAT
Problem TDEAD2200 is UNSAT
Problem TDEAD2201 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2218 is UNSAT
Problem TDEAD2219 is UNSAT
Problem TDEAD2220 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2231 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2233 is UNSAT
Problem TDEAD2234 is UNSAT
Problem TDEAD2235 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2486 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2490 is UNSAT
Problem TDEAD2491 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2495 is UNSAT
Problem TDEAD2496 is UNSAT
Problem TDEAD2497 is UNSAT
Problem TDEAD2498 is UNSAT
Problem TDEAD2499 is UNSAT
Problem TDEAD2500 is UNSAT
Problem TDEAD2501 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2503 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2505 is UNSAT
Problem TDEAD2506 is UNSAT
Problem TDEAD2507 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2510 is UNSAT
Problem TDEAD2511 is UNSAT
Problem TDEAD2512 is UNSAT
Problem TDEAD2513 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2515 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2517 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2521 is UNSAT
Problem TDEAD2522 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2525 is UNSAT
Problem TDEAD2526 is UNSAT
Problem TDEAD2527 is UNSAT
Problem TDEAD2528 is UNSAT
Problem TDEAD2529 is UNSAT
Problem TDEAD2530 is UNSAT
Problem TDEAD2531 is UNSAT
Problem TDEAD2532 is UNSAT
Problem TDEAD2533 is UNSAT
Problem TDEAD2534 is UNSAT
Problem TDEAD2535 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2537 is UNSAT
Problem TDEAD2538 is UNSAT
Problem TDEAD2539 is UNSAT
Problem TDEAD2540 is UNSAT
Problem TDEAD2541 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2543 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2545 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2548 is UNSAT
Problem TDEAD2549 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2553 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2555 is UNSAT
Problem TDEAD2556 is UNSAT
Problem TDEAD2557 is UNSAT
Problem TDEAD2558 is UNSAT
Problem TDEAD2559 is UNSAT
Problem TDEAD2560 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2562 is UNSAT
Problem TDEAD2563 is UNSAT
Problem TDEAD2564 is UNSAT
Problem TDEAD2565 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2568 is UNSAT
Problem TDEAD2569 is UNSAT
Problem TDEAD2640 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2665 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2667 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 12/24 constraints. Problems are: Problem set: 522 solved, 2226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/2863 variables, and 24 constraints, problems are : Problem set: 522 solved, 2226 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/237 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 0/2748 constraints, Known Traps: 16/16 constraints]
After SMT, in 90788ms problems are : Problem set: 522 solved, 2226 unsolved
Search for dead transitions found 522 dead transitions in 90918ms
Found 522 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 522 transitions
Dead transitions reduction (with SMT) removed 522 transitions
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2228/2769 transitions.
Reduce places removed 43 places and 709 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 194 transition count 1519
Reduce places removed 13 places and 265 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 56 place count 181 transition count 1254
Reduce places removed 12 places and 125 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 68 place count 169 transition count 1129
Reduce places removed 6 places and 84 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 74 place count 163 transition count 1045
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 162 transition count 1028
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 86 place count 151 transition count 972
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 16 places and 225 transitions.
Iterating global reduction 5 with 27 rules applied. Total rules applied 113 place count 135 transition count 747
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 120 place count 128 transition count 698
Deduced a syphon composed of 3 places in 6 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 127 place count 128 transition count 698
Deduced a syphon composed of 3 places in 5 ms
Applied a total of 127 rules in 31 ms. Remains 128 /237 variables (removed 109) and now considering 698/2228 (removed 1530) transitions.
[2024-06-01 06:20:52] [INFO ] Flow matrix only has 642 transitions (discarded 56 similar events)
// Phase 1: matrix 642 rows 128 cols
[2024-06-01 06:20:52] [INFO ] Computed 12 invariants in 3 ms
[2024-06-01 06:20:52] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 06:20:52] [INFO ] Flow matrix only has 642 transitions (discarded 56 similar events)
[2024-06-01 06:20:52] [INFO ] Invariant cache hit.
[2024-06-01 06:20:52] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-01 06:20:53] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 128/240 places, 698/2769 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101464 ms. Remains : 128/240 places, 698/2769 transitions.
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Support contains 4 out of 125 places after structural reductions.
FORMULA BugTracking-PT-q3m002-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:20:53] [INFO ] Flatten gal took : 106 ms
[2024-06-01 06:20:53] [INFO ] Flatten gal took : 62 ms
[2024-06-01 06:20:53] [INFO ] Input system was already deterministic with 698 transitions.
RANDOM walk for 40001 steps (882 resets) in 3493 ms. (11 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (263 resets) in 322 ms. (123 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (261 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
[2024-06-01 06:20:54] [INFO ] Flow matrix only has 642 transitions (discarded 56 similar events)
// Phase 1: matrix 642 rows 125 cols
[2024-06-01 06:20:54] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 06:20:54] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Real declared 366/767 variables, and 13 constraints, problems are : Problem set: 1 solved, 0 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 13/125 constraints, ReadFeed: 0/88 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 75ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA BugTracking-PT-q3m002-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 27 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 698/698 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 124 transition count 699
Applied a total of 2 rules in 35 ms. Remains 124 /125 variables (removed 1) and now considering 699/698 (removed -1) transitions.
[2024-06-01 06:20:55] [INFO ] Flow matrix only has 641 transitions (discarded 58 similar events)
// Phase 1: matrix 641 rows 124 cols
[2024-06-01 06:20:55] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 06:20:55] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-01 06:20:55] [INFO ] Flow matrix only has 641 transitions (discarded 58 similar events)
[2024-06-01 06:20:55] [INFO ] Invariant cache hit.
[2024-06-01 06:20:55] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-01 06:20:55] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2024-06-01 06:20:55] [INFO ] Redundant transitions in 27 ms returned []
Running 697 sub problems to find dead transitions.
[2024-06-01 06:20:55] [INFO ] Flow matrix only has 641 transitions (discarded 58 similar events)
[2024-06-01 06:20:55] [INFO ] Invariant cache hit.
[2024-06-01 06:20:55] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 697 unsolved
[2024-06-01 06:21:01] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 7 ms to minimize.
[2024-06-01 06:21:01] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 2/11 constraints. Problems are: Problem set: 4 solved, 693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 693 unsolved
At refinement iteration 4 (OVERLAPS) 641/764 variables, 123/134 constraints. Problems are: Problem set: 4 solved, 693 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 88/222 constraints. Problems are: Problem set: 4 solved, 693 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/222 constraints. Problems are: Problem set: 4 solved, 693 unsolved
At refinement iteration 7 (OVERLAPS) 1/765 variables, 1/223 constraints. Problems are: Problem set: 4 solved, 693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/765 variables, and 223 constraints, problems are : Problem set: 4 solved, 693 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 697/697 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 693 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 693 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 2/11 constraints. Problems are: Problem set: 4 solved, 693 unsolved
[2024-06-01 06:21:30] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/12 constraints. Problems are: Problem set: 4 solved, 693 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 693 unsolved
At refinement iteration 5 (OVERLAPS) 641/764 variables, 123/135 constraints. Problems are: Problem set: 4 solved, 693 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 88/223 constraints. Problems are: Problem set: 4 solved, 693 unsolved
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 596/819 constraints. Problems are: Problem set: 70 solved, 627 unsolved
[2024-06-01 06:21:50] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
Problem TDEAD553 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD585 is UNSAT
[2024-06-01 06:21:50] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
Problem TDEAD613 is UNSAT
[2024-06-01 06:21:50] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:21:50] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/764 variables, 4/823 constraints. Problems are: Problem set: 119 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/765 variables, and 823 constraints, problems are : Problem set: 119 solved, 578 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/124 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 596/697 constraints, Known Traps: 7/7 constraints]
After SMT, in 62191ms problems are : Problem set: 119 solved, 578 unsolved
Search for dead transitions found 119 dead transitions in 62202ms
Found 119 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 119 transitions
Dead transitions reduction (with SMT) removed 119 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 124/125 places, 580/698 transitions.
Graph (complete) has 937 edges and 124 vertex of which 121 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 13 places and 181 transitions.
Reduce places removed 8 places and 73 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 100 transition count 326
Reduce places removed 4 places and 29 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 96 transition count 297
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 94 transition count 281
Reduce places removed 1 places and 7 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 93 transition count 274
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 21 place count 88 transition count 239
Iterating global reduction 4 with 5 rules applied. Total rules applied 26 place count 88 transition count 239
Applied a total of 26 rules in 48 ms. Remains 88 /124 variables (removed 36) and now considering 239/580 (removed 341) transitions.
[2024-06-01 06:21:58] [INFO ] Flow matrix only has 223 transitions (discarded 16 similar events)
// Phase 1: matrix 223 rows 88 cols
[2024-06-01 06:21:58] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 06:21:58] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-06-01 06:21:58] [INFO ] Flow matrix only has 223 transitions (discarded 16 similar events)
[2024-06-01 06:21:58] [INFO ] Invariant cache hit.
[2024-06-01 06:21:58] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 06:21:58] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/125 places, 239/698 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63618 ms. Remains : 88/125 places, 239/698 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m002-LTLCardinality-02
Product exploration explored 100000 steps with 2281 reset in 343 ms.
Product exploration explored 100000 steps with 2288 reset in 307 ms.
Computed a total of 4 stabilizing places and 18 stable transitions
Computed a total of 4 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (924 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31244 steps (233 resets) in 97 ms. (318 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 239/239 transitions.
Applied a total of 0 rules in 10 ms. Remains 88 /88 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-06-01 06:22:00] [INFO ] Flow matrix only has 223 transitions (discarded 16 similar events)
[2024-06-01 06:22:00] [INFO ] Invariant cache hit.
[2024-06-01 06:22:00] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 06:22:00] [INFO ] Flow matrix only has 223 transitions (discarded 16 similar events)
[2024-06-01 06:22:00] [INFO ] Invariant cache hit.
[2024-06-01 06:22:00] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 06:22:00] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2024-06-01 06:22:00] [INFO ] Redundant transitions in 2 ms returned []
Running 237 sub problems to find dead transitions.
[2024-06-01 06:22:00] [INFO ] Flow matrix only has 223 transitions (discarded 16 similar events)
[2024-06-01 06:22:00] [INFO ] Invariant cache hit.
[2024-06-01 06:22:00] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-06-01 06:22:02] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:22:02] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
At refinement iteration 4 (OVERLAPS) 223/310 variables, 87/97 constraints. Problems are: Problem set: 14 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 48/145 constraints. Problems are: Problem set: 14 solved, 223 unsolved
[2024-06-01 06:22:04] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:22:04] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 2/147 constraints. Problems are: Problem set: 14 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/147 constraints. Problems are: Problem set: 14 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 1/311 variables, 1/148 constraints. Problems are: Problem set: 14 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/148 constraints. Problems are: Problem set: 14 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 0/311 variables, 0/148 constraints. Problems are: Problem set: 14 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 148 constraints, problems are : Problem set: 14 solved, 223 unsolved in 8970 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 14 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 7/7 constraints. Problems are: Problem set: 14 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/8 constraints. Problems are: Problem set: 14 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 4/12 constraints. Problems are: Problem set: 14 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 14 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 223/310 variables, 87/99 constraints. Problems are: Problem set: 14 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 48/147 constraints. Problems are: Problem set: 14 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 167/314 constraints. Problems are: Problem set: 14 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 0/314 constraints. Problems are: Problem set: 14 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 1/311 variables, 1/315 constraints. Problems are: Problem set: 14 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 56/371 constraints. Problems are: Problem set: 14 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/371 constraints. Problems are: Problem set: 14 solved, 223 unsolved
At refinement iteration 11 (OVERLAPS) 0/311 variables, 0/371 constraints. Problems are: Problem set: 14 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 371 constraints, problems are : Problem set: 14 solved, 223 unsolved in 10406 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 223/237 constraints, Known Traps: 4/4 constraints]
After SMT, in 19587ms problems are : Problem set: 14 solved, 223 unsolved
Search for dead transitions found 14 dead transitions in 19615ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 88/88 places, 225/239 transitions.
Applied a total of 0 rules in 16 ms. Remains 88 /88 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-06-01 06:22:20] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 20101 ms. Remains : 88/88 places, 225/239 transitions.
Computed a total of 4 stabilizing places and 18 stable transitions
Computed a total of 4 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (917 resets) in 343 ms. (116 steps per ms) remains 1/1 properties
BEST_FIRST walk for 19085 steps (120 resets) in 54 ms. (347 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2349 reset in 420 ms.
Product exploration explored 100000 steps with 2311 reset in 370 ms.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 225/225 transitions.
Applied a total of 0 rules in 17 ms. Remains 88 /88 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-06-01 06:22:21] [INFO ] Flow matrix only has 209 transitions (discarded 16 similar events)
// Phase 1: matrix 209 rows 88 cols
[2024-06-01 06:22:22] [INFO ] Computed 8 invariants in 4 ms
[2024-06-01 06:22:22] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-01 06:22:22] [INFO ] Flow matrix only has 209 transitions (discarded 16 similar events)
[2024-06-01 06:22:22] [INFO ] Invariant cache hit.
[2024-06-01 06:22:22] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 06:22:22] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-06-01 06:22:22] [INFO ] Redundant transitions in 1 ms returned []
Running 223 sub problems to find dead transitions.
[2024-06-01 06:22:22] [INFO ] Flow matrix only has 209 transitions (discarded 16 similar events)
[2024-06-01 06:22:22] [INFO ] Invariant cache hit.
[2024-06-01 06:22:22] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 223 unsolved
[2024-06-01 06:22:23] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:22:23] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 209/296 variables, 87/97 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 45/142 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (OVERLAPS) 1/297 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 143 constraints, problems are : Problem set: 0 solved, 223 unsolved in 6574 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 209/296 variables, 87/97 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 45/142 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 167/309 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 1/297 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 56/366 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (OVERLAPS) 0/297 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 366 constraints, problems are : Problem set: 0 solved, 223 unsolved in 8558 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 2/2 constraints]
After SMT, in 15291ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 15295ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15687 ms. Remains : 88/88 places, 225/225 transitions.
Treatment of property BugTracking-PT-q3m002-LTLCardinality-02 finished in 102891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 698/698 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 691
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 691
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 123 transition count 692
Applied a total of 4 rules in 28 ms. Remains 123 /125 variables (removed 2) and now considering 692/698 (removed 6) transitions.
[2024-06-01 06:22:37] [INFO ] Flow matrix only has 632 transitions (discarded 60 similar events)
// Phase 1: matrix 632 rows 123 cols
[2024-06-01 06:22:37] [INFO ] Computed 9 invariants in 5 ms
[2024-06-01 06:22:38] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 06:22:38] [INFO ] Flow matrix only has 632 transitions (discarded 60 similar events)
[2024-06-01 06:22:38] [INFO ] Invariant cache hit.
[2024-06-01 06:22:38] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-01 06:22:38] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2024-06-01 06:22:38] [INFO ] Redundant transitions in 6 ms returned []
Running 690 sub problems to find dead transitions.
[2024-06-01 06:22:38] [INFO ] Flow matrix only has 632 transitions (discarded 60 similar events)
[2024-06-01 06:22:38] [INFO ] Invariant cache hit.
[2024-06-01 06:22:38] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-01 06:22:43] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 2 ms to minimize.
[2024-06-01 06:22:43] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 4 solved, 686 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 686 unsolved
At refinement iteration 4 (OVERLAPS) 632/754 variables, 122/133 constraints. Problems are: Problem set: 4 solved, 686 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/754 variables, 86/219 constraints. Problems are: Problem set: 4 solved, 686 unsolved
[2024-06-01 06:22:51] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 1/220 constraints. Problems are: Problem set: 27 solved, 663 unsolved
[2024-06-01 06:23:01] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/754 variables, 1/221 constraints. Problems are: Problem set: 87 solved, 603 unsolved
[2024-06-01 06:23:05] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 5 ms to minimize.
Problem TDEAD544 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD568 is UNSAT
[2024-06-01 06:23:06] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 18 ms to minimize.
Problem TDEAD569 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
[2024-06-01 06:23:06] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
Problem TDEAD584 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD600 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/754 variables, 3/224 constraints. Problems are: Problem set: 105 solved, 585 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 754/755 variables, and 224 constraints, problems are : Problem set: 105 solved, 585 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/123 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 105 solved, 585 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 7/7 constraints. Problems are: Problem set: 105 solved, 585 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 1/8 constraints. Problems are: Problem set: 105 solved, 585 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 5/13 constraints. Problems are: Problem set: 105 solved, 585 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/13 constraints. Problems are: Problem set: 105 solved, 585 unsolved
At refinement iteration 4 (OVERLAPS) 3/122 variables, 1/14 constraints. Problems are: Problem set: 105 solved, 585 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 2/16 constraints. Problems are: Problem set: 105 solved, 585 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/16 constraints. Problems are: Problem set: 105 solved, 585 unsolved
At refinement iteration 7 (OVERLAPS) 632/754 variables, 122/138 constraints. Problems are: Problem set: 105 solved, 585 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/754 variables, 86/224 constraints. Problems are: Problem set: 105 solved, 585 unsolved
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 488/712 constraints. Problems are: Problem set: 118 solved, 572 unsolved
[2024-06-01 06:23:29] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
Problem TDEAD613 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/754 variables, 1/713 constraints. Problems are: Problem set: 119 solved, 571 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 754/755 variables, and 713 constraints, problems are : Problem set: 119 solved, 571 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/123 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 488/690 constraints, Known Traps: 8/8 constraints]
After SMT, in 61862ms problems are : Problem set: 119 solved, 571 unsolved
Search for dead transitions found 119 dead transitions in 61870ms
Found 119 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 119 transitions
Dead transitions reduction (with SMT) removed 119 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 123/125 places, 573/698 transitions.
Graph (complete) has 935 edges and 123 vertex of which 120 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 12 places and 174 transitions.
Reduce places removed 8 places and 73 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 100 transition count 326
Reduce places removed 4 places and 29 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 96 transition count 297
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 94 transition count 281
Reduce places removed 1 places and 7 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 93 transition count 274
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 21 place count 88 transition count 239
Iterating global reduction 4 with 5 rules applied. Total rules applied 26 place count 88 transition count 239
Applied a total of 26 rules in 38 ms. Remains 88 /123 variables (removed 35) and now considering 239/573 (removed 334) transitions.
[2024-06-01 06:23:40] [INFO ] Flow matrix only has 223 transitions (discarded 16 similar events)
// Phase 1: matrix 223 rows 88 cols
[2024-06-01 06:23:40] [INFO ] Computed 8 invariants in 2 ms
[2024-06-01 06:23:40] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 06:23:40] [INFO ] Flow matrix only has 223 transitions (discarded 16 similar events)
[2024-06-01 06:23:40] [INFO ] Invariant cache hit.
[2024-06-01 06:23:40] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-06-01 06:23:40] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/125 places, 239/698 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62779 ms. Remains : 88/125 places, 239/698 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m002-LTLCardinality-10
Stuttering criterion allowed to conclude after 33 steps with 1 reset in 0 ms.
FORMULA BugTracking-PT-q3m002-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q3m002-LTLCardinality-10 finished in 62923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 06:23:41] [INFO ] Flatten gal took : 70 ms
[2024-06-01 06:23:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 06:23:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 125 places, 698 transitions and 3357 arcs took 33 ms.
Total runtime 271744 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BugTracking-PT-q3m002-LTLCardinality-02

BK_STOP 1717223082310

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name BugTracking-PT-q3m002-LTLCardinality-02
ltl formula formula --ltl=/tmp/879/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 125 places, 698 transitions and 3357 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.200 real 0.030 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/879/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/879/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/879/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/879/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 127 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 126, there are 701 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2236 levels ~10000 states ~22296 transitions
pnml2lts-mc( 3/ 4): ~4525 levels ~20000 states ~44812 transitions
pnml2lts-mc( 3/ 4): ~9097 levels ~40000 states ~89892 transitions
pnml2lts-mc( 3/ 4): ~18246 levels ~80000 states ~179868 transitions
pnml2lts-mc( 3/ 4): ~36545 levels ~160000 states ~359948 transitions
pnml2lts-mc( 3/ 4): ~73145 levels ~320000 states ~720120 transitions
pnml2lts-mc( 3/ 4): ~146342 levels ~640000 states ~1440452 transitions
pnml2lts-mc( 3/ 4): ~292739 levels ~1280000 states ~2881172 transitions
pnml2lts-mc( 3/ 4): ~585535 levels ~2560000 states ~5762376 transitions
pnml2lts-mc( 3/ 4): ~1171124 levels ~5120000 states ~11524988 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 20588
pnml2lts-mc( 0/ 4): unique states count: 7700935
pnml2lts-mc( 0/ 4): unique transitions count: 20386577
pnml2lts-mc( 0/ 4): - self-loop count: 20529
pnml2lts-mc( 0/ 4): - claim dead count: 3
pnml2lts-mc( 0/ 4): - claim found count: 944072
pnml2lts-mc( 0/ 4): - claim success count: 7700943
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7485382
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7700943 states 20386595 transitions, fanout: 2.647
pnml2lts-mc( 0/ 4): Total exploration time 59.860 sec (59.830 sec minimum, 59.843 sec on average)
pnml2lts-mc( 0/ 4): States per second: 128649, Transitions per second: 340571
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 206.6MB, 11.6 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 55.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 710 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 206.6MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BugTracking-PT-q3m002, 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 r472-tajo-171620399300323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m002.tgz
mv BugTracking-PT-q3m002 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 ;