Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r169-tall-167838855800404.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855800404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 29K Feb 26 11:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 214K Feb 26 11:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 74K Feb 26 11:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 290K Feb 26 11:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 62K Feb 26 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 423K Feb 26 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Feb 26 11:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 417K Feb 26 11:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.3K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:22 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-PT-L00020M0002C001P001G001-LTLFireability-00
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-01
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-02
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-03
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-04
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-05
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-06
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-07
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-08
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-09
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-10
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-11
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-12
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-14
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678537474081

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00020M0002C001P001G001
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 12:24:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 12:24:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 12:24:35] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2023-03-11 12:24:35] [INFO ] Transformed 3271 places.
[2023-03-11 12:24:35] [INFO ] Transformed 2753 transitions.
[2023-03-11 12:24:35] [INFO ] Parsed PT model containing 3271 places and 2753 transitions and 8446 arcs in 372 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 11 places and 0 transitions.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 485 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Reduce places removed 76 places and 0 transitions.
Discarding 313 places :
Implicit places reduction removed 313 places
Iterating post reduction 0 with 389 rules applied. Total rules applied 389 place count 2871 transition count 2753
Discarding 248 places :
Symmetric choice reduction at 1 with 248 rule applications. Total rules 637 place count 2623 transition count 2484
Iterating global reduction 1 with 248 rules applied. Total rules applied 885 place count 2623 transition count 2484
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 1 with 19 rules applied. Total rules applied 904 place count 2604 transition count 2484
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 1006 place count 2502 transition count 2382
Iterating global reduction 2 with 102 rules applied. Total rules applied 1108 place count 2502 transition count 2382
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 2 with 40 rules applied. Total rules applied 1148 place count 2482 transition count 2362
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 1189 place count 2441 transition count 2321
Iterating global reduction 3 with 41 rules applied. Total rules applied 1230 place count 2441 transition count 2321
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1231 place count 2440 transition count 2300
Iterating global reduction 3 with 1 rules applied. Total rules applied 1232 place count 2440 transition count 2300
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1251 place count 2421 transition count 2281
Iterating global reduction 3 with 19 rules applied. Total rules applied 1270 place count 2421 transition count 2281
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1289 place count 2402 transition count 2262
Iterating global reduction 3 with 19 rules applied. Total rules applied 1308 place count 2402 transition count 2262
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1327 place count 2383 transition count 2243
Iterating global reduction 3 with 19 rules applied. Total rules applied 1346 place count 2383 transition count 2243
Applied a total of 1346 rules in 1218 ms. Remains 2383 /3260 variables (removed 877) and now considering 2243/2753 (removed 510) transitions.
// Phase 1: matrix 2243 rows 2383 cols
[2023-03-11 12:24:37] [INFO ] Computed 346 place invariants in 98 ms
[2023-03-11 12:24:38] [INFO ] Implicit Places using invariants in 1053 ms returned [147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 821, 822, 823, 824, 825, 826, 827, 828, 829, 830, 831, 832, 833, 834, 835, 836, 837, 838, 839, 840, 841, 1356, 1357, 1358, 1359, 1360, 1361, 1362, 1363, 1364, 1365, 1366, 1367, 1368, 1369, 1370, 1371, 1372, 1373, 1374, 1375, 1572, 1573, 1574, 1575, 1576, 1577, 1578, 1579, 1580, 1581, 1582, 1583, 1584, 1585, 1586, 1587, 1588, 1589, 1590, 1591, 1592, 1636, 1833, 1834, 1835, 1836, 1837, 1838, 1839, 1840, 1841, 1842, 1843, 1844, 1845, 1846, 1847, 1848, 1849, 1850, 1851, 1852, 1853, 2213, 2214, 2215, 2216, 2217, 2219, 2220, 2221, 2223, 2224, 2225, 2226, 2227, 2228, 2229, 2230, 2231, 2232, 2233]
Discarding 124 places :
Implicit Place search using SMT only with invariants took 1083 ms to find 124 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2259/3260 places, 2243/2753 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 2220 transition count 2204
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 2220 transition count 2204
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 97 place count 2201 transition count 2166
Iterating global reduction 0 with 19 rules applied. Total rules applied 116 place count 2201 transition count 2166
Applied a total of 116 rules in 195 ms. Remains 2201 /2259 variables (removed 58) and now considering 2166/2243 (removed 77) transitions.
// Phase 1: matrix 2166 rows 2201 cols
[2023-03-11 12:24:38] [INFO ] Computed 222 place invariants in 61 ms
[2023-03-11 12:24:39] [INFO ] Implicit Places using invariants in 521 ms returned []
[2023-03-11 12:24:39] [INFO ] Invariant cache hit.
[2023-03-11 12:24:41] [INFO ] Implicit Places using invariants and state equation in 2644 ms returned []
Implicit Place search using SMT with State Equation took 3170 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2201/3260 places, 2166/2753 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5675 ms. Remains : 2201/3260 places, 2166/2753 transitions.
Support contains 485 out of 2201 places after structural reductions.
[2023-03-11 12:24:42] [INFO ] Flatten gal took : 140 ms
[2023-03-11 12:24:42] [INFO ] Flatten gal took : 99 ms
[2023-03-11 12:24:42] [INFO ] Input system was already deterministic with 2166 transitions.
Support contains 422 out of 2201 places (down from 485) after GAL structural reductions.
Finished random walk after 1547 steps, including 1 resets, run visited all 21 properties in 164 ms. (steps per millisecond=9 )
Computed a total of 2201 stabilizing places and 2166 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2201 transition count 2166
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 21 out of 2201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2201/2201 places, 2166/2166 transitions.
Graph (complete) has 2903 edges and 2201 vertex of which 913 are kept as prefixes of interest. Removing 1288 places using SCC suffix rule.10 ms
Discarding 1288 places :
Also discarding 1276 output transitions
Drop transitions removed 1276 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 65 places :
Implicit places reduction removed 65 places
Drop transitions removed 743 transitions
Trivial Post-agglo rules discarded 743 transitions
Performed 743 trivial Post agglomeration. Transition count delta: 743
Iterating post reduction 0 with 808 rules applied. Total rules applied 809 place count 827 transition count 126
Reduce places removed 743 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 783 rules applied. Total rules applied 1592 place count 84 transition count 86
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 38 rules applied. Total rules applied 1630 place count 65 transition count 67
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 1630 place count 65 transition count 48
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 1668 place count 46 transition count 48
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1670 place count 44 transition count 46
Iterating global reduction 3 with 2 rules applied. Total rules applied 1672 place count 44 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1674 place count 44 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1674 place count 44 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1678 place count 42 transition count 42
Applied a total of 1678 rules in 43 ms. Remains 42 /2201 variables (removed 2159) and now considering 42/2166 (removed 2124) transitions.
// Phase 1: matrix 42 rows 42 cols
[2023-03-11 12:24:43] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 12:24:43] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-11 12:24:43] [INFO ] Invariant cache hit.
[2023-03-11 12:24:43] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-11 12:24:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 12:24:43] [INFO ] Invariant cache hit.
[2023-03-11 12:24:43] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/2201 places, 42/2166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 42/2201 places, 42/2166 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s33 1) (GEQ s32 1) (GEQ s35 1) (GEQ s34 1) (GEQ s29 1) (GEQ s28 1) (GEQ s31 1) (GEQ s30 1) (GEQ s25 1) (GEQ s24 1) (GEQ s27 1) (GEQ s26 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 44 steps with 1 reset in 3 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-00 finished in 399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 63 out of 2201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2201/2201 places, 2166/2166 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 2135 transition count 2166
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 133 place count 2068 transition count 2059
Iterating global reduction 1 with 67 rules applied. Total rules applied 200 place count 2068 transition count 2059
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 285 place count 1983 transition count 1954
Iterating global reduction 1 with 85 rules applied. Total rules applied 370 place count 1983 transition count 1954
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 24 places :
Implicit places reduction removed 24 places
Iterating post reduction 1 with 46 rules applied. Total rules applied 416 place count 1959 transition count 1932
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 479 place count 1896 transition count 1829
Iterating global reduction 2 with 63 rules applied. Total rules applied 542 place count 1896 transition count 1829
Discarding 82 places :
Symmetric choice reduction at 2 with 82 rule applications. Total rules 624 place count 1814 transition count 1747
Iterating global reduction 2 with 82 rules applied. Total rules applied 706 place count 1814 transition count 1747
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 767 place count 1753 transition count 1686
Iterating global reduction 2 with 61 rules applied. Total rules applied 828 place count 1753 transition count 1686
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 889 place count 1692 transition count 1625
Iterating global reduction 2 with 61 rules applied. Total rules applied 950 place count 1692 transition count 1625
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 992 place count 1650 transition count 1583
Iterating global reduction 2 with 42 rules applied. Total rules applied 1034 place count 1650 transition count 1583
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1076 place count 1608 transition count 1541
Iterating global reduction 2 with 42 rules applied. Total rules applied 1118 place count 1608 transition count 1541
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1160 place count 1566 transition count 1499
Iterating global reduction 2 with 42 rules applied. Total rules applied 1202 place count 1566 transition count 1499
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1225 place count 1543 transition count 1476
Iterating global reduction 2 with 23 rules applied. Total rules applied 1248 place count 1543 transition count 1476
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1271 place count 1520 transition count 1453
Iterating global reduction 2 with 23 rules applied. Total rules applied 1294 place count 1520 transition count 1453
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1317 place count 1497 transition count 1430
Iterating global reduction 2 with 23 rules applied. Total rules applied 1340 place count 1497 transition count 1430
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1363 place count 1474 transition count 1407
Iterating global reduction 2 with 23 rules applied. Total rules applied 1386 place count 1474 transition count 1407
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1407 place count 1453 transition count 1386
Iterating global reduction 2 with 21 rules applied. Total rules applied 1428 place count 1453 transition count 1386
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1449 place count 1432 transition count 1365
Iterating global reduction 2 with 21 rules applied. Total rules applied 1470 place count 1432 transition count 1365
Applied a total of 1470 rules in 1237 ms. Remains 1432 /2201 variables (removed 769) and now considering 1365/2166 (removed 801) transitions.
// Phase 1: matrix 1365 rows 1432 cols
[2023-03-11 12:24:44] [INFO ] Computed 132 place invariants in 18 ms
[2023-03-11 12:24:44] [INFO ] Implicit Places using invariants in 313 ms returned [315, 600, 624, 667, 1242]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 315 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1427/2201 places, 1365/2166 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1425 transition count 1363
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1425 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1424 transition count 1361
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1424 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1423 transition count 1360
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1423 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1422 transition count 1359
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1422 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1421 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1421 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1420 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1420 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1419 transition count 1356
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1419 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1418 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1418 transition count 1355
Applied a total of 18 rules in 524 ms. Remains 1418 /1427 variables (removed 9) and now considering 1355/1365 (removed 10) transitions.
// Phase 1: matrix 1355 rows 1418 cols
[2023-03-11 12:24:45] [INFO ] Computed 127 place invariants in 9 ms
[2023-03-11 12:24:45] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-11 12:24:45] [INFO ] Invariant cache hit.
[2023-03-11 12:24:46] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1418/2201 places, 1355/2166 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3203 ms. Remains : 1418/2201 places, 1355/2166 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s170 1) (LT s168 1) (LT s174 1) (LT s172 1) (LT s178 1) (LT s176 1) (LT s182 1) (LT s180 1) (LT s186 1) (LT s184 1) (LT s190 1) (LT s188 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-01 finished in 3323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0)) U (G(p2)||p1))))'
Support contains 168 out of 2201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2201/2201 places, 2166/2166 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2198 transition count 2166
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 51 place count 2150 transition count 2078
Iterating global reduction 1 with 48 rules applied. Total rules applied 99 place count 2150 transition count 2078
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 165 place count 2084 transition count 1992
Iterating global reduction 1 with 66 rules applied. Total rules applied 231 place count 2084 transition count 1992
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 24 places :
Implicit places reduction removed 24 places
Iterating post reduction 1 with 46 rules applied. Total rules applied 277 place count 2060 transition count 1970
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 321 place count 2016 transition count 1886
Iterating global reduction 2 with 44 rules applied. Total rules applied 365 place count 2016 transition count 1886
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 428 place count 1953 transition count 1823
Iterating global reduction 2 with 63 rules applied. Total rules applied 491 place count 1953 transition count 1823
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 531 place count 1913 transition count 1783
Iterating global reduction 2 with 40 rules applied. Total rules applied 571 place count 1913 transition count 1783
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 611 place count 1873 transition count 1743
Iterating global reduction 2 with 40 rules applied. Total rules applied 651 place count 1873 transition count 1743
Applied a total of 651 rules in 886 ms. Remains 1873 /2201 variables (removed 328) and now considering 1743/2166 (removed 423) transitions.
// Phase 1: matrix 1743 rows 1873 cols
[2023-03-11 12:24:47] [INFO ] Computed 195 place invariants in 19 ms
[2023-03-11 12:24:48] [INFO ] Implicit Places using invariants in 431 ms returned [399, 1041, 1065, 1108, 1683]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 433 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1868/2201 places, 1743/2166 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1866 transition count 1741
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1866 transition count 1741
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1865 transition count 1739
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1865 transition count 1739
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1864 transition count 1738
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1864 transition count 1738
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1863 transition count 1737
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1863 transition count 1737
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1862 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1862 transition count 1736
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1861 transition count 1735
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1861 transition count 1735
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1860 transition count 1734
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1860 transition count 1734
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1859 transition count 1733
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1859 transition count 1733
Applied a total of 18 rules in 741 ms. Remains 1859 /1868 variables (removed 9) and now considering 1733/1743 (removed 10) transitions.
// Phase 1: matrix 1733 rows 1859 cols
[2023-03-11 12:24:48] [INFO ] Computed 190 place invariants in 17 ms
[2023-03-11 12:24:49] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-11 12:24:49] [INFO ] Invariant cache hit.
[2023-03-11 12:24:50] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1571 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1859/2201 places, 1733/2166 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3632 ms. Remains : 1859/2201 places, 1733/2166 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), p0, p0, (AND p0 (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s1709 1) (GEQ s1708 1) (GEQ s1711 1) (GEQ s1710 1) (GEQ s1705 1) (GEQ s1704 1) (GEQ s1707 1) (GEQ s1706 1) (GEQ s1701 1) (GEQ s1700 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 273 reset in 427 ms.
Product exploration explored 100000 steps with 269 reset in 357 ms.
Computed a total of 1859 stabilizing places and 1733 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1859 transition count 1733
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 618 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 140 steps, including 0 resets, run visited all 2 properties in 22 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 14 factoid took 649 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-11 12:24:53] [INFO ] Invariant cache hit.
[2023-03-11 12:24:55] [INFO ] [Real]Absence check using 0 positive and 190 generalized place invariants in 149 ms returned sat
[2023-03-11 12:24:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:24:58] [INFO ] [Real]Absence check using state equation in 3208 ms returned sat
[2023-03-11 12:24:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:24:59] [INFO ] [Nat]Absence check using 0 positive and 190 generalized place invariants in 104 ms returned sat
[2023-03-11 12:24:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:04] [INFO ] [Nat]Absence check using state equation in 4959 ms returned sat
[2023-03-11 12:25:05] [INFO ] Computed and/alt/rep : 1710/1963/1710 causal constraints (skipped 2 transitions) in 85 ms.
[2023-03-11 12:25:13] [INFO ] Added : 350 causal constraints over 70 iterations in 8502 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 147 out of 1859 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1859/1859 places, 1733/1733 transitions.
Applied a total of 0 rules in 93 ms. Remains 1859 /1859 variables (removed 0) and now considering 1733/1733 (removed 0) transitions.
[2023-03-11 12:25:13] [INFO ] Invariant cache hit.
[2023-03-11 12:25:13] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-11 12:25:13] [INFO ] Invariant cache hit.
[2023-03-11 12:25:15] [INFO ] Implicit Places using invariants and state equation in 1153 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
[2023-03-11 12:25:15] [INFO ] Invariant cache hit.
[2023-03-11 12:25:15] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2363 ms. Remains : 1859/1859 places, 1733/1733 transitions.
Computed a total of 1859 stabilizing places and 1733 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1859 transition count 1733
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 155 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 327 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-11 12:25:17] [INFO ] Invariant cache hit.
[2023-03-11 12:25:18] [INFO ] [Real]Absence check using 0 positive and 190 generalized place invariants in 142 ms returned sat
[2023-03-11 12:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:22] [INFO ] [Real]Absence check using state equation in 3247 ms returned sat
[2023-03-11 12:25:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:25:23] [INFO ] [Nat]Absence check using 0 positive and 190 generalized place invariants in 109 ms returned sat
[2023-03-11 12:25:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:28] [INFO ] [Nat]Absence check using state equation in 4800 ms returned sat
[2023-03-11 12:25:28] [INFO ] Computed and/alt/rep : 1710/1963/1710 causal constraints (skipped 2 transitions) in 80 ms.
[2023-03-11 12:25:37] [INFO ] Added : 360 causal constraints over 72 iterations in 8511 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 175 reset in 714 ms.
Product exploration explored 100000 steps with 176 reset in 742 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 147 out of 1859 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1859/1859 places, 1733/1733 transitions.
Graph (complete) has 2132 edges and 1859 vertex of which 1428 are kept as prefixes of interest. Removing 431 places using SCC suffix rule.10 ms
Discarding 431 places :
Also discarding 347 output transitions
Drop transitions removed 347 transitions
Performed 441 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 441 rules applied. Total rules applied 442 place count 1428 transition count 1386
Performed 546 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 546 Pre rules applied. Total rules applied 442 place count 1428 transition count 1470
Deduced a syphon composed of 987 places in 0 ms
Iterating global reduction 1 with 546 rules applied. Total rules applied 988 place count 1428 transition count 1470
Discarding 609 places :
Symmetric choice reduction at 1 with 609 rule applications. Total rules 1597 place count 819 transition count 861
Deduced a syphon composed of 378 places in 0 ms
Iterating global reduction 1 with 609 rules applied. Total rules applied 2206 place count 819 transition count 861
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 399 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 2227 place count 819 transition count 861
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 2248 place count 798 transition count 840
Deduced a syphon composed of 378 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 2269 place count 798 transition count 840
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 399 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 2290 place count 798 transition count 924
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 2311 place count 777 transition count 882
Deduced a syphon composed of 378 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 2332 place count 777 transition count 882
Deduced a syphon composed of 378 places in 0 ms
Applied a total of 2332 rules in 378 ms. Remains 777 /1859 variables (removed 1082) and now considering 882/1733 (removed 851) transitions.
[2023-03-11 12:25:39] [INFO ] Redundant transitions in 58 ms returned []
// Phase 1: matrix 882 rows 777 cols
[2023-03-11 12:25:39] [INFO ] Computed 105 place invariants in 3 ms
[2023-03-11 12:25:39] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 777/1859 places, 882/1733 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 956 ms. Remains : 777/1859 places, 882/1733 transitions.
Support contains 147 out of 1859 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1859/1859 places, 1733/1733 transitions.
Applied a total of 0 rules in 83 ms. Remains 1859 /1859 variables (removed 0) and now considering 1733/1733 (removed 0) transitions.
// Phase 1: matrix 1733 rows 1859 cols
[2023-03-11 12:25:40] [INFO ] Computed 190 place invariants in 12 ms
[2023-03-11 12:25:40] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-11 12:25:40] [INFO ] Invariant cache hit.
[2023-03-11 12:25:41] [INFO ] Implicit Places using invariants and state equation in 1083 ms returned []
Implicit Place search using SMT with State Equation took 1447 ms to find 0 implicit places.
[2023-03-11 12:25:41] [INFO ] Invariant cache hit.
[2023-03-11 12:25:42] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2302 ms. Remains : 1859/1859 places, 1733/1733 transitions.
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-02 finished in 55755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(X(F(p1)))))))'
Support contains 105 out of 2201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2201/2201 places, 2166/2166 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 2135 transition count 2166
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 133 place count 2068 transition count 2059
Iterating global reduction 1 with 67 rules applied. Total rules applied 200 place count 2068 transition count 2059
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 266 place count 2002 transition count 1973
Iterating global reduction 1 with 66 rules applied. Total rules applied 332 place count 2002 transition count 1973
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 24 places :
Implicit places reduction removed 24 places
Iterating post reduction 1 with 46 rules applied. Total rules applied 378 place count 1978 transition count 1951
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 422 place count 1934 transition count 1867
Iterating global reduction 2 with 44 rules applied. Total rules applied 466 place count 1934 transition count 1867
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 529 place count 1871 transition count 1804
Iterating global reduction 2 with 63 rules applied. Total rules applied 592 place count 1871 transition count 1804
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 634 place count 1829 transition count 1762
Iterating global reduction 2 with 42 rules applied. Total rules applied 676 place count 1829 transition count 1762
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 716 place count 1789 transition count 1722
Iterating global reduction 2 with 40 rules applied. Total rules applied 756 place count 1789 transition count 1722
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 777 place count 1768 transition count 1701
Iterating global reduction 2 with 21 rules applied. Total rules applied 798 place count 1768 transition count 1701
Applied a total of 798 rules in 716 ms. Remains 1768 /2201 variables (removed 433) and now considering 1701/2166 (removed 465) transitions.
// Phase 1: matrix 1701 rows 1768 cols
[2023-03-11 12:25:43] [INFO ] Computed 132 place invariants in 15 ms
[2023-03-11 12:25:43] [INFO ] Implicit Places using invariants in 357 ms returned [399, 936, 960, 1003, 1578]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 359 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1763/2201 places, 1701/2166 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1761 transition count 1699
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1761 transition count 1699
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1760 transition count 1697
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1760 transition count 1697
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1759 transition count 1696
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1759 transition count 1696
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1758 transition count 1695
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1758 transition count 1695
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1757 transition count 1694
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1757 transition count 1694
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1756 transition count 1693
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1756 transition count 1693
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1755 transition count 1692
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1755 transition count 1692
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1754 transition count 1691
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1754 transition count 1691
Applied a total of 18 rules in 587 ms. Remains 1754 /1763 variables (removed 9) and now considering 1691/1701 (removed 10) transitions.
// Phase 1: matrix 1691 rows 1754 cols
[2023-03-11 12:25:44] [INFO ] Computed 127 place invariants in 15 ms
[2023-03-11 12:25:44] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-11 12:25:44] [INFO ] Invariant cache hit.
[2023-03-11 12:25:45] [INFO ] Implicit Places using invariants and state equation in 1035 ms returned []
Implicit Place search using SMT with State Equation took 1346 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1754/2201 places, 1691/2166 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3009 ms. Remains : 1754/2201 places, 1691/2166 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 2}, { cond=(NOT p0), acceptance={} source=7 dest: 4}]], initial=1, aps=[p1:(OR (GEQ s877 1) (GEQ s879 1) (GEQ s873 1) (GEQ s875 1) (GEQ s824 1) (GEQ s881 1) (GEQ s822 1) (GEQ s883 1) (GEQ s861 1) (GEQ s863 1) (GEQ s857 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 895 reset in 439 ms.
Product exploration explored 100000 steps with 906 reset in 448 ms.
Computed a total of 1754 stabilizing places and 1691 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1754 transition count 1691
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 241 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 126 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 6 factoid took 257 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2023-03-11 12:25:48] [INFO ] Invariant cache hit.
[2023-03-11 12:25:48] [INFO ] [Real]Absence check using 0 positive and 127 generalized place invariants in 54 ms returned sat
[2023-03-11 12:25:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:50] [INFO ] [Real]Absence check using state equation in 1911 ms returned sat
[2023-03-11 12:25:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:25:51] [INFO ] [Nat]Absence check using 0 positive and 127 generalized place invariants in 53 ms returned sat
[2023-03-11 12:25:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:25:53] [INFO ] [Nat]Absence check using state equation in 1699 ms returned sat
[2023-03-11 12:25:53] [INFO ] Computed and/alt/rep : 1668/1858/1668 causal constraints (skipped 2 transitions) in 76 ms.
[2023-03-11 12:25:56] [INFO ] Added : 168 causal constraints over 34 iterations in 2817 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 63 out of 1754 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1754/1754 places, 1691/1691 transitions.
Applied a total of 0 rules in 65 ms. Remains 1754 /1754 variables (removed 0) and now considering 1691/1691 (removed 0) transitions.
[2023-03-11 12:25:56] [INFO ] Invariant cache hit.
[2023-03-11 12:25:56] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-11 12:25:56] [INFO ] Invariant cache hit.
[2023-03-11 12:25:57] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
[2023-03-11 12:25:57] [INFO ] Invariant cache hit.
[2023-03-11 12:25:58] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2063 ms. Remains : 1754/1754 places, 1691/1691 transitions.
Computed a total of 1754 stabilizing places and 1691 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1754 transition count 1691
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(NOT p1), true, (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 112 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=56 )
Knowledge obtained : [(NOT p1), true, (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
[2023-03-11 12:25:59] [INFO ] Invariant cache hit.
[2023-03-11 12:26:00] [INFO ] [Real]Absence check using 0 positive and 127 generalized place invariants in 54 ms returned sat
[2023-03-11 12:26:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:26:02] [INFO ] [Real]Absence check using state equation in 1882 ms returned sat
[2023-03-11 12:26:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:26:02] [INFO ] [Nat]Absence check using 0 positive and 127 generalized place invariants in 53 ms returned sat
[2023-03-11 12:26:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:26:04] [INFO ] [Nat]Absence check using state equation in 1690 ms returned sat
[2023-03-11 12:26:04] [INFO ] Computed and/alt/rep : 1668/1858/1668 causal constraints (skipped 2 transitions) in 69 ms.
[2023-03-11 12:26:07] [INFO ] Added : 168 causal constraints over 34 iterations in 2760 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 898 reset in 423 ms.
Product exploration explored 100000 steps with 895 reset in 433 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 63 out of 1754 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1754/1754 places, 1691/1691 transitions.
Graph (complete) has 1964 edges and 1754 vertex of which 609 are kept as prefixes of interest. Removing 1145 places using SCC suffix rule.3 ms
Discarding 1145 places :
Also discarding 1040 output transitions
Drop transitions removed 1040 transitions
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 252 rules applied. Total rules applied 253 place count 609 transition count 651
Performed 210 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 210 Pre rules applied. Total rules applied 253 place count 609 transition count 693
Deduced a syphon composed of 462 places in 0 ms
Iterating global reduction 1 with 210 rules applied. Total rules applied 463 place count 609 transition count 693
Discarding 315 places :
Symmetric choice reduction at 1 with 315 rule applications. Total rules 778 place count 294 transition count 378
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 1 with 315 rules applied. Total rules applied 1093 place count 294 transition count 378
Deduced a syphon composed of 147 places in 0 ms
Applied a total of 1093 rules in 42 ms. Remains 294 /1754 variables (removed 1460) and now considering 378/1691 (removed 1313) transitions.
[2023-03-11 12:26:08] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 378 rows 294 cols
[2023-03-11 12:26:08] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 12:26:08] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 294/1754 places, 378/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 294/1754 places, 378/1691 transitions.
Support contains 63 out of 1754 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1754/1754 places, 1691/1691 transitions.
Applied a total of 0 rules in 66 ms. Remains 1754 /1754 variables (removed 0) and now considering 1691/1691 (removed 0) transitions.
// Phase 1: matrix 1691 rows 1754 cols
[2023-03-11 12:26:09] [INFO ] Computed 127 place invariants in 11 ms
[2023-03-11 12:26:09] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-11 12:26:09] [INFO ] Invariant cache hit.
[2023-03-11 12:26:10] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
[2023-03-11 12:26:10] [INFO ] Invariant cache hit.
[2023-03-11 12:26:11] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2107 ms. Remains : 1754/1754 places, 1691/1691 transitions.
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-03 finished in 28718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(p1)))'
Support contains 44 out of 2201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2201/2201 places, 2166/2166 transitions.
Graph (complete) has 2903 edges and 2201 vertex of which 2193 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.10 ms
Discarding 8 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions removed 1224 transitions
Trivial Post-agglo rules discarded 1224 transitions
Performed 1224 trivial Post agglomeration. Transition count delta: 1224
Iterating post reduction 0 with 1290 rules applied. Total rules applied 1291 place count 2106 transition count 912
Reduce places removed 1224 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 1262 rules applied. Total rules applied 2553 place count 882 transition count 874
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 2572 place count 863 transition count 874
Performed 290 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 290 Pre rules applied. Total rules applied 2572 place count 863 transition count 584
Deduced a syphon composed of 290 places in 0 ms
Ensure Unique test removed 84 places
Reduce places removed 374 places and 0 transitions.
Iterating global reduction 3 with 664 rules applied. Total rules applied 3236 place count 489 transition count 584
Discarding 21 places :
Implicit places reduction removed 21 places
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 63 rules applied. Total rules applied 3299 place count 468 transition count 542
Reduce places removed 42 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 4 with 63 rules applied. Total rules applied 3362 place count 426 transition count 521
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 3383 place count 405 transition count 521
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 3411 place count 377 transition count 453
Iterating global reduction 6 with 28 rules applied. Total rules applied 3439 place count 377 transition count 453
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 6 with 91 rules applied. Total rules applied 3530 place count 355 transition count 384
Reduce places removed 24 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 7 with 45 rules applied. Total rules applied 3575 place count 331 transition count 363
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 3596 place count 310 transition count 363
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 3596 place count 310 transition count 359
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 3604 place count 306 transition count 359
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 3605 place count 305 transition count 338
Iterating global reduction 9 with 1 rules applied. Total rules applied 3606 place count 305 transition count 338
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
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 44 rules applied. Total rules applied 3650 place count 303 transition count 296
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 3671 place count 282 transition count 296
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 2 Pre rules applied. Total rules applied 3671 place count 282 transition count 294
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 3675 place count 280 transition count 294
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 11 with 42 rules applied. Total rules applied 3717 place count 259 transition count 273
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 11 with 21 rules applied. Total rules applied 3738 place count 238 transition count 252
Applied a total of 3738 rules in 109 ms. Remains 238 /2201 variables (removed 1963) and now considering 252/2166 (removed 1914) transitions.
// Phase 1: matrix 252 rows 238 cols
[2023-03-11 12:26:11] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-11 12:26:11] [INFO ] Implicit Places using invariants in 160 ms returned [0, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 173, 174]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 162 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 214/2201 places, 252/2166 transitions.
Reduce places removed 21 places and 21 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 193 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 172 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 172 transition count 189
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 84 place count 151 transition count 189
Applied a total of 84 rules in 10 ms. Remains 151 /214 variables (removed 63) and now considering 189/252 (removed 63) transitions.
// Phase 1: matrix 189 rows 151 cols
[2023-03-11 12:26:11] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 12:26:11] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-11 12:26:11] [INFO ] Invariant cache hit.
[2023-03-11 12:26:11] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 151/2201 places, 189/2166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 410 ms. Remains : 151/2201 places, 189/2166 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s137 1) (GEQ s136 1) (GEQ s135 1) (GEQ s134 1) (GEQ s133 1) (GEQ s132 1) (GEQ s131 1) (GEQ s130 1) (GEQ s150 1) (GEQ s149 1) (GEQ s148 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 46 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-06 finished in 517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 63 out of 2201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2201/2201 places, 2166/2166 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 2135 transition count 2166
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 133 place count 2068 transition count 2059
Iterating global reduction 1 with 67 rules applied. Total rules applied 200 place count 2068 transition count 2059
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 285 place count 1983 transition count 1954
Iterating global reduction 1 with 85 rules applied. Total rules applied 370 place count 1983 transition count 1954
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 24 places :
Implicit places reduction removed 24 places
Iterating post reduction 1 with 46 rules applied. Total rules applied 416 place count 1959 transition count 1932
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 479 place count 1896 transition count 1829
Iterating global reduction 2 with 63 rules applied. Total rules applied 542 place count 1896 transition count 1829
Discarding 82 places :
Symmetric choice reduction at 2 with 82 rule applications. Total rules 624 place count 1814 transition count 1747
Iterating global reduction 2 with 82 rules applied. Total rules applied 706 place count 1814 transition count 1747
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 767 place count 1753 transition count 1686
Iterating global reduction 2 with 61 rules applied. Total rules applied 828 place count 1753 transition count 1686
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 889 place count 1692 transition count 1625
Iterating global reduction 2 with 61 rules applied. Total rules applied 950 place count 1692 transition count 1625
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 992 place count 1650 transition count 1583
Iterating global reduction 2 with 42 rules applied. Total rules applied 1034 place count 1650 transition count 1583
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1076 place count 1608 transition count 1541
Iterating global reduction 2 with 42 rules applied. Total rules applied 1118 place count 1608 transition count 1541
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1160 place count 1566 transition count 1499
Iterating global reduction 2 with 42 rules applied. Total rules applied 1202 place count 1566 transition count 1499
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1225 place count 1543 transition count 1476
Iterating global reduction 2 with 23 rules applied. Total rules applied 1248 place count 1543 transition count 1476
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1271 place count 1520 transition count 1453
Iterating global reduction 2 with 23 rules applied. Total rules applied 1294 place count 1520 transition count 1453
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1317 place count 1497 transition count 1430
Iterating global reduction 2 with 23 rules applied. Total rules applied 1340 place count 1497 transition count 1430
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 1363 place count 1474 transition count 1407
Iterating global reduction 2 with 23 rules applied. Total rules applied 1386 place count 1474 transition count 1407
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1407 place count 1453 transition count 1386
Iterating global reduction 2 with 21 rules applied. Total rules applied 1428 place count 1453 transition count 1386
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1449 place count 1432 transition count 1365
Iterating global reduction 2 with 21 rules applied. Total rules applied 1470 place count 1432 transition count 1365
Applied a total of 1470 rules in 973 ms. Remains 1432 /2201 variables (removed 769) and now considering 1365/2166 (removed 801) transitions.
// Phase 1: matrix 1365 rows 1432 cols
[2023-03-11 12:26:12] [INFO ] Computed 132 place invariants in 13 ms
[2023-03-11 12:26:12] [INFO ] Implicit Places using invariants in 303 ms returned [315, 600, 624, 667, 1242]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 304 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1427/2201 places, 1365/2166 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1425 transition count 1363
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1425 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1424 transition count 1361
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1424 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1423 transition count 1360
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1423 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1422 transition count 1359
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1422 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1421 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1421 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1420 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1420 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1419 transition count 1356
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1419 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1418 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1418 transition count 1355
Applied a total of 18 rules in 395 ms. Remains 1418 /1427 variables (removed 9) and now considering 1355/1365 (removed 10) transitions.
// Phase 1: matrix 1355 rows 1418 cols
[2023-03-11 12:26:13] [INFO ] Computed 127 place invariants in 11 ms
[2023-03-11 12:26:13] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-11 12:26:13] [INFO ] Invariant cache hit.
[2023-03-11 12:26:14] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1418/2201 places, 1355/2166 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2777 ms. Remains : 1418/2201 places, 1355/2166 transitions.
Stuttering acceptance computed with spot in 99 ms :[p0, p0, p0]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=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 s170 1) (LT s168 1) (LT s174 1) (LT s172 1) (LT s178 1) (LT s176 1) (LT s182 1) (LT s180 1) (LT s186 1) (LT s184 1) (LT s190 1) (LT s188 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 18300 reset in 650 ms.
Product exploration explored 100000 steps with 18361 reset in 635 ms.
Computed a total of 1418 stabilizing places and 1355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1418 transition count 1355
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [p0, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[p0, p0, p0]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 87 ms :[p0, p0, p0]
[2023-03-11 12:26:16] [INFO ] Invariant cache hit.
[2023-03-11 12:26:17] [INFO ] [Real]Absence check using 0 positive and 127 generalized place invariants in 46 ms returned sat
[2023-03-11 12:26:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:26:18] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2023-03-11 12:26:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:26:18] [INFO ] [Nat]Absence check using 0 positive and 127 generalized place invariants in 44 ms returned sat
[2023-03-11 12:26:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:26:19] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2023-03-11 12:26:19] [INFO ] Computed and/alt/rep : 1332/1522/1332 causal constraints (skipped 2 transitions) in 60 ms.
[2023-03-11 12:26:19] [INFO ] Added : 0 causal constraints over 0 iterations in 177 ms. Result :sat
Could not prove EG p0
Support contains 63 out of 1418 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1418/1418 places, 1355/1355 transitions.
Applied a total of 0 rules in 43 ms. Remains 1418 /1418 variables (removed 0) and now considering 1355/1355 (removed 0) transitions.
[2023-03-11 12:26:19] [INFO ] Invariant cache hit.
[2023-03-11 12:26:20] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-11 12:26:20] [INFO ] Invariant cache hit.
[2023-03-11 12:26:20] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
[2023-03-11 12:26:20] [INFO ] Invariant cache hit.
[2023-03-11 12:26:21] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1666 ms. Remains : 1418/1418 places, 1355/1355 transitions.
Computed a total of 1418 stabilizing places and 1355 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1418 transition count 1355
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [p0, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[p0, p0, p0]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 101 ms :[p0, p0, p0]
[2023-03-11 12:26:22] [INFO ] Invariant cache hit.
[2023-03-11 12:26:22] [INFO ] [Real]Absence check using 0 positive and 127 generalized place invariants in 46 ms returned sat
[2023-03-11 12:26:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:26:23] [INFO ] [Real]Absence check using state equation in 837 ms returned sat
[2023-03-11 12:26:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:26:24] [INFO ] [Nat]Absence check using 0 positive and 127 generalized place invariants in 45 ms returned sat
[2023-03-11 12:26:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:26:25] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2023-03-11 12:26:25] [INFO ] Computed and/alt/rep : 1332/1522/1332 causal constraints (skipped 2 transitions) in 60 ms.
[2023-03-11 12:26:25] [INFO ] Added : 0 causal constraints over 0 iterations in 172 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 110 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 18406 reset in 645 ms.
Product exploration explored 100000 steps with 18288 reset in 663 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 103 ms :[p0, p0, p0]
Support contains 63 out of 1418 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1418/1418 places, 1355/1355 transitions.
Graph (complete) has 1628 edges and 1418 vertex of which 105 are kept as prefixes of interest. Removing 1313 places using SCC suffix rule.1 ms
Discarding 1313 places :
Also discarding 1208 output transitions
Drop transitions removed 1208 transitions
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 21 Pre rules applied. Total rules applied 1 place count 105 transition count 189
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 0 with 21 rules applied. Total rules applied 22 place count 105 transition count 189
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 22 rules in 5 ms. Remains 105 /1418 variables (removed 1313) and now considering 189/1355 (removed 1166) transitions.
[2023-03-11 12:26:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 189 rows 105 cols
[2023-03-11 12:26:26] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 12:26:26] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/1418 places, 189/1355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 105/1418 places, 189/1355 transitions.
Support contains 63 out of 1418 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1418/1418 places, 1355/1355 transitions.
Applied a total of 0 rules in 56 ms. Remains 1418 /1418 variables (removed 0) and now considering 1355/1355 (removed 0) transitions.
// Phase 1: matrix 1355 rows 1418 cols
[2023-03-11 12:26:27] [INFO ] Computed 127 place invariants in 10 ms
[2023-03-11 12:26:27] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-11 12:26:27] [INFO ] Invariant cache hit.
[2023-03-11 12:26:28] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
[2023-03-11 12:26:28] [INFO ] Invariant cache hit.
[2023-03-11 12:26:28] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1742 ms. Remains : 1418/1418 places, 1355/1355 transitions.
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-07 finished in 17090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 2201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2201/2201 places, 2166/2166 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 2135 transition count 2166
Discarding 65 places :
Symmetric choice reduction at 1 with 65 rule applications. Total rules 131 place count 2070 transition count 2061
Iterating global reduction 1 with 65 rules applied. Total rules applied 196 place count 2070 transition count 2061
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 278 place count 1988 transition count 1979
Iterating global reduction 1 with 82 rules applied. Total rules applied 360 place count 1988 transition count 1979
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 42 rules applied. Total rules applied 402 place count 1967 transition count 1958
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 443 place count 1926 transition count 1897
Iterating global reduction 2 with 41 rules applied. Total rules applied 484 place count 1926 transition count 1897
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 524 place count 1886 transition count 1857
Iterating global reduction 2 with 40 rules applied. Total rules applied 564 place count 1886 transition count 1857
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 604 place count 1846 transition count 1817
Iterating global reduction 2 with 40 rules applied. Total rules applied 644 place count 1846 transition count 1817
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 684 place count 1806 transition count 1777
Iterating global reduction 2 with 40 rules applied. Total rules applied 724 place count 1806 transition count 1777
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 745 place count 1785 transition count 1756
Iterating global reduction 2 with 21 rules applied. Total rules applied 766 place count 1785 transition count 1756
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 787 place count 1764 transition count 1735
Iterating global reduction 2 with 21 rules applied. Total rules applied 808 place count 1764 transition count 1735
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 829 place count 1743 transition count 1714
Iterating global reduction 2 with 21 rules applied. Total rules applied 850 place count 1743 transition count 1714
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 871 place count 1722 transition count 1693
Iterating global reduction 2 with 21 rules applied. Total rules applied 892 place count 1722 transition count 1693
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 911 place count 1722 transition count 1674
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 913 place count 1720 transition count 1672
Iterating global reduction 3 with 2 rules applied. Total rules applied 915 place count 1720 transition count 1672
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 917 place count 1718 transition count 1670
Iterating global reduction 3 with 2 rules applied. Total rules applied 919 place count 1718 transition count 1670
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 921 place count 1716 transition count 1668
Iterating global reduction 3 with 2 rules applied. Total rules applied 923 place count 1716 transition count 1668
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 925 place count 1714 transition count 1666
Iterating global reduction 3 with 2 rules applied. Total rules applied 927 place count 1714 transition count 1666
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 929 place count 1714 transition count 1664
Applied a total of 929 rules in 1155 ms. Remains 1714 /2201 variables (removed 487) and now considering 1664/2166 (removed 502) transitions.
// Phase 1: matrix 1664 rows 1714 cols
[2023-03-11 12:26:29] [INFO ] Computed 135 place invariants in 13 ms
[2023-03-11 12:26:30] [INFO ] Implicit Places using invariants in 338 ms returned [189, 338, 791, 836, 1565]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 339 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1709/2201 places, 1664/2166 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1707 transition count 1662
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1707 transition count 1662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1706 transition count 1660
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1706 transition count 1660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1705 transition count 1659
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1705 transition count 1659
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1704 transition count 1658
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1704 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1703 transition count 1657
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1703 transition count 1657
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1702 transition count 1656
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1702 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1701 transition count 1655
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1701 transition count 1655
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1700 transition count 1654
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1700 transition count 1654
Applied a total of 18 rules in 594 ms. Remains 1700 /1709 variables (removed 9) and now considering 1654/1664 (removed 10) transitions.
// Phase 1: matrix 1654 rows 1700 cols
[2023-03-11 12:26:30] [INFO ] Computed 130 place invariants in 10 ms
[2023-03-11 12:26:31] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-11 12:26:31] [INFO ] Invariant cache hit.
[2023-03-11 12:26:32] [INFO ] Implicit Places using invariants and state equation in 1567 ms returned []
Implicit Place search using SMT with State Equation took 1880 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1700/2201 places, 1654/2166 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3969 ms. Remains : 1700/2201 places, 1654/2166 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s1044 1) (AND (GEQ s252 1) (GEQ s1551 1) (GEQ s1578 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1213 steps with 0 reset in 4 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-09 finished in 4061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(p1 U p2))))'
Support contains 3 out of 2201 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2201/2201 places, 2166/2166 transitions.
Graph (complete) has 2903 edges and 2201 vertex of which 1979 are kept as prefixes of interest. Removing 222 places using SCC suffix rule.4 ms
Discarding 222 places :
Also discarding 240 output transitions
Drop transitions removed 240 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 65 places :
Implicit places reduction removed 65 places
Drop transitions removed 1195 transitions
Trivial Post-agglo rules discarded 1195 transitions
Performed 1195 trivial Post agglomeration. Transition count delta: 1195
Iterating post reduction 0 with 1260 rules applied. Total rules applied 1261 place count 1893 transition count 710
Reduce places removed 1195 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 1231 rules applied. Total rules applied 2492 place count 698 transition count 674
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 2511 place count 680 transition count 673
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2512 place count 679 transition count 673
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 250 Pre rules applied. Total rules applied 2512 place count 679 transition count 423
Deduced a syphon composed of 250 places in 0 ms
Ensure Unique test removed 105 places
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 4 with 605 rules applied. Total rules applied 3117 place count 324 transition count 423
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 4 with 63 rules applied. Total rules applied 3180 place count 324 transition count 360
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 5 with 63 rules applied. Total rules applied 3243 place count 261 transition count 360
Discarding 45 places :
Symmetric choice reduction at 6 with 45 rule applications. Total rules 3288 place count 216 transition count 276
Iterating global reduction 6 with 45 rules applied. Total rules applied 3333 place count 216 transition count 276
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 28 rules applied. Total rules applied 3361 place count 215 transition count 249
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 3366 place count 210 transition count 249
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 3366 place count 210 transition count 247
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3370 place count 208 transition count 247
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3371 place count 207 transition count 226
Iterating global reduction 8 with 1 rules applied. Total rules applied 3372 place count 207 transition count 226
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 8 with 65 rules applied. Total rules applied 3437 place count 205 transition count 163
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 9 with 42 rules applied. Total rules applied 3479 place count 163 transition count 163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 3479 place count 163 transition count 161
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 3483 place count 161 transition count 161
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 10 with 46 rules applied. Total rules applied 3529 place count 138 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3530 place count 138 transition count 137
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3532 place count 137 transition count 155
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 11 with 19 rules applied. Total rules applied 3551 place count 118 transition count 136
Applied a total of 3551 rules in 59 ms. Remains 118 /2201 variables (removed 2083) and now considering 136/2166 (removed 2030) transitions.
// Phase 1: matrix 136 rows 118 cols
[2023-03-11 12:26:32] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-11 12:26:33] [INFO ] Implicit Places using invariants in 80 ms returned [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 94, 96]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 81 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/2201 places, 136/2166 transitions.
Reduce places removed 19 places and 19 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 76 transition count 115
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 74 transition count 115
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 23 place count 55 transition count 77
Iterating global reduction 0 with 19 rules applied. Total rules applied 42 place count 55 transition count 77
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 61 place count 36 transition count 58
Iterating global reduction 0 with 19 rules applied. Total rules applied 80 place count 36 transition count 58
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 99 place count 17 transition count 20
Iterating global reduction 0 with 19 rules applied. Total rules applied 118 place count 17 transition count 20
Applied a total of 118 rules in 5 ms. Remains 17 /95 variables (removed 78) and now considering 20/136 (removed 116) transitions.
// Phase 1: matrix 20 rows 17 cols
[2023-03-11 12:26:33] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 12:26:33] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 12:26:33] [INFO ] Invariant cache hit.
[2023-03-11 12:26:33] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/2201 places, 20/2166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 17/2201 places, 20/2166 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s9 1) (GEQ s10 1)), p0:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 207 steps with 16 reset in 1 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-10 finished in 301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 5 out of 2201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2201/2201 places, 2166/2166 transitions.
Graph (complete) has 2903 edges and 2201 vertex of which 2197 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Drop transitions removed 1301 transitions
Trivial Post-agglo rules discarded 1301 transitions
Performed 1301 trivial Post agglomeration. Transition count delta: 1301
Iterating post reduction 0 with 1367 rules applied. Total rules applied 1368 place count 2110 transition count 839
Reduce places removed 1301 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 1339 rules applied. Total rules applied 2707 place count 809 transition count 801
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 2727 place count 790 transition count 800
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2728 place count 789 transition count 800
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 293 Pre rules applied. Total rules applied 2728 place count 789 transition count 507
Deduced a syphon composed of 293 places in 0 ms
Ensure Unique test removed 105 places
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 4 with 691 rules applied. Total rules applied 3419 place count 391 transition count 507
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 4 with 63 rules applied. Total rules applied 3482 place count 391 transition count 444
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 5 with 63 rules applied. Total rules applied 3545 place count 328 transition count 444
Discarding 47 places :
Symmetric choice reduction at 6 with 47 rule applications. Total rules 3592 place count 281 transition count 337
Iterating global reduction 6 with 47 rules applied. Total rules applied 3639 place count 281 transition count 337
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 6 with 113 rules applied. Total rules applied 3752 place count 259 transition count 246
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 7 with 46 rules applied. Total rules applied 3798 place count 213 transition count 246
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 3798 place count 213 transition count 244
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3802 place count 211 transition count 244
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 3803 place count 210 transition count 223
Iterating global reduction 8 with 1 rules applied. Total rules applied 3804 place count 210 transition count 223
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 8 with 126 rules applied. Total rules applied 3930 place count 147 transition count 160
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 3931 place count 147 transition count 160
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 3952 place count 126 transition count 139
Applied a total of 3952 rules in 65 ms. Remains 126 /2201 variables (removed 2075) and now considering 139/2166 (removed 2027) transitions.
// Phase 1: matrix 139 rows 126 cols
[2023-03-11 12:26:33] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-11 12:26:33] [INFO ] Implicit Places using invariants in 82 ms returned [0, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 67, 91, 119]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 97 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/2201 places, 139/2166 transitions.
Graph (complete) has 184 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 98 transition count 136
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 3 place count 98 transition count 115
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 45 place count 77 transition count 115
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 59 transition count 97
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 59 transition count 97
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 98 place count 42 transition count 63
Iterating global reduction 2 with 17 rules applied. Total rules applied 115 place count 42 transition count 63
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 131 place count 26 transition count 31
Iterating global reduction 2 with 16 rules applied. Total rules applied 147 place count 26 transition count 31
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 149 place count 25 transition count 30
Applied a total of 149 rules in 7 ms. Remains 25 /101 variables (removed 76) and now considering 30/139 (removed 109) transitions.
// Phase 1: matrix 30 rows 25 cols
[2023-03-11 12:26:33] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 12:26:33] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 12:26:33] [INFO ] Invariant cache hit.
[2023-03-11 12:26:33] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/2201 places, 30/2166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 237 ms. Remains : 25/2201 places, 30/2166 transitions.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s12 1), p0:(OR (AND (GEQ s19 1) (GEQ s24 1)) (AND (GEQ s4 1) (GEQ s11 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-11 finished in 280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((G((p2 U p3))&&p1))&&p0)))'
Support contains 5 out of 2201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2201/2201 places, 2166/2166 transitions.
Graph (complete) has 2903 edges and 2201 vertex of which 1592 are kept as prefixes of interest. Removing 609 places using SCC suffix rule.2 ms
Discarding 609 places :
Also discarding 584 output transitions
Drop transitions removed 584 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 64 places :
Implicit places reduction removed 64 places
Drop transitions removed 1136 transitions
Trivial Post-agglo rules discarded 1136 transitions
Performed 1136 trivial Post agglomeration. Transition count delta: 1136
Iterating post reduction 0 with 1200 rules applied. Total rules applied 1201 place count 1507 transition count 425
Reduce places removed 1136 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 1174 rules applied. Total rules applied 2375 place count 371 transition count 387
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 2395 place count 352 transition count 386
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2396 place count 351 transition count 386
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 153 Pre rules applied. Total rules applied 2396 place count 351 transition count 233
Deduced a syphon composed of 153 places in 0 ms
Ensure Unique test removed 45 places
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 4 with 351 rules applied. Total rules applied 2747 place count 153 transition count 233
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 4 with 43 rules applied. Total rules applied 2790 place count 153 transition count 190
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 5 with 43 rules applied. Total rules applied 2833 place count 110 transition count 190
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 2857 place count 86 transition count 126
Iterating global reduction 6 with 24 rules applied. Total rules applied 2881 place count 86 transition count 126
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 6 with 72 rules applied. Total rules applied 2953 place count 84 transition count 56
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 26 rules applied. Total rules applied 2979 place count 59 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2980 place count 58 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 2980 place count 58 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2982 place count 57 transition count 54
Discarding 17 places :
Symmetric choice reduction at 9 with 17 rule applications. Total rules 2999 place count 40 transition count 37
Iterating global reduction 9 with 17 rules applied. Total rules applied 3016 place count 40 transition count 37
Discarding 17 places :
Symmetric choice reduction at 9 with 17 rule applications. Total rules 3033 place count 23 transition count 20
Iterating global reduction 9 with 17 rules applied. Total rules applied 3050 place count 23 transition count 20
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 9 with 2 rules applied. Total rules applied 3052 place count 22 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 3055 place count 19 transition count 16
Applied a total of 3055 rules in 64 ms. Remains 19 /2201 variables (removed 2182) and now considering 16/2166 (removed 2150) transitions.
// Phase 1: matrix 16 rows 19 cols
[2023-03-11 12:26:33] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-11 12:26:33] [INFO ] Implicit Places using invariants in 85 ms returned [10, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 86 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/2201 places, 16/2166 transitions.
Graph (complete) has 18 edges and 17 vertex of which 14 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 2 places and 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 12 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 11 transition count 10
Applied a total of 3 rules in 2 ms. Remains 11 /17 variables (removed 6) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-11 12:26:33] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 12:26:33] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 12:26:33] [INFO ] Invariant cache hit.
[2023-03-11 12:26:33] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/2201 places, 10/2166 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 194 ms. Remains : 11/2201 places, 10/2166 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1)), (NOT p3), (NOT p3)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 p1 p3) (AND p0 p1 p2)), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 2}, { cond=(OR p3 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s5 1)), p1:(AND (GEQ s4 1) (GEQ s5 1)), p3:(GEQ s1 1), p2:(AND (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-12 finished in 408 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 3 out of 2201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2201/2201 places, 2166/2166 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 2135 transition count 2166
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 132 place count 2069 transition count 2060
Iterating global reduction 1 with 66 rules applied. Total rules applied 198 place count 2069 transition count 2060
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 282 place count 1985 transition count 1956
Iterating global reduction 1 with 84 rules applied. Total rules applied 366 place count 1985 transition count 1956
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 23 places :
Implicit places reduction removed 23 places
Iterating post reduction 1 with 44 rules applied. Total rules applied 410 place count 1962 transition count 1935
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 473 place count 1899 transition count 1832
Iterating global reduction 2 with 63 rules applied. Total rules applied 536 place count 1899 transition count 1832
Discarding 82 places :
Symmetric choice reduction at 2 with 82 rule applications. Total rules 618 place count 1817 transition count 1750
Iterating global reduction 2 with 82 rules applied. Total rules applied 700 place count 1817 transition count 1750
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 761 place count 1756 transition count 1689
Iterating global reduction 2 with 61 rules applied. Total rules applied 822 place count 1756 transition count 1689
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 883 place count 1695 transition count 1628
Iterating global reduction 2 with 61 rules applied. Total rules applied 944 place count 1695 transition count 1628
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 986 place count 1653 transition count 1586
Iterating global reduction 2 with 42 rules applied. Total rules applied 1028 place count 1653 transition count 1586
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1070 place count 1611 transition count 1544
Iterating global reduction 2 with 42 rules applied. Total rules applied 1112 place count 1611 transition count 1544
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1154 place count 1569 transition count 1502
Iterating global reduction 2 with 42 rules applied. Total rules applied 1196 place count 1569 transition count 1502
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1238 place count 1527 transition count 1460
Iterating global reduction 2 with 42 rules applied. Total rules applied 1280 place count 1527 transition count 1460
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 1299 place count 1527 transition count 1441
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1322 place count 1504 transition count 1418
Iterating global reduction 3 with 23 rules applied. Total rules applied 1345 place count 1504 transition count 1418
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1368 place count 1481 transition count 1395
Iterating global reduction 3 with 23 rules applied. Total rules applied 1391 place count 1481 transition count 1395
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1414 place count 1458 transition count 1372
Iterating global reduction 3 with 23 rules applied. Total rules applied 1437 place count 1458 transition count 1372
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1460 place count 1435 transition count 1349
Iterating global reduction 3 with 23 rules applied. Total rules applied 1483 place count 1435 transition count 1349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1485 place count 1435 transition count 1347
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 1506 place count 1414 transition count 1326
Iterating global reduction 4 with 21 rules applied. Total rules applied 1527 place count 1414 transition count 1326
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 1548 place count 1393 transition count 1305
Iterating global reduction 4 with 21 rules applied. Total rules applied 1569 place count 1393 transition count 1305
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 4 with 21 rules applied. Total rules applied 1590 place count 1393 transition count 1284
Applied a total of 1590 rules in 1153 ms. Remains 1393 /2201 variables (removed 808) and now considering 1284/2166 (removed 882) transitions.
// Phase 1: matrix 1284 rows 1393 cols
[2023-03-11 12:26:35] [INFO ] Computed 133 place invariants in 13 ms
[2023-03-11 12:26:35] [INFO ] Implicit Places using invariants in 310 ms returned [273, 558, 582, 625, 1203]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 317 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1388/2201 places, 1284/2166 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1386 transition count 1282
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1386 transition count 1282
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1385 transition count 1280
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1385 transition count 1280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1384 transition count 1279
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1384 transition count 1279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1383 transition count 1278
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1383 transition count 1278
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1382 transition count 1277
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1382 transition count 1277
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1381 transition count 1276
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1381 transition count 1276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1380 transition count 1275
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1380 transition count 1275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1379 transition count 1274
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1379 transition count 1274
Applied a total of 18 rules in 464 ms. Remains 1379 /1388 variables (removed 9) and now considering 1274/1284 (removed 10) transitions.
// Phase 1: matrix 1274 rows 1379 cols
[2023-03-11 12:26:35] [INFO ] Computed 128 place invariants in 8 ms
[2023-03-11 12:26:36] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-11 12:26:36] [INFO ] Invariant cache hit.
[2023-03-11 12:26:36] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1379/2201 places, 1274/2166 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3050 ms. Remains : 1379/2201 places, 1274/2166 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s1222 1), p1:(AND (GEQ s830 1) (GEQ s874 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 121 reset in 254 ms.
Product exploration explored 100000 steps with 121 reset in 283 ms.
Computed a total of 1379 stabilizing places and 1274 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1379 transition count 1274
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 327 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 810 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=135 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 factoid took 293 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-11 12:26:38] [INFO ] Invariant cache hit.
[2023-03-11 12:26:39] [INFO ] [Real]Absence check using 0 positive and 128 generalized place invariants in 43 ms returned sat
[2023-03-11 12:26:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:26:40] [INFO ] [Real]Absence check using state equation in 1019 ms returned sat
[2023-03-11 12:26:40] [INFO ] Computed and/alt/rep : 1251/1402/1251 causal constraints (skipped 2 transitions) in 58 ms.
[2023-03-11 12:26:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:26:50] [INFO ] [Nat]Absence check using 0 positive and 128 generalized place invariants in 42 ms returned sat
[2023-03-11 12:26:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:26:51] [INFO ] [Nat]Absence check using state equation in 1030 ms returned sat
[2023-03-11 12:26:52] [INFO ] Computed and/alt/rep : 1251/1402/1251 causal constraints (skipped 2 transitions) in 64 ms.
[2023-03-11 12:27:05] [INFO ] Added : 805 causal constraints over 161 iterations in 13386 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 1 out of 1379 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1379/1379 places, 1274/1274 transitions.
Graph (complete) has 1549 edges and 1379 vertex of which 76 are kept as prefixes of interest. Removing 1303 places using SCC suffix rule.1 ms
Discarding 1303 places :
Also discarding 1199 output transitions
Drop transitions removed 1199 transitions
Reduce places removed 2 places and 2 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 74 transition count 19
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 20 transition count 19
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 109 place count 20 transition count 11
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 127 place count 10 transition count 11
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 9 transition count 10
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 9 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 130 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 8 transition count 8
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 3 with 2 rules applied. Total rules applied 134 place count 7 transition count 7
Applied a total of 134 rules in 5 ms. Remains 7 /1379 variables (removed 1372) and now considering 7/1274 (removed 1267) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-11 12:27:05] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 12:27:05] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-11 12:27:05] [INFO ] Invariant cache hit.
[2023-03-11 12:27:05] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-11 12:27:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 12:27:05] [INFO ] Invariant cache hit.
[2023-03-11 12:27:05] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/1379 places, 7/1274 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 7/1379 places, 7/1274 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2023-03-11 12:27:05] [INFO ] Invariant cache hit.
[2023-03-11 12:27:06] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 12:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:27:06] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-11 12:27:06] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-11 12:27:06] [INFO ] Added : 3 causal constraints over 2 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 32494 reset in 52 ms.
Product exploration explored 100000 steps with 32457 reset in 54 ms.
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Graph (complete) has 5 edges and 7 vertex of which 2 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /7 variables (removed 5) and now considering 2/7 (removed 5) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-11 12:27:06] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 12:27:06] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-11 12:27:06] [INFO ] Invariant cache hit.
[2023-03-11 12:27:06] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-11 12:27:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 12:27:06] [INFO ] Invariant cache hit.
[2023-03-11 12:27:06] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/7 places, 2/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58 ms. Remains : 2/7 places, 2/7 transitions.
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13 finished in 32402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0)) U (G(p2)||p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(X(F(p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Found a Shortening insensitive property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-07
Stuttering acceptance computed with spot in 99 ms :[p0, p0, p0]
Support contains 63 out of 2201 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2201/2201 places, 2166/2166 transitions.
Graph (complete) has 2903 edges and 2201 vertex of which 105 are kept as prefixes of interest. Removing 2096 places using SCC suffix rule.4 ms
Discarding 2096 places :
Also discarding 2019 output transitions
Drop transitions removed 2019 transitions
Reduce places removed 21 places and 21 transitions.
Applied a total of 1 rules in 9 ms. Remains 84 /2201 variables (removed 2117) and now considering 126/2166 (removed 2040) transitions.
// Phase 1: matrix 126 rows 84 cols
[2023-03-11 12:27:06] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 12:27:06] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 12:27:06] [INFO ] Invariant cache hit.
[2023-03-11 12:27:06] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-11 12:27:06] [INFO ] Invariant cache hit.
[2023-03-11 12:27:06] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 84/2201 places, 126/2166 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 130 ms. Remains : 84/2201 places, 126/2166 transitions.
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=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 s44 1) (LT s42 1) (LT s48 1) (LT s46 1) (LT s52 1) (LT s50 1) (LT s56 1) (LT s54 1) (LT s60 1) (LT s58 1) (LT s64 1) (LT s62 1) (LT s68 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33163 reset in 250 ms.
Product exploration explored 100000 steps with 33156 reset in 265 ms.
Computed a total of 84 stabilizing places and 126 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 126
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [p0, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[p0, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 112 ms :[p0, p0, p0]
[2023-03-11 12:27:07] [INFO ] Invariant cache hit.
[2023-03-11 12:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:27:08] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-11 12:27:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:27:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:27:08] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-11 12:27:08] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 12:27:08] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG p0
Support contains 63 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 126/126 transitions.
Applied a total of 0 rules in 0 ms. Remains 84 /84 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-11 12:27:08] [INFO ] Invariant cache hit.
[2023-03-11 12:27:08] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 12:27:08] [INFO ] Invariant cache hit.
[2023-03-11 12:27:08] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-11 12:27:08] [INFO ] Invariant cache hit.
[2023-03-11 12:27:08] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 84/84 places, 126/126 transitions.
Computed a total of 84 stabilizing places and 126 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 84 transition count 126
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [p0, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[p0, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 107 ms :[p0, p0, p0]
[2023-03-11 12:27:08] [INFO ] Invariant cache hit.
[2023-03-11 12:27:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:27:09] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-11 12:27:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 12:27:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 12:27:09] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-11 12:27:09] [INFO ] Computed and/alt/rep : 63/63/63 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-11 12:27:09] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 114 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 33149 reset in 253 ms.
Product exploration explored 100000 steps with 33147 reset in 267 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 119 ms :[p0, p0, p0]
Support contains 63 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-11 12:27:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 12:27:10] [INFO ] Invariant cache hit.
[2023-03-11 12:27:10] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 84/84 places, 126/126 transitions.
Support contains 63 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 126/126 transitions.
Applied a total of 0 rules in 0 ms. Remains 84 /84 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-11 12:27:10] [INFO ] Invariant cache hit.
[2023-03-11 12:27:10] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-11 12:27:10] [INFO ] Invariant cache hit.
[2023-03-11 12:27:10] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-11 12:27:10] [INFO ] Invariant cache hit.
[2023-03-11 12:27:10] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 84/84 places, 126/126 transitions.
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-07 finished in 3811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Found a Lengthening insensitive property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 2201 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2201/2201 places, 2166/2166 transitions.
Graph (complete) has 2903 edges and 2201 vertex of which 997 are kept as prefixes of interest. Removing 1204 places using SCC suffix rule.4 ms
Discarding 1204 places :
Also discarding 1174 output transitions
Drop transitions removed 1174 transitions
Reduce places removed 21 places and 21 transitions.
Discarding 65 places :
Implicit places reduction removed 65 places
Drop transitions removed 804 transitions
Trivial Post-agglo rules discarded 804 transitions
Performed 804 trivial Post agglomeration. Transition count delta: 804
Iterating post reduction 0 with 869 rules applied. Total rules applied 870 place count 911 transition count 167
Reduce places removed 804 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 842 rules applied. Total rules applied 1712 place count 107 transition count 129
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 1731 place count 88 transition count 129
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 1731 place count 88 transition count 101
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1789 place count 58 transition count 101
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1810 place count 37 transition count 60
Iterating global reduction 3 with 21 rules applied. Total rules applied 1831 place count 37 transition count 60
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 25 rules applied. Total rules applied 1856 place count 37 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1857 place count 36 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1857 place count 36 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1859 place count 35 transition count 34
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1877 place count 17 transition count 16
Iterating global reduction 5 with 18 rules applied. Total rules applied 1895 place count 17 transition count 16
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1897 place count 15 transition count 14
Iterating global reduction 5 with 2 rules applied. Total rules applied 1899 place count 15 transition count 14
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 5 with 2 rules applied. Total rules applied 1901 place count 14 transition count 13
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 1904 place count 11 transition count 10
Applied a total of 1904 rules in 19 ms. Remains 11 /2201 variables (removed 2190) and now considering 10/2166 (removed 2156) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-11 12:27:10] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 12:27:10] [INFO ] Implicit Places using invariants in 17 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/2201 places, 10/2166 transitions.
Graph (complete) has 7 edges and 10 vertex of which 9 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Applied a total of 1 rules in 1 ms. Remains 7 /10 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-11 12:27:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 12:27:10] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-11 12:27:10] [INFO ] Invariant cache hit.
[2023-03-11 12:27:10] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 7/2201 places, 7/2166 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 73 ms. Remains : 7/2201 places, 7/2166 transitions.
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s6 1), p1:(AND (GEQ s1 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32440 reset in 53 ms.
Product exploration explored 100000 steps with 32528 reset in 60 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 272 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p0)]
Knowledge based reduction with 4 factoid took 296 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-11 12:27:11] [INFO ] Invariant cache hit.
[2023-03-11 12:27:11] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 12:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:27:11] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-11 12:27:11] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 12:27:11] [INFO ] Added : 3 causal constraints over 2 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 7 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-11 12:27:11] [INFO ] Invariant cache hit.
[2023-03-11 12:27:11] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-11 12:27:11] [INFO ] Invariant cache hit.
[2023-03-11 12:27:11] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-11 12:27:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 12:27:11] [INFO ] Invariant cache hit.
[2023-03-11 12:27:11] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 7/7 places, 7/7 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-03-11 12:27:11] [INFO ] Invariant cache hit.
[2023-03-11 12:27:11] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 12:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 12:27:11] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-11 12:27:11] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-11 12:27:12] [INFO ] Added : 3 causal constraints over 2 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 32483 reset in 53 ms.
Product exploration explored 100000 steps with 32496 reset in 53 ms.
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 7/7 transitions.
Graph (complete) has 5 edges and 7 vertex of which 2 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Applied a total of 1 rules in 0 ms. Remains 2 /7 variables (removed 5) and now considering 2/7 (removed 5) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-11 12:27:12] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 12:27:12] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-11 12:27:12] [INFO ] Invariant cache hit.
[2023-03-11 12:27:12] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-11 12:27:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 12:27:12] [INFO ] Invariant cache hit.
[2023-03-11 12:27:12] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/7 places, 2/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 2/7 places, 2/7 transitions.
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13 finished in 1988 ms.
[2023-03-11 12:27:12] [INFO ] Flatten gal took : 71 ms
[2023-03-11 12:27:12] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-11 12:27:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2201 places, 2166 transitions and 5212 arcs took 9 ms.
Total runtime 156755 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2104/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2104/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2104/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2104/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-02
Could not compute solution for formula : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-03
Could not compute solution for formula : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-07
Could not compute solution for formula : FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13

BK_STOP 1678538447096

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-02
ltl formula formula --ltl=/tmp/2104/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2201 places, 2166 transitions and 5212 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.430 real 0.060 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2104/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2104/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2104/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2104/ltl_0_
ltl formula name FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-03
ltl formula formula --ltl=/tmp/2104/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2201 places, 2166 transitions and 5212 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.410 real 0.050 user 0.090 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2104/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2104/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2104/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2104/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-07
ltl formula formula --ltl=/tmp/2104/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2201 places, 2166 transitions and 5212 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.060 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2104/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2104/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2104/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2104/ltl_2_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
ltl formula name FamilyReunion-PT-L00020M0002C001P001G001-LTLFireability-13
ltl formula formula --ltl=/tmp/2104/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2201 places, 2166 transitions and 5212 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.200 real 0.080 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2104/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2104/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2104/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2104/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-PT-L00020M0002C001P001G001"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is FamilyReunion-PT-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 r169-tall-167838855800404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00020M0002C001P001G001.tgz
mv FamilyReunion-PT-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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;