About the Execution of ITS-Tools for FamilyReunion-COL-L00020M0002C001P001G001
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1569.964 | 233978.00 | 177544.00 | 61126.90 | FFTFFFTFF??????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875900853.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 itstools
Input is FamilyReunion-COL-L00020M0002C001P001G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875900853
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 22 18:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 18:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 24 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 135K May 5 16:51 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 FamilyReunion-COL-L00020M0002C001P001G001-00
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-01
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-02
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-03
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-04
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-05
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-06
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-07
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-08
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-09
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-10
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-11
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-12
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-13
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-14
FORMULA_NAME FamilyReunion-COL-L00020M0002C001P001G001-15
=== Now, execution of the tool begins
BK_START 1620678156373
Running Version 0
[2021-05-10 20:22:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-10 20:22:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 20:22:56] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-10 20:22:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-10 20:22:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 724 ms
[2021-05-10 20:22:57] [INFO ] Detected 5 constant HL places corresponding to 11 PT places.
[2021-05-10 20:22:57] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 3292 PT places and 2774.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 20:22:57] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions in 6 ms.
[2021-05-10 20:22:57] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_7798014413858616865.dot
Reduce places removed 5 places and 0 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-05-10 20:22:57] [INFO ] Flatten gal took : 27 ms
[2021-05-10 20:22:57] [INFO ] Flatten gal took : 8 ms
[2021-05-10 20:22:57] [INFO ] Unfolded HLPN to a Petri net with 3292 places and 2753 transitions in 33 ms.
[2021-05-10 20:22:57] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_12418281380125855882.dot
[2021-05-10 20:22:57] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 21 places in 22 ms
Reduce places removed 32 places and 0 transitions.
Support contains 1386 out of 3260 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Reduce places removed 76 places and 0 transitions.
Discarding 189 places :
Implicit places reduction removed 189 places
Iterating post reduction 0 with 265 rules applied. Total rules applied 265 place count 2995 transition count 2753
Discarding 169 places :
Symmetric choice reduction at 1 with 169 rule applications. Total rules 434 place count 2826 transition count 2563
Iterating global reduction 1 with 169 rules applied. Total rules applied 603 place count 2826 transition count 2563
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 646 place count 2783 transition count 2500
Iterating global reduction 1 with 43 rules applied. Total rules applied 689 place count 2783 transition count 2500
Applied a total of 689 rules in 535 ms. Remains 2783 /3260 variables (removed 477) and now considering 2500/2753 (removed 253) transitions.
// Phase 1: matrix 2500 rows 2783 cols
[2021-05-10 20:22:58] [INFO ] Computed 509 place invariants in 158 ms
[2021-05-10 20:22:59] [INFO ] Implicit Places using invariants in 911 ms returned [1558, 1878, 1879, 1880, 1881, 1882, 1883, 1884, 1885, 1886, 1887, 1888, 1889, 1890, 1891, 1892, 1893, 1894, 1895, 1896, 1897, 1898, 1941, 1942, 1943, 1944, 1945, 1946, 1947, 1948, 1949, 1950, 1951, 1952, 1953, 1954, 1955, 1956, 1957, 1958, 1959, 1960, 1961, 2130, 2131, 2132, 2133, 2134, 2135, 2136, 2137, 2138, 2139, 2140, 2141, 2142, 2143, 2144, 2145, 2146, 2147, 2148, 2149, 2150]
Discarding 64 places :
Implicit Place search using SMT only with invariants took 940 ms to find 64 implicit places.
// Phase 1: matrix 2500 rows 2719 cols
[2021-05-10 20:22:59] [INFO ] Computed 445 place invariants in 91 ms
[2021-05-10 20:23:00] [INFO ] Dead Transitions using invariants and state equation in 1499 ms returned []
Starting structural reductions, iteration 1 : 2719/3260 places, 2500/2753 transitions.
Applied a total of 0 rules in 68 ms. Remains 2719 /2719 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2719 cols
[2021-05-10 20:23:00] [INFO ] Computed 445 place invariants in 50 ms
[2021-05-10 20:23:02] [INFO ] Dead Transitions using invariants and state equation in 1570 ms returned []
Finished structural reductions, in 2 iterations. Remains : 2719/3260 places, 2500/2753 transitions.
[2021-05-10 20:23:02] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-10 20:23:02] [INFO ] Flatten gal took : 149 ms
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 20:23:02] [INFO ] Flatten gal took : 116 ms
[2021-05-10 20:23:21] [INFO ] Input system was already deterministic with 2500 transitions.
Finished random walk after 917 steps, including 0 resets, run visited all 26 properties in 75 ms. (steps per millisecond=12 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F((p1||X((p2 U p3))))))], workingDir=/home/mcc/execution]
Support contains 168 out of 2719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2719/2719 places, 2500/2500 transitions.
Discarding 189 places :
Implicit places reduction removed 189 places
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 2530 transition count 2500
Discarding 168 places :
Symmetric choice reduction at 1 with 168 rule applications. Total rules 357 place count 2362 transition count 2332
Iterating global reduction 1 with 168 rules applied. Total rules applied 525 place count 2362 transition count 2332
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 591 place count 2296 transition count 2186
Iterating global reduction 1 with 66 rules applied. Total rules applied 657 place count 2296 transition count 2186
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 1 with 63 rules applied. Total rules applied 720 place count 2254 transition count 2165
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 805 place count 2169 transition count 2060
Iterating global reduction 2 with 85 rules applied. Total rules applied 890 place count 2169 transition count 2060
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 2 with 63 rules applied. Total rules applied 953 place count 2127 transition count 2039
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1016 place count 2064 transition count 1976
Iterating global reduction 3 with 63 rules applied. Total rules applied 1079 place count 2064 transition count 1976
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1121 place count 2022 transition count 1934
Iterating global reduction 3 with 42 rules applied. Total rules applied 1163 place count 2022 transition count 1934
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1205 place count 1980 transition count 1892
Iterating global reduction 3 with 42 rules applied. Total rules applied 1247 place count 1980 transition count 1892
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1289 place count 1938 transition count 1850
Iterating global reduction 3 with 42 rules applied. Total rules applied 1331 place count 1938 transition count 1850
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1373 place count 1896 transition count 1808
Iterating global reduction 3 with 42 rules applied. Total rules applied 1415 place count 1896 transition count 1808
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1457 place count 1854 transition count 1766
Iterating global reduction 3 with 42 rules applied. Total rules applied 1499 place count 1854 transition count 1766
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1541 place count 1812 transition count 1724
Iterating global reduction 3 with 42 rules applied. Total rules applied 1583 place count 1812 transition count 1724
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1625 place count 1770 transition count 1682
Iterating global reduction 3 with 42 rules applied. Total rules applied 1667 place count 1770 transition count 1682
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1709 place count 1728 transition count 1640
Iterating global reduction 3 with 42 rules applied. Total rules applied 1751 place count 1728 transition count 1640
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1793 place count 1686 transition count 1598
Iterating global reduction 3 with 42 rules applied. Total rules applied 1835 place count 1686 transition count 1598
Applied a total of 1835 rules in 1451 ms. Remains 1686 /2719 variables (removed 1033) and now considering 1598/2500 (removed 902) transitions.
// Phase 1: matrix 1598 rows 1686 cols
[2021-05-10 20:23:23] [INFO ] Computed 172 place invariants in 13 ms
[2021-05-10 20:23:23] [INFO ] Implicit Places using invariants in 416 ms returned [378, 928, 1433]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 418 ms to find 3 implicit places.
// Phase 1: matrix 1598 rows 1683 cols
[2021-05-10 20:23:23] [INFO ] Computed 169 place invariants in 9 ms
[2021-05-10 20:23:24] [INFO ] Dead Transitions using invariants and state equation in 832 ms returned []
Starting structural reductions, iteration 1 : 1683/2719 places, 1598/2500 transitions.
Applied a total of 0 rules in 57 ms. Remains 1683 /1683 variables (removed 0) and now considering 1598/1598 (removed 0) transitions.
// Phase 1: matrix 1598 rows 1683 cols
[2021-05-10 20:23:24] [INFO ] Computed 169 place invariants in 9 ms
[2021-05-10 20:23:25] [INFO ] Dead Transitions using invariants and state equation in 797 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1683/2719 places, 1598/2500 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), true]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND p0 p1) (AND p0 p3)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (LT s180 1) (LT s235 1)) (OR (LT s195 1) (LT s240 1)) (OR (LT s210 1) (LT s245 1)) (OR (LT s225 1) (LT s250 1)) (OR (LT s170 1) (LT s231 1)) (OR (LT s200 1) (LT s241 1)) (OR (LT s230 1) (LT s251 1)) (OR (LT s214 1) (LT s246 1)) (OR (LT s185 1) (LT s236 1)) (OR (LT s226 1) (LT s250 1)) (OR (LT s196 1) (LT s240 1)) (OR (LT s229 1) (LT s251 1)) (OR (LT s213 1) (LT s246 1)) (OR (LT s184 1) (LT s236 1)) (OR (LT s192 1) (LT s239 1)) (OR (LT s188 1) (LT s237 1)) (OR (LT s197 1) (LT s240 1)) (OR (LT s207 1) (LT s244 1)) (OR (LT s172 1) (LT s232 1)) (OR (LT s208 1) (LT s244 1)) (OR (LT s218 1) (LT s247 1)) (OR (LT s228 1) (LT s251 1)) (OR (LT s193 1) (LT s239 1)) (OR (LT s168 1) (LT s231 1)) (OR (LT s183 1) (LT s236 1)) (OR (LT s187 1) (LT s237 1)) (OR (LT s212 1) (LT s245 1)) (OR (LT s186 1) (LT s237 1)) (OR (LT s191 1) (LT s238 1)) (OR (LT s211 1) (LT s245 1)) (OR (LT s173 1) (LT s232 1)) (OR (LT s169 1) (LT s231 1)) (OR (LT s194 1) (LT s239 1)) (OR (LT s190 1) (LT s238 1)) (OR (LT s215 1) (LT s246 1)) (OR (LT s220 1) (LT s248 1)) (OR (LT s205 1) (LT s243 1)) (OR (LT s175 1) (LT s233 1)) (OR (LT s179 1) (LT s234 1)) (OR (LT s224 1) (LT s249 1)) (OR (LT s216 1) (LT s247 1)) (OR (LT s189 1) (LT s238 1)) (OR (LT s171 1) (LT s232 1)) (OR (LT s176 1) (LT s233 1)) (OR (LT s221 1) (LT s248 1)) (OR (LT s201 1) (LT s242 1)) (OR (LT s204 1) (LT s243 1)) (OR (LT s209 1) (LT s244 1)) (OR (LT s217 1) (LT s247 1)) (OR (LT s182 1) (LT s235 1)) (OR (LT s177 1) (LT s234 1)) (OR (LT s227 1) (LT s250 1)) (OR (LT s202 1) (LT s242 1)) (OR (LT s222 1) (LT s249 1)) (OR (LT s206 1) (LT s243 1)) (OR (LT s181 1) (LT s235 1)) (OR (LT s199 1) (LT s241 1)) (OR (LT s174 1) (LT s233 1)) (OR (LT s203 1) (LT s242 1)) (OR (LT s198 1) (LT s241 1)) (OR (LT s223 1) (LT s249 1)) (OR (LT s178 1) (LT s234 1)) (OR (LT s219 1) (LT s248 1))), p1:(AND (LT s64 1) (LT s63 1) (LT s66 1) (LT s65 1) (LT s68 1) (LT s67 1) (LT s70 1) (LT s69 1) (LT s72 1) (LT s71 1) (LT s74 1) (LT s73 1) (LT s76 1) (LT s75 1) (LT s78 1) (LT s77 1) (LT s80 1) (LT s79 1) (LT s82 1) (LT s81 1) (LT s83 1)), p3:(AND (OR (LT s803 1) (LT s871 1)) (OR (LT s803 1) (LT s870 1)) (OR (LT s809 1) (LT s883 1)) (OR (LT s809 1) (LT s882 1)) (OR (LT s815 1) (LT s894 1)) (OR (LT s802 1) (LT s869 1)) (OR (LT s815 1) (LT s895 1)) (OR (LT s802 1) (LT s868 1)) (OR (LT s813 1) (LT s890 1)) (OR (LT s816 1) (LT s896 1)) (OR (LT s816 1) (LT s897 1)) (OR (LT s819 1) (LT s902 1)) (OR (LT s804 1) (LT s873 1)) (OR (LT s804 1) (LT s872 1)) (OR (LT s805 1) (LT s875 1)) (OR (LT s819 1) (LT s903 1)) (OR (LT s805 1) (LT s874 1)) (OR (LT s808 1) (LT s881 1)) (OR (LT s808 1) (LT s880 1)) (OR (LT s801 1) (LT s867 1)) (OR (LT s801 1) (LT s866 1)) (OR (LT s812 1) (LT s888 1)) (OR (LT s812 1) (LT s889 1)) (OR (LT s800 1) (LT s864 1)) (OR (LT s800 1) (LT s865 1)) (OR (LT s817 1) (LT s898 1)) (OR (LT s817 1) (LT s899 1)) (OR (LT s806 1) (LT s877 1)) (OR (LT s806 1) (LT s876 1)) (OR (LT s811 1) (LT s886 1)) (OR (LT s811 1) (LT s887 1)) (OR (LT s813 1) (LT s891 1)) (OR (LT s810 1) (LT s885 1)) (OR (LT s810 1) (LT s884 1)) (OR (LT s807 1) (LT s879 1)) (OR (LT s807 1) (LT s878 1)) (OR (LT s818 1) (LT s900 1)) (OR (LT s818 1) (LT s901 1)) (OR (LT s814 1) (LT s892 1)) (OR (LT s799 1) (LT s863 1)) (OR (LT s814 1) (LT s893 1)) (OR (LT s799 1) (LT s862 1)) (LT s64 1) (LT s63 1) (LT s66 1) (LT s65 1) (LT s68 1) (LT s67 1) (LT s70 1) (LT s69 1) (LT s72 1) (LT s71 1) (LT s74 1) (LT s73 1) (LT s76 1) (LT s75 1) (LT s78 1) (LT s77 1) (LT s80 1) (LT s79 1) (LT s82 1) (LT s81 1) (LT s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 2 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-00 finished in 3888 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U (p1&&G(p0)))))], workingDir=/home/mcc/execution]
Support contains 84 out of 2719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2719/2719 places, 2500/2500 transitions.
Discarding 189 places :
Implicit places reduction removed 189 places
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 2530 transition count 2500
Discarding 147 places :
Symmetric choice reduction at 1 with 147 rule applications. Total rules 336 place count 2383 transition count 2353
Iterating global reduction 1 with 147 rules applied. Total rules applied 483 place count 2383 transition count 2353
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 528 place count 2338 transition count 2228
Iterating global reduction 1 with 45 rules applied. Total rules applied 573 place count 2338 transition count 2228
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 1 with 63 rules applied. Total rules applied 636 place count 2296 transition count 2207
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 720 place count 2212 transition count 2123
Iterating global reduction 2 with 84 rules applied. Total rules applied 804 place count 2212 transition count 2123
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 42 rules applied. Total rules applied 846 place count 2191 transition count 2102
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 909 place count 2128 transition count 2039
Iterating global reduction 3 with 63 rules applied. Total rules applied 972 place count 2128 transition count 2039
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1014 place count 2086 transition count 1997
Iterating global reduction 3 with 42 rules applied. Total rules applied 1056 place count 2086 transition count 1997
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1098 place count 2044 transition count 1955
Iterating global reduction 3 with 42 rules applied. Total rules applied 1140 place count 2044 transition count 1955
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1182 place count 2002 transition count 1913
Iterating global reduction 3 with 42 rules applied. Total rules applied 1224 place count 2002 transition count 1913
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1266 place count 1960 transition count 1871
Iterating global reduction 3 with 42 rules applied. Total rules applied 1308 place count 1960 transition count 1871
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1350 place count 1918 transition count 1829
Iterating global reduction 3 with 42 rules applied. Total rules applied 1392 place count 1918 transition count 1829
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1434 place count 1876 transition count 1787
Iterating global reduction 3 with 42 rules applied. Total rules applied 1476 place count 1876 transition count 1787
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1518 place count 1834 transition count 1745
Iterating global reduction 3 with 42 rules applied. Total rules applied 1560 place count 1834 transition count 1745
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1602 place count 1792 transition count 1703
Iterating global reduction 3 with 42 rules applied. Total rules applied 1644 place count 1792 transition count 1703
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1686 place count 1750 transition count 1661
Iterating global reduction 3 with 42 rules applied. Total rules applied 1728 place count 1750 transition count 1661
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1770 place count 1708 transition count 1619
Iterating global reduction 3 with 42 rules applied. Total rules applied 1812 place count 1708 transition count 1619
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1854 place count 1666 transition count 1577
Iterating global reduction 3 with 42 rules applied. Total rules applied 1896 place count 1666 transition count 1577
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 3 with 63 rules applied. Total rules applied 1959 place count 1645 transition count 1535
Applied a total of 1959 rules in 1283 ms. Remains 1645 /2719 variables (removed 1074) and now considering 1535/2500 (removed 965) transitions.
// Phase 1: matrix 1535 rows 1645 cols
[2021-05-10 20:23:26] [INFO ] Computed 172 place invariants in 11 ms
[2021-05-10 20:23:27] [INFO ] Implicit Places using invariants in 448 ms returned [273, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 887, 1392]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 450 ms to find 24 implicit places.
// Phase 1: matrix 1535 rows 1621 cols
[2021-05-10 20:23:27] [INFO ] Computed 148 place invariants in 6 ms
[2021-05-10 20:23:28] [INFO ] Dead Transitions using invariants and state equation in 809 ms returned []
Starting structural reductions, iteration 1 : 1621/2719 places, 1535/2500 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1580 transition count 1494
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1580 transition count 1494
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1560 transition count 1454
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1560 transition count 1454
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1540 transition count 1434
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1540 transition count 1434
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1520 transition count 1414
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1520 transition count 1414
Applied a total of 202 rules in 259 ms. Remains 1520 /1621 variables (removed 101) and now considering 1414/1535 (removed 121) transitions.
// Phase 1: matrix 1414 rows 1520 cols
[2021-05-10 20:23:28] [INFO ] Computed 148 place invariants in 24 ms
[2021-05-10 20:23:28] [INFO ] Implicit Places using invariants in 357 ms returned []
// Phase 1: matrix 1414 rows 1520 cols
[2021-05-10 20:23:28] [INFO ] Computed 148 place invariants in 6 ms
[2021-05-10 20:23:29] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1392 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1520/2719 places, 1414/2500 transitions.
Stuttering acceptance computed with spot in 8600 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-01 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s435 1) (GEQ s641 1)) (AND (GEQ s429 1) (GEQ s630 1)) (AND (GEQ s429 1) (GEQ s629 1)) (AND (GEQ s435 1) (GEQ s642 1)) (AND (GEQ s440 1) (GEQ s652 1)) (AND (GEQ s434 1) (GEQ s639 1)) (AND (GEQ s434 1) (GEQ s640 1)) (AND (GEQ s423 1) (GEQ s617 1)) (AND (GEQ s436 1) (GEQ s644 1)) (AND (GEQ s423 1) (GEQ s618 1)) (AND (GEQ s440 1) (GEQ s651 1)) (AND (GEQ s436 1) (GEQ s643 1)) (AND (GEQ s428 1) (GEQ s628 1)) (AND (GEQ s431 1) (GEQ s634 1)) (AND (GEQ s431 1) (GEQ s633 1)) (AND (GEQ s424 1) (GEQ s619 1)) (AND (GEQ s420 1) (GEQ s612 1)) (AND (GEQ s428 1) (GEQ s627 1)) (AND (GEQ s439 1) (GEQ s649 1)) (AND (GEQ s424 1) (GEQ s620 1)) (AND (GEQ s439 1) (GEQ s650 1)) (AND (GEQ s432 1) (GEQ s635 1)) (AND (GEQ s420 1) (GEQ s611 1)) (AND (GEQ s432 1) (GEQ s636 1)) (AND (GEQ s427 1) (GEQ s626 1)) (AND (GEQ s427 1) (GEQ s625 1)) (AND (GEQ s421 1) (GEQ s613 1)) (AND (GEQ s421 1) (GEQ s614 1)) (AND (GEQ s438 1) (GEQ s647 1)) (AND (GEQ s425 1) (GEQ s621 1)) (AND (GEQ s425 1) (GEQ s622 1)) (AND (GEQ s438 1) (GEQ s648 1)) (AND (GEQ s422 1) (GEQ s616 1)) (AND (GEQ s422 1) (GEQ s615 1)) (AND (GEQ s433 1) (GEQ s638 1)) (AND (GEQ s433 1) (GEQ s637 1)) (AND (GEQ s437 1) (GEQ s645 1)) (AND (GEQ s430 1) (GEQ s632 1)) (AND (GEQ s437 1) (GEQ s646 1)) (AND (GEQ s430 1) (GEQ s631 1)) (AND (GEQ s426 1) (GEQ s624 1)) (AND (GEQ s426 1) (GEQ s623 1))), p1:(OR (GEQ s232 1) (GEQ s233 1) (GEQ s234 1) (GEQ s235 1) (GEQ s236 1) (GEQ s237 1) (GEQ s238 1) (GEQ s239 1) (GEQ s231 1) (GEQ s248 1) (GEQ s249 1) (GEQ s250 1) (GEQ s251 1) (GEQ s240 1) (GEQ s241 1) (GEQ s242 1) (GEQ s243 1) (GEQ s244 1) (GEQ s245 1) (GEQ s246 1) (GEQ s247 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-01 finished in 12822 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G((F(p1)&&p0))||(F(p1)&&p2)))))], workingDir=/home/mcc/execution]
Support contains 105 out of 2719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2719/2719 places, 2500/2500 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 189 places :
Implicit places reduction removed 189 places
Drop transitions removed 1134 transitions
Trivial Post-agglo rules discarded 1134 transitions
Performed 1134 trivial Post agglomeration. Transition count delta: 1134
Iterating post reduction 0 with 1323 rules applied. Total rules applied 1323 place count 2529 transition count 1365
Reduce places removed 1134 places and 0 transitions.
Iterating post reduction 1 with 1134 rules applied. Total rules applied 2457 place count 1395 transition count 1365
Performed 273 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 273 Pre rules applied. Total rules applied 2457 place count 1395 transition count 1092
Deduced a syphon composed of 273 places in 1 ms
Ensure Unique test removed 105 places
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 2 with 651 rules applied. Total rules applied 3108 place count 1017 transition count 1092
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 2 with 21 rules applied. Total rules applied 3129 place count 1017 transition count 1071
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 3150 place count 996 transition count 1071
Discarding 107 places :
Symmetric choice reduction at 4 with 107 rule applications. Total rules 3257 place count 889 transition count 924
Iterating global reduction 4 with 107 rules applied. Total rules applied 3364 place count 889 transition count 924
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 4 with 126 rules applied. Total rules applied 3490 place count 868 transition count 819
Reduce places removed 84 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 5 with 105 rules applied. Total rules applied 3595 place count 784 transition count 798
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 3616 place count 763 transition count 798
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 3616 place count 763 transition count 777
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 3658 place count 742 transition count 777
Discarding 44 places :
Symmetric choice reduction at 7 with 44 rule applications. Total rules 3702 place count 698 transition count 693
Iterating global reduction 7 with 44 rules applied. Total rules applied 3746 place count 698 transition count 693
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Discarding 62 places :
Implicit places reduction removed 62 places
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 7 with 207 rules applied. Total rules applied 3953 place count 636 transition count 548
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 8 with 82 rules applied. Total rules applied 4035 place count 554 transition count 548
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 22 Pre rules applied. Total rules applied 4035 place count 554 transition count 526
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 9 with 45 rules applied. Total rules applied 4080 place count 531 transition count 526
Discarding 21 places :
Symmetric choice reduction at 9 with 21 rule applications. Total rules 4101 place count 510 transition count 505
Iterating global reduction 9 with 21 rules applied. Total rules applied 4122 place count 510 transition count 505
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 9 with 212 rules applied. Total rules applied 4334 place count 404 transition count 399
Discarding 21 places :
Symmetric choice reduction at 9 with 21 rule applications. Total rules 4355 place count 383 transition count 378
Ensure Unique test removed 21 places
Iterating global reduction 9 with 42 rules applied. Total rules applied 4397 place count 362 transition count 378
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 9 with 42 rules applied. Total rules applied 4439 place count 362 transition count 336
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 4460 place count 341 transition count 336
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4461 place count 340 transition count 335
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4462 place count 339 transition count 334
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4463 place count 338 transition count 333
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4464 place count 337 transition count 332
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4465 place count 336 transition count 331
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4466 place count 335 transition count 330
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4467 place count 334 transition count 329
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4468 place count 333 transition count 328
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4469 place count 332 transition count 327
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4470 place count 331 transition count 326
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4471 place count 330 transition count 325
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4472 place count 329 transition count 324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4473 place count 328 transition count 323
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4474 place count 327 transition count 322
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4475 place count 326 transition count 321
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4476 place count 325 transition count 320
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4477 place count 324 transition count 319
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4478 place count 323 transition count 318
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4479 place count 322 transition count 317
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4480 place count 321 transition count 316
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4481 place count 320 transition count 315
Applied a total of 4481 rules in 471 ms. Remains 320 /2719 variables (removed 2399) and now considering 315/2500 (removed 2185) transitions.
// Phase 1: matrix 315 rows 320 cols
[2021-05-10 20:23:38] [INFO ] Computed 46 place invariants in 2 ms
[2021-05-10 20:23:38] [INFO ] Implicit Places using invariants in 152 ms returned [21, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 171, 319]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 154 ms to find 45 implicit places.
[2021-05-10 20:23:38] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 315 rows 275 cols
[2021-05-10 20:23:38] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-10 20:23:39] [INFO ] Dead Transitions using invariants and state equation in 124 ms returned []
Starting structural reductions, iteration 1 : 275/2719 places, 315/2500 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 274 transition count 293
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 253 transition count 293
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 42 place count 253 transition count 252
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 124 place count 212 transition count 252
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 144 place count 192 transition count 232
Iterating global reduction 2 with 20 rules applied. Total rules applied 164 place count 192 transition count 232
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 2 with 2 rules applied. Total rules applied 166 place count 191 transition count 231
Applied a total of 166 rules in 26 ms. Remains 191 /275 variables (removed 84) and now considering 231/315 (removed 84) transitions.
// Phase 1: matrix 231 rows 191 cols
[2021-05-10 20:23:39] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-10 20:23:39] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 231 rows 191 cols
[2021-05-10 20:23:39] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-10 20:23:39] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 191/2719 places, 231/2500 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s138 1) (LT s139 1) (LT s136 1) (LT s137 1) (LT s142 1) (LT s143 1) (LT s140 1) (LT s141 1) (LT s130 1) (LT s131 1) (LT s128 1) (LT s129 1) (LT s134 1) (LT s135 1) (LT s132 1) (LT s133 1) (LT s154 1) (LT s155 1) (LT s152 1) (LT s153 1) (LT s158 1) (LT s159 1) (LT s156 1) (LT s157 1) (LT s146 1) (LT s147 1) (LT s144 1) (LT s145 1) (LT s150 1) (LT s151 1) (LT s148 1) (LT s149 1) (LT s169 1) (LT s168 1) (LT s162 1) (LT s163 1) (LT s160 1) (LT s161 1) (LT s167 1) (LT s166 1) (LT s164 1) (LT s165 1)), p1:(AND (LT s32 1) (LT s33 1) (LT s34 1) (LT s35 1) (LT s28 1) (LT s29 1) (LT s30 1) (LT s31 1) (LT s40 1) (LT s41 1) (LT s42 1) (LT s43 1) (LT s36 1) (LT s37 1) (LT s38 1) (LT s39 1) (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1) (LT s12 1) (LT s13 1) (LT s14 1) (LT s15 1) (LT s24 1) (LT s25 1) (LT s26 1) (LT s27 1) (LT s20 1) (LT s21 1) (LT s22 1) (LT s23 1) (LT s2 1) (LT s3 1) (LT s8 1) (LT s9 1) (LT s10 1) (LT s11 1) (LT s4 1) (LT s5 1) (LT s6 1) (LT s7 1)), p2:(AND (LT s72 1) (LT s71 1) (LT s70 1) (LT s69 1) (LT s76 1) (LT s75 1) (LT s74 1) (LT s73 1) (LT s80 1) (LT s79 1) (LT s78 1) (LT s77 1) (LT s84 1) (LT s83 1) (LT s82 1) (LT s81 1) (LT s85 1) (LT s68 1) (LT s67 1) (LT s66 1) (LT s65 1) (LT s138 1) (LT s139 1) (LT s136 1) (LT s137 1) (LT s142 1) (LT s143 1) (LT s140 1) (LT s141 1) (LT s130 1) (LT s131 1) (LT s128 1) (LT s129 1) (LT s134 1) (LT s135 1) (LT s132 1) (LT s133 1) (LT s154 1) (LT s155 1) (LT s152 1) (LT s153 1) (LT s158 1) (LT s159 1) (LT s156 1) (LT s157 1) (LT s146 1) (LT s147 1) (LT s144 1) (LT s145 1) (LT s150 1) (LT s151 1) (LT s148 1) (LT s149 1) (LT s169 1) (LT s168 1) (LT s162 1) (LT s163 1) (LT s160 1) (LT s161 1) (LT s167 1) (LT s166 1) (LT s164 1) (LT s165 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1192 reset in 557 ms.
Product exploration explored 100000 steps with 1201 reset in 493 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 191 transition count 231
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G p1)), (F (G p2)), p0, p1, p2]
Adopting property with smaller alphabet thanks to knowledge :(F (G p0))
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-02 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-02 finished in 2292 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (p1||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 189 out of 2719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2719/2719 places, 2500/2500 transitions.
Discarding 126 places :
Implicit places reduction removed 126 places
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 2593 transition count 2500
Discarding 147 places :
Symmetric choice reduction at 1 with 147 rule applications. Total rules 273 place count 2446 transition count 2353
Iterating global reduction 1 with 147 rules applied. Total rules applied 420 place count 2446 transition count 2353
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 486 place count 2380 transition count 2207
Iterating global reduction 1 with 66 rules applied. Total rules applied 552 place count 2380 transition count 2207
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 1 with 63 rules applied. Total rules applied 615 place count 2338 transition count 2186
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 679 place count 2274 transition count 2102
Iterating global reduction 2 with 64 rules applied. Total rules applied 743 place count 2274 transition count 2102
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 21 rules applied. Total rules applied 764 place count 2253 transition count 2102
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 785 place count 2232 transition count 2081
Iterating global reduction 3 with 21 rules applied. Total rules applied 806 place count 2232 transition count 2081
Applied a total of 806 rules in 481 ms. Remains 2232 /2719 variables (removed 487) and now considering 2081/2500 (removed 419) transitions.
// Phase 1: matrix 2081 rows 2232 cols
[2021-05-10 20:23:41] [INFO ] Computed 256 place invariants in 16 ms
[2021-05-10 20:23:41] [INFO ] Implicit Places using invariants in 609 ms returned [252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 525, 1346, 1347, 1348, 1349, 1350, 1351, 1352, 1353, 1354, 1355, 1356, 1357, 1358, 1359, 1360, 1361, 1362, 1363, 1364, 1365, 1366, 1474, 1979]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 611 ms to find 45 implicit places.
// Phase 1: matrix 2081 rows 2187 cols
[2021-05-10 20:23:41] [INFO ] Computed 211 place invariants in 11 ms
[2021-05-10 20:23:42] [INFO ] Dead Transitions using invariants and state equation in 1076 ms returned []
Starting structural reductions, iteration 1 : 2187/2719 places, 2081/2500 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2146 transition count 2040
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2146 transition count 2040
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 2126 transition count 2000
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 2126 transition count 2000
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 2106 transition count 1980
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 2106 transition count 1980
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 2086 transition count 1960
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 2086 transition count 1960
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 2066 transition count 1940
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 2066 transition count 1940
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 2046 transition count 1920
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 2046 transition count 1920
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 2026 transition count 1900
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 2026 transition count 1900
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 2006 transition count 1880
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 2006 transition count 1880
Applied a total of 362 rules in 712 ms. Remains 2006 /2187 variables (removed 181) and now considering 1880/2081 (removed 201) transitions.
// Phase 1: matrix 1880 rows 2006 cols
[2021-05-10 20:23:43] [INFO ] Computed 211 place invariants in 11 ms
[2021-05-10 20:23:43] [INFO ] Implicit Places using invariants in 391 ms returned []
// Phase 1: matrix 1880 rows 2006 cols
[2021-05-10 20:23:43] [INFO ] Computed 211 place invariants in 9 ms
[2021-05-10 20:23:45] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2006/2719 places, 1880/2500 transitions.
Stuttering acceptance computed with spot in 9466 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-04 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s1044 1) (LT s1108 1)) (OR (LT s1039 1) (LT s1103 1)) (OR (LT s1012 1) (LT s1076 1)) (OR (LT s1066 1) (LT s1130 1)) (OR (LT s1054 1) (LT s1118 1)) (OR (LT s1034 1) (LT s1098 1)) (OR (LT s1022 1) (LT s1086 1)) (OR (LT s1014 1) (LT s1078 1)) (OR (LT s1029 1) (LT s1093 1)) (OR (LT s1017 1) (LT s1081 1)) (OR (LT s1041 1) (LT s1105 1)) (OR (LT s1037 1) (LT s1101 1)) (OR (LT s1061 1) (LT s1125 1)) (OR (LT s1049 1) (LT s1113 1)) (OR (LT s1069 1) (LT s1133 1)) (OR (LT s1073 1) (LT s1137 1)) (OR (LT s1062 1) (LT s1126 1)) (OR (LT s1046 1) (LT s1110 1)) (OR (LT s1072 1) (LT s1136 1)) (OR (LT s1027 1) (LT s1091 1)) (OR (LT s1064 1) (LT s1128 1)) (OR (LT s1019 1) (LT s1083 1)) (OR (LT s1056 1) (LT s1120 1)) (OR (LT s1048 1) (LT s1112 1)) (OR (LT s1040 1) (LT s1104 1)) (OR (LT s1043 1) (LT s1107 1)) (OR (LT s1032 1) (LT s1096 1)) (OR (LT s1035 1) (LT s1099 1)) (OR (LT s1024 1) (LT s1088 1)) (OR (LT s1016 1) (LT s1080 1)) (OR (LT s1067 1) (LT s1131 1)) (OR (LT s1059 1) (LT s1123 1)) (OR (LT s1051 1) (LT s1115 1)) (OR (LT s1060 1) (LT s1124 1)) (OR (LT s1023 1) (LT s1087 1)) (OR (LT s1028 1) (LT s1092 1)) (OR (LT s1018 1) (LT s1082 1)) (OR (LT s1050 1) (LT s1114 1)) (OR (LT s1038 1) (LT s1102 1)) (OR (LT s1070 1) (LT s1134 1)) (OR (LT s1030 1) (LT s1094 1)) (OR (LT s1021 1) (LT s1085 1)) (OR (LT s1025 1) (LT s1089 1)) (OR (LT s1013 1) (LT s1077 1)) (OR (LT s1045 1) (LT s1109 1)) (OR (LT s1033 1) (LT s1097 1)) (OR (LT s1065 1) (LT s1129 1)) (OR (LT s1057 1) (LT s1121 1)) (OR (LT s1053 1) (LT s1117 1)) (OR (LT s1015 1) (LT s1079 1)) (OR (LT s1052 1) (LT s1116 1)) (OR (LT s1047 1) (LT s1111 1)) (OR (LT s1036 1) (LT s1100 1)) (OR (LT s1031 1) (LT s1095 1)) (OR (LT s1026 1) (LT s1090 1)) (OR (LT s1020 1) (LT s1084 1)) (OR (LT s1058 1) (LT s1122 1)) (OR (LT s1042 1) (LT s1106 1)) (OR (LT s1068 1) (LT s1132 1)) (OR (LT s1074 1) (LT s1138 1)) (OR (LT s1063 1) (LT s1127 1)) (OR (LT s1055 1) (LT s1119 1)) (OR (LT s1071 1) (LT s1135 1)) (OR (AND (GEQ s164 1) (GEQ s391 1)) (AND (GEQ s164 1) (GEQ s392 1)) (AND (GEQ s152 1) (GEQ s368 1)) (AND (GEQ s152 1) (GEQ s367 1)) (AND (GEQ s147 1) (GEQ s357 1)) (AND (GEQ s147 1) (GEQ s358 1)) (AND (GEQ s158 1) (GEQ s379 1)) (AND (GEQ s158 1) (GEQ s380 1)) (AND (GEQ s165 1) (GEQ s393 1)) (AND (GEQ s154 1) (GEQ s372 1)) (AND (GEQ s154 1) (GEQ s371 1)) (AND (GEQ s153 1) (GEQ s369 1)) (AND (GEQ s165 1) (GEQ s394 1)) (AND (GEQ s150 1) (GEQ s364 1)) (AND (GEQ s150 1) (GEQ s363 1)) (AND (GEQ s153 1) (GEQ s370 1)) (AND (GEQ s157 1) (GEQ s377 1)) (AND (GEQ s161 1) (GEQ s385 1)) (AND (GEQ s157 1) (GEQ s378 1)) (AND (GEQ s155 1) (GEQ s373 1)) (AND (GEQ s161 1) (GEQ s386 1)) (AND (GEQ s149 1) (GEQ s361 1)) (AND (GEQ s155 1) (GEQ s374 1)) (AND (GEQ s149 1) (GEQ s362 1)) (AND (GEQ s167 1) (GEQ s398 1)) (AND (GEQ s167 1) (GEQ s397 1)) (AND (GEQ s166 1) (GEQ s396 1)) (AND (GEQ s166 1) (GEQ s395 1)) (AND (GEQ s160 1) (GEQ s383 1)) (AND (GEQ s160 1) (GEQ s384 1)) (AND (GEQ s156 1) (GEQ s376 1)) (AND (GEQ s156 1) (GEQ s375 1)) (AND (GEQ s148 1) (GEQ s359 1)) (AND (GEQ s162 1) (GEQ s387 1)) (AND (GEQ s148 1) (GEQ s360 1)) (AND (GEQ s162 1) (GEQ s388 1)) (AND (GEQ s151 1) (GEQ s365 1)) (AND (GEQ s151 1) (GEQ s366 1)) (AND (GEQ s163 1) (GEQ s390 1)) (AND (GEQ s163 1) (GEQ s389 1)) (AND (GEQ s159 1) (GEQ s382 1)) (AND (GEQ s159 1) (GEQ s381 1)))), p0:(OR (AND (GEQ s164 1) (GEQ s391 1)) (AND (GEQ s164 1) (GEQ s392 1)) (AND (GEQ s152 1) (GEQ s368 1)) (AND (GEQ s152 1) (GEQ s367 1)) (AND (GEQ s147 1) (GEQ s357 1)) (AND (GEQ s147 1) (GEQ s358 1)) (AND (GEQ s158 1) (GEQ s379 1)) (AND (GEQ s158 1) (GEQ s380 1)) (AND (GEQ s165 1) (GEQ s393 1)) (AND (GEQ s154 1) (GEQ s372 1)) (AND (GEQ s154 1) (GEQ s371 1)) (AND (GEQ s153 1) (GEQ s369 1)) (AND (GEQ s165 1) (GEQ s394 1)) (AND (GEQ s150 1) (GEQ s364 1)) (AND (GEQ s150 1) (GEQ s363 1)) (AND (GEQ s153 1) (GEQ s370 1)) (AND (GEQ s157 1) (GEQ s377 1)) (AND (GEQ s161 1) (GEQ s385 1)) (AND (GEQ s157 1) (GEQ s378 1)) (AND (GEQ s155 1) (GEQ s373 1)) (AND (GEQ s161 1) (GEQ s386 1)) (AND (GEQ s149 1) (GEQ s361 1)) (AND (GEQ s155 1) (GEQ s374 1)) (AND (GEQ s149 1) (GEQ s362 1)) (AND (GEQ s167 1) (GEQ s398 1)) (AND (GEQ s167 1) (GEQ s397 1)) (AND (GEQ s166 1) (GEQ s396 1)) (AND (GEQ s166 1) (GEQ s395 1)) (AND (GEQ s160 1) (GEQ s383 1)) (AND (GEQ s160 1) (GEQ s384 1)) (AND (GEQ s156 1) (GEQ s376 1)) (AND (GEQ s156 1) (GEQ s375 1)) (AND (GEQ s148 1) (GEQ s359 1)) (AND (GEQ s162 1) (GEQ s387 1)) (AND (GEQ s148 1) (GEQ s360 1)) (AND (GEQ s162 1) (GEQ s388 1)) (AND (GEQ s151 1) (GEQ s365 1)) (AND (GEQ s151 1) (GEQ s366 1)) (AND (GEQ s163 1) (GEQ s390 1)) (AND (GEQ s163 1) (GEQ s389 1)) (AND (GEQ s159 1) (GEQ s382 1)) (AND (GEQ s159 1) (GEQ s381 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-04 finished in 14051 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 84 out of 2719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2719/2719 places, 2500/2500 transitions.
Discarding 189 places :
Implicit places reduction removed 189 places
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 2530 transition count 2500
Discarding 168 places :
Symmetric choice reduction at 1 with 168 rule applications. Total rules 357 place count 2362 transition count 2332
Iterating global reduction 1 with 168 rules applied. Total rules applied 525 place count 2362 transition count 2332
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 591 place count 2296 transition count 2186
Iterating global reduction 1 with 66 rules applied. Total rules applied 657 place count 2296 transition count 2186
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 1 with 63 rules applied. Total rules applied 720 place count 2254 transition count 2165
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 805 place count 2169 transition count 2060
Iterating global reduction 2 with 85 rules applied. Total rules applied 890 place count 2169 transition count 2060
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 2 with 63 rules applied. Total rules applied 953 place count 2127 transition count 2039
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1016 place count 2064 transition count 1976
Iterating global reduction 3 with 63 rules applied. Total rules applied 1079 place count 2064 transition count 1976
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1121 place count 2022 transition count 1934
Iterating global reduction 3 with 42 rules applied. Total rules applied 1163 place count 2022 transition count 1934
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1205 place count 1980 transition count 1892
Iterating global reduction 3 with 42 rules applied. Total rules applied 1247 place count 1980 transition count 1892
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1289 place count 1938 transition count 1850
Iterating global reduction 3 with 42 rules applied. Total rules applied 1331 place count 1938 transition count 1850
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1373 place count 1896 transition count 1808
Iterating global reduction 3 with 42 rules applied. Total rules applied 1415 place count 1896 transition count 1808
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1457 place count 1854 transition count 1766
Iterating global reduction 3 with 42 rules applied. Total rules applied 1499 place count 1854 transition count 1766
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1541 place count 1812 transition count 1724
Iterating global reduction 3 with 42 rules applied. Total rules applied 1583 place count 1812 transition count 1724
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1625 place count 1770 transition count 1682
Iterating global reduction 3 with 42 rules applied. Total rules applied 1667 place count 1770 transition count 1682
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1709 place count 1728 transition count 1640
Iterating global reduction 3 with 42 rules applied. Total rules applied 1751 place count 1728 transition count 1640
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1793 place count 1686 transition count 1598
Iterating global reduction 3 with 42 rules applied. Total rules applied 1835 place count 1686 transition count 1598
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1877 place count 1644 transition count 1556
Iterating global reduction 3 with 42 rules applied. Total rules applied 1919 place count 1644 transition count 1556
Applied a total of 1919 rules in 1108 ms. Remains 1644 /2719 variables (removed 1075) and now considering 1556/2500 (removed 944) transitions.
// Phase 1: matrix 1556 rows 1644 cols
[2021-05-10 20:23:55] [INFO ] Computed 172 place invariants in 10 ms
[2021-05-10 20:23:56] [INFO ] Implicit Places using invariants in 461 ms returned [189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 336, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 886, 1391]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 463 ms to find 45 implicit places.
// Phase 1: matrix 1556 rows 1599 cols
[2021-05-10 20:23:56] [INFO ] Computed 127 place invariants in 5 ms
[2021-05-10 20:23:56] [INFO ] Dead Transitions using invariants and state equation in 786 ms returned []
Starting structural reductions, iteration 1 : 1599/2719 places, 1556/2500 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1558 transition count 1515
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1558 transition count 1515
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1538 transition count 1475
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1538 transition count 1475
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1518 transition count 1455
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1518 transition count 1455
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1498 transition count 1435
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1498 transition count 1435
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1478 transition count 1415
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1478 transition count 1415
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 1458 transition count 1395
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 1458 transition count 1395
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1438 transition count 1375
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1438 transition count 1375
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1418 transition count 1355
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1418 transition count 1355
Applied a total of 362 rules in 401 ms. Remains 1418 /1599 variables (removed 181) and now considering 1355/1556 (removed 201) transitions.
// Phase 1: matrix 1355 rows 1418 cols
[2021-05-10 20:23:57] [INFO ] Computed 127 place invariants in 5 ms
[2021-05-10 20:23:57] [INFO ] Implicit Places using invariants in 285 ms returned []
// Phase 1: matrix 1355 rows 1418 cols
[2021-05-10 20:23:57] [INFO ] Computed 127 place invariants in 6 ms
[2021-05-10 20:23:58] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1418/2719 places, 1355/2500 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s41 1) (GEQ s40 1) (GEQ s21 1) (GEQ s22 1) (GEQ s23 1) (GEQ s24 1) (GEQ s25 1) (GEQ s26 1) (GEQ s27 1) (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1)), p1:(OR (GEQ s128 1) (GEQ s126 1) (GEQ s132 1) (GEQ s130 1) (GEQ s136 1) (GEQ s134 1) (GEQ s140 1) (GEQ s138 1) (GEQ s144 1) (GEQ s142 1) (GEQ s146 1) (GEQ s85 1) (GEQ s87 1) (GEQ s89 1) (GEQ s91 1) (GEQ s93 1) (GEQ s95 1) (GEQ s97 1) (GEQ s99 1) (GEQ s103 1) (GEQ s101 1) (GEQ s107 1) (GEQ s105 1) (GEQ s111 1) (GEQ s109 1) (GEQ s115 1) (GEQ s113 1) (GEQ s119 1) (GEQ s117 1) (GEQ s123 1) (GEQ s121 1) (GEQ s127 1) (GEQ s125 1) (GEQ s131 1) (GEQ s129 1) (GEQ s135 1) (GEQ s133 1) (GEQ s139 1) (GEQ s137 1) (GEQ s143 1) (GEQ s141 1) (GEQ s84 1) (GEQ s145 1) (GEQ s86 1) (GEQ s88 1) (GEQ s90 1) (GEQ s92 1) (GEQ s94 1) (GEQ s96 1) (GEQ s98 1) (GEQ s100 1) (GEQ s104 1) (GEQ s102 1) (GEQ s108 1) (GEQ s106 1) (GEQ s112 1) (GEQ s110 1) (GEQ s116 1) (GEQ s114 1) (GEQ s120 1) (GEQ s118 1) (GEQ s124 1) (GEQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1214 steps with 0 reset in 8 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-05 finished in 4000 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 42 out of 2719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2719/2719 places, 2500/2500 transitions.
Discarding 189 places :
Implicit places reduction removed 189 places
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 2530 transition count 2500
Discarding 168 places :
Symmetric choice reduction at 1 with 168 rule applications. Total rules 357 place count 2362 transition count 2332
Iterating global reduction 1 with 168 rules applied. Total rules applied 525 place count 2362 transition count 2332
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 591 place count 2296 transition count 2186
Iterating global reduction 1 with 66 rules applied. Total rules applied 657 place count 2296 transition count 2186
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 1 with 63 rules applied. Total rules applied 720 place count 2254 transition count 2165
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 805 place count 2169 transition count 2060
Iterating global reduction 2 with 85 rules applied. Total rules applied 890 place count 2169 transition count 2060
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 2 with 63 rules applied. Total rules applied 953 place count 2127 transition count 2039
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 995 place count 2085 transition count 1997
Iterating global reduction 3 with 42 rules applied. Total rules applied 1037 place count 2085 transition count 1997
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1079 place count 2043 transition count 1955
Iterating global reduction 3 with 42 rules applied. Total rules applied 1121 place count 2043 transition count 1955
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1163 place count 2001 transition count 1913
Iterating global reduction 3 with 42 rules applied. Total rules applied 1205 place count 2001 transition count 1913
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1247 place count 1959 transition count 1871
Iterating global reduction 3 with 42 rules applied. Total rules applied 1289 place count 1959 transition count 1871
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1331 place count 1917 transition count 1829
Iterating global reduction 3 with 42 rules applied. Total rules applied 1373 place count 1917 transition count 1829
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1415 place count 1875 transition count 1787
Iterating global reduction 3 with 42 rules applied. Total rules applied 1457 place count 1875 transition count 1787
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1499 place count 1833 transition count 1745
Iterating global reduction 3 with 42 rules applied. Total rules applied 1541 place count 1833 transition count 1745
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1583 place count 1791 transition count 1703
Iterating global reduction 3 with 42 rules applied. Total rules applied 1625 place count 1791 transition count 1703
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1667 place count 1749 transition count 1661
Iterating global reduction 3 with 42 rules applied. Total rules applied 1709 place count 1749 transition count 1661
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1751 place count 1707 transition count 1619
Iterating global reduction 3 with 42 rules applied. Total rules applied 1793 place count 1707 transition count 1619
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1835 place count 1665 transition count 1577
Iterating global reduction 3 with 42 rules applied. Total rules applied 1877 place count 1665 transition count 1577
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1919 place count 1623 transition count 1535
Iterating global reduction 3 with 42 rules applied. Total rules applied 1961 place count 1623 transition count 1535
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 3 with 63 rules applied. Total rules applied 2024 place count 1602 transition count 1493
Applied a total of 2024 rules in 1398 ms. Remains 1602 /2719 variables (removed 1117) and now considering 1493/2500 (removed 1007) transitions.
// Phase 1: matrix 1493 rows 1602 cols
[2021-05-10 20:24:00] [INFO ] Computed 151 place invariants in 10 ms
[2021-05-10 20:24:00] [INFO ] Implicit Places using invariants in 425 ms returned [273, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 823, 1349]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 427 ms to find 24 implicit places.
// Phase 1: matrix 1493 rows 1578 cols
[2021-05-10 20:24:00] [INFO ] Computed 127 place invariants in 4 ms
[2021-05-10 20:24:01] [INFO ] Dead Transitions using invariants and state equation in 759 ms returned []
Starting structural reductions, iteration 1 : 1578/2719 places, 1493/2500 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1537 transition count 1452
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1537 transition count 1452
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1517 transition count 1412
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1517 transition count 1412
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1497 transition count 1392
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1497 transition count 1392
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1477 transition count 1372
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1477 transition count 1372
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1457 transition count 1352
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1457 transition count 1352
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 1437 transition count 1332
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 1437 transition count 1332
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1417 transition count 1312
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1417 transition count 1312
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1397 transition count 1292
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1397 transition count 1292
Applied a total of 362 rules in 514 ms. Remains 1397 /1578 variables (removed 181) and now considering 1292/1493 (removed 201) transitions.
// Phase 1: matrix 1292 rows 1397 cols
[2021-05-10 20:24:01] [INFO ] Computed 127 place invariants in 5 ms
[2021-05-10 20:24:02] [INFO ] Implicit Places using invariants in 302 ms returned []
// Phase 1: matrix 1292 rows 1397 cols
[2021-05-10 20:24:02] [INFO ] Computed 127 place invariants in 5 ms
[2021-05-10 20:24:02] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1397/2719 places, 1292/2500 transitions.
Stuttering acceptance computed with spot in 8610 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (LT s1071 1) (LT s1072 1) (LT s1069 1) (LT s1070 1) (LT s1075 1) (LT s1076 1) (LT s1073 1) (LT s1074 1) (LT s1063 1) (LT s1064 1) (LT s1061 1) (LT s1062 1) (LT s1067 1) (LT s1068 1) (LT s1065 1) (LT s1066 1) (LT s1087 1) (LT s1088 1) (LT s1085 1) (LT s1086 1) (LT s1091 1) (LT s1092 1) (LT s1089 1) (LT s1090 1) (LT s1079 1) (LT s1080 1) (LT s1077 1) (LT s1078 1) (LT s1083 1) (LT s1084 1) (LT s1081 1) (LT s1082 1) (LT s1102 1) (LT s1101 1) (LT s1095 1) (LT s1096 1) (LT s1093 1) (LT s1094 1) (LT s1100 1) (LT s1099 1) (LT s1097 1) (LT s1098 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 855 ms.
Product exploration explored 100000 steps with 33333 reset in 804 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1397 transition count 1292
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-06 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-06 finished in 14858 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 84 out of 2719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2719/2719 places, 2500/2500 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 189 places :
Implicit places reduction removed 189 places
Drop transitions removed 1218 transitions
Trivial Post-agglo rules discarded 1218 transitions
Performed 1218 trivial Post agglomeration. Transition count delta: 1218
Iterating post reduction 0 with 1407 rules applied. Total rules applied 1407 place count 2529 transition count 1281
Reduce places removed 1218 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 1 with 1260 rules applied. Total rules applied 2667 place count 1311 transition count 1239
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 2709 place count 1269 transition count 1239
Performed 168 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 168 Pre rules applied. Total rules applied 2709 place count 1269 transition count 1071
Deduced a syphon composed of 168 places in 1 ms
Ensure Unique test removed 63 places
Reduce places removed 231 places and 0 transitions.
Iterating global reduction 3 with 399 rules applied. Total rules applied 3108 place count 1038 transition count 1071
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 21 rules applied. Total rules applied 3129 place count 1038 transition count 1050
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 3150 place count 1017 transition count 1050
Discarding 107 places :
Symmetric choice reduction at 5 with 107 rule applications. Total rules 3257 place count 910 transition count 903
Iterating global reduction 5 with 107 rules applied. Total rules applied 3364 place count 910 transition count 903
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 5 with 168 rules applied. Total rules applied 3532 place count 889 transition count 756
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 6 with 126 rules applied. Total rules applied 3658 place count 763 transition count 756
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 3658 place count 763 transition count 735
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 3700 place count 742 transition count 735
Discarding 45 places :
Symmetric choice reduction at 7 with 45 rule applications. Total rules 3745 place count 697 transition count 630
Iterating global reduction 7 with 45 rules applied. Total rules applied 3790 place count 697 transition count 630
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Discarding 83 places :
Implicit places reduction removed 83 places
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 7 with 249 rules applied. Total rules applied 4039 place count 614 transition count 464
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 8 with 103 rules applied. Total rules applied 4142 place count 511 transition count 464
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 43 Pre rules applied. Total rules applied 4142 place count 511 transition count 421
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 9 with 87 rules applied. Total rules applied 4229 place count 467 transition count 421
Discarding 21 places :
Symmetric choice reduction at 9 with 21 rule applications. Total rules 4250 place count 446 transition count 400
Iterating global reduction 9 with 21 rules applied. Total rules applied 4271 place count 446 transition count 400
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 9 with 170 rules applied. Total rules applied 4441 place count 361 transition count 315
Discarding 21 places :
Symmetric choice reduction at 9 with 21 rule applications. Total rules 4462 place count 340 transition count 294
Ensure Unique test removed 21 places
Iterating global reduction 9 with 42 rules applied. Total rules applied 4504 place count 319 transition count 294
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 9 with 42 rules applied. Total rules applied 4546 place count 319 transition count 252
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 4567 place count 298 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4568 place count 297 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4569 place count 296 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4570 place count 295 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4571 place count 294 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4572 place count 293 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4573 place count 292 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4574 place count 291 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4575 place count 290 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4576 place count 289 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4577 place count 288 transition count 242
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4578 place count 287 transition count 241
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4579 place count 286 transition count 240
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4580 place count 285 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4581 place count 284 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4582 place count 283 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4583 place count 282 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4584 place count 281 transition count 235
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4585 place count 280 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4586 place count 279 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4587 place count 278 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 4588 place count 277 transition count 231
Applied a total of 4588 rules in 196 ms. Remains 277 /2719 variables (removed 2442) and now considering 231/2500 (removed 2269) transitions.
// Phase 1: matrix 231 rows 277 cols
[2021-05-10 20:24:13] [INFO ] Computed 67 place invariants in 1 ms
[2021-05-10 20:24:13] [INFO ] Implicit Places using invariants in 121 ms returned [21, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 86, 276]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 129 ms to find 24 implicit places.
[2021-05-10 20:24:13] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 231 rows 253 cols
[2021-05-10 20:24:13] [INFO ] Computed 43 place invariants in 1 ms
[2021-05-10 20:24:13] [INFO ] Dead Transitions using invariants and state equation in 118 ms returned []
Starting structural reductions, iteration 1 : 253/2719 places, 231/2500 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 253 transition count 210
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 232 transition count 210
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 42 place count 232 transition count 189
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 84 place count 211 transition count 189
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 104 place count 191 transition count 169
Iterating global reduction 2 with 20 rules applied. Total rules applied 124 place count 191 transition count 169
Applied a total of 124 rules in 12 ms. Remains 191 /253 variables (removed 62) and now considering 169/231 (removed 62) transitions.
// Phase 1: matrix 169 rows 191 cols
[2021-05-10 20:24:13] [INFO ] Computed 43 place invariants in 0 ms
[2021-05-10 20:24:13] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 169 rows 191 cols
[2021-05-10 20:24:13] [INFO ] Computed 43 place invariants in 1 ms
[2021-05-10 20:24:14] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 191/2719 places, 169/2500 transitions.
Stuttering acceptance computed with spot in 34 ms :[true, (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (OR (LT s119 1) (LT s161 1)) (OR (LT s140 1) (LT s182 1)) (OR (LT s135 1) (LT s177 1)) (OR (LT s108 1) (LT s150 1)) (OR (LT s114 1) (LT s156 1)) (OR (LT s124 1) (LT s166 1)) (OR (LT s146 1) (LT s188 1)) (OR (LT s130 1) (LT s172 1)) (OR (LT s134 1) (LT s176 1)) (OR (LT s110 1) (LT s152 1)) (OR (LT s118 1) (LT s160 1)) (OR (LT s109 1) (LT s151 1)) (OR (LT s113 1) (LT s155 1)) (OR (LT s117 1) (LT s159 1)) (OR (LT s121 1) (LT s163 1)) (OR (LT s125 1) (LT s167 1)) (OR (LT s129 1) (LT s171 1)) (OR (LT s133 1) (LT s175 1)) (OR (LT s137 1) (LT s179 1)) (OR (LT s141 1) (LT s183 1)) (OR (LT s145 1) (LT s187 1)) (OR (LT s111 1) (LT s153 1)) (OR (LT s132 1) (LT s174 1)) (OR (LT s127 1) (LT s169 1)) (OR (LT s143 1) (LT s185 1)) (OR (LT s116 1) (LT s158 1)) (OR (LT s122 1) (LT s164 1)) (OR (LT s106 1) (LT s148 1)) (OR (LT s126 1) (LT s168 1)) (OR (LT s138 1) (LT s180 1)) (OR (LT s142 1) (LT s184 1)) (OR (LT s107 1) (LT s149 1)) (OR (LT s115 1) (LT s157 1)) (OR (LT s123 1) (LT s165 1)) (OR (LT s128 1) (LT s170 1)) (OR (LT s131 1) (LT s173 1)) (OR (LT s136 1) (LT s178 1)) (OR (LT s144 1) (LT s186 1)) (OR (LT s139 1) (LT s181 1)) (OR (LT s112 1) (LT s154 1)) (OR (LT s120 1) (LT s162 1)) (OR (LT s147 1) (LT s189 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-COL-L00020M0002C001P001G001-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-08 finished in 657 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 168 out of 2719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2719/2719 places, 2500/2500 transitions.
Discarding 126 places :
Implicit places reduction removed 126 places
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 2593 transition count 2500
Discarding 168 places :
Symmetric choice reduction at 1 with 168 rule applications. Total rules 294 place count 2425 transition count 2332
Iterating global reduction 1 with 168 rules applied. Total rules applied 462 place count 2425 transition count 2332
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 528 place count 2359 transition count 2186
Iterating global reduction 1 with 66 rules applied. Total rules applied 594 place count 2359 transition count 2186
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 1 with 63 rules applied. Total rules applied 657 place count 2317 transition count 2165
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 742 place count 2232 transition count 2060
Iterating global reduction 2 with 85 rules applied. Total rules applied 827 place count 2232 transition count 2060
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 2 with 63 rules applied. Total rules applied 890 place count 2190 transition count 2039
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 932 place count 2148 transition count 1997
Iterating global reduction 3 with 42 rules applied. Total rules applied 974 place count 2148 transition count 1997
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1016 place count 2106 transition count 1955
Iterating global reduction 3 with 42 rules applied. Total rules applied 1058 place count 2106 transition count 1955
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1100 place count 2064 transition count 1913
Iterating global reduction 3 with 42 rules applied. Total rules applied 1142 place count 2064 transition count 1913
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1184 place count 2022 transition count 1871
Iterating global reduction 3 with 42 rules applied. Total rules applied 1226 place count 2022 transition count 1871
Applied a total of 1226 rules in 701 ms. Remains 2022 /2719 variables (removed 697) and now considering 1871/2500 (removed 629) transitions.
// Phase 1: matrix 1871 rows 2022 cols
[2021-05-10 20:24:14] [INFO ] Computed 235 place invariants in 13 ms
[2021-05-10 20:24:15] [INFO ] Implicit Places using invariants in 541 ms returned [231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 462, 1115, 1116, 1117, 1118, 1119, 1120, 1121, 1122, 1123, 1124, 1125, 1126, 1127, 1128, 1129, 1130, 1131, 1132, 1133, 1134, 1135, 1243, 1769]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 543 ms to find 45 implicit places.
// Phase 1: matrix 1871 rows 1977 cols
[2021-05-10 20:24:15] [INFO ] Computed 190 place invariants in 12 ms
[2021-05-10 20:24:16] [INFO ] Dead Transitions using invariants and state equation in 918 ms returned []
Starting structural reductions, iteration 1 : 1977/2719 places, 1871/2500 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1936 transition count 1830
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1936 transition count 1830
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1916 transition count 1790
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1916 transition count 1790
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1896 transition count 1770
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1896 transition count 1770
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1876 transition count 1750
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1876 transition count 1750
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1856 transition count 1730
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1856 transition count 1730
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 1836 transition count 1710
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 1836 transition count 1710
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1816 transition count 1690
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1816 transition count 1690
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1796 transition count 1670
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1796 transition count 1670
Applied a total of 362 rules in 601 ms. Remains 1796 /1977 variables (removed 181) and now considering 1670/1871 (removed 201) transitions.
// Phase 1: matrix 1670 rows 1796 cols
[2021-05-10 20:24:16] [INFO ] Computed 190 place invariants in 8 ms
[2021-05-10 20:24:17] [INFO ] Implicit Places using invariants in 348 ms returned []
// Phase 1: matrix 1670 rows 1796 cols
[2021-05-10 20:24:17] [INFO ] Computed 190 place invariants in 9 ms
[2021-05-10 20:24:18] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 1370 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1796/2719 places, 1670/2500 transitions.
Stuttering acceptance computed with spot in 9883 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s1470 1) (LT s1471 1) (LT s1468 1) (LT s1469 1) (LT s1474 1) (LT s1475 1) (LT s1472 1) (LT s1473 1) (LT s1462 1) (LT s1463 1) (LT s1460 1) (LT s1461 1) (LT s1466 1) (LT s1467 1) (LT s1464 1) (LT s1465 1) (LT s1486 1) (LT s1487 1) (LT s1484 1) (LT s1485 1) (LT s1490 1) (LT s1491 1) (LT s1488 1) (LT s1489 1) (LT s1478 1) (LT s1479 1) (LT s1476 1) (LT s1477 1) (LT s1482 1) (LT s1483 1) (LT s1480 1) (LT s1481 1) (LT s1501 1) (LT s1500 1) (LT s1494 1) (LT s1495 1) (LT s1492 1) (LT s1493 1) (LT s1499 1) (LT s1498 1) (LT s1496 1) (LT s1497 1)), p1:(OR (AND (GEQ s738 1) (GEQ s801 1)) (AND (GEQ s701 1) (GEQ s764 1)) (AND (GEQ s733 1) (GEQ s796 1)) (AND (GEQ s706 1) (GEQ s769 1)) (AND (GEQ s696 1) (GEQ s759 1)) (AND (GEQ s711 1) (GEQ s774 1)) (AND (GEQ s723 1) (GEQ s786 1)) (AND (GEQ s753 1) (GEQ s816 1)) (AND (GEQ s755 1) (GEQ s818 1)) (AND (GEQ s743 1) (GEQ s806 1)) (AND (GEQ s713 1) (GEQ s776 1)) (AND (GEQ s721 1) (GEQ s784 1)) (AND (GEQ s716 1) (GEQ s779 1)) (AND (GEQ s708 1) (GEQ s771 1)) (AND (GEQ s748 1) (GEQ s811 1)) (AND (GEQ s740 1) (GEQ s803 1)) (AND (GEQ s736 1) (GEQ s799 1)) (AND (GEQ s728 1) (GEQ s791 1)) (AND (GEQ s704 1) (GEQ s767 1)) (AND (GEQ s715 1) (GEQ s778 1)) (AND (GEQ s699 1) (GEQ s762 1)) (AND (GEQ s731 1) (GEQ s794 1)) (AND (GEQ s747 1) (GEQ s810 1)) (AND (GEQ s745 1) (GEQ s808 1)) (AND (GEQ s750 1) (GEQ s813 1)) (AND (GEQ s742 1) (GEQ s805 1)) (AND (GEQ s734 1) (GEQ s797 1)) (AND (GEQ s726 1) (GEQ s789 1)) (AND (GEQ s718 1) (GEQ s781 1)) (AND (GEQ s710 1) (GEQ s773 1)) (AND (GEQ s702 1) (GEQ s765 1)) (AND (GEQ s694 1) (GEQ s757 1)) (AND (GEQ s717 1) (GEQ s780 1)) (AND (GEQ s754 1) (GEQ s817 1)) (AND (GEQ s722 1) (GEQ s785 1)) (AND (GEQ s712 1) (GEQ s775 1)) (AND (GEQ s707 1) (GEQ s770 1)) (AND (GEQ s727 1) (GEQ s790 1)) (AND (GEQ s749 1) (GEQ s812 1)) (AND (GEQ s739 1) (GEQ s802 1)) (AND (GEQ s737 1) (GEQ s800 1)) (AND (GEQ s705 1) (GEQ s768 1)) (AND (GEQ s729 1) (GEQ s792 1)) (AND (GEQ s700 1) (GEQ s763 1)) (AND (GEQ s697 1) (GEQ s760 1)) (AND (GEQ s752 1) (GEQ s815 1)) (AND (GEQ s744 1) (GEQ s807 1)) (AND (GEQ s732 1) (GEQ s795 1)) (AND (GEQ s720 1) (GEQ s783 1)) (AND (GEQ s724 1) (GEQ s787 1)) (AND (GEQ s709 1) (GEQ s772 1)) (AND (GEQ s746 1) (GEQ s809 1)) (AND (GEQ s730 1) (GEQ s793 1)) (AND (GEQ s725 1) (GEQ s788 1)) (AND (GEQ s714 1) (GEQ s777 1)) (AND (GEQ s693 1) (GEQ s756 1)) (AND (GEQ s698 1) (GEQ s761 1)) (AND (GEQ s703 1) (GEQ s766 1)) (AND (GEQ s735 1) (GEQ s798 1)) (AND (GEQ s719 1) (GEQ s782 1)) (AND (GEQ s751 1) (GEQ s814 1)) (AND (GEQ s741 1) (GEQ s804 1)) (AND (GEQ s695 1) (GEQ s758 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1036 reset in 573 ms.
Product exploration explored 100000 steps with 1025 reset in 593 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1796 transition count 1670
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G (NOT p1))), p0, (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1031 reset in 561 ms.
Product exploration explored 100000 steps with 1033 reset in 592 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 168 out of 1796 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1796/1796 places, 1670/1670 transitions.
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 507 rules applied. Total rules applied 507 place count 1796 transition count 1670
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 509 place count 1796 transition count 1669
Performed 696 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 696 Pre rules applied. Total rules applied 509 place count 1796 transition count 2005
Deduced a syphon composed of 1204 places in 1 ms
Iterating global reduction 2 with 696 rules applied. Total rules applied 1205 place count 1796 transition count 2005
Discarding 676 places :
Symmetric choice reduction at 2 with 676 rule applications. Total rules 1881 place count 1120 transition count 1329
Deduced a syphon composed of 528 places in 0 ms
Iterating global reduction 2 with 676 rules applied. Total rules applied 2557 place count 1120 transition count 1329
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 572 places in 1 ms
Iterating global reduction 2 with 44 rules applied. Total rules applied 2601 place count 1120 transition count 1329
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 2646 place count 1075 transition count 1284
Deduced a syphon composed of 527 places in 1 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 2691 place count 1075 transition count 1284
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 548 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 2712 place count 1075 transition count 1368
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 2733 place count 1054 transition count 1326
Deduced a syphon composed of 527 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 2754 place count 1054 transition count 1326
Deduced a syphon composed of 527 places in 0 ms
Applied a total of 2754 rules in 368 ms. Remains 1054 /1796 variables (removed 742) and now considering 1326/1670 (removed 344) transitions.
[2021-05-10 20:24:31] [INFO ] Redundant transitions in 61 ms returned []
// Phase 1: matrix 1326 rows 1054 cols
[2021-05-10 20:24:31] [INFO ] Computed 190 place invariants in 8 ms
[2021-05-10 20:24:32] [INFO ] Dead Transitions using invariants and state equation in 656 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1054/1796 places, 1326/1670 transitions.
Product exploration explored 100000 steps with 4316 reset in 1247 ms.
Product exploration explored 100000 steps with 4322 reset in 1071 ms.
[2021-05-10 20:24:34] [INFO ] Flatten gal took : 57 ms
[2021-05-10 20:24:34] [INFO ] Flatten gal took : 51 ms
[2021-05-10 20:24:44] [INFO ] Time to serialize gal into /tmp/LTL11142405900150178348.gal : 9976 ms
[2021-05-10 20:24:45] [INFO ] Time to serialize properties into /tmp/LTL11975878335367500719.ltl : 150 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11142405900150178348.gal, -t, CGAL, -LTL, /tmp/LTL11975878335367500719.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11142405900150178348.gal -t CGAL -LTL /tmp/LTL11975878335367500719.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((((((((((((((((((((((((((((((((((((((((((p6_10<1)&&(p6_11<1))&&(p6_8<1))&&(p6_9<1))&&(p6_14<1))&&(p6_15<1))&&(p6_12<1))&&(p6_13<1))&&(p6_2<1))&&(p6_3<1))&&(p6_0<1))&&(p6_1<1))&&(p6_6<1))&&(p6_7<1))&&(p6_4<1))&&(p6_5<1))&&(p6_26<1))&&(p6_27<1))&&(p6_24<1))&&(p6_25<1))&&(p6_30<1))&&(p6_31<1))&&(p6_28<1))&&(p6_29<1))&&(p6_18<1))&&(p6_19<1))&&(p6_16<1))&&(p6_17<1))&&(p6_22<1))&&(p6_23<1))&&(p6_20<1))&&(p6_21<1))&&(p6_41<1))&&(p6_40<1))&&(p6_34<1))&&(p6_35<1))&&(p6_32<1))&&(p6_33<1))&&(p6_39<1))&&(p6_38<1))&&(p6_36<1))&&(p6_37<1))"))&&(X(F("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((lm2_45>=1)&&(m4_45>=1))||((lm2_8>=1)&&(m4_8>=1)))||((lm2_40>=1)&&(m4_40>=1)))||((lm2_13>=1)&&(m4_13>=1)))||((lm2_3>=1)&&(m4_3>=1)))||((lm2_18>=1)&&(m4_18>=1)))||((lm2_30>=1)&&(m4_30>=1)))||((lm2_60>=1)&&(m4_60>=1)))||((lm2_62>=1)&&(m4_62>=1)))||((lm2_50>=1)&&(m4_50>=1)))||((lm2_20>=1)&&(m4_20>=1)))||((lm2_28>=1)&&(m4_28>=1)))||((lm2_23>=1)&&(m4_23>=1)))||((lm2_15>=1)&&(m4_15>=1)))||((lm2_55>=1)&&(m4_55>=1)))||((lm2_47>=1)&&(m4_47>=1)))||((lm2_43>=1)&&(m4_43>=1)))||((lm2_35>=1)&&(m4_35>=1)))||((lm2_11>=1)&&(m4_11>=1)))||((lm2_22>=1)&&(m4_22>=1)))||((lm2_6>=1)&&(m4_6>=1)))||((lm2_38>=1)&&(m4_38>=1)))||((lm2_54>=1)&&(m4_54>=1)))||((lm2_52>=1)&&(m4_52>=1)))||((lm2_57>=1)&&(m4_57>=1)))||((lm2_49>=1)&&(m4_49>=1)))||((lm2_41>=1)&&(m4_41>=1)))||((lm2_33>=1)&&(m4_33>=1)))||((lm2_25>=1)&&(m4_25>=1)))||((lm2_17>=1)&&(m4_17>=1)))||((lm2_9>=1)&&(m4_9>=1)))||((lm2_1>=1)&&(m4_1>=1)))||((lm2_24>=1)&&(m4_24>=1)))||((lm2_61>=1)&&(m4_61>=1)))||((lm2_29>=1)&&(m4_29>=1)))||((lm2_19>=1)&&(m4_19>=1)))||((lm2_14>=1)&&(m4_14>=1)))||((lm2_34>=1)&&(m4_34>=1)))||((lm2_56>=1)&&(m4_56>=1)))||((lm2_46>=1)&&(m4_46>=1)))||((lm2_44>=1)&&(m4_44>=1)))||((lm2_12>=1)&&(m4_12>=1)))||((lm2_36>=1)&&(m4_36>=1)))||((lm2_7>=1)&&(m4_7>=1)))||((lm2_4>=1)&&(m4_4>=1)))||((lm2_59>=1)&&(m4_59>=1)))||((lm2_51>=1)&&(m4_51>=1)))||((lm2_39>=1)&&(m4_39>=1)))||((lm2_27>=1)&&(m4_27>=1)))||((lm2_31>=1)&&(m4_31>=1)))||((lm2_16>=1)&&(m4_16>=1)))||((lm2_53>=1)&&(m4_53>=1)))||((lm2_37>=1)&&(m4_37>=1)))||((lm2_32>=1)&&(m4_32>=1)))||((lm2_21>=1)&&(m4_21>=1)))||((lm2_0>=1)&&(m4_0>=1)))||((lm2_5>=1)&&(m4_5>=1)))||((lm2_10>=1)&&(m4_10>=1)))||((lm2_42>=1)&&(m4_42>=1)))||((lm2_26>=1)&&(m4_26>=1)))||((lm2_58>=1)&&(m4_58>=1)))||((lm2_48>=1)&&(m4_48>=1)))||((lm2_2>=1)&&(m4_2>=1)))")))))
Formula 0 simplified : !(F"((((((((((((((((((((((((((((((((((((((((((p6_10<1)&&(p6_11<1))&&(p6_8<1))&&(p6_9<1))&&(p6_14<1))&&(p6_15<1))&&(p6_12<1))&&(p6_13<1))&&(p6_2<1))&&(p6_3<1))&&(p6_0<1))&&(p6_1<1))&&(p6_6<1))&&(p6_7<1))&&(p6_4<1))&&(p6_5<1))&&(p6_26<1))&&(p6_27<1))&&(p6_24<1))&&(p6_25<1))&&(p6_30<1))&&(p6_31<1))&&(p6_28<1))&&(p6_29<1))&&(p6_18<1))&&(p6_19<1))&&(p6_16<1))&&(p6_17<1))&&(p6_22<1))&&(p6_23<1))&&(p6_20<1))&&(p6_21<1))&&(p6_41<1))&&(p6_40<1))&&(p6_34<1))&&(p6_35<1))&&(p6_32<1))&&(p6_33<1))&&(p6_39<1))&&(p6_38<1))&&(p6_36<1))&&(p6_37<1))" & XF"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((lm2_45>=1)&&(m4_45>=1))||((lm2_8>=1)&&(m4_8>=1)))||((lm2_40>=1)&&(m4_40>=1)))||((lm2_13>=1)&&(m4_13>=1)))||((lm2_3>=1)&&(m4_3>=1)))||((lm2_18>=1)&&(m4_18>=1)))||((lm2_30>=1)&&(m4_30>=1)))||((lm2_60>=1)&&(m4_60>=1)))||((lm2_62>=1)&&(m4_62>=1)))||((lm2_50>=1)&&(m4_50>=1)))||((lm2_20>=1)&&(m4_20>=1)))||((lm2_28>=1)&&(m4_28>=1)))||((lm2_23>=1)&&(m4_23>=1)))||((lm2_15>=1)&&(m4_15>=1)))||((lm2_55>=1)&&(m4_55>=1)))||((lm2_47>=1)&&(m4_47>=1)))||((lm2_43>=1)&&(m4_43>=1)))||((lm2_35>=1)&&(m4_35>=1)))||((lm2_11>=1)&&(m4_11>=1)))||((lm2_22>=1)&&(m4_22>=1)))||((lm2_6>=1)&&(m4_6>=1)))||((lm2_38>=1)&&(m4_38>=1)))||((lm2_54>=1)&&(m4_54>=1)))||((lm2_52>=1)&&(m4_52>=1)))||((lm2_57>=1)&&(m4_57>=1)))||((lm2_49>=1)&&(m4_49>=1)))||((lm2_41>=1)&&(m4_41>=1)))||((lm2_33>=1)&&(m4_33>=1)))||((lm2_25>=1)&&(m4_25>=1)))||((lm2_17>=1)&&(m4_17>=1)))||((lm2_9>=1)&&(m4_9>=1)))||((lm2_1>=1)&&(m4_1>=1)))||((lm2_24>=1)&&(m4_24>=1)))||((lm2_61>=1)&&(m4_61>=1)))||((lm2_29>=1)&&(m4_29>=1)))||((lm2_19>=1)&&(m4_19>=1)))||((lm2_14>=1)&&(m4_14>=1)))||((lm2_34>=1)&&(m4_34>=1)))||((lm2_56>=1)&&(m4_56>=1)))||((lm2_46>=1)&&(m4_46>=1)))||((lm2_44>=1)&&(m4_44>=1)))||((lm2_12>=1)&&(m4_12>=1)))||((lm2_36>=1)&&(m4_36>=1)))||((lm2_7>=1)&&(m4_7>=1)))||((lm2_4>=1)&&(m4_4>=1)))||((lm2_59>=1)&&(m4_59>=1)))||((lm2_51>=1)&&(m4_51>=1)))||((lm2_39>=1)&&(m4_39>=1)))||((lm2_27>=1)&&(m4_27>=1)))||((lm2_31>=1)&&(m4_31>=1)))||((lm2_16>=1)&&(m4_16>=1)))||((lm2_53>=1)&&(m4_53>=1)))||((lm2_37>=1)&&(m4_37>=1)))||((lm2_32>=1)&&(m4_32>=1)))||((lm2_21>=1)&&(m4_21>=1)))||((lm2_0>=1)&&(m4_0>=1)))||((lm2_5>=1)&&(m4_5>=1)))||((lm2_10>=1)&&(m4_10>=1)))||((lm2_42>=1)&&(m4_42>=1)))||((lm2_26>=1)&&(m4_26>=1)))||((lm2_58>=1)&&(m4_58>=1)))||((lm2_48>=1)&&(m4_48>=1)))||((lm2_2>=1)&&(m4_2>=1)))")
Detected timeout of ITS tools.
[2021-05-10 20:25:00] [INFO ] Flatten gal took : 66 ms
[2021-05-10 20:25:00] [INFO ] Applying decomposition
[2021-05-10 20:25:00] [INFO ] Flatten gal took : 137 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10599342135396333740.txt, -o, /tmp/graph10599342135396333740.bin, -w, /tmp/graph10599342135396333740.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10599342135396333740.bin, -l, -1, -v, -w, /tmp/graph10599342135396333740.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 20:25:02] [INFO ] Decomposing Gal with order
[2021-05-10 20:25:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 20:25:03] [INFO ] Removed a total of 159 redundant transitions.
[2021-05-10 20:25:03] [INFO ] Flatten gal took : 246 ms
[2021-05-10 20:25:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 26 ms.
[2021-05-10 20:25:03] [INFO ] Time to serialize gal into /tmp/LTL16134763464338699279.gal : 20 ms
[2021-05-10 20:25:03] [INFO ] Time to serialize properties into /tmp/LTL7007826113510670875.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16134763464338699279.gal, -t, CGAL, -LTL, /tmp/LTL7007826113510670875.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16134763464338699279.gal -t CGAL -LTL /tmp/LTL7007826113510670875.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("((((((((((((((((((((((((((((((((((((((((((i34.i0.i2.u543.p6_10<1)&&(i34.i0.i1.u522.p6_11<1))&&(i2.i1.i2.u520.p6_8<1))&&(i2.i1.i1.u521.p6_9<1))&&(i37.i0.i1.u563.p6_14<1))&&(i37.i0.i2.u545.p6_15<1))&&(i30.i2.i0.u523.p6_12<1))&&(i30.i2.i1.u544.p6_13<1))&&(i23.i0.i2.u516.p6_2<1))&&(i23.i0.i1.u541.p6_3<1))&&(i28.i1.i1.u515.p6_0<1))&&(i28.i1.i2.u540.p6_1<1))&&(i14.i1.i2.u519.p6_6<1))&&(i14.i1.i3.u542.p6_7<1))&&(i16.i1.i3.u557.p6_4<1))&&(i16.i1.i4.u518.p6_5<1))&&(i41.i1.i0.u530.p6_26<1))&&(i41.i1.i1.u531.p6_27<1))&&(i40.i1.i2.u550.p6_24<1))&&(i40.i1.i3.u529.p6_25<1))&&(i24.i0.i1.u532.p6_30<1))&&(i24.i0.i2.u533.p6_31<1))&&(i39.i0.i1.u551.p6_28<1))&&(i39.i0.i2.u552.p6_29<1))&&(i31.i1.i2.u526.p6_18<1))&&(i31.i1.i1.u547.p6_19<1))&&(i29.i0.i3.u546.p6_16<1))&&(i29.i0.i2.u525.p6_17<1))&&(i38.i2.i0.u528.p6_22<1))&&(i38.i2.i1.u549.p6_23<1))&&(i4.i0.i1.u548.p6_20<1))&&(i4.i0.i2.u527.p6_21<1))&&(i19.i0.i2.u539.p6_41<1))&&(i19.i0.i1.u538.p6_40<1))&&(i25.i2.i1.u535.p6_34<1))&&(i25.i2.i0.u554.p6_35<1))&&(i32.i1.i3.u553.p6_32<1))&&(i32.i1.i2.u534.p6_33<1))&&(i42.i0.i3.u537.p6_39<1))&&(i42.i0.i2.u556.p6_38<1))&&(i35.i0.i1.u536.p6_36<1))&&(i35.i0.i2.u555.p6_37<1))"))&&(X(F("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i7.i0.i1.u226.lm2_45>=1)&&(i7.i0.i1.u183.m4_45>=1))||((i9.u215.lm2_8>=1)&&(i9.u165.m4_8>=1)))||((i33.u283.lm2_40>=1)&&(i33.u180.m4_40>=1)))||((i20.u265.lm2_13>=1)&&(i20.u168.m4_13>=1)))||((i5.i0.i1.u258.lm2_3>=1)&&(i5.i0.i2.u161.m4_3>=1)))||((i0.u216.lm2_18>=1)&&(i0.u171.m4_18>=1)))||((i12.i1.i1.u278.lm2_30>=1)&&(i12.i1.i1.u135.m4_30>=1)))||((i1.i0.i0.u232.lm2_60>=1)&&(i1.i0.i0.u192.m4_60>=1)))||((i1.i0.i1.u233.lm2_62>=1)&&(i1.i0.i1.u146.m4_62>=1)))||((i32.i0.i1.u289.lm2_50>=1)&&(i32.i0.i1.u142.m4_50>=1)))||((i0.u271.lm2_20>=1)&&(i0.u131.m4_20>=1)))||((i6.i0.i3.u276.lm2_28>=1)&&(i6.i0.i1.u133.m4_28>=1)))||((i11.i0.i2.u273.lm2_23>=1)&&(i11.i0.i2.u174.m4_23>=1)))||((i17.i0.i2.u267.lm2_15>=1)&&(i17.i0.i2.u309.m4_15>=1)))||((i27.i0.i3.u292.lm2_55>=1)&&(i27.i0.i3.u315.m4_55>=1)))||((i7.i0.i2.u287.lm2_47>=1)&&(i7.i0.i2.u185.m4_47>=1)))||((i18.i0.i3.u225.lm2_43>=1)&&(i18.i0.i0.u140.m4_43>=1)))||((i21.u221.lm2_35>=1)&&(i21.u178.m4_35>=1)))||((i10.u263.lm2_11>=1)&&(i10.u128.m4_11>=1)))||((i11.i0.i1.u217.lm2_22>=1)&&(i11.i0.i1.u173.m4_22>=1)))||((i9.u260.lm2_6>=1)&&(i9.u312.m4_6>=1)))||((i26.u223.lm2_38>=1)&&(i26.u138.m4_38>=1)))||((i27.i0.i1.u291.lm2_54>=1)&&(i27.i0.i1.u211.m4_54>=1)))||((i8.u230.lm2_52>=1)&&(i8.u188.m4_52>=1)))||((i22.u294.lm2_57>=1)&&(i22.u190.m4_57>=1)))||((i32.i0.i2.u288.lm2_49>=1)&&(i32.i0.i2.u186.m4_49>=1)))||((i33.u284.lm2_41>=1)&&(i33.u181.m4_41>=1)))||((i21.u220.lm2_33>=1)&&(i21.u177.m4_33>=1)))||((i3.u219.lm2_25>=1)&&(i3.u132.m4_25>=1)))||((i17.i0.i2.u269.lm2_17>=1)&&(i17.i0.i2.u170.m4_17>=1)))||((i10.u261.lm2_9>=1)&&(i10.u166.m4_9>=1)))||((i13.u256.lm2_1>=1)&&(i13.u159.m4_1>=1)))||((i3.u218.lm2_24>=1)&&(i3.u207.m4_24>=1)))||((i1.i0.i3.u296.lm2_61>=1)&&(i1.i0.i3.u316.m4_61>=1)))||((i6.i0.i2.u277.lm2_29>=1)&&(i6.i0.i2.u134.m4_29>=1)))||((i0.u270.lm2_19>=1)&&(i0.u130.m4_19>=1)))||((i20.u266.lm2_14>=1)&&(i20.u169.m4_14>=1)))||((i21.u281.lm2_34>=1)&&(i21.u209.m4_34>=1)))||((i27.i0.i2.u293.lm2_56>=1)&&(i27.i0.i2.u144.m4_56>=1)))||((i7.i0.i3.u227.lm2_46>=1)&&(i7.i0.i0.u184.m4_46>=1)))||((i18.i0.i2.u286.lm2_44>=1)&&(i18.i0.i2.u210.m4_44>=1)))||((i20.u264.lm2_12>=1)&&(i20.u167.m4_12>=1)))||((i26.u282.lm2_36>=1)&&(i26.u137.m4_36>=1)))||((i9.u214.lm2_7>=1)&&(i9.u312.m4_7>=1)))||((i5.i0.i1.u259.lm2_4>=1)&&(i5.i0.i1.u162.m4_4>=1)))||((i22.u295.lm2_59>=1)&&(i22.u212.m4_59>=1)))||((i8.u229.lm2_51>=1)&&(i8.u187.m4_51>=1)))||((i33.u224.lm2_39>=1)&&(i33.u139.m4_39>=1)))||((i6.i0.i3.u275.lm2_27>=1)&&(i6.i0.i0.u208.m4_27>=1)))||((i12.i1.i2.u279.lm2_31>=1)&&(i12.i1.i2.u176.m4_31>=1)))||((i17.i0.i0.u268.lm2_16>=1)&&(i17.i0.i0.u206.m4_16>=1)))||((i8.u290.lm2_53>=1)&&(i8.u189.m4_53>=1)))||((i26.u222.lm2_37>=1)&&(i26.u179.m4_37>=1)))||((i12.i1.i3.u280.lm2_32>=1)&&(i12.i1.i3.u313.m4_32>=1)))||((i11.i0.i3.u272.lm2_21>=1)&&(i11.i0.i3.u322.m4_21>=1)))||((i13.u255.lm2_0>=1)&&(i13.u126.m4_0>=1)))||((i5.i0.i0.u213.lm2_5>=1)&&(i5.i0.i0.u163.m4_5>=1)))||((i10.u262.lm2_10>=1)&&(i10.u205.m4_10>=1)))||((i18.i0.i3.u285.lm2_42>=1)&&(i18.i0.i1.u182.m4_42>=1)))||((i3.u274.lm2_26>=1)&&(i3.u175.m4_26>=1)))||((i22.u231.lm2_58>=1)&&(i22.u191.m4_58>=1)))||((i32.i0.i0.u228.lm2_48>=1)&&(i32.i0.i0.u141.m4_48>=1)))||((i13.u257.lm2_2>=1)&&(i13.u160.m4_2>=1)))")))))
Formula 0 simplified : !(F"((((((((((((((((((((((((((((((((((((((((((i34.i0.i2.u543.p6_10<1)&&(i34.i0.i1.u522.p6_11<1))&&(i2.i1.i2.u520.p6_8<1))&&(i2.i1.i1.u521.p6_9<1))&&(i37.i0.i1.u563.p6_14<1))&&(i37.i0.i2.u545.p6_15<1))&&(i30.i2.i0.u523.p6_12<1))&&(i30.i2.i1.u544.p6_13<1))&&(i23.i0.i2.u516.p6_2<1))&&(i23.i0.i1.u541.p6_3<1))&&(i28.i1.i1.u515.p6_0<1))&&(i28.i1.i2.u540.p6_1<1))&&(i14.i1.i2.u519.p6_6<1))&&(i14.i1.i3.u542.p6_7<1))&&(i16.i1.i3.u557.p6_4<1))&&(i16.i1.i4.u518.p6_5<1))&&(i41.i1.i0.u530.p6_26<1))&&(i41.i1.i1.u531.p6_27<1))&&(i40.i1.i2.u550.p6_24<1))&&(i40.i1.i3.u529.p6_25<1))&&(i24.i0.i1.u532.p6_30<1))&&(i24.i0.i2.u533.p6_31<1))&&(i39.i0.i1.u551.p6_28<1))&&(i39.i0.i2.u552.p6_29<1))&&(i31.i1.i2.u526.p6_18<1))&&(i31.i1.i1.u547.p6_19<1))&&(i29.i0.i3.u546.p6_16<1))&&(i29.i0.i2.u525.p6_17<1))&&(i38.i2.i0.u528.p6_22<1))&&(i38.i2.i1.u549.p6_23<1))&&(i4.i0.i1.u548.p6_20<1))&&(i4.i0.i2.u527.p6_21<1))&&(i19.i0.i2.u539.p6_41<1))&&(i19.i0.i1.u538.p6_40<1))&&(i25.i2.i1.u535.p6_34<1))&&(i25.i2.i0.u554.p6_35<1))&&(i32.i1.i3.u553.p6_32<1))&&(i32.i1.i2.u534.p6_33<1))&&(i42.i0.i3.u537.p6_39<1))&&(i42.i0.i2.u556.p6_38<1))&&(i35.i0.i1.u536.p6_36<1))&&(i35.i0.i2.u555.p6_37<1))" & XF"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((i7.i0.i1.u226.lm2_45>=1)&&(i7.i0.i1.u183.m4_45>=1))||((i9.u215.lm2_8>=1)&&(i9.u165.m4_8>=1)))||((i33.u283.lm2_40>=1)&&(i33.u180.m4_40>=1)))||((i20.u265.lm2_13>=1)&&(i20.u168.m4_13>=1)))||((i5.i0.i1.u258.lm2_3>=1)&&(i5.i0.i2.u161.m4_3>=1)))||((i0.u216.lm2_18>=1)&&(i0.u171.m4_18>=1)))||((i12.i1.i1.u278.lm2_30>=1)&&(i12.i1.i1.u135.m4_30>=1)))||((i1.i0.i0.u232.lm2_60>=1)&&(i1.i0.i0.u192.m4_60>=1)))||((i1.i0.i1.u233.lm2_62>=1)&&(i1.i0.i1.u146.m4_62>=1)))||((i32.i0.i1.u289.lm2_50>=1)&&(i32.i0.i1.u142.m4_50>=1)))||((i0.u271.lm2_20>=1)&&(i0.u131.m4_20>=1)))||((i6.i0.i3.u276.lm2_28>=1)&&(i6.i0.i1.u133.m4_28>=1)))||((i11.i0.i2.u273.lm2_23>=1)&&(i11.i0.i2.u174.m4_23>=1)))||((i17.i0.i2.u267.lm2_15>=1)&&(i17.i0.i2.u309.m4_15>=1)))||((i27.i0.i3.u292.lm2_55>=1)&&(i27.i0.i3.u315.m4_55>=1)))||((i7.i0.i2.u287.lm2_47>=1)&&(i7.i0.i2.u185.m4_47>=1)))||((i18.i0.i3.u225.lm2_43>=1)&&(i18.i0.i0.u140.m4_43>=1)))||((i21.u221.lm2_35>=1)&&(i21.u178.m4_35>=1)))||((i10.u263.lm2_11>=1)&&(i10.u128.m4_11>=1)))||((i11.i0.i1.u217.lm2_22>=1)&&(i11.i0.i1.u173.m4_22>=1)))||((i9.u260.lm2_6>=1)&&(i9.u312.m4_6>=1)))||((i26.u223.lm2_38>=1)&&(i26.u138.m4_38>=1)))||((i27.i0.i1.u291.lm2_54>=1)&&(i27.i0.i1.u211.m4_54>=1)))||((i8.u230.lm2_52>=1)&&(i8.u188.m4_52>=1)))||((i22.u294.lm2_57>=1)&&(i22.u190.m4_57>=1)))||((i32.i0.i2.u288.lm2_49>=1)&&(i32.i0.i2.u186.m4_49>=1)))||((i33.u284.lm2_41>=1)&&(i33.u181.m4_41>=1)))||((i21.u220.lm2_33>=1)&&(i21.u177.m4_33>=1)))||((i3.u219.lm2_25>=1)&&(i3.u132.m4_25>=1)))||((i17.i0.i2.u269.lm2_17>=1)&&(i17.i0.i2.u170.m4_17>=1)))||((i10.u261.lm2_9>=1)&&(i10.u166.m4_9>=1)))||((i13.u256.lm2_1>=1)&&(i13.u159.m4_1>=1)))||((i3.u218.lm2_24>=1)&&(i3.u207.m4_24>=1)))||((i1.i0.i3.u296.lm2_61>=1)&&(i1.i0.i3.u316.m4_61>=1)))||((i6.i0.i2.u277.lm2_29>=1)&&(i6.i0.i2.u134.m4_29>=1)))||((i0.u270.lm2_19>=1)&&(i0.u130.m4_19>=1)))||((i20.u266.lm2_14>=1)&&(i20.u169.m4_14>=1)))||((i21.u281.lm2_34>=1)&&(i21.u209.m4_34>=1)))||((i27.i0.i2.u293.lm2_56>=1)&&(i27.i0.i2.u144.m4_56>=1)))||((i7.i0.i3.u227.lm2_46>=1)&&(i7.i0.i0.u184.m4_46>=1)))||((i18.i0.i2.u286.lm2_44>=1)&&(i18.i0.i2.u210.m4_44>=1)))||((i20.u264.lm2_12>=1)&&(i20.u167.m4_12>=1)))||((i26.u282.lm2_36>=1)&&(i26.u137.m4_36>=1)))||((i9.u214.lm2_7>=1)&&(i9.u312.m4_7>=1)))||((i5.i0.i1.u259.lm2_4>=1)&&(i5.i0.i1.u162.m4_4>=1)))||((i22.u295.lm2_59>=1)&&(i22.u212.m4_59>=1)))||((i8.u229.lm2_51>=1)&&(i8.u187.m4_51>=1)))||((i33.u224.lm2_39>=1)&&(i33.u139.m4_39>=1)))||((i6.i0.i3.u275.lm2_27>=1)&&(i6.i0.i0.u208.m4_27>=1)))||((i12.i1.i2.u279.lm2_31>=1)&&(i12.i1.i2.u176.m4_31>=1)))||((i17.i0.i0.u268.lm2_16>=1)&&(i17.i0.i0.u206.m4_16>=1)))||((i8.u290.lm2_53>=1)&&(i8.u189.m4_53>=1)))||((i26.u222.lm2_37>=1)&&(i26.u179.m4_37>=1)))||((i12.i1.i3.u280.lm2_32>=1)&&(i12.i1.i3.u313.m4_32>=1)))||((i11.i0.i3.u272.lm2_21>=1)&&(i11.i0.i3.u322.m4_21>=1)))||((i13.u255.lm2_0>=1)&&(i13.u126.m4_0>=1)))||((i5.i0.i0.u213.lm2_5>=1)&&(i5.i0.i0.u163.m4_5>=1)))||((i10.u262.lm2_10>=1)&&(i10.u205.m4_10>=1)))||((i18.i0.i3.u285.lm2_42>=1)&&(i18.i0.i1.u182.m4_42>=1)))||((i3.u274.lm2_26>=1)&&(i3.u175.m4_26>=1)))||((i22.u231.lm2_58>=1)&&(i22.u191.m4_58>=1)))||((i32.i0.i0.u228.lm2_48>=1)&&(i32.i0.i0.u141.m4_48>=1)))||((i13.u257.lm2_2>=1)&&(i13.u160.m4_2>=1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8452025567537669837
[2021-05-10 20:25:19] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8452025567537669837
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8452025567537669837]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8452025567537669837] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8452025567537669837] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-09 finished in 66085 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(p1)))], workingDir=/home/mcc/execution]
Support contains 84 out of 2719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2719/2719 places, 2500/2500 transitions.
Discarding 189 places :
Implicit places reduction removed 189 places
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 2530 transition count 2500
Discarding 168 places :
Symmetric choice reduction at 1 with 168 rule applications. Total rules 357 place count 2362 transition count 2332
Iterating global reduction 1 with 168 rules applied. Total rules applied 525 place count 2362 transition count 2332
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 591 place count 2296 transition count 2186
Iterating global reduction 1 with 66 rules applied. Total rules applied 657 place count 2296 transition count 2186
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 1 with 63 rules applied. Total rules applied 720 place count 2254 transition count 2165
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 805 place count 2169 transition count 2060
Iterating global reduction 2 with 85 rules applied. Total rules applied 890 place count 2169 transition count 2060
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 2 with 63 rules applied. Total rules applied 953 place count 2127 transition count 2039
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1016 place count 2064 transition count 1976
Iterating global reduction 3 with 63 rules applied. Total rules applied 1079 place count 2064 transition count 1976
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1121 place count 2022 transition count 1934
Iterating global reduction 3 with 42 rules applied. Total rules applied 1163 place count 2022 transition count 1934
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1205 place count 1980 transition count 1892
Iterating global reduction 3 with 42 rules applied. Total rules applied 1247 place count 1980 transition count 1892
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1289 place count 1938 transition count 1850
Iterating global reduction 3 with 42 rules applied. Total rules applied 1331 place count 1938 transition count 1850
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1373 place count 1896 transition count 1808
Iterating global reduction 3 with 42 rules applied. Total rules applied 1415 place count 1896 transition count 1808
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1457 place count 1854 transition count 1766
Iterating global reduction 3 with 42 rules applied. Total rules applied 1499 place count 1854 transition count 1766
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1541 place count 1812 transition count 1724
Iterating global reduction 3 with 42 rules applied. Total rules applied 1583 place count 1812 transition count 1724
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1625 place count 1770 transition count 1682
Iterating global reduction 3 with 42 rules applied. Total rules applied 1667 place count 1770 transition count 1682
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1709 place count 1728 transition count 1640
Iterating global reduction 3 with 42 rules applied. Total rules applied 1751 place count 1728 transition count 1640
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1793 place count 1686 transition count 1598
Iterating global reduction 3 with 42 rules applied. Total rules applied 1835 place count 1686 transition count 1598
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1877 place count 1644 transition count 1556
Iterating global reduction 3 with 42 rules applied. Total rules applied 1919 place count 1644 transition count 1556
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 1961 place count 1602 transition count 1514
Iterating global reduction 3 with 42 rules applied. Total rules applied 2003 place count 1602 transition count 1514
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 3 with 63 rules applied. Total rules applied 2066 place count 1581 transition count 1472
Applied a total of 2066 rules in 1405 ms. Remains 1581 /2719 variables (removed 1138) and now considering 1472/2500 (removed 1028) transitions.
// Phase 1: matrix 1472 rows 1581 cols
[2021-05-10 20:25:21] [INFO ] Computed 151 place invariants in 10 ms
[2021-05-10 20:25:22] [INFO ] Implicit Places using invariants in 417 ms returned [273, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 823, 1328]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 418 ms to find 24 implicit places.
// Phase 1: matrix 1472 rows 1557 cols
[2021-05-10 20:25:22] [INFO ] Computed 127 place invariants in 4 ms
[2021-05-10 20:25:22] [INFO ] Dead Transitions using invariants and state equation in 772 ms returned []
Starting structural reductions, iteration 1 : 1557/2719 places, 1472/2500 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1516 transition count 1431
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1516 transition count 1431
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1496 transition count 1391
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1496 transition count 1391
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1476 transition count 1371
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1476 transition count 1371
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1456 transition count 1351
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1456 transition count 1351
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1436 transition count 1331
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1436 transition count 1331
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 1416 transition count 1311
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 1416 transition count 1311
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1396 transition count 1291
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1396 transition count 1291
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1376 transition count 1271
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1376 transition count 1271
Applied a total of 362 rules in 437 ms. Remains 1376 /1557 variables (removed 181) and now considering 1271/1472 (removed 201) transitions.
// Phase 1: matrix 1271 rows 1376 cols
[2021-05-10 20:25:23] [INFO ] Computed 127 place invariants in 4 ms
[2021-05-10 20:25:23] [INFO ] Implicit Places using invariants in 325 ms returned []
// Phase 1: matrix 1271 rows 1376 cols
[2021-05-10 20:25:23] [INFO ] Computed 127 place invariants in 5 ms
[2021-05-10 20:25:24] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1376/2719 places, 1271/2500 transitions.
Spot timed out Subprocess running CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, (G p0 | G!p0)&(G p1 | G!p1)], workingDir=/home/mcc/execution] killed by timeout after 10 SECONDS
Stuttering acceptance computed with spot in 11545 ms :[false, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-10 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s925 1) (GEQ s926 1) (GEQ s927 1) (GEQ s928 1) (GEQ s929 1) (GEQ s930 1) (GEQ s931 1) (GEQ s932 1) (GEQ s917 1) (GEQ s918 1) (GEQ s919 1) (GEQ s920 1) (GEQ s921 1) (GEQ s922 1) (GEQ s923 1) (GEQ s924 1) (GEQ s933 1) (GEQ s934 1) (GEQ s893 1) (GEQ s894 1) (GEQ s895 1) (GEQ s896 1) (GEQ s897 1) (GEQ s898 1) (GEQ s899 1) (GEQ s900 1) (GEQ s909 1) (GEQ s910 1) (GEQ s911 1) (GEQ s912 1) (GEQ s913 1) (GEQ s914 1) (GEQ s915 1) (GEQ s916 1) (GEQ s901 1) (GEQ s902 1) (GEQ s903 1) (GEQ s904 1) (GEQ s905 1) (GEQ s906 1) (GEQ s907 1) (GEQ s908 1)), p1:(AND (LT s43 1) (LT s42 1) (LT s45 1) (LT s44 1) (LT s47 1) (LT s46 1) (LT s49 1) (LT s48 1) (LT s51 1) (LT s50 1) (LT s53 1) (LT s52 1) (LT s55 1) (LT s54 1) (LT s57 1) (LT s56 1) (LT s59 1) (LT s58 1) (LT s61 1) (LT s60 1) (LT s62 1) (OR (GEQ s925 1) (GEQ s926 1) (GEQ s927 1) (GEQ s928 1) (GEQ s929 1) (GEQ s930 1) (GEQ s931 1) (GEQ s932 1) (GEQ s917 1) (GEQ s918 1) (GEQ s919 1) (GEQ s920 1) (GEQ s921 1) (GEQ s922 1) (GEQ s923 1) (GEQ s924 1) (GEQ s933 1) (GEQ s934 1) (GEQ s893 1) (GEQ s894 1) (GEQ s895 1) (GEQ s896 1) (GEQ s897 1) (GEQ s898 1) (GEQ s899 1) (GEQ s900 1) (GEQ s909 1) (GEQ s910 1) (GEQ s911 1) (GEQ s912 1) (GEQ s913 1) (GEQ s914 1) (GEQ s915 1) (GEQ s916 1) (GEQ s901 1) (GEQ s902 1) (GEQ s903 1) (GEQ s904 1) (GEQ s905 1) (GEQ s906 1) (GEQ s907 1) (GEQ s908 1)) (LT s711 1) (LT s710 1) (LT s709 1) (LT s708 1) (LT s715 1) (LT s714 1) (LT s713 1) (LT s712 1) (LT s719 1) (LT s718 1) (LT s717 1) (LT s716 1) (LT s723 1) (LT s722 1) (LT s721 1) (LT s720 1) (LT s724 1) (LT s707 1) (LT s706 1) (LT s705 1) (LT s704 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 219 reset in 361 ms.
Product exploration explored 100000 steps with 217 reset in 405 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1376 transition count 1271
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G (NOT p1))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 217 reset in 365 ms.
Product exploration explored 100000 steps with 216 reset in 402 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 84 out of 1376 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1376/1376 places, 1271/1271 transitions.
Performed 423 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 423 rules applied. Total rules applied 423 place count 1376 transition count 1271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 425 place count 1376 transition count 1270
Performed 507 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 507 Pre rules applied. Total rules applied 425 place count 1376 transition count 1522
Deduced a syphon composed of 931 places in 0 ms
Iterating global reduction 2 with 507 rules applied. Total rules applied 932 place count 1376 transition count 1522
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 2 with 42 rules applied. Total rules applied 974 place count 1334 transition count 1522
Discarding 634 places :
Symmetric choice reduction at 3 with 634 rule applications. Total rules 1608 place count 700 transition count 888
Deduced a syphon composed of 297 places in 1 ms
Iterating global reduction 3 with 634 rules applied. Total rules applied 2242 place count 700 transition count 888
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 362 places in 0 ms
Iterating global reduction 3 with 65 rules applied. Total rules applied 2307 place count 700 transition count 888
Discarding 87 places :
Symmetric choice reduction at 3 with 87 rule applications. Total rules 2394 place count 613 transition count 801
Deduced a syphon composed of 275 places in 1 ms
Iterating global reduction 3 with 87 rules applied. Total rules applied 2481 place count 613 transition count 801
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 296 places in 0 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 2502 place count 613 transition count 843
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2523 place count 592 transition count 801
Deduced a syphon composed of 275 places in 0 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 2544 place count 592 transition count 801
Deduced a syphon composed of 275 places in 0 ms
Applied a total of 2544 rules in 242 ms. Remains 592 /1376 variables (removed 784) and now considering 801/1271 (removed 470) transitions.
[2021-05-10 20:25:38] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 801 rows 592 cols
[2021-05-10 20:25:38] [INFO ] Computed 85 place invariants in 4 ms
[2021-05-10 20:25:38] [INFO ] Dead Transitions using invariants and state equation in 296 ms returned []
Finished structural reductions, in 1 iterations. Remains : 592/1376 places, 801/1271 transitions.
Product exploration explored 100000 steps with 3932 reset in 692 ms.
Product exploration explored 100000 steps with 3948 reset in 689 ms.
[2021-05-10 20:25:40] [INFO ] Flatten gal took : 32 ms
[2021-05-10 20:25:40] [INFO ] Flatten gal took : 33 ms
[2021-05-10 20:25:40] [INFO ] Time to serialize gal into /tmp/LTL7560291255962739183.gal : 5 ms
[2021-05-10 20:25:40] [INFO ] Time to serialize properties into /tmp/LTL17641572865870518945.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7560291255962739183.gal, -t, CGAL, -LTL, /tmp/LTL17641572865870518945.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7560291255962739183.gal -t CGAL -LTL /tmp/LTL17641572865870518945.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((((((((((((((((((((((((((((((((((((((((((p3_32>=1)||(p3_33>=1))||(p3_34>=1))||(p3_35>=1))||(p3_36>=1))||(p3_37>=1))||(p3_38>=1))||(p3_39>=1))||(p3_24>=1))||(p3_25>=1))||(p3_26>=1))||(p3_27>=1))||(p3_28>=1))||(p3_29>=1))||(p3_30>=1))||(p3_31>=1))||(p3_40>=1))||(p3_41>=1))||(p3_0>=1))||(p3_1>=1))||(p3_2>=1))||(p3_3>=1))||(p3_4>=1))||(p3_5>=1))||(p3_6>=1))||(p3_7>=1))||(p3_16>=1))||(p3_17>=1))||(p3_18>=1))||(p3_19>=1))||(p3_20>=1))||(p3_21>=1))||(p3_22>=1))||(p3_23>=1))||(p3_8>=1))||(p3_9>=1))||(p3_10>=1))||(p3_11>=1))||(p3_12>=1))||(p3_13>=1))||(p3_14>=1))||(p3_15>=1))"))||(X("(((((((((((((((((((((((((((((((((((((((((((l0_1<1)&&(l0_0<1))&&(l0_3<1))&&(l0_2<1))&&(l0_5<1))&&(l0_4<1))&&(l0_7<1))&&(l0_6<1))&&(l0_9<1))&&(l0_8<1))&&(l0_11<1))&&(l0_10<1))&&(l0_13<1))&&(l0_12<1))&&(l0_15<1))&&(l0_14<1))&&(l0_17<1))&&(l0_16<1))&&(l0_19<1))&&(l0_18<1))&&(l0_20<1))&&((((((((((((((((((((((((((((((((((((((((((p3_32>=1)||(p3_33>=1))||(p3_34>=1))||(p3_35>=1))||(p3_36>=1))||(p3_37>=1))||(p3_38>=1))||(p3_39>=1))||(p3_24>=1))||(p3_25>=1))||(p3_26>=1))||(p3_27>=1))||(p3_28>=1))||(p3_29>=1))||(p3_30>=1))||(p3_31>=1))||(p3_40>=1))||(p3_41>=1))||(p3_0>=1))||(p3_1>=1))||(p3_2>=1))||(p3_3>=1))||(p3_4>=1))||(p3_5>=1))||(p3_6>=1))||(p3_7>=1))||(p3_16>=1))||(p3_17>=1))||(p3_18>=1))||(p3_19>=1))||(p3_20>=1))||(p3_21>=1))||(p3_22>=1))||(p3_23>=1))||(p3_8>=1))||(p3_9>=1))||(p3_10>=1))||(p3_11>=1))||(p3_12>=1))||(p3_13>=1))||(p3_14>=1))||(p3_15>=1)))&&(l13_7<1))&&(l13_6<1))&&(l13_5<1))&&(l13_4<1))&&(l13_11<1))&&(l13_10<1))&&(l13_9<1))&&(l13_8<1))&&(l13_15<1))&&(l13_14<1))&&(l13_13<1))&&(l13_12<1))&&(l13_19<1))&&(l13_18<1))&&(l13_17<1))&&(l13_16<1))&&(l13_20<1))&&(l13_3<1))&&(l13_2<1))&&(l13_1<1))&&(l13_0<1))"))))
Formula 0 simplified : !(F"((((((((((((((((((((((((((((((((((((((((((p3_32>=1)||(p3_33>=1))||(p3_34>=1))||(p3_35>=1))||(p3_36>=1))||(p3_37>=1))||(p3_38>=1))||(p3_39>=1))||(p3_24>=1))||(p3_25>=1))||(p3_26>=1))||(p3_27>=1))||(p3_28>=1))||(p3_29>=1))||(p3_30>=1))||(p3_31>=1))||(p3_40>=1))||(p3_41>=1))||(p3_0>=1))||(p3_1>=1))||(p3_2>=1))||(p3_3>=1))||(p3_4>=1))||(p3_5>=1))||(p3_6>=1))||(p3_7>=1))||(p3_16>=1))||(p3_17>=1))||(p3_18>=1))||(p3_19>=1))||(p3_20>=1))||(p3_21>=1))||(p3_22>=1))||(p3_23>=1))||(p3_8>=1))||(p3_9>=1))||(p3_10>=1))||(p3_11>=1))||(p3_12>=1))||(p3_13>=1))||(p3_14>=1))||(p3_15>=1))" | X"(((((((((((((((((((((((((((((((((((((((((((l0_1<1)&&(l0_0<1))&&(l0_3<1))&&(l0_2<1))&&(l0_5<1))&&(l0_4<1))&&(l0_7<1))&&(l0_6<1))&&(l0_9<1))&&(l0_8<1))&&(l0_11<1))&&(l0_10<1))&&(l0_13<1))&&(l0_12<1))&&(l0_15<1))&&(l0_14<1))&&(l0_17<1))&&(l0_16<1))&&(l0_19<1))&&(l0_18<1))&&(l0_20<1))&&((((((((((((((((((((((((((((((((((((((((((p3_32>=1)||(p3_33>=1))||(p3_34>=1))||(p3_35>=1))||(p3_36>=1))||(p3_37>=1))||(p3_38>=1))||(p3_39>=1))||(p3_24>=1))||(p3_25>=1))||(p3_26>=1))||(p3_27>=1))||(p3_28>=1))||(p3_29>=1))||(p3_30>=1))||(p3_31>=1))||(p3_40>=1))||(p3_41>=1))||(p3_0>=1))||(p3_1>=1))||(p3_2>=1))||(p3_3>=1))||(p3_4>=1))||(p3_5>=1))||(p3_6>=1))||(p3_7>=1))||(p3_16>=1))||(p3_17>=1))||(p3_18>=1))||(p3_19>=1))||(p3_20>=1))||(p3_21>=1))||(p3_22>=1))||(p3_23>=1))||(p3_8>=1))||(p3_9>=1))||(p3_10>=1))||(p3_11>=1))||(p3_12>=1))||(p3_13>=1))||(p3_14>=1))||(p3_15>=1)))&&(l13_7<1))&&(l13_6<1))&&(l13_5<1))&&(l13_4<1))&&(l13_11<1))&&(l13_10<1))&&(l13_9<1))&&(l13_8<1))&&(l13_15<1))&&(l13_14<1))&&(l13_13<1))&&(l13_12<1))&&(l13_19<1))&&(l13_18<1))&&(l13_17<1))&&(l13_16<1))&&(l13_20<1))&&(l13_3<1))&&(l13_2<1))&&(l13_1<1))&&(l13_0<1))")
Detected timeout of ITS tools.
[2021-05-10 20:25:55] [INFO ] Flatten gal took : 29 ms
[2021-05-10 20:25:55] [INFO ] Applying decomposition
[2021-05-10 20:25:55] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4359138727753059800.txt, -o, /tmp/graph4359138727753059800.bin, -w, /tmp/graph4359138727753059800.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4359138727753059800.bin, -l, -1, -v, -w, /tmp/graph4359138727753059800.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 20:25:55] [INFO ] Decomposing Gal with order
[2021-05-10 20:25:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 20:25:55] [INFO ] Removed a total of 40 redundant transitions.
[2021-05-10 20:25:55] [INFO ] Flatten gal took : 86 ms
[2021-05-10 20:25:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-10 20:25:55] [INFO ] Time to serialize gal into /tmp/LTL13462704648418383683.gal : 23 ms
[2021-05-10 20:25:55] [INFO ] Time to serialize properties into /tmp/LTL17099464936368668462.ltl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13462704648418383683.gal, -t, CGAL, -LTL, /tmp/LTL17099464936368668462.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13462704648418383683.gal -t CGAL -LTL /tmp/LTL17099464936368668462.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("((((((((((((((((((((((((((((((((((((((((((i17.u408.p3_32>=1)||(i17.u466.p3_33>=1))||(i26.u409.p3_34>=1))||(i26.u410.p3_35>=1))||(i31.u411.p3_36>=1))||(i31.u467.p3_37>=1))||(i5.u468.p3_38>=1))||(i5.u412.p3_39>=1))||(i18.u463.p3_24>=1))||(i18.u403.p3_25>=1))||(i21.u404.p3_26>=1))||(i21.u405.p3_27>=1))||(i14.u464.p3_28>=1))||(i14.u406.p3_29>=1))||(i19.u407.p3_30>=1))||(i19.u465.p3_31>=1))||(i11.u469.p3_40>=1))||(i11.u470.p3_41>=1))||(i25.i1.i1.i1.u387.p3_0>=1))||(i25.i1.i1.i0.u455.p3_1>=1))||(i0.u456.p3_2>=1))||(i0.u457.p3_3>=1))||(i24.u458.p3_4>=1))||(i24.u388.p3_5>=1))||(i20.u389.p3_6>=1))||(i20.u390.p3_7>=1))||(i27.u396.p3_16>=1))||(i27.u397.p3_17>=1))||(i15.u398.p3_18>=1))||(i15.u399.p3_19>=1))||(i12.u400.p3_20>=1))||(i12.u401.p3_21>=1))||(i29.u462.p3_22>=1))||(i29.u402.p3_23>=1))||(i1.u391.p3_8>=1))||(i1.u459.p3_9>=1))||(i22.u392.p3_10>=1))||(i22.u393.p3_11>=1))||(i23.u394.p3_12>=1))||(i23.u460.p3_13>=1))||(i16.u461.p3_14>=1))||(i16.u395.p3_15>=1))"))||(X("(((((((((((((((((((((((((((((((((((((((((((i0.u22.l0_1<1)&&(i25.i0.i0.i0.u0.l0_0<1))&&(i20.u23.l0_3<1))&&(i24.u1.l0_2<1))&&(i22.u2.l0_5<1))&&(i1.u24.l0_4<1))&&(i16.u4.l0_7<1))&&(i23.u3.l0_6<1))&&(i15.u26.l0_9<1))&&(i27.u25.l0_8<1))&&(i29.u28.l0_11<1))&&(i12.u27.l0_10<1))&&(i21.u30.l0_13<1))&&(i13.u29.l0_12<1))&&(i19.u31.l0_15<1))&&(i14.u6.l0_14<1))&&(i26.u32.l0_17<1))&&(i17.u7.l0_16<1))&&(i5.u34.l0_19<1))&&(i31.u33.l0_18<1))&&(i11.u8.l0_20<1))&&((((((((((((((((((((((((((((((((((((((((((i17.u408.p3_32>=1)||(i17.u466.p3_33>=1))||(i26.u409.p3_34>=1))||(i26.u410.p3_35>=1))||(i31.u411.p3_36>=1))||(i31.u467.p3_37>=1))||(i5.u468.p3_38>=1))||(i5.u412.p3_39>=1))||(i18.u463.p3_24>=1))||(i18.u403.p3_25>=1))||(i21.u404.p3_26>=1))||(i21.u405.p3_27>=1))||(i14.u464.p3_28>=1))||(i14.u406.p3_29>=1))||(i19.u407.p3_30>=1))||(i19.u465.p3_31>=1))||(i11.u469.p3_40>=1))||(i11.u470.p3_41>=1))||(i25.i1.i1.i1.u387.p3_0>=1))||(i25.i1.i1.i0.u455.p3_1>=1))||(i0.u456.p3_2>=1))||(i0.u457.p3_3>=1))||(i24.u458.p3_4>=1))||(i24.u388.p3_5>=1))||(i20.u389.p3_6>=1))||(i20.u390.p3_7>=1))||(i27.u396.p3_16>=1))||(i27.u397.p3_17>=1))||(i15.u398.p3_18>=1))||(i15.u399.p3_19>=1))||(i12.u400.p3_20>=1))||(i12.u401.p3_21>=1))||(i29.u462.p3_22>=1))||(i29.u402.p3_23>=1))||(i1.u391.p3_8>=1))||(i1.u459.p3_9>=1))||(i22.u392.p3_10>=1))||(i22.u393.p3_11>=1))||(i23.u394.p3_12>=1))||(i23.u460.p3_13>=1))||(i16.u461.p3_14>=1))||(i16.u395.p3_15>=1)))&&(i16.u12.l13_7<1))&&(i23.u314.l13_6<1))&&(i22.u321.l13_5<1))&&(i1.u320.l13_4<1))&&(i29.u15.l13_11<1))&&(i12.u322.l13_10<1))&&(i15.u331.l13_9<1))&&(i27.u13.l13_8<1))&&(i19.u335.l13_15<1))&&(i14.u17.l13_14<1))&&(i21.u334.l13_13<1))&&(i13.u16.l13_12<1))&&(i5.u20.l13_19<1))&&(i31.u324.l13_18<1))&&(i26.u19.l13_17<1))&&(i17.u323.l13_16<1))&&(i11.u21.l13_20<1))&&(i20.u10.l13_3<1))&&(i24.u326.l13_2<1))&&(i0.u9.l13_1<1))&&(i25.i1.i0.i1.u311.l13_0<1))"))))
Formula 0 simplified : !(F"((((((((((((((((((((((((((((((((((((((((((i17.u408.p3_32>=1)||(i17.u466.p3_33>=1))||(i26.u409.p3_34>=1))||(i26.u410.p3_35>=1))||(i31.u411.p3_36>=1))||(i31.u467.p3_37>=1))||(i5.u468.p3_38>=1))||(i5.u412.p3_39>=1))||(i18.u463.p3_24>=1))||(i18.u403.p3_25>=1))||(i21.u404.p3_26>=1))||(i21.u405.p3_27>=1))||(i14.u464.p3_28>=1))||(i14.u406.p3_29>=1))||(i19.u407.p3_30>=1))||(i19.u465.p3_31>=1))||(i11.u469.p3_40>=1))||(i11.u470.p3_41>=1))||(i25.i1.i1.i1.u387.p3_0>=1))||(i25.i1.i1.i0.u455.p3_1>=1))||(i0.u456.p3_2>=1))||(i0.u457.p3_3>=1))||(i24.u458.p3_4>=1))||(i24.u388.p3_5>=1))||(i20.u389.p3_6>=1))||(i20.u390.p3_7>=1))||(i27.u396.p3_16>=1))||(i27.u397.p3_17>=1))||(i15.u398.p3_18>=1))||(i15.u399.p3_19>=1))||(i12.u400.p3_20>=1))||(i12.u401.p3_21>=1))||(i29.u462.p3_22>=1))||(i29.u402.p3_23>=1))||(i1.u391.p3_8>=1))||(i1.u459.p3_9>=1))||(i22.u392.p3_10>=1))||(i22.u393.p3_11>=1))||(i23.u394.p3_12>=1))||(i23.u460.p3_13>=1))||(i16.u461.p3_14>=1))||(i16.u395.p3_15>=1))" | X"(((((((((((((((((((((((((((((((((((((((((((i0.u22.l0_1<1)&&(i25.i0.i0.i0.u0.l0_0<1))&&(i20.u23.l0_3<1))&&(i24.u1.l0_2<1))&&(i22.u2.l0_5<1))&&(i1.u24.l0_4<1))&&(i16.u4.l0_7<1))&&(i23.u3.l0_6<1))&&(i15.u26.l0_9<1))&&(i27.u25.l0_8<1))&&(i29.u28.l0_11<1))&&(i12.u27.l0_10<1))&&(i21.u30.l0_13<1))&&(i13.u29.l0_12<1))&&(i19.u31.l0_15<1))&&(i14.u6.l0_14<1))&&(i26.u32.l0_17<1))&&(i17.u7.l0_16<1))&&(i5.u34.l0_19<1))&&(i31.u33.l0_18<1))&&(i11.u8.l0_20<1))&&((((((((((((((((((((((((((((((((((((((((((i17.u408.p3_32>=1)||(i17.u466.p3_33>=1))||(i26.u409.p3_34>=1))||(i26.u410.p3_35>=1))||(i31.u411.p3_36>=1))||(i31.u467.p3_37>=1))||(i5.u468.p3_38>=1))||(i5.u412.p3_39>=1))||(i18.u463.p3_24>=1))||(i18.u403.p3_25>=1))||(i21.u404.p3_26>=1))||(i21.u405.p3_27>=1))||(i14.u464.p3_28>=1))||(i14.u406.p3_29>=1))||(i19.u407.p3_30>=1))||(i19.u465.p3_31>=1))||(i11.u469.p3_40>=1))||(i11.u470.p3_41>=1))||(i25.i1.i1.i1.u387.p3_0>=1))||(i25.i1.i1.i0.u455.p3_1>=1))||(i0.u456.p3_2>=1))||(i0.u457.p3_3>=1))||(i24.u458.p3_4>=1))||(i24.u388.p3_5>=1))||(i20.u389.p3_6>=1))||(i20.u390.p3_7>=1))||(i27.u396.p3_16>=1))||(i27.u397.p3_17>=1))||(i15.u398.p3_18>=1))||(i15.u399.p3_19>=1))||(i12.u400.p3_20>=1))||(i12.u401.p3_21>=1))||(i29.u462.p3_22>=1))||(i29.u402.p3_23>=1))||(i1.u391.p3_8>=1))||(i1.u459.p3_9>=1))||(i22.u392.p3_10>=1))||(i22.u393.p3_11>=1))||(i23.u394.p3_12>=1))||(i23.u460.p3_13>=1))||(i16.u461.p3_14>=1))||(i16.u395.p3_15>=1)))&&(i16.u12.l13_7<1))&&(i23.u314.l13_6<1))&&(i22.u321.l13_5<1))&&(i1.u320.l13_4<1))&&(i29.u15.l13_11<1))&&(i12.u322.l13_10<1))&&(i15.u331.l13_9<1))&&(i27.u13.l13_8<1))&&(i19.u335.l13_15<1))&&(i14.u17.l13_14<1))&&(i21.u334.l13_13<1))&&(i13.u16.l13_12<1))&&(i5.u20.l13_19<1))&&(i31.u324.l13_18<1))&&(i26.u19.l13_17<1))&&(i17.u323.l13_16<1))&&(i11.u21.l13_20<1))&&(i20.u10.l13_3<1))&&(i24.u326.l13_2<1))&&(i0.u9.l13_1<1))&&(i25.i1.i0.i1.u311.l13_0<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6153357017331067497
[2021-05-10 20:26:10] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6153357017331067497
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6153357017331067497]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6153357017331067497] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6153357017331067497] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property FamilyReunion-COL-L00020M0002C001P001G001-10 finished in 51604 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((p0 U G((F(p1)||(p2&&X(p0)))))))))], workingDir=/home/mcc/execution]
Support contains 315 out of 2719 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2719/2719 places, 2500/2500 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 2656 transition count 2500
Discarding 147 places :
Symmetric choice reduction at 1 with 147 rule applications. Total rules 210 place count 2509 transition count 2353
Iterating global reduction 1 with 147 rules applied. Total rules applied 357 place count 2509 transition count 2353
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 422 place count 2444 transition count 2228
Iterating global reduction 1 with 65 rules applied. Total rules applied 487 place count 2444 transition count 2228
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 1 with 63 rules applied. Total rules applied 550 place count 2402 transition count 2207
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 614 place count 2338 transition count 2123
Iterating global reduction 2 with 64 rules applied. Total rules applied 678 place count 2338 transition count 2123
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 741 place count 2275 transition count 2060
Iterating global reduction 2 with 63 rules applied. Total rules applied 804 place count 2275 transition count 2060
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 846 place count 2233 transition count 2018
Iterating global reduction 2 with 42 rules applied. Total rules applied 888 place count 2233 transition count 2018
Applied a total of 888 rules in 592 ms. Remains 2233 /2719 variables (removed 486) and now considering 2018/2500 (removed 482) transitions.
// Phase 1: matrix 2018 rows 2233 cols
[2021-05-10 20:26:12] [INFO ] Computed 340 place invariants in 15 ms
[2021-05-10 20:26:13] [INFO ] Implicit Places using invariants in 633 ms returned [147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 905, 906, 907, 908, 909, 910, 911, 912, 913, 914, 915, 916, 917, 918, 919, 920, 921, 922, 923, 924, 925, 1347, 1348, 1349, 1350, 1351, 1352, 1353, 1354, 1355, 1356, 1357, 1358, 1359, 1360, 1361, 1362, 1363, 1364, 1365, 1366, 1367, 1475, 1980]
Discarding 86 places :
Implicit Place search using SMT only with invariants took 636 ms to find 86 implicit places.
// Phase 1: matrix 2018 rows 2147 cols
[2021-05-10 20:26:13] [INFO ] Computed 254 place invariants in 11 ms
[2021-05-10 20:26:14] [INFO ] Dead Transitions using invariants and state equation in 1193 ms returned []
Starting structural reductions, iteration 1 : 2147/2719 places, 2018/2500 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2106 transition count 1977
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2106 transition count 1977
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 2086 transition count 1937
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 2086 transition count 1937
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 2066 transition count 1917
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 2066 transition count 1917
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 2046 transition count 1897
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 2046 transition count 1897
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 2026 transition count 1877
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 2026 transition count 1877
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 2006 transition count 1857
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 2006 transition count 1857
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1986 transition count 1837
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1986 transition count 1837
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1966 transition count 1817
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1966 transition count 1817
Applied a total of 362 rules in 620 ms. Remains 1966 /2147 variables (removed 181) and now considering 1817/2018 (removed 201) transitions.
// Phase 1: matrix 1817 rows 1966 cols
[2021-05-10 20:26:14] [INFO ] Computed 254 place invariants in 10 ms
[2021-05-10 20:26:15] [INFO ] Implicit Places using invariants in 392 ms returned []
// Phase 1: matrix 1817 rows 1966 cols
[2021-05-10 20:26:15] [INFO ] Computed 254 place invariants in 10 ms
[2021-05-10 20:26:16] [INFO ] Implicit Places using invariants and state equation in 1339 ms returned []
Implicit Place search using SMT with State Equation took 1733 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1966/2719 places, 1817/2500 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p1) p2 (NOT p0)))]
Running random walk in product with property : FamilyReunion-COL-L00020M0002C001P001G001-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (AND (GEQ s928 1) (GEQ s993 1)) (AND (GEQ s950 1) (GEQ s1015 1)) (AND (GEQ s938 1) (GEQ s1003 1)) (AND (GEQ s982 1) (GEQ s1047 1)) (AND (GEQ s980 1) (GEQ s1045 1)) (AND (GEQ s960 1) (GEQ s1025 1)) (AND (GEQ s970 1) (GEQ s1035 1)) (AND (GEQ s948 1) (GEQ s1013 1)) (AND (GEQ s940 1) (GEQ s1005 1)) (AND (GEQ s935 1) (GEQ s1000 1)) (AND (GEQ s987 1) (GEQ s1052 1)) (AND (GEQ s943 1) (GEQ s1008 1)) (AND (GEQ s955 1) (GEQ s1020 1)) (AND (GEQ s963 1) (GEQ s1028 1)) (AND (GEQ s967 1) (GEQ s1032 1)) (AND (GEQ s975 1) (GEQ s1040 1)) (AND (GEQ s931 1) (GEQ s996 1)) (AND (GEQ s942 1) (GEQ s1007 1)) (AND (GEQ s958 1) (GEQ s1023 1)) (AND (GEQ s988 1) (GEQ s1053 1)) (AND (GEQ s972 1) (GEQ s1037 1)) (AND (GEQ s974 1) (GEQ s1039 1)) (AND (GEQ s985 1) (GEQ s1050 1)) (AND (GEQ s929 1) (GEQ s994 1)) (AND (GEQ s937 1) (GEQ s1002 1)) (AND (GEQ s945 1) (GEQ s1010 1)) (AND (GEQ s953 1) (GEQ s1018 1)) (AND (GEQ s961 1) (GEQ s1026 1)) (AND (GEQ s969 1) (GEQ s1034 1)) (AND (GEQ s977 1) (GEQ s1042 1)) (AND (GEQ s981 1) (GEQ s1046 1)) (AND (GEQ s944 1) (GEQ s1009 1)) (AND (GEQ s939 1) (GEQ s1004 1)) (AND (GEQ s954 1) (GEQ s1019 1)) (AND (GEQ s934 1) (GEQ s999 1)) (AND (GEQ s986 1) (GEQ s1051 1)) (AND (GEQ s966 1) (GEQ s1031 1)) (AND (GEQ s964 1) (GEQ s1029 1)) (AND (GEQ s976 1) (GEQ s1041 1)) (AND (GEQ s956 1) (GEQ s1021 1)) (AND (GEQ s927 1) (GEQ s992 1)) (AND (GEQ s932 1) (GEQ s997 1)) (AND (GEQ s979 1) (GEQ s1044 1)) (AND (GEQ s983 1) (GEQ s1048 1)) (AND (GEQ s947 1) (GEQ s1012 1)) (AND (GEQ s951 1) (GEQ s1016 1)) (AND (GEQ s959 1) (GEQ s1024 1)) (AND (GEQ s971 1) (GEQ s1036 1)) (AND (GEQ s952 1) (GEQ s1017 1)) (AND (GEQ s989 1) (GEQ s1054 1)) (AND (GEQ s936 1) (GEQ s1001 1)) (AND (GEQ s946 1) (GEQ s1011 1)) (AND (GEQ s930 1) (GEQ s995 1)) (AND (GEQ s984 1) (GEQ s1049 1)) (AND (GEQ s962 1) (GEQ s1027 1)) (AND (GEQ s968 1) (GEQ s1033 1)) (AND (GEQ s978 1) (GEQ s1043 1)) (AND (GEQ s933 1) (GEQ s998 1)) (AND (GEQ s949 1) (GEQ s1014 1)) (AND (GEQ s941 1) (GEQ s1006 1)) (AND (GEQ s957 1) (GEQ s1022 1)) (AND (GEQ s965 1) (GEQ s1030 1)) (AND (GEQ s973 1) (GEQ s1038 1))), p1:(OR (AND (GEQ s782 1) (GEQ s845 1)) (AND (GEQ s745 1) (GEQ s808 1)) (AND (GEQ s777 1) (GEQ s840 1)) (AND (GEQ s750 1) (GEQ s813 1)) (AND (GEQ s740 1) (GEQ s803 1)) (AND (GEQ s755 1) (GEQ s818 1)) (AND (GEQ s767 1) (GEQ s830 1)) (AND (GEQ s797 1) (GEQ s860 1)) (AND (GEQ s799 1) (GEQ s862 1)) (AND (GEQ s787 1) (GEQ s850 1)) (AND (GEQ s757 1) (GEQ s820 1)) (AND (GEQ s765 1) (GEQ s828 1)) (AND (GEQ s760 1) (GEQ s823 1)) (AND (GEQ s752 1) (GEQ s815 1)) (AND (GEQ s792 1) (GEQ s855 1)) (AND (GEQ s784 1) (GEQ s847 1)) (AND (GEQ s780 1) (GEQ s843 1)) (AND (GEQ s772 1) (GEQ s835 1)) (AND (GEQ s748 1) (GEQ s811 1)) (AND (GEQ s759 1) (GEQ s822 1)) (AND (GEQ s743 1) (GEQ s806 1)) (AND (GEQ s775 1) (GEQ s838 1)) (AND (GEQ s791 1) (GEQ s854 1)) (AND (GEQ s789 1) (GEQ s852 1)) (AND (GEQ s794 1) (GEQ s857 1)) (AND (GEQ s786 1) (GEQ s849 1)) (AND (GEQ s778 1) (GEQ s841 1)) (AND (GEQ s770 1) (GEQ s833 1)) (AND (GEQ s762 1) (GEQ s825 1)) (AND (GEQ s754 1) (GEQ s817 1)) (AND (GEQ s746 1) (GEQ s809 1)) (AND (GEQ s738 1) (GEQ s801 1)) (AND (GEQ s761 1) (GEQ s824 1)) (AND (GEQ s798 1) (GEQ s861 1)) (AND (GEQ s766 1) (GEQ s829 1)) (AND (GEQ s756 1) (GEQ s819 1)) (AND (GEQ s751 1) (GEQ s814 1)) (AND (GEQ s771 1) (GEQ s834 1)) (AND (GEQ s793 1) (GEQ s856 1)) (AND (GEQ s783 1) (GEQ s846 1)) (AND (GEQ s781 1) (GEQ s844 1)) (AND (GEQ s749 1) (GEQ s812 1)) (AND (GEQ s773 1) (GEQ s836 1)) (AND (GEQ s744 1) (GEQ s807 1)) (AND (GEQ s741 1) (GEQ s804 1)) (AND (GEQ s796 1) (GEQ s859 1)) (AND (GEQ s788 1) (GEQ s851 1)) (AND (GEQ s776 1) (GEQ s839 1)) (AND (GEQ s764 1) (GEQ s827 1)) (AND (GEQ s768 1) (GEQ s831 1)) (AND (GEQ s753 1) (GEQ s816 1)) (AND (GEQ s790 1) (GEQ s853 1)) (AND (GEQ s774 1) (GEQ s837 1)) (AND (GEQ s769 1) (GEQ s832 1)) (AND (GEQ s758 1) (GEQ s821 1)) (AND (GEQ s737 1) (GEQ s800 1)) (AND (GEQ s742 1) (GEQ s805 1)) (AND (GEQ s747 1) (GEQ s810 1)) (AND (GEQ s779 1) (GEQ s842 1)) (AND (GEQ s763 1) (GEQ s826 1)) (AND (GEQ s795 1) (GEQ s858 1)) (AND (GEQ s785 1) (GEQ s848 1)) (AND (GEQ s739 1) (GEQ s802 1))), p2:(OR (AND (GEQ s617 1) (GEQ s729 1)) (AND (GEQ s627 1) (GEQ s734 1)) (AND (GEQ s602 1) (GEQ s722 1)) (AND (GEQ s622 1) (GEQ s732 1)) (AND (GEQ s597 1) (GEQ s719 1)) (AND (GEQ s592 1) (GEQ s717 1)) (AND (GEQ s591 1) (GEQ s716 1)) (AND (GEQ s601 1) (GEQ s721 1)) (AND (GEQ s607 1) (GEQ s724 1)) (AND (GEQ s613 1) (GEQ s727 1)) (AND (GEQ s611 1) (GEQ s726 1)) (AND (GEQ s598 1) (GEQ s720 1)) (AND (GEQ s626 1) (GEQ s734 1)) (AND (GEQ s590 1) (GEQ s716 1)) (AND (GEQ s623 1) (GEQ s732 1)) (AND (GEQ s593 1) (GEQ s717 1)) (AND (GEQ s631 1) (GEQ s736 1)) (AND (GEQ s610 1) (GEQ s726 1)) (AND (GEQ s606 1) (GEQ s724 1)) (AND (GEQ s618 1) (GEQ s730 1)) (AND (GEQ s614 1) (GEQ s728 1)) (AND (GEQ s599 1) (GEQ s720 1)) (AND (GEQ s604 1) (GEQ s723 1)) (AND (GEQ s630 1) (GEQ s736 1)) (AND (GEQ s594 1) (GEQ s718 1)) (AND (GEQ s615 1) (GEQ s728 1)) (AND (GEQ s629 1) (GEQ s735 1)) (AND (GEQ s605 1) (GEQ s723 1)) (AND (GEQ s619 1) (GEQ s730 1)) (AND (GEQ s625 1) (GEQ s733 1)) (AND (GEQ s609 1) (GEQ s725 1)) (AND (GEQ s603 1) (GEQ s722 1)) (AND (GEQ s608 1) (GEQ s725 1)) (AND (GEQ s621 1) (GEQ s731 1)) (AND (GEQ s595 1) (GEQ s718 1)) (AND (GEQ s628 1) (GEQ s735 1)) (AND (GEQ s596 1) (GEQ s719 1)) (AND (GEQ s600 1) (GEQ s721 1)) (AND (GEQ s620 1) (GEQ s731 1)) (AND (GEQ s624 1) (GEQ s733 1)) (AND (GEQ s616 1) (GEQ s729 1)) (AND (GEQ s612 1) (GEQ s727 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1038 reset in 605 ms.
Product exploration explored 100000 steps with 1034 reset in 647 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1966 transition count 1817
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2))), (NOT p0), (NOT p1), (NOT p2)]
Adopting property with smaller alphabet thanks to knowledge :(F (G (NOT p2)))
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 189 out of 1966 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1966/1966 places, 1817/1817 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 1903 transition count 1817
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 105 place count 1861 transition count 1775
Iterating global reduction 1 with 42 rules applied. Total rules applied 147 place count 1861 transition count 1775
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 189 place count 1819 transition count 1733
Iterating global reduction 1 with 42 rules applied. Total rules applied 231 place count 1819 transition count 1733
Applied a total of 231 rules in 191 ms. Remains 1819 /1966 variables (removed 147) and now considering 1733/1817 (removed 84) transitions.
// Phase 1: matrix 1733 rows 1819 cols
[2021-05-10 20:26:19] [INFO ] Computed 191 place invariants in 9 ms
[2021-05-10 20:26:19] [INFO ] Implicit Places using invariants in 356 ms returned []
// Phase 1: matrix 1733 rows 1819 cols
[2021-05-10 20:26:19] [INFO ] Computed 191 place invariants in 10 ms
[2021-05-10 20:26:20] [INFO ] Implicit Places using invariants and state equation in 1149 ms returned []
Implicit Place search using SMT with State Equation took 1506 ms to find 0 implicit places.
// Phase 1: matrix 1733 rows 1819 cols
[2021-05-10 20:26:20] [INFO ] Computed 191 place invariants in 10 ms
[2021-05-10 20:26:21] [INFO ] Dead Transitions using invariants and state equation in 857 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1819/1966 places, 1733/1817 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 1037 reset in 741 ms.
Product exploration explored 100000 steps with 1025 reset in 764 ms.
Applying partial POR strategy [true, true]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 189 out of 1819 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1819/1819 places, 1733/1733 transitions.
Performed 528 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 528 rules applied. Total rules applied 528 place count 1819 transition count 1733
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 530 place count 1819 transition count 1732
Performed 612 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 612 Pre rules applied. Total rules applied 530 place count 1819 transition count 2047
Deduced a syphon composed of 1141 places in 1 ms
Iterating global reduction 2 with 612 rules applied. Total rules applied 1142 place count 1819 transition count 2047
Discarding 592 places :
Symmetric choice reduction at 2 with 592 rule applications. Total rules 1734 place count 1227 transition count 1455
Deduced a syphon composed of 549 places in 0 ms
Iterating global reduction 2 with 592 rules applied. Total rules applied 2326 place count 1227 transition count 1455
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 635 places in 0 ms
Iterating global reduction 2 with 86 rules applied. Total rules applied 2412 place count 1227 transition count 1455
Discarding 87 places :
Symmetric choice reduction at 2 with 87 rule applications. Total rules 2499 place count 1140 transition count 1368
Deduced a syphon composed of 548 places in 1 ms
Iterating global reduction 2 with 87 rules applied. Total rules applied 2586 place count 1140 transition count 1368
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 569 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 2607 place count 1140 transition count 1452
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 2628 place count 1119 transition count 1410
Deduced a syphon composed of 548 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 2649 place count 1119 transition count 1410
Deduced a syphon composed of 548 places in 0 ms
Applied a total of 2649 rules in 281 ms. Remains 1119 /1819 variables (removed 700) and now considering 1410/1733 (removed 323) transitions.
[2021-05-10 20:26:23] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1410 rows 1119 cols
[2021-05-10 20:26:23] [INFO ] Computed 191 place invariants in 8 ms
[2021-05-10 20:26:24] [INFO ] Dead Transitions using invariants and state equation in 707 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1119/1819 places, 1410/1733 transitions.
Product exploration explored 100000 steps with 4536 reset in 845 ms.
Product exploration explored 100000 steps with 4507 reset in 826 ms.
Starting structural reductions, iteration 0 : 1966/1966 places, 1817/1817 transitions.
Applied a total of 0 rules in 66 ms. Remains 1966 /1966 variables (removed 0) and now considering 1817/1817 (removed 0) transitions.
// Phase 1: matrix 1817 rows 1966 cols
[2021-05-10 20:26:26] [INFO ] Computed 254 place invariants in 9 ms
[2021-05-10 20:26:26] [INFO ] Implicit Places using invariants in 396 ms returned []
// Phase 1: matrix 1817 rows 1966 cols
[2021-05-10 20:26:26] [INFO ] Computed 254 place invariants in 9 ms
[2021-05-10 20:26:27] [INFO ] Implicit Places using invariants and state equation in 1218 ms returned []
Implicit Place search using SMT with State Equation took 1615 ms to find 0 implicit places.
// Phase 1: matrix 1817 rows 1966 cols
[2021-05-10 20:26:27] [INFO ] Computed 254 place invariants in 11 ms
[2021-05-10 20:26:28] [INFO ] Dead Transitions using invariants and state equation in 1041 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1966/1966 places, 1817/1817 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:789)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:835)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:825)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
BK_STOP 1620678390351
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="FamilyReunion-COL-L00020M0002C001P001G001"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is FamilyReunion-COL-L00020M0002C001P001G001, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875900853"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00020M0002C001P001G001.tgz
mv FamilyReunion-COL-L00020M0002C001P001G001 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;