Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636280400307.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636280400307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 33K Apr 11 20:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 233K Apr 11 20:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 50K Apr 11 20:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 11 20:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 22K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 64K Apr 11 20:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 436K Apr 11 20:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 149K Apr 11 20:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 568K Apr 11 20:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 24 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716652237638

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00020M0002C001P001G001
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:50:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:50:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:50:41] [INFO ] Load time of PNML (sax parser for PT used): 374 ms
[2024-05-25 15:50:41] [INFO ] Transformed 3271 places.
[2024-05-25 15:50:41] [INFO ] Transformed 2753 transitions.
[2024-05-25 15:50:41] [INFO ] Parsed PT model containing 3271 places and 2753 transitions and 8446 arcs in 549 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 96 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 11 places and 0 transitions.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 797 out of 3260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Reduce places removed 73 places and 0 transitions.
Discarding 378 places :
Implicit places reduction removed 378 places
Iterating post reduction 0 with 451 rules applied. Total rules applied 451 place count 2809 transition count 2753
Discarding 145 places :
Symmetric choice reduction at 1 with 145 rule applications. Total rules 596 place count 2664 transition count 2608
Iterating global reduction 1 with 145 rules applied. Total rules applied 741 place count 2664 transition count 2608
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 1 with 20 rules applied. Total rules applied 761 place count 2644 transition count 2608
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 779 place count 2626 transition count 2590
Iterating global reduction 2 with 18 rules applied. Total rules applied 797 place count 2626 transition count 2590
Applied a total of 797 rules in 877 ms. Remains 2626 /3260 variables (removed 634) and now considering 2590/2753 (removed 163) transitions.
// Phase 1: matrix 2590 rows 2626 cols
[2024-05-25 15:50:42] [INFO ] Computed 302 invariants in 160 ms
[2024-05-25 15:50:43] [INFO ] Implicit Places using invariants in 1376 ms returned [151]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1422 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2625/3260 places, 2590/2753 transitions.
Applied a total of 0 rules in 108 ms. Remains 2625 /2625 variables (removed 0) and now considering 2590/2590 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2410 ms. Remains : 2625/3260 places, 2590/2753 transitions.
Support contains 797 out of 2625 places after structural reductions.
[2024-05-25 15:50:44] [INFO ] Flatten gal took : 359 ms
[2024-05-25 15:50:45] [INFO ] Flatten gal took : 229 ms
[2024-05-25 15:50:45] [INFO ] Input system was already deterministic with 2590 transitions.
Support contains 796 out of 2625 places (down from 797) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 859 ms. (steps per millisecond=11 ) properties (out of 31) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2590 rows 2625 cols
[2024-05-25 15:50:46] [INFO ] Computed 301 invariants in 109 ms
[2024-05-25 15:50:47] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-05-25 15:50:48] [INFO ] [Real]Absence check using 2 positive and 299 generalized place invariants in 180 ms returned sat
[2024-05-25 15:50:50] [INFO ] After 3745ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-25 15:50:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2024-05-25 15:50:51] [INFO ] [Nat]Absence check using 2 positive and 299 generalized place invariants in 161 ms returned sat
[2024-05-25 15:50:53] [INFO ] After 2393ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2024-05-25 15:50:53] [INFO ] After 2635ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2024-05-25 15:50:53] [INFO ] After 3557ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 599 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=74 )
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 2625 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2625/2625 places, 2590/2590 transitions.
Graph (complete) has 3764 edges and 2625 vertex of which 2145 are kept as prefixes of interest. Removing 480 places using SCC suffix rule.8 ms
Discarding 480 places :
Also discarding 435 output transitions
Drop transitions removed 435 transitions
Drop transitions removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions removed 1263 transitions
Trivial Post-agglo rules discarded 1263 transitions
Performed 1263 trivial Post agglomeration. Transition count delta: 1263
Iterating post reduction 0 with 1325 rules applied. Total rules applied 1326 place count 2145 transition count 830
Reduce places removed 1263 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 1343 rules applied. Total rules applied 2669 place count 862 transition count 770
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 2709 place count 822 transition count 770
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 191 Pre rules applied. Total rules applied 2709 place count 822 transition count 579
Deduced a syphon composed of 191 places in 1 ms
Ensure Unique test removed 105 places
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 3 with 487 rules applied. Total rules applied 3196 place count 526 transition count 579
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 3 with 43 rules applied. Total rules applied 3239 place count 526 transition count 536
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 3282 place count 483 transition count 536
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 3282 place count 483 transition count 516
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 3322 place count 463 transition count 516
Discarding 85 places :
Symmetric choice reduction at 5 with 85 rule applications. Total rules 3407 place count 378 transition count 412
Iterating global reduction 5 with 85 rules applied. Total rules applied 3492 place count 378 transition count 412
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 5 with 30 rules applied. Total rules applied 3522 place count 375 transition count 385
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 3548 place count 349 transition count 385
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 3548 place count 349 transition count 383
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 3552 place count 347 transition count 383
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 3556 place count 343 transition count 319
Iterating global reduction 7 with 4 rules applied. Total rules applied 3560 place count 343 transition count 319
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Discarding 64 places :
Implicit places reduction removed 64 places
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 7 with 153 rules applied. Total rules applied 3713 place count 279 transition count 230
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 8 with 64 rules applied. Total rules applied 3777 place count 215 transition count 230
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 43 Pre rules applied. Total rules applied 3777 place count 215 transition count 187
Deduced a syphon composed of 43 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 9 with 87 rules applied. Total rules applied 3864 place count 171 transition count 187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 3864 place count 171 transition count 186
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 3866 place count 170 transition count 186
Discarding 59 places :
Symmetric choice reduction at 9 with 59 rule applications. Total rules 3925 place count 111 transition count 127
Iterating global reduction 9 with 59 rules applied. Total rules applied 3984 place count 111 transition count 127
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 9 with 101 rules applied. Total rules applied 4085 place count 91 transition count 46
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 10 with 41 rules applied. Total rules applied 4126 place count 50 transition count 46
Discarding 19 places :
Symmetric choice reduction at 11 with 19 rule applications. Total rules 4145 place count 31 transition count 27
Iterating global reduction 11 with 19 rules applied. Total rules applied 4164 place count 31 transition count 27
Discarding 19 places :
Symmetric choice reduction at 11 with 19 rule applications. Total rules 4183 place count 12 transition count 8
Iterating global reduction 11 with 19 rules applied. Total rules applied 4202 place count 12 transition count 8
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 4203 place count 12 transition count 8
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 4205 place count 10 transition count 6
Applied a total of 4205 rules in 184 ms. Remains 10 /2625 variables (removed 2615) and now considering 6/2590 (removed 2584) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 10/2625 places, 6/2590 transitions.
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 2625 stabilizing places and 2590 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2625 transition count 2590
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1)||X(G(p2)))))'
Support contains 212 out of 2625 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2625/2625 places, 2590/2590 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2624 transition count 2590
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 89 place count 2536 transition count 2481
Iterating global reduction 1 with 88 rules applied. Total rules applied 177 place count 2536 transition count 2481
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 41 rules applied. Total rules applied 218 place count 2515 transition count 2461
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 221 place count 2512 transition count 2418
Iterating global reduction 2 with 3 rules applied. Total rules applied 224 place count 2512 transition count 2418
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 2 with 23 rules applied. Total rules applied 247 place count 2490 transition count 2417
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 289 place count 2448 transition count 2375
Iterating global reduction 3 with 42 rules applied. Total rules applied 331 place count 2448 transition count 2375
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 353 place count 2426 transition count 2333
Iterating global reduction 3 with 22 rules applied. Total rules applied 375 place count 2426 transition count 2333
Applied a total of 375 rules in 1214 ms. Remains 2426 /2625 variables (removed 199) and now considering 2333/2590 (removed 257) transitions.
// Phase 1: matrix 2333 rows 2426 cols
[2024-05-25 15:50:55] [INFO ] Computed 257 invariants in 47 ms
[2024-05-25 15:50:57] [INFO ] Implicit Places using invariants in 1429 ms returned [147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 1243, 1328, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1342, 1343, 1344, 1345, 1346, 1347, 1348, 1562, 1563, 1564, 1565, 1566, 1567, 1568, 1569, 1570, 1571, 1572, 1573, 1574, 1575, 1576, 1577, 1578, 1579, 1580, 1581, 1582, 1942, 1943, 1944, 1945, 1946, 1947, 1948, 1949, 1950, 1951, 1952, 1953, 1954, 1955, 1956, 1957, 1958, 1959, 1960, 1961, 1962, 2236]
Discarding 106 places :
Implicit Place search using SMT only with invariants took 1441 ms to find 106 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2320/2625 places, 2333/2590 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2279 transition count 2292
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2279 transition count 2292
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 2259 transition count 2252
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 2259 transition count 2252
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 2239 transition count 2232
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 2239 transition count 2232
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 2219 transition count 2212
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 2219 transition count 2212
Applied a total of 202 rules in 789 ms. Remains 2219 /2320 variables (removed 101) and now considering 2212/2333 (removed 121) transitions.
// Phase 1: matrix 2212 rows 2219 cols
[2024-05-25 15:50:58] [INFO ] Computed 151 invariants in 27 ms
[2024-05-25 15:50:58] [INFO ] Implicit Places using invariants in 812 ms returned []
[2024-05-25 15:50:58] [INFO ] Invariant cache hit.
[2024-05-25 15:51:02] [INFO ] Implicit Places using invariants and state equation in 3301 ms returned []
Implicit Place search using SMT with State Equation took 4118 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2219/2625 places, 2212/2590 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7564 ms. Remains : 2219/2625 places, 2212/2590 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 441 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(LEQ (ADD s779 s780 s781 s782 s783 s784 s785 s786 s787 s788 s789 s790 s791 s792 s793 s794 s795 s796 s797 s798 s799) (ADD s1568 s1569 s1570 s1571 s1572 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2950 ms.
Product exploration explored 100000 steps with 50000 reset in 2720 ms.
Computed a total of 2219 stabilizing places and 2212 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2219 transition count 2212
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 p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 34 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-00 finished in 14564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 24 out of 2625 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2625/2625 places, 2590/2590 transitions.
Graph (complete) has 3764 edges and 2625 vertex of which 1391 are kept as prefixes of interest. Removing 1234 places using SCC suffix rule.14 ms
Discarding 1234 places :
Also discarding 1160 output transitions
Drop transitions removed 1160 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 883 transitions
Trivial Post-agglo rules discarded 883 transitions
Performed 883 trivial Post agglomeration. Transition count delta: 883
Iterating post reduction 0 with 883 rules applied. Total rules applied 884 place count 1370 transition count 526
Reduce places removed 883 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 963 rules applied. Total rules applied 1847 place count 467 transition count 466
Reduce places removed 40 places and 0 transitions.
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Iterating post reduction 2 with 103 rules applied. Total rules applied 1950 place count 427 transition count 403
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 2013 place count 364 transition count 403
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 2013 place count 364 transition count 382
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 2055 place count 343 transition count 382
Discarding 44 places :
Symmetric choice reduction at 4 with 44 rule applications. Total rules 2099 place count 299 transition count 338
Iterating global reduction 4 with 44 rules applied. Total rules applied 2143 place count 299 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 7 rules applied. Total rules applied 2150 place count 297 transition count 333
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2154 place count 293 transition count 333
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 2154 place count 293 transition count 312
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 2196 place count 272 transition count 312
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 6 with 42 rules applied. Total rules applied 2238 place count 251 transition count 291
Applied a total of 2238 rules in 94 ms. Remains 251 /2625 variables (removed 2374) and now considering 291/2590 (removed 2299) transitions.
// Phase 1: matrix 291 rows 251 cols
[2024-05-25 15:51:09] [INFO ] Computed 42 invariants in 2 ms
[2024-05-25 15:51:09] [INFO ] Implicit Places using invariants in 171 ms returned [21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 174 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 210/2625 places, 291/2590 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 210 transition count 231
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 150 transition count 231
Applied a total of 120 rules in 11 ms. Remains 150 /210 variables (removed 60) and now considering 231/291 (removed 60) transitions.
// Phase 1: matrix 231 rows 150 cols
[2024-05-25 15:51:09] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 15:51:09] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-25 15:51:09] [INFO ] Invariant cache hit.
[2024-05-25 15:51:09] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 150/2625 places, 231/2590 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 467 ms. Remains : 150/2625 places, 231/2590 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149) (ADD s84 s85 s86))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-01 finished in 528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(p0 U p1)))))'
Support contains 105 out of 2625 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2625/2625 places, 2590/2590 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2622 transition count 2590
Discarding 151 places :
Symmetric choice reduction at 1 with 151 rule applications. Total rules 154 place count 2471 transition count 2418
Iterating global reduction 1 with 151 rules applied. Total rules applied 305 place count 2471 transition count 2418
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 41 rules applied. Total rules applied 346 place count 2450 transition count 2398
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 412 place count 2384 transition count 2292
Iterating global reduction 2 with 66 rules applied. Total rules applied 478 place count 2384 transition count 2292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 2 with 23 rules applied. Total rules applied 501 place count 2362 transition count 2291
Discarding 85 places :
Symmetric choice reduction at 3 with 85 rule applications. Total rules 586 place count 2277 transition count 2186
Iterating global reduction 3 with 85 rules applied. Total rules applied 671 place count 2277 transition count 2186
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 716 place count 2232 transition count 2081
Iterating global reduction 3 with 45 rules applied. Total rules applied 761 place count 2232 transition count 2081
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 3 with 63 rules applied. Total rules applied 824 place count 2190 transition count 2060
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 866 place count 2148 transition count 2018
Iterating global reduction 4 with 42 rules applied. Total rules applied 908 place count 2148 transition count 2018
Applied a total of 908 rules in 897 ms. Remains 2148 /2625 variables (removed 477) and now considering 2018/2590 (removed 572) transitions.
// Phase 1: matrix 2018 rows 2148 cols
[2024-05-25 15:51:10] [INFO ] Computed 214 invariants in 22 ms
[2024-05-25 15:51:11] [INFO ] Implicit Places using invariants in 980 ms returned [147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 419, 1156, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1251, 1252, 1253, 1254, 1255, 1256, 1257, 1258, 1259, 1260, 1261, 1304, 1664, 1665, 1666, 1667, 1668, 1669, 1670, 1671, 1672, 1673, 1674, 1675, 1676, 1677, 1678, 1679, 1680, 1681, 1682, 1683, 1684, 1958]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 983 ms to find 66 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2082/2625 places, 2018/2590 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 2041 transition count 1977
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 2041 transition count 1977
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 2021 transition count 1937
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 2021 transition count 1937
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 2001 transition count 1917
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 2001 transition count 1917
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1981 transition count 1897
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1981 transition count 1897
Applied a total of 202 rules in 635 ms. Remains 1981 /2082 variables (removed 101) and now considering 1897/2018 (removed 121) transitions.
// Phase 1: matrix 1897 rows 1981 cols
[2024-05-25 15:51:12] [INFO ] Computed 148 invariants in 21 ms
[2024-05-25 15:51:12] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-25 15:51:12] [INFO ] Implicit Places using invariants in 789 ms returned []
[2024-05-25 15:51:12] [INFO ] Invariant cache hit.
[2024-05-25 15:51:14] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 2728 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1981/2625 places, 1897/2590 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5246 ms. Remains : 1981/2625 places, 1897/2590 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s1115 s1116 s1117 s1118 s1119 s1120 s1121 s1122 s1123 s1124 s1125 s1126 s1127 s1128 s1129 s1130 s1131 s1132 s1133 s1134 s1135 s1136 s1137 s11...], 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]]
Product exploration explored 100000 steps with 50000 reset in 2276 ms.
Product exploration explored 100000 steps with 50000 reset in 2320 ms.
Computed a total of 1981 stabilizing places and 1897 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1981 transition count 1897
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 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-02 finished in 10633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(F(p1)))))'
Support contains 63 out of 2625 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2625/2625 places, 2590/2590 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2622 transition count 2590
Discarding 130 places :
Symmetric choice reduction at 1 with 130 rule applications. Total rules 133 place count 2492 transition count 2439
Iterating global reduction 1 with 130 rules applied. Total rules applied 263 place count 2492 transition count 2439
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 41 rules applied. Total rules applied 304 place count 2471 transition count 2419
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 370 place count 2405 transition count 2313
Iterating global reduction 2 with 66 rules applied. Total rules applied 436 place count 2405 transition count 2313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 2 with 23 rules applied. Total rules applied 459 place count 2383 transition count 2312
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 523 place count 2319 transition count 2228
Iterating global reduction 3 with 64 rules applied. Total rules applied 587 place count 2319 transition count 2228
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 631 place count 2275 transition count 2144
Iterating global reduction 3 with 44 rules applied. Total rules applied 675 place count 2275 transition count 2144
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 3 with 63 rules applied. Total rules applied 738 place count 2233 transition count 2123
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 780 place count 2191 transition count 2081
Iterating global reduction 4 with 42 rules applied. Total rules applied 822 place count 2191 transition count 2081
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 864 place count 2149 transition count 2039
Iterating global reduction 4 with 42 rules applied. Total rules applied 906 place count 2149 transition count 2039
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 948 place count 2107 transition count 1997
Iterating global reduction 4 with 42 rules applied. Total rules applied 990 place count 2107 transition count 1997
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1032 place count 2065 transition count 1955
Iterating global reduction 4 with 42 rules applied. Total rules applied 1074 place count 2065 transition count 1955
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1116 place count 2023 transition count 1913
Iterating global reduction 4 with 42 rules applied. Total rules applied 1158 place count 2023 transition count 1913
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1200 place count 1981 transition count 1871
Iterating global reduction 4 with 42 rules applied. Total rules applied 1242 place count 1981 transition count 1871
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1284 place count 1939 transition count 1829
Iterating global reduction 4 with 42 rules applied. Total rules applied 1326 place count 1939 transition count 1829
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1368 place count 1897 transition count 1787
Iterating global reduction 4 with 42 rules applied. Total rules applied 1410 place count 1897 transition count 1787
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1452 place count 1855 transition count 1745
Iterating global reduction 4 with 42 rules applied. Total rules applied 1494 place count 1855 transition count 1745
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1536 place count 1813 transition count 1703
Iterating global reduction 4 with 42 rules applied. Total rules applied 1578 place count 1813 transition count 1703
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1620 place count 1771 transition count 1661
Iterating global reduction 4 with 42 rules applied. Total rules applied 1662 place count 1771 transition count 1661
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1704 place count 1729 transition count 1619
Iterating global reduction 4 with 42 rules applied. Total rules applied 1746 place count 1729 transition count 1619
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1788 place count 1687 transition count 1577
Iterating global reduction 4 with 42 rules applied. Total rules applied 1830 place count 1687 transition count 1577
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 4 with 62 rules applied. Total rules applied 1892 place count 1667 transition count 1535
Applied a total of 1892 rules in 2218 ms. Remains 1667 /2625 variables (removed 958) and now considering 1535/2590 (removed 1055) transitions.
// Phase 1: matrix 1535 rows 1667 cols
[2024-05-25 15:51:22] [INFO ] Computed 194 invariants in 17 ms
[2024-05-25 15:51:23] [INFO ] Implicit Places using invariants in 910 ms returned [273, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 717, 823, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198, 1199, 1200, 1201, 1202, 1203, 1477]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 913 ms to find 46 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1621/2625 places, 1535/2590 transitions.
Applied a total of 0 rules in 93 ms. Remains 1621 /1621 variables (removed 0) and now considering 1535/1535 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3225 ms. Remains : 1621/2625 places, 1535/2590 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (AND (LEQ (ADD s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1054 steps with 0 reset in 8 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-03 finished in 3452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||(p1 U (p2||G(p1)))))))'
Support contains 168 out of 2625 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2625/2625 places, 2590/2590 transitions.
Graph (complete) has 3764 edges and 2625 vertex of which 2554 are kept as prefixes of interest. Removing 71 places using SCC suffix rule.10 ms
Discarding 71 places :
Also discarding 47 output transitions
Drop transitions removed 47 transitions
Reduce places removed 21 places and 21 transitions.
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Drop transitions removed 1131 transitions
Trivial Post-agglo rules discarded 1131 transitions
Performed 1131 trivial Post agglomeration. Transition count delta: 1131
Iterating post reduction 0 with 1173 rules applied. Total rules applied 1174 place count 2533 transition count 1349
Reduce places removed 1131 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 1211 rules applied. Total rules applied 2385 place count 1382 transition count 1289
Reduce places removed 40 places and 0 transitions.
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Iterating post reduction 2 with 166 rules applied. Total rules applied 2551 place count 1342 transition count 1163
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 3 with 126 rules applied. Total rules applied 2677 place count 1216 transition count 1163
Performed 211 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 211 Pre rules applied. Total rules applied 2677 place count 1216 transition count 952
Deduced a syphon composed of 211 places in 1 ms
Ensure Unique test removed 84 places
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 4 with 506 rules applied. Total rules applied 3183 place count 921 transition count 952
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 4 with 63 rules applied. Total rules applied 3246 place count 900 transition count 910
Reduce places removed 42 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 5 with 63 rules applied. Total rules applied 3309 place count 858 transition count 889
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 3330 place count 837 transition count 889
Discarding 107 places :
Symmetric choice reduction at 7 with 107 rule applications. Total rules 3437 place count 730 transition count 782
Iterating global reduction 7 with 107 rules applied. Total rules applied 3544 place count 730 transition count 782
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 with 28 rules applied. Total rules applied 3572 place count 728 transition count 756
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 3597 place count 703 transition count 756
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 42 Pre rules applied. Total rules applied 3597 place count 703 transition count 714
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 9 with 84 rules applied. Total rules applied 3681 place count 661 transition count 714
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 3685 place count 657 transition count 630
Iterating global reduction 9 with 4 rules applied. Total rules applied 3689 place count 657 transition count 630
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 63 places :
Implicit places reduction removed 63 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 126 rules applied. Total rules applied 3815 place count 594 transition count 567
Reduce places removed 21 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 10 with 63 rules applied. Total rules applied 3878 place count 573 transition count 525
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 11 with 42 rules applied. Total rules applied 3920 place count 531 transition count 525
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 12 with 84 rules applied. Total rules applied 4004 place count 489 transition count 483
Applied a total of 4004 rules in 284 ms. Remains 489 /2625 variables (removed 2136) and now considering 483/2590 (removed 2107) transitions.
// Phase 1: matrix 483 rows 489 cols
[2024-05-25 15:51:24] [INFO ] Computed 88 invariants in 3 ms
[2024-05-25 15:51:24] [INFO ] Implicit Places using invariants in 379 ms returned [21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 167, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 252, 253, 254, 255, 256, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 298, 362]
Discarding 65 places :
Implicit Place search using SMT only with invariants took 381 ms to find 65 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 424/2625 places, 483/2590 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 424 transition count 462
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 403 transition count 462
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 403 transition count 441
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 105 place count 361 transition count 441
Applied a total of 105 rules in 20 ms. Remains 361 /424 variables (removed 63) and now considering 441/483 (removed 42) transitions.
// Phase 1: matrix 441 rows 361 cols
[2024-05-25 15:51:24] [INFO ] Computed 2 invariants in 2 ms
[2024-05-25 15:51:24] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-25 15:51:24] [INFO ] Invariant cache hit.
[2024-05-25 15:51:24] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 361/2625 places, 441/2590 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1173 ms. Remains : 361/2625 places, 441/2590 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 516 reset in 584 ms.
Product exploration explored 100000 steps with 515 reset in 734 ms.
Computed a total of 361 stabilizing places and 441 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 361 transition count 441
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) p1 (NOT p2)), (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 19 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-04 finished in 2813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 42 out of 2625 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2625/2625 places, 2590/2590 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2622 transition count 2590
Discarding 131 places :
Symmetric choice reduction at 1 with 131 rule applications. Total rules 134 place count 2491 transition count 2438
Iterating global reduction 1 with 131 rules applied. Total rules applied 265 place count 2491 transition count 2438
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 266 place count 2490 transition count 2438
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 331 place count 2425 transition count 2333
Iterating global reduction 2 with 65 rules applied. Total rules applied 396 place count 2425 transition count 2333
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 21 rules applied. Total rules applied 417 place count 2404 transition count 2333
Discarding 85 places :
Symmetric choice reduction at 3 with 85 rule applications. Total rules 502 place count 2319 transition count 2228
Iterating global reduction 3 with 85 rules applied. Total rules applied 587 place count 2319 transition count 2228
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 632 place count 2274 transition count 2123
Iterating global reduction 3 with 45 rules applied. Total rules applied 677 place count 2274 transition count 2123
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Iterating post reduction 3 with 84 rules applied. Total rules applied 761 place count 2211 transition count 2102
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 803 place count 2169 transition count 2060
Iterating global reduction 4 with 42 rules applied. Total rules applied 845 place count 2169 transition count 2060
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 887 place count 2127 transition count 2018
Iterating global reduction 4 with 42 rules applied. Total rules applied 929 place count 2127 transition count 2018
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 971 place count 2085 transition count 1976
Iterating global reduction 4 with 42 rules applied. Total rules applied 1013 place count 2085 transition count 1976
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1055 place count 2043 transition count 1934
Iterating global reduction 4 with 42 rules applied. Total rules applied 1097 place count 2043 transition count 1934
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1139 place count 2001 transition count 1892
Iterating global reduction 4 with 42 rules applied. Total rules applied 1181 place count 2001 transition count 1892
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1223 place count 1959 transition count 1850
Iterating global reduction 4 with 42 rules applied. Total rules applied 1265 place count 1959 transition count 1850
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1307 place count 1917 transition count 1808
Iterating global reduction 4 with 42 rules applied. Total rules applied 1349 place count 1917 transition count 1808
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1391 place count 1875 transition count 1766
Iterating global reduction 4 with 42 rules applied. Total rules applied 1433 place count 1875 transition count 1766
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1475 place count 1833 transition count 1724
Iterating global reduction 4 with 42 rules applied. Total rules applied 1517 place count 1833 transition count 1724
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1559 place count 1791 transition count 1682
Iterating global reduction 4 with 42 rules applied. Total rules applied 1601 place count 1791 transition count 1682
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1643 place count 1749 transition count 1640
Iterating global reduction 4 with 42 rules applied. Total rules applied 1685 place count 1749 transition count 1640
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1727 place count 1707 transition count 1598
Iterating global reduction 4 with 42 rules applied. Total rules applied 1769 place count 1707 transition count 1598
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1811 place count 1665 transition count 1556
Iterating global reduction 4 with 42 rules applied. Total rules applied 1853 place count 1665 transition count 1556
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 4 with 62 rules applied. Total rules applied 1915 place count 1645 transition count 1514
Applied a total of 1915 rules in 2241 ms. Remains 1645 /2625 variables (removed 980) and now considering 1514/2590 (removed 1076) transitions.
// Phase 1: matrix 1514 rows 1645 cols
[2024-05-25 15:51:28] [INFO ] Computed 194 invariants in 13 ms
[2024-05-25 15:51:29] [INFO ] Implicit Places using invariants in 941 ms returned [273, 653, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 713, 714, 715, 716, 759, 1035, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1180, 1181, 1455]
Discarding 67 places :
Implicit Place search using SMT only with invariants took 942 ms to find 67 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1578/2625 places, 1514/2590 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1537 transition count 1473
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1537 transition count 1473
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1517 transition count 1433
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1517 transition count 1433
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1497 transition count 1413
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1497 transition count 1413
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1477 transition count 1393
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1477 transition count 1393
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1457 transition count 1373
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1457 transition count 1373
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 262 place count 1437 transition count 1353
Iterating global reduction 0 with 20 rules applied. Total rules applied 282 place count 1437 transition count 1353
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 302 place count 1417 transition count 1333
Iterating global reduction 0 with 20 rules applied. Total rules applied 322 place count 1417 transition count 1333
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1397 transition count 1313
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1397 transition count 1313
Applied a total of 362 rules in 622 ms. Remains 1397 /1578 variables (removed 181) and now considering 1313/1514 (removed 201) transitions.
// Phase 1: matrix 1313 rows 1397 cols
[2024-05-25 15:51:30] [INFO ] Computed 127 invariants in 6 ms
[2024-05-25 15:51:30] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-25 15:51:30] [INFO ] Invariant cache hit.
[2024-05-25 15:51:32] [INFO ] Implicit Places using invariants and state equation in 1402 ms returned []
Implicit Place search using SMT with State Equation took 1824 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1397/2625 places, 1313/2590 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5630 ms. Remains : 1397/2625 places, 1313/2590 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s830 s831 s832 s833 s834 s835 s836 s837 s838 s839 s840 s841 s842 s843 s844 s845 s846 s847 s848 s849 s850 s851 s852 s853 s854 s855 s856 s857...], 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]]
Product exploration explored 100000 steps with 210 reset in 356 ms.
Stuttering criterion allowed to conclude after 9387 steps with 17 reset in 37 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-05 finished in 6122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 21 out of 2625 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2625/2625 places, 2590/2590 transitions.
Graph (complete) has 3764 edges and 2625 vertex of which 1348 are kept as prefixes of interest. Removing 1277 places using SCC suffix rule.4 ms
Discarding 1277 places :
Also discarding 1202 output transitions
Drop transitions removed 1202 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 989 transitions
Trivial Post-agglo rules discarded 989 transitions
Performed 989 trivial Post agglomeration. Transition count delta: 989
Iterating post reduction 0 with 989 rules applied. Total rules applied 990 place count 1327 transition count 378
Reduce places removed 989 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 1009 rules applied. Total rules applied 1999 place count 338 transition count 358
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 1999 place count 338 transition count 316
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 2103 place count 276 transition count 316
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 2147 place count 232 transition count 272
Iterating global reduction 2 with 44 rules applied. Total rules applied 2191 place count 232 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2192 place count 232 transition count 271
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 2192 place count 232 transition count 249
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 45 rules applied. Total rules applied 2237 place count 209 transition count 249
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2239 place count 207 transition count 207
Iterating global reduction 3 with 2 rules applied. Total rules applied 2241 place count 207 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 3 with 23 rules applied. Total rules applied 2264 place count 186 transition count 205
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 2264 place count 186 transition count 184
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 2306 place count 165 transition count 184
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 2346 place count 125 transition count 144
Iterating global reduction 4 with 40 rules applied. Total rules applied 2386 place count 125 transition count 144
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 2426 place count 125 transition count 104
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2426 place count 125 transition count 84
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 2486 place count 85 transition count 84
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 5 with 21 rules applied. Total rules applied 2507 place count 64 transition count 63
Applied a total of 2507 rules in 44 ms. Remains 64 /2625 variables (removed 2561) and now considering 63/2590 (removed 2527) transitions.
// Phase 1: matrix 63 rows 64 cols
[2024-05-25 15:51:32] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 15:51:32] [INFO ] Implicit Places using invariants in 58 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/2625 places, 63/2590 transitions.
Reduce places removed 21 places and 21 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /63 variables (removed 21) and now considering 42/63 (removed 21) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 109 ms. Remains : 42/2625 places, 42/2590 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-07 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:(GT 2 (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2639 reset in 207 ms.
Product exploration explored 100000 steps with 2631 reset in 230 ms.
Computed a total of 42 stabilizing places and 42 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 42 transition count 42
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, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-07 finished in 702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (p1 U p2))))'
Support contains 5 out of 2625 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2625/2625 places, 2590/2590 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 2623 transition count 2590
Discarding 148 places :
Symmetric choice reduction at 1 with 148 rule applications. Total rules 150 place count 2475 transition count 2421
Iterating global reduction 1 with 148 rules applied. Total rules applied 298 place count 2475 transition count 2421
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 41 rules applied. Total rules applied 339 place count 2454 transition count 2401
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 405 place count 2388 transition count 2295
Iterating global reduction 2 with 66 rules applied. Total rules applied 471 place count 2388 transition count 2295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 22 rules applied. Total rules applied 493 place count 2367 transition count 2294
Discarding 85 places :
Symmetric choice reduction at 3 with 85 rule applications. Total rules 578 place count 2282 transition count 2189
Iterating global reduction 3 with 85 rules applied. Total rules applied 663 place count 2282 transition count 2189
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 708 place count 2237 transition count 2084
Iterating global reduction 3 with 45 rules applied. Total rules applied 753 place count 2237 transition count 2084
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Iterating post reduction 3 with 84 rules applied. Total rules applied 837 place count 2174 transition count 2063
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 877 place count 2134 transition count 2023
Iterating global reduction 4 with 40 rules applied. Total rules applied 917 place count 2134 transition count 2023
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 957 place count 2094 transition count 1983
Iterating global reduction 4 with 40 rules applied. Total rules applied 997 place count 2094 transition count 1983
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 1037 place count 2054 transition count 1943
Iterating global reduction 4 with 40 rules applied. Total rules applied 1077 place count 2054 transition count 1943
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 1116 place count 2015 transition count 1904
Iterating global reduction 4 with 39 rules applied. Total rules applied 1155 place count 2015 transition count 1904
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 1194 place count 1976 transition count 1865
Iterating global reduction 4 with 39 rules applied. Total rules applied 1233 place count 1976 transition count 1865
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 1272 place count 1937 transition count 1826
Iterating global reduction 4 with 39 rules applied. Total rules applied 1311 place count 1937 transition count 1826
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 1350 place count 1898 transition count 1787
Iterating global reduction 4 with 39 rules applied. Total rules applied 1389 place count 1898 transition count 1787
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 1428 place count 1859 transition count 1748
Iterating global reduction 4 with 39 rules applied. Total rules applied 1467 place count 1859 transition count 1748
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 1506 place count 1820 transition count 1709
Iterating global reduction 4 with 39 rules applied. Total rules applied 1545 place count 1820 transition count 1709
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 1584 place count 1781 transition count 1670
Iterating global reduction 4 with 39 rules applied. Total rules applied 1623 place count 1781 transition count 1670
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 1662 place count 1742 transition count 1631
Iterating global reduction 4 with 39 rules applied. Total rules applied 1701 place count 1742 transition count 1631
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 1740 place count 1703 transition count 1592
Iterating global reduction 4 with 39 rules applied. Total rules applied 1779 place count 1703 transition count 1592
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 1818 place count 1664 transition count 1553
Iterating global reduction 4 with 39 rules applied. Total rules applied 1857 place count 1664 transition count 1553
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Discarding 17 places :
Implicit places reduction removed 17 places
Iterating post reduction 4 with 56 rules applied. Total rules applied 1913 place count 1647 transition count 1514
Applied a total of 1913 rules in 2340 ms. Remains 1647 /2625 variables (removed 978) and now considering 1514/2590 (removed 1076) transitions.
// Phase 1: matrix 1514 rows 1647 cols
[2024-05-25 15:51:35] [INFO ] Computed 178 invariants in 14 ms
[2024-05-25 15:51:36] [INFO ] Implicit Places using invariants in 909 ms returned [147, 148, 149, 285, 688, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 799, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1180, 1181, 1182, 1456]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 914 ms to find 49 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1598/2625 places, 1514/2590 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1559 transition count 1475
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1559 transition count 1475
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 97 place count 1540 transition count 1437
Iterating global reduction 0 with 19 rules applied. Total rules applied 116 place count 1540 transition count 1437
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 135 place count 1521 transition count 1418
Iterating global reduction 0 with 19 rules applied. Total rules applied 154 place count 1521 transition count 1418
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 173 place count 1502 transition count 1399
Iterating global reduction 0 with 19 rules applied. Total rules applied 192 place count 1502 transition count 1399
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 211 place count 1483 transition count 1380
Iterating global reduction 0 with 19 rules applied. Total rules applied 230 place count 1483 transition count 1380
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 249 place count 1464 transition count 1361
Iterating global reduction 0 with 19 rules applied. Total rules applied 268 place count 1464 transition count 1361
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 287 place count 1445 transition count 1342
Iterating global reduction 0 with 19 rules applied. Total rules applied 306 place count 1445 transition count 1342
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 325 place count 1426 transition count 1323
Iterating global reduction 0 with 19 rules applied. Total rules applied 344 place count 1426 transition count 1323
Applied a total of 344 rules in 701 ms. Remains 1426 /1598 variables (removed 172) and now considering 1323/1514 (removed 191) transitions.
// Phase 1: matrix 1323 rows 1426 cols
[2024-05-25 15:51:37] [INFO ] Computed 129 invariants in 6 ms
[2024-05-25 15:51:37] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-05-25 15:51:37] [INFO ] Invariant cache hit.
[2024-05-25 15:51:39] [INFO ] Implicit Places using invariants and state equation in 1356 ms returned []
Implicit Place search using SMT with State Equation took 1835 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1426/2625 places, 1323/2590 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5791 ms. Remains : 1426/2625 places, 1323/2590 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), (NOT p2), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 1 s553), p1:(OR (GT s794 s658) (AND (LEQ s794 s658) (LEQ s1278 s636))), p0:(GT s794 s658)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1974 steps with 4 reset in 11 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-08 finished in 5964 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 2625 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2625/2625 places, 2590/2590 transitions.
Graph (complete) has 3764 edges and 2625 vertex of which 2518 are kept as prefixes of interest. Removing 107 places using SCC suffix rule.4 ms
Discarding 107 places :
Also discarding 124 output transitions
Drop transitions removed 124 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 1342 transitions
Trivial Post-agglo rules discarded 1342 transitions
Performed 1342 trivial Post agglomeration. Transition count delta: 1342
Iterating post reduction 0 with 1342 rules applied. Total rules applied 1343 place count 2497 transition count 1103
Reduce places removed 1342 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 1422 rules applied. Total rules applied 2765 place count 1135 transition count 1043
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 2805 place count 1095 transition count 1043
Performed 211 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 211 Pre rules applied. Total rules applied 2805 place count 1095 transition count 832
Deduced a syphon composed of 211 places in 1 ms
Ensure Unique test removed 105 places
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 3 with 527 rules applied. Total rules applied 3332 place count 779 transition count 832
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 3 with 41 rules applied. Total rules applied 3373 place count 779 transition count 791
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 4 with 41 rules applied. Total rules applied 3414 place count 738 transition count 791
Discarding 127 places :
Symmetric choice reduction at 5 with 127 rule applications. Total rules 3541 place count 611 transition count 644
Iterating global reduction 5 with 127 rules applied. Total rules applied 3668 place count 611 transition count 644
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 50 rules applied. Total rules applied 3718 place count 609 transition count 596
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 6 with 47 rules applied. Total rules applied 3765 place count 562 transition count 596
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 3765 place count 562 transition count 575
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 3807 place count 541 transition count 575
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 3811 place count 537 transition count 510
Iterating global reduction 7 with 4 rules applied. Total rules applied 3815 place count 537 transition count 510
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Discarding 42 places :
Implicit places reduction removed 42 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 7 with 107 rules applied. Total rules applied 3922 place count 495 transition count 445
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 8 with 42 rules applied. Total rules applied 3964 place count 453 transition count 445
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 22 Pre rules applied. Total rules applied 3964 place count 453 transition count 423
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 9 with 44 rules applied. Total rules applied 4008 place count 431 transition count 423
Discarding 41 places :
Symmetric choice reduction at 9 with 41 rule applications. Total rules 4049 place count 390 transition count 362
Iterating global reduction 9 with 41 rules applied. Total rules applied 4090 place count 390 transition count 362
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 41 rules applied. Total rules applied 4131 place count 389 transition count 322
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 21 Pre rules applied. Total rules applied 4131 place count 389 transition count 301
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 10 with 62 rules applied. Total rules applied 4193 place count 348 transition count 301
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 10 with 128 rules applied. Total rules applied 4321 place count 284 transition count 237
Reduce places removed 21 places and 21 transitions.
Iterating global reduction 10 with 21 rules applied. Total rules applied 4342 place count 263 transition count 216
Applied a total of 4342 rules in 171 ms. Remains 263 /2625 variables (removed 2362) and now considering 216/2590 (removed 2374) transitions.
// Phase 1: matrix 216 rows 263 cols
[2024-05-25 15:51:39] [INFO ] Computed 89 invariants in 3 ms
[2024-05-25 15:51:39] [INFO ] Implicit Places using invariants in 443 ms returned [0, 22, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 105, 107, 129, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220]
Discarding 87 places :
Implicit Place search using SMT only with invariants took 445 ms to find 87 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 176/2625 places, 216/2590 transitions.
Graph (complete) has 278 edges and 176 vertex of which 155 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 21 output transitions
Drop transitions removed 21 transitions
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 155 transition count 174
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 134 transition count 174
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 43 place count 134 transition count 132
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 127 place count 92 transition count 132
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 146 place count 73 transition count 113
Iterating global reduction 2 with 19 rules applied. Total rules applied 165 place count 73 transition count 113
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 184 place count 54 transition count 75
Iterating global reduction 2 with 19 rules applied. Total rules applied 203 place count 54 transition count 75
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 222 place count 35 transition count 56
Iterating global reduction 2 with 19 rules applied. Total rules applied 241 place count 35 transition count 56
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 259 place count 17 transition count 20
Iterating global reduction 2 with 18 rules applied. Total rules applied 277 place count 17 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 2 with 2 rules applied. Total rules applied 279 place count 16 transition count 19
Applied a total of 279 rules in 8 ms. Remains 16 /176 variables (removed 160) and now considering 19/216 (removed 197) transitions.
// Phase 1: matrix 19 rows 16 cols
[2024-05-25 15:51:39] [INFO ] Computed 2 invariants in 0 ms
[2024-05-25 15:51:39] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-25 15:51:39] [INFO ] Invariant cache hit.
[2024-05-25 15:51:40] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/2625 places, 19/2590 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 687 ms. Remains : 16/2625 places, 19/2590 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT s10 s9) (AND (GT 1 s5) (GT s10 s9)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 1 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-10 finished in 747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2625 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2625/2625 places, 2590/2590 transitions.
Graph (complete) has 3764 edges and 2625 vertex of which 992 are kept as prefixes of interest. Removing 1633 places using SCC suffix rule.2 ms
Discarding 1633 places :
Also discarding 1537 output transitions
Drop transitions removed 1537 transitions
Reduce places removed 21 places and 21 transitions.
Drop transitions removed 812 transitions
Trivial Post-agglo rules discarded 812 transitions
Performed 812 trivial Post agglomeration. Transition count delta: 812
Iterating post reduction 0 with 812 rules applied. Total rules applied 813 place count 971 transition count 220
Reduce places removed 812 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 816 rules applied. Total rules applied 1629 place count 158 transition count 217
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1631 place count 156 transition count 217
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 1631 place count 156 transition count 196
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 1673 place count 135 transition count 196
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 1694 place count 114 transition count 139
Iterating global reduction 3 with 21 rules applied. Total rules applied 1715 place count 114 transition count 139
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1715 place count 114 transition count 137
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1719 place count 112 transition count 137
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1722 place count 109 transition count 130
Iterating global reduction 3 with 3 rules applied. Total rules applied 1725 place count 109 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1727 place count 109 transition count 128
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 1767 place count 69 transition count 88
Iterating global reduction 4 with 40 rules applied. Total rules applied 1807 place count 69 transition count 88
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 1847 place count 69 transition count 48
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 1847 place count 69 transition count 28
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 1907 place count 29 transition count 28
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1926 place count 10 transition count 9
Iterating global reduction 5 with 19 rules applied. Total rules applied 1945 place count 10 transition count 9
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 1947 place count 9 transition count 8
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1949 place count 7 transition count 6
Applied a total of 1949 rules in 22 ms. Remains 7 /2625 variables (removed 2618) and now considering 6/2590 (removed 2584) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-25 15:51:40] [INFO ] Computed 2 invariants in 0 ms
[2024-05-25 15:51:40] [INFO ] Implicit Places using invariants in 24 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/2625 places, 6/2590 transitions.
Graph (complete) has 3 edges and 5 vertex of which 4 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.
Applied a total of 1 rules in 1 ms. Remains 3 /5 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 15:51:40] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 15:51:40] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-25 15:51:40] [INFO ] Invariant cache hit.
[2024-05-25 15:51:40] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/2625 places, 4/2590 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 87 ms. Remains : 3/2625 places, 4/2590 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-12 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:(LEQ 1 s2)], 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 7 steps with 2 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-12 finished in 176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((p1 U (p2||X(p3)||G(p1))))&&p0))))'
Support contains 6 out of 2625 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2625/2625 places, 2590/2590 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2622 transition count 2590
Discarding 150 places :
Symmetric choice reduction at 1 with 150 rule applications. Total rules 153 place count 2472 transition count 2419
Iterating global reduction 1 with 150 rules applied. Total rules applied 303 place count 2472 transition count 2419
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 1 with 40 rules applied. Total rules applied 343 place count 2452 transition count 2399
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 407 place count 2388 transition count 2315
Iterating global reduction 2 with 64 rules applied. Total rules applied 471 place count 2388 transition count 2315
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 21 rules applied. Total rules applied 492 place count 2367 transition count 2315
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 556 place count 2303 transition count 2231
Iterating global reduction 3 with 64 rules applied. Total rules applied 620 place count 2303 transition count 2231
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 664 place count 2259 transition count 2147
Iterating global reduction 3 with 44 rules applied. Total rules applied 708 place count 2259 transition count 2147
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 42 places :
Implicit places reduction removed 42 places
Iterating post reduction 3 with 63 rules applied. Total rules applied 771 place count 2217 transition count 2126
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 813 place count 2175 transition count 2084
Iterating global reduction 4 with 42 rules applied. Total rules applied 855 place count 2175 transition count 2084
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 897 place count 2133 transition count 2042
Iterating global reduction 4 with 42 rules applied. Total rules applied 939 place count 2133 transition count 2042
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 981 place count 2091 transition count 2000
Iterating global reduction 4 with 42 rules applied. Total rules applied 1023 place count 2091 transition count 2000
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1065 place count 2049 transition count 1958
Iterating global reduction 4 with 42 rules applied. Total rules applied 1107 place count 2049 transition count 1958
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 1148 place count 2008 transition count 1917
Iterating global reduction 4 with 41 rules applied. Total rules applied 1189 place count 2008 transition count 1917
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 1230 place count 1967 transition count 1876
Iterating global reduction 4 with 41 rules applied. Total rules applied 1271 place count 1967 transition count 1876
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 1312 place count 1926 transition count 1835
Iterating global reduction 4 with 41 rules applied. Total rules applied 1353 place count 1926 transition count 1835
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 1394 place count 1885 transition count 1794
Iterating global reduction 4 with 41 rules applied. Total rules applied 1435 place count 1885 transition count 1794
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 1476 place count 1844 transition count 1753
Iterating global reduction 4 with 41 rules applied. Total rules applied 1517 place count 1844 transition count 1753
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 1558 place count 1803 transition count 1712
Iterating global reduction 4 with 41 rules applied. Total rules applied 1599 place count 1803 transition count 1712
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 1640 place count 1762 transition count 1671
Iterating global reduction 4 with 41 rules applied. Total rules applied 1681 place count 1762 transition count 1671
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 1722 place count 1721 transition count 1630
Iterating global reduction 4 with 41 rules applied. Total rules applied 1763 place count 1721 transition count 1630
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 1804 place count 1680 transition count 1589
Iterating global reduction 4 with 41 rules applied. Total rules applied 1845 place count 1680 transition count 1589
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 4 with 60 rules applied. Total rules applied 1905 place count 1661 transition count 1548
Applied a total of 1905 rules in 2506 ms. Remains 1661 /2625 variables (removed 964) and now considering 1548/2590 (removed 1042) transitions.
// Phase 1: matrix 1548 rows 1661 cols
[2024-05-25 15:51:42] [INFO ] Computed 197 invariants in 18 ms
[2024-05-25 15:51:43] [INFO ] Implicit Places using invariants in 932 ms returned [147, 277, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 463, 464, 465, 466, 467, 468, 469, 470, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 813, 982, 1090, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1471]
Discarding 68 places :
Implicit Place search using SMT only with invariants took 934 ms to find 68 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1593/2625 places, 1548/2590 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1552 transition count 1507
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1552 transition count 1507
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1532 transition count 1467
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1532 transition count 1467
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1512 transition count 1427
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1512 transition count 1427
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1492 transition count 1407
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1492 transition count 1407
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 221 place count 1473 transition count 1388
Iterating global reduction 0 with 19 rules applied. Total rules applied 240 place count 1473 transition count 1388
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 278 place count 1435 transition count 1350
Iterating global reduction 0 with 38 rules applied. Total rules applied 316 place count 1435 transition count 1350
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 335 place count 1416 transition count 1312
Iterating global reduction 0 with 19 rules applied. Total rules applied 354 place count 1416 transition count 1312
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 373 place count 1397 transition count 1293
Iterating global reduction 0 with 19 rules applied. Total rules applied 392 place count 1397 transition count 1293
Applied a total of 392 rules in 724 ms. Remains 1397 /1593 variables (removed 196) and now considering 1293/1548 (removed 255) transitions.
// Phase 1: matrix 1293 rows 1397 cols
[2024-05-25 15:51:44] [INFO ] Computed 129 invariants in 10 ms
[2024-05-25 15:51:44] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-25 15:51:44] [INFO ] Invariant cache hit.
[2024-05-25 15:51:46] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 2065 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1397/2625 places, 1293/2590 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6230 ms. Remains : 1397/2625 places, 1293/2590 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={} source=2 dest: 2}, { cond=(OR (AND p0 p2 p3) (AND p0 p1 p3)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GT s518 s892) (GT 2 s570)), p3:(GT s67 s448), p2:(GT 1 s92), p1:(GT s518 s892)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FamilyReunion-PT-L00020M0002C001P001G001-LTLCardinality-15 finished in 6469 ms.
All properties solved by simple procedures.
Total runtime 66210 ms.

BK_STOP 1716652308007

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r175-smll-171636280400307"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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