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.r373-tall-171683789800647.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 ShieldRVt-PT-050B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789800647
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 11 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 614K May 18 16:43 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 ShieldRVt-PT-050B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717015910338

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=ShieldRVt-PT-050B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 20:51:52] [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-29 20:51:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:51:52] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2024-05-29 20:51:52] [INFO ] Transformed 2503 places.
[2024-05-29 20:51:52] [INFO ] Transformed 2503 transitions.
[2024-05-29 20:51:52] [INFO ] Found NUPN structural information;
[2024-05-29 20:51:52] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-050B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Discarding 538 places :
Symmetric choice reduction at 0 with 538 rule applications. Total rules 538 place count 1965 transition count 1965
Iterating global reduction 0 with 538 rules applied. Total rules applied 1076 place count 1965 transition count 1965
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1077 place count 1964 transition count 1964
Iterating global reduction 0 with 1 rules applied. Total rules applied 1078 place count 1964 transition count 1964
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1079 place count 1963 transition count 1963
Iterating global reduction 0 with 1 rules applied. Total rules applied 1080 place count 1963 transition count 1963
Applied a total of 1080 rules in 783 ms. Remains 1963 /2503 variables (removed 540) and now considering 1963/2503 (removed 540) transitions.
// Phase 1: matrix 1963 rows 1963 cols
[2024-05-29 20:51:53] [INFO ] Computed 201 invariants in 25 ms
[2024-05-29 20:51:54] [INFO ] Implicit Places using invariants in 764 ms returned []
[2024-05-29 20:51:54] [INFO ] Invariant cache hit.
[2024-05-29 20:51:56] [INFO ] Implicit Places using invariants and state equation in 1687 ms returned []
Implicit Place search using SMT with State Equation took 2591 ms to find 0 implicit places.
[2024-05-29 20:51:56] [INFO ] Invariant cache hit.
[2024-05-29 20:51:57] [INFO ] Dead Transitions using invariants and state equation in 1268 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1963/2503 places, 1963/2503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4646 ms. Remains : 1963/2503 places, 1963/2503 transitions.
Support contains 30 out of 1963 places after structural reductions.
[2024-05-29 20:51:57] [INFO ] Flatten gal took : 136 ms
[2024-05-29 20:51:57] [INFO ] Flatten gal took : 78 ms
[2024-05-29 20:51:58] [INFO ] Input system was already deterministic with 1963 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-29 20:51:58] [INFO ] Invariant cache hit.
[2024-05-29 20:51:59] [INFO ] [Real]Absence check using 201 positive place invariants in 86 ms returned sat
[2024-05-29 20:51:59] [INFO ] After 629ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 20:52:00] [INFO ] [Nat]Absence check using 201 positive place invariants in 116 ms returned sat
[2024-05-29 20:52:02] [INFO ] After 1694ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 20:52:02] [INFO ] Deduced a trap composed of 35 places in 491 ms of which 10 ms to minimize.
[2024-05-29 20:52:03] [INFO ] Deduced a trap composed of 35 places in 376 ms of which 2 ms to minimize.
[2024-05-29 20:52:03] [INFO ] Deduced a trap composed of 33 places in 396 ms of which 1 ms to minimize.
[2024-05-29 20:52:04] [INFO ] Deduced a trap composed of 44 places in 413 ms of which 3 ms to minimize.
[2024-05-29 20:52:04] [INFO ] Deduced a trap composed of 46 places in 372 ms of which 1 ms to minimize.
[2024-05-29 20:52:04] [INFO ] Deduced a trap composed of 40 places in 379 ms of which 1 ms to minimize.
[2024-05-29 20:52:05] [INFO ] Deduced a trap composed of 41 places in 377 ms of which 2 ms to minimize.
[2024-05-29 20:52:05] [INFO ] Deduced a trap composed of 36 places in 362 ms of which 1 ms to minimize.
[2024-05-29 20:52:06] [INFO ] Deduced a trap composed of 52 places in 342 ms of which 1 ms to minimize.
[2024-05-29 20:52:06] [INFO ] Deduced a trap composed of 50 places in 369 ms of which 1 ms to minimize.
[2024-05-29 20:52:06] [INFO ] Deduced a trap composed of 59 places in 328 ms of which 1 ms to minimize.
[2024-05-29 20:52:07] [INFO ] Deduced a trap composed of 46 places in 334 ms of which 1 ms to minimize.
[2024-05-29 20:52:07] [INFO ] Deduced a trap composed of 46 places in 306 ms of which 1 ms to minimize.
[2024-05-29 20:52:08] [INFO ] Deduced a trap composed of 65 places in 318 ms of which 1 ms to minimize.
[2024-05-29 20:52:08] [INFO ] Deduced a trap composed of 69 places in 321 ms of which 1 ms to minimize.
[2024-05-29 20:52:08] [INFO ] Deduced a trap composed of 83 places in 300 ms of which 1 ms to minimize.
[2024-05-29 20:52:09] [INFO ] Deduced a trap composed of 56 places in 316 ms of which 1 ms to minimize.
[2024-05-29 20:52:09] [INFO ] Deduced a trap composed of 57 places in 300 ms of which 1 ms to minimize.
[2024-05-29 20:52:10] [INFO ] Deduced a trap composed of 55 places in 310 ms of which 0 ms to minimize.
[2024-05-29 20:52:10] [INFO ] Deduced a trap composed of 59 places in 309 ms of which 1 ms to minimize.
[2024-05-29 20:52:10] [INFO ] Deduced a trap composed of 62 places in 295 ms of which 1 ms to minimize.
[2024-05-29 20:52:11] [INFO ] Deduced a trap composed of 64 places in 299 ms of which 1 ms to minimize.
[2024-05-29 20:52:11] [INFO ] Deduced a trap composed of 75 places in 283 ms of which 1 ms to minimize.
[2024-05-29 20:52:11] [INFO ] Deduced a trap composed of 56 places in 284 ms of which 1 ms to minimize.
[2024-05-29 20:52:12] [INFO ] Deduced a trap composed of 74 places in 290 ms of which 1 ms to minimize.
[2024-05-29 20:52:12] [INFO ] Deduced a trap composed of 63 places in 282 ms of which 1 ms to minimize.
[2024-05-29 20:52:12] [INFO ] Deduced a trap composed of 66 places in 272 ms of which 1 ms to minimize.
[2024-05-29 20:52:12] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 10826 ms
[2024-05-29 20:52:13] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 1 ms to minimize.
[2024-05-29 20:52:13] [INFO ] Deduced a trap composed of 72 places in 252 ms of which 0 ms to minimize.
[2024-05-29 20:52:14] [INFO ] Deduced a trap composed of 66 places in 256 ms of which 0 ms to minimize.
[2024-05-29 20:52:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1027 ms
[2024-05-29 20:52:14] [INFO ] Deduced a trap composed of 73 places in 290 ms of which 1 ms to minimize.
[2024-05-29 20:52:15] [INFO ] Deduced a trap composed of 65 places in 285 ms of which 1 ms to minimize.
[2024-05-29 20:52:15] [INFO ] Deduced a trap composed of 65 places in 277 ms of which 0 ms to minimize.
[2024-05-29 20:52:15] [INFO ] Deduced a trap composed of 85 places in 291 ms of which 5 ms to minimize.
[2024-05-29 20:52:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1492 ms
[2024-05-29 20:52:16] [INFO ] Deduced a trap composed of 28 places in 326 ms of which 1 ms to minimize.
[2024-05-29 20:52:16] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 0 ms to minimize.
[2024-05-29 20:52:17] [INFO ] Deduced a trap composed of 28 places in 300 ms of which 1 ms to minimize.
[2024-05-29 20:52:17] [INFO ] Deduced a trap composed of 30 places in 289 ms of which 0 ms to minimize.
[2024-05-29 20:52:17] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 1 ms to minimize.
[2024-05-29 20:52:18] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 2 ms to minimize.
[2024-05-29 20:52:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2207 ms
[2024-05-29 20:52:18] [INFO ] Deduced a trap composed of 54 places in 285 ms of which 1 ms to minimize.
[2024-05-29 20:52:18] [INFO ] Deduced a trap composed of 49 places in 279 ms of which 1 ms to minimize.
[2024-05-29 20:52:19] [INFO ] Deduced a trap composed of 63 places in 288 ms of which 5 ms to minimize.
[2024-05-29 20:52:19] [INFO ] Deduced a trap composed of 51 places in 267 ms of which 1 ms to minimize.
[2024-05-29 20:52:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1453 ms
[2024-05-29 20:52:19] [INFO ] Deduced a trap composed of 67 places in 257 ms of which 1 ms to minimize.
[2024-05-29 20:52:20] [INFO ] Deduced a trap composed of 58 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:52:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 704 ms
[2024-05-29 20:52:20] [INFO ] After 20021ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 680 ms.
[2024-05-29 20:52:21] [INFO ] After 21623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 580 ms.
Support contains 17 out of 1963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Drop transitions removed 539 transitions
Trivial Post-agglo rules discarded 539 transitions
Performed 539 trivial Post agglomeration. Transition count delta: 539
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 1963 transition count 1424
Reduce places removed 539 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 542 rules applied. Total rules applied 1081 place count 1424 transition count 1421
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1084 place count 1421 transition count 1421
Performed 391 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 391 Pre rules applied. Total rules applied 1084 place count 1421 transition count 1030
Deduced a syphon composed of 391 places in 1 ms
Reduce places removed 391 places and 0 transitions.
Iterating global reduction 3 with 782 rules applied. Total rules applied 1866 place count 1030 transition count 1030
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1871 place count 1025 transition count 1025
Iterating global reduction 3 with 5 rules applied. Total rules applied 1876 place count 1025 transition count 1025
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1876 place count 1025 transition count 1021
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1884 place count 1021 transition count 1021
Performed 445 Post agglomeration using F-continuation condition.Transition count delta: 445
Deduced a syphon composed of 445 places in 1 ms
Reduce places removed 445 places and 0 transitions.
Iterating global reduction 3 with 890 rules applied. Total rules applied 2774 place count 576 transition count 576
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2775 place count 576 transition count 575
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2777 place count 575 transition count 574
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2979 place count 474 transition count 670
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 3065 place count 431 transition count 711
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3066 place count 431 transition count 710
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3070 place count 431 transition count 706
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 3074 place count 427 transition count 706
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 3078 place count 427 transition count 702
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3079 place count 426 transition count 701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3080 place count 425 transition count 701
Applied a total of 3080 rules in 363 ms. Remains 425 /1963 variables (removed 1538) and now considering 701/1963 (removed 1262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 425/1963 places, 701/1963 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) 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 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 701 rows 425 cols
[2024-05-29 20:52:22] [INFO ] Computed 200 invariants in 3 ms
[2024-05-29 20:52:22] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:52:22] [INFO ] [Nat]Absence check using 200 positive place invariants in 45 ms returned sat
[2024-05-29 20:52:23] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:52:23] [INFO ] State equation strengthened by 228 read => feed constraints.
[2024-05-29 20:52:26] [INFO ] After 3595ms SMT Verify possible using 228 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 20:52:27] [INFO ] After 4380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1757 ms.
[2024-05-29 20:52:29] [INFO ] After 6613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 114 ms.
Support contains 8 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 701/701 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 425 transition count 697
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 421 transition count 697
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 421 transition count 694
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 418 transition count 694
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 415 transition count 691
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 413 transition count 695
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 412 transition count 694
Applied a total of 25 rules in 99 ms. Remains 412 /425 variables (removed 13) and now considering 694/701 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 412/425 places, 694/701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 226543 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 226543 steps, saw 152300 distinct states, run finished after 3002 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 694 rows 412 cols
[2024-05-29 20:52:32] [INFO ] Computed 200 invariants in 3 ms
[2024-05-29 20:52:33] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:52:33] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2024-05-29 20:52:33] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:52:33] [INFO ] State equation strengthened by 218 read => feed constraints.
[2024-05-29 20:52:33] [INFO ] After 353ms SMT Verify possible using 218 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 20:52:34] [INFO ] After 858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5928 ms.
[2024-05-29 20:52:40] [INFO ] After 7222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 155 ms.
Support contains 8 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 694/694 transitions.
Applied a total of 0 rules in 14 ms. Remains 412 /412 variables (removed 0) and now considering 694/694 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 412/412 places, 694/694 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 694/694 transitions.
Applied a total of 0 rules in 14 ms. Remains 412 /412 variables (removed 0) and now considering 694/694 (removed 0) transitions.
[2024-05-29 20:52:40] [INFO ] Invariant cache hit.
[2024-05-29 20:52:40] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-29 20:52:40] [INFO ] Invariant cache hit.
[2024-05-29 20:52:41] [INFO ] State equation strengthened by 218 read => feed constraints.
[2024-05-29 20:52:42] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
[2024-05-29 20:52:42] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-29 20:52:42] [INFO ] Invariant cache hit.
[2024-05-29 20:52:42] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2083 ms. Remains : 412/412 places, 694/694 transitions.
Graph (trivial) has 190 edges and 412 vertex of which 4 / 412 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1487 edges and 410 vertex of which 408 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 187 edges and 406 vertex of which 4 / 406 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 404 transition count 685
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 186 edges and 402 vertex of which 6 / 402 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 399 transition count 676
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 183 edges and 397 vertex of which 6 / 397 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 14 rules applied. Total rules applied 34 place count 394 transition count 665
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 181 edges and 391 vertex of which 8 / 391 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 15 rules applied. Total rules applied 49 place count 387 transition count 654
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 1383 edges and 383 vertex of which 380 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Graph (trivial) has 176 edges and 380 vertex of which 8 / 380 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 20 rules applied. Total rules applied 69 place count 376 transition count 637
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 172 edges and 372 vertex of which 8 / 372 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 88 place count 368 transition count 623
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 168 edges and 364 vertex of which 8 / 364 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 107 place count 360 transition count 609
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 164 edges and 356 vertex of which 8 / 356 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 126 place count 352 transition count 595
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 160 edges and 348 vertex of which 8 / 348 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 145 place count 344 transition count 581
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 156 edges and 340 vertex of which 8 / 340 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 164 place count 336 transition count 567
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 152 edges and 332 vertex of which 6 / 332 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 10 with 17 rules applied. Total rules applied 181 place count 329 transition count 555
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 149 edges and 326 vertex of which 6 / 326 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 11 with 16 rules applied. Total rules applied 197 place count 323 transition count 543
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 147 edges and 320 vertex of which 6 / 320 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 15 rules applied. Total rules applied 212 place count 317 transition count 532
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 145 edges and 314 vertex of which 8 / 314 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 15 rules applied. Total rules applied 227 place count 310 transition count 521
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 1109 edges and 306 vertex of which 300 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (trivial) has 138 edges and 300 vertex of which 8 / 300 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 21 rules applied. Total rules applied 248 place count 296 transition count 501
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 134 edges and 292 vertex of which 8 / 292 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 267 place count 288 transition count 487
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 130 edges and 284 vertex of which 8 / 284 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 286 place count 280 transition count 473
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 126 edges and 276 vertex of which 8 / 276 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 305 place count 272 transition count 459
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 122 edges and 268 vertex of which 8 / 268 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 324 place count 264 transition count 445
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 118 edges and 260 vertex of which 8 / 260 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 343 place count 256 transition count 431
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 114 edges and 252 vertex of which 6 / 252 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 362 place count 249 transition count 417
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 111 edges and 246 vertex of which 6 / 246 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 21 with 14 rules applied. Total rules applied 376 place count 243 transition count 407
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 108 edges and 240 vertex of which 6 / 240 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 22 with 16 rules applied. Total rules applied 392 place count 237 transition count 395
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 106 edges and 234 vertex of which 8 / 234 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 15 rules applied. Total rules applied 407 place count 230 transition count 384
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 831 edges and 226 vertex of which 220 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Graph (trivial) has 99 edges and 220 vertex of which 8 / 220 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 21 rules applied. Total rules applied 428 place count 216 transition count 362
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 95 edges and 212 vertex of which 8 / 212 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 447 place count 208 transition count 348
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 91 edges and 204 vertex of which 8 / 204 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 466 place count 200 transition count 334
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 84 edges and 198 vertex of which 2 / 198 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 27 with 13 rules applied. Total rules applied 479 place count 197 transition count 324
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 483 place count 196 transition count 321
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 29 with 2 rules applied. Total rules applied 485 place count 195 transition count 320
Graph (complete) has 732 edges and 195 vertex of which 193 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 29 with 1 rules applied. Total rules applied 486 place count 193 transition count 319
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 490 place count 193 transition count 315
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 31 with 4 rules applied. Total rules applied 494 place count 193 transition count 311
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 496 place count 191 transition count 311
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 32 with 2 rules applied. Total rules applied 498 place count 190 transition count 310
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 32 with 4 rules applied. Total rules applied 502 place count 190 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 503 place count 189 transition count 306
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 33 with 20 rules applied. Total rules applied 523 place count 189 transition count 306
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 33 with 19 rules applied. Total rules applied 542 place count 189 transition count 287
Applied a total of 542 rules in 142 ms. Remains 189 /412 variables (removed 223) and now considering 287/694 (removed 407) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 287 rows 189 cols
[2024-05-29 20:52:42] [INFO ] Computed 89 invariants in 1 ms
[2024-05-29 20:52:42] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:52:42] [INFO ] [Nat]Absence check using 89 positive place invariants in 11 ms returned sat
[2024-05-29 20:52:42] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:52:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 20:52:42] [INFO ] After 44ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 20:52:43] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 39 ms.
[2024-05-29 20:52:43] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 602 stabilizing places and 602 stable transitions
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)))'
Support contains 3 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1952 transition count 1952
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1952 transition count 1952
Applied a total of 22 rules in 206 ms. Remains 1952 /1963 variables (removed 11) and now considering 1952/1963 (removed 11) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2024-05-29 20:52:43] [INFO ] Computed 201 invariants in 11 ms
[2024-05-29 20:52:44] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-05-29 20:52:44] [INFO ] Invariant cache hit.
[2024-05-29 20:52:45] [INFO ] Implicit Places using invariants and state equation in 1543 ms returned []
Implicit Place search using SMT with State Equation took 2074 ms to find 0 implicit places.
[2024-05-29 20:52:45] [INFO ] Invariant cache hit.
[2024-05-29 20:52:46] [INFO ] Dead Transitions using invariants and state equation in 1048 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1963 places, 1952/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3331 ms. Remains : 1952/1963 places, 1952/1963 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 307 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s1340 1), p1:(OR (EQ s200 0) (EQ s1898 1))], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 613 ms.
Product exploration explored 100000 steps with 2 reset in 717 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 81 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 223350 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 223350 steps, saw 116358 distinct states, run finished after 3005 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 20:52:51] [INFO ] Invariant cache hit.
[2024-05-29 20:52:51] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:52:52] [INFO ] [Nat]Absence check using 201 positive place invariants in 77 ms returned sat
[2024-05-29 20:52:53] [INFO ] After 934ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:52:53] [INFO ] Deduced a trap composed of 49 places in 450 ms of which 2 ms to minimize.
[2024-05-29 20:52:54] [INFO ] Deduced a trap composed of 33 places in 432 ms of which 1 ms to minimize.
[2024-05-29 20:52:54] [INFO ] Deduced a trap composed of 36 places in 417 ms of which 1 ms to minimize.
[2024-05-29 20:52:55] [INFO ] Deduced a trap composed of 33 places in 412 ms of which 1 ms to minimize.
[2024-05-29 20:52:55] [INFO ] Deduced a trap composed of 26 places in 414 ms of which 1 ms to minimize.
[2024-05-29 20:52:56] [INFO ] Deduced a trap composed of 30 places in 383 ms of which 1 ms to minimize.
[2024-05-29 20:52:56] [INFO ] Deduced a trap composed of 25 places in 344 ms of which 1 ms to minimize.
[2024-05-29 20:52:56] [INFO ] Deduced a trap composed of 21 places in 363 ms of which 1 ms to minimize.
[2024-05-29 20:52:57] [INFO ] Deduced a trap composed of 32 places in 355 ms of which 1 ms to minimize.
[2024-05-29 20:52:57] [INFO ] Deduced a trap composed of 49 places in 344 ms of which 1 ms to minimize.
[2024-05-29 20:52:58] [INFO ] Deduced a trap composed of 23 places in 342 ms of which 1 ms to minimize.
[2024-05-29 20:52:58] [INFO ] Deduced a trap composed of 36 places in 335 ms of which 1 ms to minimize.
[2024-05-29 20:52:58] [INFO ] Deduced a trap composed of 38 places in 314 ms of which 1 ms to minimize.
[2024-05-29 20:52:59] [INFO ] Deduced a trap composed of 49 places in 319 ms of which 0 ms to minimize.
[2024-05-29 20:52:59] [INFO ] Deduced a trap composed of 44 places in 313 ms of which 3 ms to minimize.
[2024-05-29 20:52:59] [INFO ] Deduced a trap composed of 47 places in 284 ms of which 1 ms to minimize.
[2024-05-29 20:53:00] [INFO ] Deduced a trap composed of 56 places in 288 ms of which 3 ms to minimize.
[2024-05-29 20:53:00] [INFO ] Deduced a trap composed of 55 places in 283 ms of which 1 ms to minimize.
[2024-05-29 20:53:01] [INFO ] Deduced a trap composed of 58 places in 264 ms of which 3 ms to minimize.
[2024-05-29 20:53:01] [INFO ] Deduced a trap composed of 62 places in 287 ms of which 1 ms to minimize.
[2024-05-29 20:53:01] [INFO ] Deduced a trap composed of 46 places in 272 ms of which 0 ms to minimize.
[2024-05-29 20:53:02] [INFO ] Deduced a trap composed of 46 places in 265 ms of which 1 ms to minimize.
[2024-05-29 20:53:02] [INFO ] Deduced a trap composed of 63 places in 261 ms of which 1 ms to minimize.
[2024-05-29 20:53:02] [INFO ] Deduced a trap composed of 45 places in 264 ms of which 0 ms to minimize.
[2024-05-29 20:53:02] [INFO ] Deduced a trap composed of 38 places in 244 ms of which 0 ms to minimize.
[2024-05-29 20:53:03] [INFO ] Deduced a trap composed of 57 places in 248 ms of which 1 ms to minimize.
[2024-05-29 20:53:03] [INFO ] Deduced a trap composed of 70 places in 246 ms of which 1 ms to minimize.
[2024-05-29 20:53:03] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 0 ms to minimize.
[2024-05-29 20:53:04] [INFO ] Deduced a trap composed of 59 places in 219 ms of which 0 ms to minimize.
[2024-05-29 20:53:04] [INFO ] Deduced a trap composed of 68 places in 230 ms of which 1 ms to minimize.
[2024-05-29 20:53:04] [INFO ] Deduced a trap composed of 48 places in 223 ms of which 1 ms to minimize.
[2024-05-29 20:53:05] [INFO ] Deduced a trap composed of 58 places in 223 ms of which 1 ms to minimize.
[2024-05-29 20:53:05] [INFO ] Deduced a trap composed of 68 places in 212 ms of which 1 ms to minimize.
[2024-05-29 20:53:05] [INFO ] Deduced a trap composed of 56 places in 225 ms of which 1 ms to minimize.
[2024-05-29 20:53:05] [INFO ] Deduced a trap composed of 74 places in 225 ms of which 0 ms to minimize.
[2024-05-29 20:53:06] [INFO ] Deduced a trap composed of 68 places in 217 ms of which 1 ms to minimize.
[2024-05-29 20:53:06] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 13100 ms
[2024-05-29 20:53:06] [INFO ] After 14092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-05-29 20:53:06] [INFO ] After 14518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1952 transition count 1405
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1405 transition count 1405
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1094 place count 1405 transition count 1006
Deduced a syphon composed of 399 places in 1 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1892 place count 1006 transition count 1006
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1893 place count 1005 transition count 1005
Iterating global reduction 2 with 1 rules applied. Total rules applied 1894 place count 1005 transition count 1005
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1894 place count 1005 transition count 1004
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1896 place count 1004 transition count 1004
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 0 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2794 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2795 place count 555 transition count 554
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2797 place count 554 transition count 553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2999 place count 453 transition count 653
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3095 place count 405 transition count 701
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3096 place count 405 transition count 700
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3097 place count 404 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3098 place count 403 transition count 699
Applied a total of 3098 rules in 248 ms. Remains 403 /1952 variables (removed 1549) and now considering 699/1952 (removed 1253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 403/1952 places, 699/1952 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20423 steps, run visited all 1 properties in 173 ms. (steps per millisecond=118 )
Probabilistic random walk after 20423 steps, saw 12880 distinct states, run finished after 174 ms. (steps per millisecond=117 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 6 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050B-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050B-LTLCardinality-00 finished in 23745 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&&G(p1)))))'
Support contains 4 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1952 transition count 1952
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1952 transition count 1952
Applied a total of 22 rules in 215 ms. Remains 1952 /1963 variables (removed 11) and now considering 1952/1963 (removed 11) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2024-05-29 20:53:07] [INFO ] Computed 201 invariants in 7 ms
[2024-05-29 20:53:07] [INFO ] Implicit Places using invariants in 530 ms returned []
[2024-05-29 20:53:07] [INFO ] Invariant cache hit.
[2024-05-29 20:53:09] [INFO ] Implicit Places using invariants and state equation in 1806 ms returned []
Implicit Place search using SMT with State Equation took 2338 ms to find 0 implicit places.
[2024-05-29 20:53:09] [INFO ] Invariant cache hit.
[2024-05-29 20:53:10] [INFO ] Dead Transitions using invariants and state equation in 1139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1963 places, 1952/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3699 ms. Remains : 1952/1963 places, 1952/1963 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s1131 0) (EQ s1305 1)), p1:(OR (EQ s349 0) (EQ s1742 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 469 ms.
Product exploration explored 100000 steps with 1 reset in 628 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 801 steps, including 0 resets, run visited all 3 properties in 27 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 149 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 1952 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Applied a total of 0 rules in 103 ms. Remains 1952 /1952 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
[2024-05-29 20:53:12] [INFO ] Invariant cache hit.
[2024-05-29 20:53:13] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-05-29 20:53:13] [INFO ] Invariant cache hit.
[2024-05-29 20:53:15] [INFO ] Implicit Places using invariants and state equation in 1832 ms returned []
Implicit Place search using SMT with State Equation took 2321 ms to find 0 implicit places.
[2024-05-29 20:53:15] [INFO ] Invariant cache hit.
[2024-05-29 20:53:16] [INFO ] Dead Transitions using invariants and state equation in 1121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3546 ms. Remains : 1952/1952 places, 1952/1952 transitions.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 169 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 787 steps, including 0 resets, run visited all 3 properties in 25 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 130 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 472 ms.
Product exploration explored 100000 steps with 1 reset in 614 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 1952 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Performed 546 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1952 transition count 1952
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 546 place count 1952 transition count 2152
Deduced a syphon composed of 747 places in 3 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 747 place count 1952 transition count 2152
Performed 598 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1345 places in 2 ms
Iterating global reduction 1 with 598 rules applied. Total rules applied 1345 place count 1952 transition count 2152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1346 place count 1952 transition count 2151
Renaming transitions due to excessive name length > 1024 char.
Discarding 398 places :
Symmetric choice reduction at 2 with 398 rule applications. Total rules 1744 place count 1554 transition count 1753
Deduced a syphon composed of 947 places in 2 ms
Iterating global reduction 2 with 398 rules applied. Total rules applied 2142 place count 1554 transition count 1753
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 948 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2143 place count 1554 transition count 1753
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2145 place count 1552 transition count 1751
Deduced a syphon composed of 946 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2147 place count 1552 transition count 1751
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 1047 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2248 place count 1552 transition count 2483
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2349 place count 1451 transition count 2281
Deduced a syphon composed of 946 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2450 place count 1451 transition count 2281
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -692
Deduced a syphon composed of 1041 places in 1 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 2545 place count 1451 transition count 2973
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 2640 place count 1356 transition count 2783
Deduced a syphon composed of 946 places in 1 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 2735 place count 1356 transition count 2783
Deduced a syphon composed of 946 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2738 place count 1356 transition count 2780
Deduced a syphon composed of 946 places in 1 ms
Applied a total of 2738 rules in 1212 ms. Remains 1356 /1952 variables (removed 596) and now considering 2780/1952 (removed -828) transitions.
[2024-05-29 20:53:19] [INFO ] Redundant transitions in 79 ms returned []
// Phase 1: matrix 2780 rows 1356 cols
[2024-05-29 20:53:19] [INFO ] Computed 201 invariants in 23 ms
[2024-05-29 20:53:21] [INFO ] Dead Transitions using invariants and state equation in 1304 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1356/1952 places, 2780/1952 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2609 ms. Remains : 1356/1952 places, 2780/1952 transitions.
Built C files in :
/tmp/ltsmin8725069531891851378
[2024-05-29 20:53:21] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8725069531891851378
Running compilation step : cd /tmp/ltsmin8725069531891851378;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8725069531891851378;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8725069531891851378;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1952 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Applied a total of 0 rules in 89 ms. Remains 1952 /1952 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2024-05-29 20:53:24] [INFO ] Computed 201 invariants in 9 ms
[2024-05-29 20:53:25] [INFO ] Implicit Places using invariants in 667 ms returned []
[2024-05-29 20:53:25] [INFO ] Invariant cache hit.
[2024-05-29 20:53:26] [INFO ] Implicit Places using invariants and state equation in 1687 ms returned []
Implicit Place search using SMT with State Equation took 2361 ms to find 0 implicit places.
[2024-05-29 20:53:26] [INFO ] Invariant cache hit.
[2024-05-29 20:53:27] [INFO ] Dead Transitions using invariants and state equation in 1197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3662 ms. Remains : 1952/1952 places, 1952/1952 transitions.
Built C files in :
/tmp/ltsmin6320281548021527897
[2024-05-29 20:53:27] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6320281548021527897
Running compilation step : cd /tmp/ltsmin6320281548021527897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6320281548021527897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6320281548021527897;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 20:53:31] [INFO ] Flatten gal took : 78 ms
[2024-05-29 20:53:31] [INFO ] Flatten gal took : 70 ms
[2024-05-29 20:53:31] [INFO ] Time to serialize gal into /tmp/LTL6827201635800200960.gal : 32 ms
[2024-05-29 20:53:31] [INFO ] Time to serialize properties into /tmp/LTL6962262001785393833.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6827201635800200960.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15831067391600771655.hoa' '-atoms' '/tmp/LTL6962262001785393833.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6962262001785393833.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15831067391600771655.hoa
Detected timeout of ITS tools.
[2024-05-29 20:53:46] [INFO ] Flatten gal took : 44 ms
[2024-05-29 20:53:46] [INFO ] Flatten gal took : 77 ms
[2024-05-29 20:53:46] [INFO ] Time to serialize gal into /tmp/LTL14800945637212242702.gal : 28 ms
[2024-05-29 20:53:46] [INFO ] Time to serialize properties into /tmp/LTL15631649603502331753.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14800945637212242702.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15631649603502331753.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((p434==0)||(p2229==1))"))&&("((p1442==0)||(p1665==1))")))))
Formula 0 simplified : XG(!"((p1442==0)||(p1665==1))" | F!"((p434==0)||(p2229==1))")
Detected timeout of ITS tools.
[2024-05-29 20:54:01] [INFO ] Flatten gal took : 45 ms
[2024-05-29 20:54:01] [INFO ] Applying decomposition
[2024-05-29 20:54:01] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9924546445024094373.txt' '-o' '/tmp/graph9924546445024094373.bin' '-w' '/tmp/graph9924546445024094373.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9924546445024094373.bin' '-l' '-1' '-v' '-w' '/tmp/graph9924546445024094373.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:54:02] [INFO ] Decomposing Gal with order
[2024-05-29 20:54:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:54:02] [INFO ] Removed a total of 499 redundant transitions.
[2024-05-29 20:54:02] [INFO ] Flatten gal took : 155 ms
[2024-05-29 20:54:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2024-05-29 20:54:02] [INFO ] Time to serialize gal into /tmp/LTL12808896282577336551.gal : 25 ms
[2024-05-29 20:54:02] [INFO ] Time to serialize properties into /tmp/LTL15507528518519140132.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12808896282577336551.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15507528518519140132.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((i15.i4.u140.p434==0)||(i43.i2.u687.p2229==1))"))&&("((i29.i7.u450.p1442==0)||(i32.i5.u516.p1665==1))")))))
Formula 0 simplified : XG(!"((i29.i7.u450.p1442==0)||(i32.i5.u516.p1665==1))" | F!"((i15.i4.u140.p434==0)||(i43.i2.u687.p2229==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13709508062907963372
[2024-05-29 20:54:17] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13709508062907963372
Running compilation step : cd /tmp/ltsmin13709508062907963372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13709508062907963372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13709508062907963372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVt-PT-050B-LTLCardinality-01 finished in 73575 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 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 555 transitions
Trivial Post-agglo rules discarded 555 transitions
Performed 555 trivial Post agglomeration. Transition count delta: 555
Iterating post reduction 0 with 555 rules applied. Total rules applied 555 place count 1962 transition count 1407
Reduce places removed 555 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 556 rules applied. Total rules applied 1111 place count 1407 transition count 1406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1112 place count 1406 transition count 1406
Performed 389 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 389 Pre rules applied. Total rules applied 1112 place count 1406 transition count 1017
Deduced a syphon composed of 389 places in 1 ms
Reduce places removed 389 places and 0 transitions.
Iterating global reduction 3 with 778 rules applied. Total rules applied 1890 place count 1017 transition count 1017
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1897 place count 1010 transition count 1010
Iterating global reduction 3 with 7 rules applied. Total rules applied 1904 place count 1010 transition count 1010
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1904 place count 1010 transition count 1003
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1918 place count 1003 transition count 1003
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 447
Deduced a syphon composed of 447 places in 0 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2812 place count 556 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2813 place count 556 transition count 555
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 2815 place count 555 transition count 554
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3017 place count 454 transition count 654
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 3113 place count 406 transition count 702
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3115 place count 404 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3116 place count 403 transition count 700
Applied a total of 3116 rules in 213 ms. Remains 403 /1963 variables (removed 1560) and now considering 700/1963 (removed 1263) transitions.
// Phase 1: matrix 700 rows 403 cols
[2024-05-29 20:54:20] [INFO ] Computed 200 invariants in 3 ms
[2024-05-29 20:54:21] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-29 20:54:21] [INFO ] Invariant cache hit.
[2024-05-29 20:54:21] [INFO ] State equation strengthened by 170 read => feed constraints.
[2024-05-29 20:54:22] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 1408 ms to find 0 implicit places.
[2024-05-29 20:54:22] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-29 20:54:22] [INFO ] Invariant cache hit.
[2024-05-29 20:54:22] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/1963 places, 700/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1989 ms. Remains : 403/1963 places, 700/1963 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-02 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 (EQ s326 0) (EQ s131 1))], 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 1253 steps with 0 reset in 17 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-02 finished in 2094 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)) U (p1&&X(!p1))))'
Support contains 3 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1952 transition count 1952
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1952 transition count 1952
Applied a total of 22 rules in 140 ms. Remains 1952 /1963 variables (removed 11) and now considering 1952/1963 (removed 11) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2024-05-29 20:54:22] [INFO ] Computed 201 invariants in 13 ms
[2024-05-29 20:54:23] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-05-29 20:54:23] [INFO ] Invariant cache hit.
[2024-05-29 20:54:24] [INFO ] Implicit Places using invariants and state equation in 1654 ms returned []
Implicit Place search using SMT with State Equation took 2123 ms to find 0 implicit places.
[2024-05-29 20:54:24] [INFO ] Invariant cache hit.
[2024-05-29 20:54:26] [INFO ] Dead Transitions using invariants and state equation in 1141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1963 places, 1952/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3406 ms. Remains : 1952/1963 places, 1952/1963 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, p0, p1, true]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s804 1), p0:(OR (EQ s1041 0) (EQ s1519 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-06 finished in 3682 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)))'
Support contains 4 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1952 transition count 1952
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1952 transition count 1952
Applied a total of 22 rules in 154 ms. Remains 1952 /1963 variables (removed 11) and now considering 1952/1963 (removed 11) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2024-05-29 20:54:26] [INFO ] Computed 201 invariants in 10 ms
[2024-05-29 20:54:27] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-05-29 20:54:27] [INFO ] Invariant cache hit.
[2024-05-29 20:54:28] [INFO ] Implicit Places using invariants and state equation in 1799 ms returned []
Implicit Place search using SMT with State Equation took 2276 ms to find 0 implicit places.
[2024-05-29 20:54:28] [INFO ] Invariant cache hit.
[2024-05-29 20:54:29] [INFO ] Dead Transitions using invariants and state equation in 1185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1963 places, 1952/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3616 ms. Remains : 1952/1963 places, 1952/1963 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s418 0) (EQ s1363 1) (OR (EQ s115 0) (EQ s1044 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-07 finished in 3741 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 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 555 transitions
Trivial Post-agglo rules discarded 555 transitions
Performed 555 trivial Post agglomeration. Transition count delta: 555
Iterating post reduction 0 with 555 rules applied. Total rules applied 555 place count 1962 transition count 1407
Reduce places removed 555 places and 0 transitions.
Iterating post reduction 1 with 555 rules applied. Total rules applied 1110 place count 1407 transition count 1407
Performed 390 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 390 Pre rules applied. Total rules applied 1110 place count 1407 transition count 1017
Deduced a syphon composed of 390 places in 1 ms
Reduce places removed 390 places and 0 transitions.
Iterating global reduction 2 with 780 rules applied. Total rules applied 1890 place count 1017 transition count 1017
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1897 place count 1010 transition count 1010
Iterating global reduction 2 with 7 rules applied. Total rules applied 1904 place count 1010 transition count 1010
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1904 place count 1010 transition count 1004
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1916 place count 1004 transition count 1004
Performed 448 Post agglomeration using F-continuation condition.Transition count delta: 448
Deduced a syphon composed of 448 places in 0 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2812 place count 556 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2813 place count 556 transition count 555
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2815 place count 555 transition count 554
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3017 place count 454 transition count 653
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3113 place count 406 transition count 701
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 3114 place count 406 transition count 701
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3116 place count 404 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3117 place count 403 transition count 699
Applied a total of 3117 rules in 230 ms. Remains 403 /1963 variables (removed 1560) and now considering 699/1963 (removed 1264) transitions.
// Phase 1: matrix 699 rows 403 cols
[2024-05-29 20:54:30] [INFO ] Computed 200 invariants in 4 ms
[2024-05-29 20:54:30] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-29 20:54:30] [INFO ] Invariant cache hit.
[2024-05-29 20:54:31] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
[2024-05-29 20:54:31] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-29 20:54:31] [INFO ] Invariant cache hit.
[2024-05-29 20:54:31] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/1963 places, 699/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1421 ms. Remains : 403/1963 places, 699/1963 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s20 0) (EQ s138 1))], 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 25 reset in 565 ms.
Product exploration explored 100000 steps with 31 reset in 622 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Finished probabilistic random walk after 27612 steps, run visited all 1 properties in 266 ms. (steps per millisecond=103 )
Probabilistic random walk after 27612 steps, saw 16816 distinct states, run finished after 266 ms. (steps per millisecond=103 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 699/699 transitions.
Applied a total of 0 rules in 14 ms. Remains 403 /403 variables (removed 0) and now considering 699/699 (removed 0) transitions.
[2024-05-29 20:54:33] [INFO ] Invariant cache hit.
[2024-05-29 20:54:33] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-29 20:54:33] [INFO ] Invariant cache hit.
[2024-05-29 20:54:34] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
[2024-05-29 20:54:34] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 20:54:34] [INFO ] Invariant cache hit.
[2024-05-29 20:54:34] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1128 ms. Remains : 403/403 places, 699/699 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Finished probabilistic random walk after 27612 steps, run visited all 1 properties in 247 ms. (steps per millisecond=111 )
Probabilistic random walk after 27612 steps, saw 16816 distinct states, run finished after 248 ms. (steps per millisecond=111 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 18 reset in 509 ms.
Product exploration explored 100000 steps with 21 reset in 582 ms.
Built C files in :
/tmp/ltsmin12413906964446506650
[2024-05-29 20:54:36] [INFO ] Computing symmetric may disable matrix : 699 transitions.
[2024-05-29 20:54:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:54:36] [INFO ] Computing symmetric may enable matrix : 699 transitions.
[2024-05-29 20:54:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:54:36] [INFO ] Computing Do-Not-Accords matrix : 699 transitions.
[2024-05-29 20:54:36] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:54:36] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12413906964446506650
Running compilation step : cd /tmp/ltsmin12413906964446506650;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1887 ms.
Running link step : cd /tmp/ltsmin12413906964446506650;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin12413906964446506650;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4368873244938544022.hoa' '--buchi-type=spotba'
LTSmin run took 9421 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-050B-LTLCardinality-08 finished in 18209 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&&G((p0 U p1))))))'
Support contains 4 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1954 transition count 1954
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1954 transition count 1954
Applied a total of 18 rules in 171 ms. Remains 1954 /1963 variables (removed 9) and now considering 1954/1963 (removed 9) transitions.
// Phase 1: matrix 1954 rows 1954 cols
[2024-05-29 20:54:48] [INFO ] Computed 201 invariants in 9 ms
[2024-05-29 20:54:49] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-05-29 20:54:49] [INFO ] Invariant cache hit.
[2024-05-29 20:54:51] [INFO ] Implicit Places using invariants and state equation in 1927 ms returned []
Implicit Place search using SMT with State Equation took 2456 ms to find 0 implicit places.
[2024-05-29 20:54:51] [INFO ] Invariant cache hit.
[2024-05-29 20:54:52] [INFO ] Dead Transitions using invariants and state equation in 1114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1954/1963 places, 1954/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3745 ms. Remains : 1954/1963 places, 1954/1963 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(OR p0 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s141 0) (EQ s940 1)), p1:(OR (EQ s1543 0) (EQ s1258 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 467 ms.
Product exploration explored 100000 steps with 4 reset in 618 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Detected a total of 600/1954 stabilizing places and 600/1954 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 101 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 20:54:53] [INFO ] Invariant cache hit.
[2024-05-29 20:54:54] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:54:54] [INFO ] [Nat]Absence check using 201 positive place invariants in 76 ms returned sat
[2024-05-29 20:54:55] [INFO ] After 1038ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 20:54:56] [INFO ] Deduced a trap composed of 24 places in 450 ms of which 1 ms to minimize.
[2024-05-29 20:54:56] [INFO ] Deduced a trap composed of 35 places in 368 ms of which 2 ms to minimize.
[2024-05-29 20:54:57] [INFO ] Deduced a trap composed of 23 places in 438 ms of which 1 ms to minimize.
[2024-05-29 20:54:57] [INFO ] Deduced a trap composed of 25 places in 426 ms of which 1 ms to minimize.
[2024-05-29 20:54:58] [INFO ] Deduced a trap composed of 28 places in 409 ms of which 2 ms to minimize.
[2024-05-29 20:54:58] [INFO ] Deduced a trap composed of 28 places in 416 ms of which 1 ms to minimize.
[2024-05-29 20:54:59] [INFO ] Deduced a trap composed of 33 places in 410 ms of which 1 ms to minimize.
[2024-05-29 20:54:59] [INFO ] Deduced a trap composed of 21 places in 368 ms of which 1 ms to minimize.
[2024-05-29 20:54:59] [INFO ] Deduced a trap composed of 32 places in 389 ms of which 1 ms to minimize.
[2024-05-29 20:55:00] [INFO ] Deduced a trap composed of 31 places in 400 ms of which 1 ms to minimize.
[2024-05-29 20:55:00] [INFO ] Deduced a trap composed of 43 places in 385 ms of which 1 ms to minimize.
[2024-05-29 20:55:01] [INFO ] Deduced a trap composed of 43 places in 380 ms of which 1 ms to minimize.
[2024-05-29 20:55:01] [INFO ] Deduced a trap composed of 33 places in 382 ms of which 1 ms to minimize.
[2024-05-29 20:55:02] [INFO ] Deduced a trap composed of 62 places in 374 ms of which 1 ms to minimize.
[2024-05-29 20:55:02] [INFO ] Deduced a trap composed of 58 places in 375 ms of which 1 ms to minimize.
[2024-05-29 20:55:03] [INFO ] Deduced a trap composed of 36 places in 374 ms of which 1 ms to minimize.
[2024-05-29 20:55:03] [INFO ] Deduced a trap composed of 41 places in 358 ms of which 1 ms to minimize.
[2024-05-29 20:55:03] [INFO ] Deduced a trap composed of 54 places in 360 ms of which 1 ms to minimize.
[2024-05-29 20:55:04] [INFO ] Deduced a trap composed of 45 places in 359 ms of which 4 ms to minimize.
[2024-05-29 20:55:04] [INFO ] Deduced a trap composed of 52 places in 328 ms of which 1 ms to minimize.
[2024-05-29 20:55:05] [INFO ] Deduced a trap composed of 53 places in 338 ms of which 1 ms to minimize.
[2024-05-29 20:55:05] [INFO ] Deduced a trap composed of 58 places in 350 ms of which 1 ms to minimize.
[2024-05-29 20:55:05] [INFO ] Deduced a trap composed of 50 places in 325 ms of which 1 ms to minimize.
[2024-05-29 20:55:06] [INFO ] Deduced a trap composed of 54 places in 327 ms of which 1 ms to minimize.
[2024-05-29 20:55:06] [INFO ] Deduced a trap composed of 66 places in 324 ms of which 1 ms to minimize.
[2024-05-29 20:55:07] [INFO ] Deduced a trap composed of 48 places in 300 ms of which 1 ms to minimize.
[2024-05-29 20:55:07] [INFO ] Deduced a trap composed of 53 places in 314 ms of which 1 ms to minimize.
[2024-05-29 20:55:07] [INFO ] Deduced a trap composed of 67 places in 292 ms of which 1 ms to minimize.
[2024-05-29 20:55:08] [INFO ] Deduced a trap composed of 59 places in 286 ms of which 0 ms to minimize.
[2024-05-29 20:55:08] [INFO ] Deduced a trap composed of 41 places in 306 ms of which 1 ms to minimize.
[2024-05-29 20:55:08] [INFO ] Deduced a trap composed of 41 places in 295 ms of which 1 ms to minimize.
[2024-05-29 20:55:09] [INFO ] Deduced a trap composed of 59 places in 287 ms of which 1 ms to minimize.
[2024-05-29 20:55:09] [INFO ] Deduced a trap composed of 61 places in 302 ms of which 1 ms to minimize.
[2024-05-29 20:55:10] [INFO ] Deduced a trap composed of 69 places in 285 ms of which 1 ms to minimize.
[2024-05-29 20:55:10] [INFO ] Deduced a trap composed of 64 places in 282 ms of which 1 ms to minimize.
[2024-05-29 20:55:10] [INFO ] Deduced a trap composed of 64 places in 276 ms of which 1 ms to minimize.
[2024-05-29 20:55:11] [INFO ] Deduced a trap composed of 62 places in 265 ms of which 1 ms to minimize.
[2024-05-29 20:55:11] [INFO ] Deduced a trap composed of 58 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:55:11] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 0 ms to minimize.
[2024-05-29 20:55:11] [INFO ] Deduced a trap composed of 66 places in 250 ms of which 0 ms to minimize.
[2024-05-29 20:55:12] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 16297 ms
[2024-05-29 20:55:12] [INFO ] Deduced a trap composed of 23 places in 260 ms of which 1 ms to minimize.
[2024-05-29 20:55:12] [INFO ] Deduced a trap composed of 53 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:55:13] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 1 ms to minimize.
[2024-05-29 20:55:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1000 ms
[2024-05-29 20:55:13] [INFO ] After 18558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 201 ms.
[2024-05-29 20:55:13] [INFO ] After 19156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 92 ms.
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Drop transitions removed 546 transitions
Trivial Post-agglo rules discarded 546 transitions
Performed 546 trivial Post agglomeration. Transition count delta: 546
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1954 transition count 1408
Reduce places removed 546 places and 0 transitions.
Iterating post reduction 1 with 546 rules applied. Total rules applied 1092 place count 1408 transition count 1408
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1092 place count 1408 transition count 1009
Deduced a syphon composed of 399 places in 1 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1890 place count 1009 transition count 1009
Performed 451 Post agglomeration using F-continuation condition.Transition count delta: 451
Deduced a syphon composed of 451 places in 0 ms
Reduce places removed 451 places and 0 transitions.
Iterating global reduction 2 with 902 rules applied. Total rules applied 2792 place count 558 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2793 place count 558 transition count 557
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2795 place count 557 transition count 556
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2997 place count 456 transition count 656
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 3089 place count 410 transition count 700
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3090 place count 410 transition count 699
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3091 place count 410 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3092 place count 409 transition count 698
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3093 place count 409 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3094 place count 408 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3095 place count 407 transition count 696
Applied a total of 3095 rules in 190 ms. Remains 407 /1954 variables (removed 1547) and now considering 696/1954 (removed 1258) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 407/1954 places, 696/1954 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Finished Best-First random walk after 9897 steps, including 2 resets, run visited all 2 properties in 32 ms. (steps per millisecond=309 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 8 factoid took 225 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Applied a total of 0 rules in 73 ms. Remains 1954 /1954 variables (removed 0) and now considering 1954/1954 (removed 0) transitions.
[2024-05-29 20:55:14] [INFO ] Invariant cache hit.
[2024-05-29 20:55:15] [INFO ] Implicit Places using invariants in 520 ms returned []
[2024-05-29 20:55:15] [INFO ] Invariant cache hit.
[2024-05-29 20:55:16] [INFO ] Implicit Places using invariants and state equation in 1844 ms returned []
Implicit Place search using SMT with State Equation took 2365 ms to find 0 implicit places.
[2024-05-29 20:55:16] [INFO ] Invariant cache hit.
[2024-05-29 20:55:18] [INFO ] Dead Transitions using invariants and state equation in 1146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3585 ms. Remains : 1954/1954 places, 1954/1954 transitions.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Detected a total of 600/1954 stabilizing places and 600/1954 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 111 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 20:55:18] [INFO ] Invariant cache hit.
[2024-05-29 20:55:18] [INFO ] After 313ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:55:19] [INFO ] [Nat]Absence check using 201 positive place invariants in 83 ms returned sat
[2024-05-29 20:55:20] [INFO ] After 1094ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 20:55:21] [INFO ] Deduced a trap composed of 24 places in 463 ms of which 1 ms to minimize.
[2024-05-29 20:55:21] [INFO ] Deduced a trap composed of 35 places in 465 ms of which 1 ms to minimize.
[2024-05-29 20:55:22] [INFO ] Deduced a trap composed of 23 places in 446 ms of which 1 ms to minimize.
[2024-05-29 20:55:22] [INFO ] Deduced a trap composed of 25 places in 405 ms of which 2 ms to minimize.
[2024-05-29 20:55:22] [INFO ] Deduced a trap composed of 28 places in 390 ms of which 1 ms to minimize.
[2024-05-29 20:55:23] [INFO ] Deduced a trap composed of 28 places in 392 ms of which 3 ms to minimize.
[2024-05-29 20:55:23] [INFO ] Deduced a trap composed of 33 places in 419 ms of which 1 ms to minimize.
[2024-05-29 20:55:24] [INFO ] Deduced a trap composed of 21 places in 415 ms of which 1 ms to minimize.
[2024-05-29 20:55:24] [INFO ] Deduced a trap composed of 32 places in 404 ms of which 1 ms to minimize.
[2024-05-29 20:55:25] [INFO ] Deduced a trap composed of 31 places in 405 ms of which 1 ms to minimize.
[2024-05-29 20:55:25] [INFO ] Deduced a trap composed of 43 places in 396 ms of which 1 ms to minimize.
[2024-05-29 20:55:26] [INFO ] Deduced a trap composed of 43 places in 395 ms of which 1 ms to minimize.
[2024-05-29 20:55:26] [INFO ] Deduced a trap composed of 33 places in 378 ms of which 1 ms to minimize.
[2024-05-29 20:55:27] [INFO ] Deduced a trap composed of 62 places in 373 ms of which 1 ms to minimize.
[2024-05-29 20:55:27] [INFO ] Deduced a trap composed of 58 places in 366 ms of which 1 ms to minimize.
[2024-05-29 20:55:28] [INFO ] Deduced a trap composed of 36 places in 352 ms of which 1 ms to minimize.
[2024-05-29 20:55:28] [INFO ] Deduced a trap composed of 41 places in 351 ms of which 1 ms to minimize.
[2024-05-29 20:55:28] [INFO ] Deduced a trap composed of 54 places in 340 ms of which 1 ms to minimize.
[2024-05-29 20:55:29] [INFO ] Deduced a trap composed of 45 places in 357 ms of which 1 ms to minimize.
[2024-05-29 20:55:29] [INFO ] Deduced a trap composed of 52 places in 353 ms of which 1 ms to minimize.
[2024-05-29 20:55:30] [INFO ] Deduced a trap composed of 53 places in 344 ms of which 1 ms to minimize.
[2024-05-29 20:55:30] [INFO ] Deduced a trap composed of 58 places in 350 ms of which 1 ms to minimize.
[2024-05-29 20:55:30] [INFO ] Deduced a trap composed of 50 places in 313 ms of which 1 ms to minimize.
[2024-05-29 20:55:31] [INFO ] Deduced a trap composed of 54 places in 324 ms of which 1 ms to minimize.
[2024-05-29 20:55:31] [INFO ] Deduced a trap composed of 66 places in 322 ms of which 1 ms to minimize.
[2024-05-29 20:55:32] [INFO ] Deduced a trap composed of 48 places in 329 ms of which 1 ms to minimize.
[2024-05-29 20:55:32] [INFO ] Deduced a trap composed of 53 places in 316 ms of which 1 ms to minimize.
[2024-05-29 20:55:32] [INFO ] Deduced a trap composed of 67 places in 307 ms of which 1 ms to minimize.
[2024-05-29 20:55:33] [INFO ] Deduced a trap composed of 59 places in 304 ms of which 0 ms to minimize.
[2024-05-29 20:55:33] [INFO ] Deduced a trap composed of 41 places in 314 ms of which 0 ms to minimize.
[2024-05-29 20:55:33] [INFO ] Deduced a trap composed of 41 places in 294 ms of which 1 ms to minimize.
[2024-05-29 20:55:34] [INFO ] Deduced a trap composed of 59 places in 294 ms of which 0 ms to minimize.
[2024-05-29 20:55:34] [INFO ] Deduced a trap composed of 61 places in 289 ms of which 1 ms to minimize.
[2024-05-29 20:55:34] [INFO ] Deduced a trap composed of 69 places in 277 ms of which 1 ms to minimize.
[2024-05-29 20:55:35] [INFO ] Deduced a trap composed of 64 places in 279 ms of which 1 ms to minimize.
[2024-05-29 20:55:35] [INFO ] Deduced a trap composed of 64 places in 276 ms of which 1 ms to minimize.
[2024-05-29 20:55:35] [INFO ] Deduced a trap composed of 62 places in 250 ms of which 0 ms to minimize.
[2024-05-29 20:55:36] [INFO ] Deduced a trap composed of 58 places in 248 ms of which 1 ms to minimize.
[2024-05-29 20:55:36] [INFO ] Deduced a trap composed of 67 places in 239 ms of which 1 ms to minimize.
[2024-05-29 20:55:36] [INFO ] Deduced a trap composed of 66 places in 233 ms of which 1 ms to minimize.
[2024-05-29 20:55:36] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 16465 ms
[2024-05-29 20:55:37] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 0 ms to minimize.
[2024-05-29 20:55:37] [INFO ] Deduced a trap composed of 53 places in 259 ms of which 0 ms to minimize.
[2024-05-29 20:55:37] [INFO ] Deduced a trap composed of 42 places in 238 ms of which 1 ms to minimize.
[2024-05-29 20:55:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 991 ms
[2024-05-29 20:55:38] [INFO ] After 18777ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 198 ms.
[2024-05-29 20:55:38] [INFO ] After 19480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 207 ms.
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Drop transitions removed 546 transitions
Trivial Post-agglo rules discarded 546 transitions
Performed 546 trivial Post agglomeration. Transition count delta: 546
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1954 transition count 1408
Reduce places removed 546 places and 0 transitions.
Iterating post reduction 1 with 546 rules applied. Total rules applied 1092 place count 1408 transition count 1408
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1092 place count 1408 transition count 1009
Deduced a syphon composed of 399 places in 3 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1890 place count 1009 transition count 1009
Performed 451 Post agglomeration using F-continuation condition.Transition count delta: 451
Deduced a syphon composed of 451 places in 0 ms
Reduce places removed 451 places and 0 transitions.
Iterating global reduction 2 with 902 rules applied. Total rules applied 2792 place count 558 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2793 place count 558 transition count 557
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2795 place count 557 transition count 556
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2997 place count 456 transition count 656
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 3089 place count 410 transition count 700
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3090 place count 410 transition count 699
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3091 place count 410 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3092 place count 409 transition count 698
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3093 place count 409 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3094 place count 408 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3095 place count 407 transition count 696
Applied a total of 3095 rules in 197 ms. Remains 407 /1954 variables (removed 1547) and now considering 696/1954 (removed 1258) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 407/1954 places, 696/1954 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) seen :1
Finished Best-First random walk after 4314 steps, including 1 resets, run visited all 2 properties in 14 ms. (steps per millisecond=308 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 8 factoid took 234 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3 reset in 478 ms.
Product exploration explored 100000 steps with 3 reset in 584 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Performed 546 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1954 transition count 1954
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 202 Pre rules applied. Total rules applied 546 place count 1954 transition count 2154
Deduced a syphon composed of 748 places in 3 ms
Iterating global reduction 1 with 202 rules applied. Total rules applied 748 place count 1954 transition count 2154
Performed 598 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1346 places in 2 ms
Iterating global reduction 1 with 598 rules applied. Total rules applied 1346 place count 1954 transition count 2154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1347 place count 1954 transition count 2153
Renaming transitions due to excessive name length > 1024 char.
Discarding 396 places :
Symmetric choice reduction at 2 with 396 rule applications. Total rules 1743 place count 1558 transition count 1757
Deduced a syphon composed of 950 places in 2 ms
Iterating global reduction 2 with 396 rules applied. Total rules applied 2139 place count 1558 transition count 1757
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 951 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2140 place count 1558 transition count 1757
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2142 place count 1556 transition count 1755
Deduced a syphon composed of 949 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2144 place count 1556 transition count 1755
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 1050 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2245 place count 1556 transition count 2487
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2346 place count 1455 transition count 2285
Deduced a syphon composed of 949 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2447 place count 1455 transition count 2285
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -683
Deduced a syphon composed of 1045 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 2543 place count 1455 transition count 2968
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 2639 place count 1359 transition count 2776
Deduced a syphon composed of 949 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 2735 place count 1359 transition count 2776
Deduced a syphon composed of 949 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2738 place count 1359 transition count 2773
Deduced a syphon composed of 949 places in 1 ms
Applied a total of 2738 rules in 633 ms. Remains 1359 /1954 variables (removed 595) and now considering 2773/1954 (removed -819) transitions.
[2024-05-29 20:55:41] [INFO ] Redundant transitions in 83 ms returned []
// Phase 1: matrix 2773 rows 1359 cols
[2024-05-29 20:55:41] [INFO ] Computed 201 invariants in 24 ms
[2024-05-29 20:55:43] [INFO ] Dead Transitions using invariants and state equation in 1311 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1359/1954 places, 2773/1954 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2038 ms. Remains : 1359/1954 places, 2773/1954 transitions.
Built C files in :
/tmp/ltsmin3060690485771450717
[2024-05-29 20:55:43] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3060690485771450717
Running compilation step : cd /tmp/ltsmin3060690485771450717;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3060690485771450717;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3060690485771450717;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Applied a total of 0 rules in 74 ms. Remains 1954 /1954 variables (removed 0) and now considering 1954/1954 (removed 0) transitions.
// Phase 1: matrix 1954 rows 1954 cols
[2024-05-29 20:55:46] [INFO ] Computed 201 invariants in 11 ms
[2024-05-29 20:55:46] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-05-29 20:55:46] [INFO ] Invariant cache hit.
[2024-05-29 20:55:48] [INFO ] Implicit Places using invariants and state equation in 1831 ms returned []
Implicit Place search using SMT with State Equation took 2345 ms to find 0 implicit places.
[2024-05-29 20:55:48] [INFO ] Invariant cache hit.
[2024-05-29 20:55:49] [INFO ] Dead Transitions using invariants and state equation in 1175 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3594 ms. Remains : 1954/1954 places, 1954/1954 transitions.
Built C files in :
/tmp/ltsmin11496452643882651411
[2024-05-29 20:55:49] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11496452643882651411
Running compilation step : cd /tmp/ltsmin11496452643882651411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11496452643882651411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11496452643882651411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 20:55:52] [INFO ] Flatten gal took : 44 ms
[2024-05-29 20:55:52] [INFO ] Flatten gal took : 41 ms
[2024-05-29 20:55:52] [INFO ] Time to serialize gal into /tmp/LTL6474814922159834322.gal : 8 ms
[2024-05-29 20:55:52] [INFO ] Time to serialize properties into /tmp/LTL11398314164263178393.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6474814922159834322.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7629800250045114576.hoa' '-atoms' '/tmp/LTL11398314164263178393.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11398314164263178393.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7629800250045114576.hoa
Detected timeout of ITS tools.
[2024-05-29 20:56:08] [INFO ] Flatten gal took : 39 ms
[2024-05-29 20:56:08] [INFO ] Flatten gal took : 37 ms
[2024-05-29 20:56:08] [INFO ] Time to serialize gal into /tmp/LTL1665075447762034770.gal : 7 ms
[2024-05-29 20:56:08] [INFO ] Time to serialize properties into /tmp/LTL2883188477416864720.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1665075447762034770.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2883188477416864720.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(F((G(("((p165==0)||(p1194==1))")U("((p1970==0)||(p1603==1))")))&&("((p165==0)||(p1194==1))")))))
Formula 0 simplified : XG(!"((p165==0)||(p1194==1))" | F(!"((p165==0)||(p1194==1))" R !"((p1970==0)||(p1603==1))"))
Detected timeout of ITS tools.
[2024-05-29 20:56:23] [INFO ] Flatten gal took : 36 ms
[2024-05-29 20:56:23] [INFO ] Applying decomposition
[2024-05-29 20:56:23] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13480584469760420937.txt' '-o' '/tmp/graph13480584469760420937.bin' '-w' '/tmp/graph13480584469760420937.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13480584469760420937.bin' '-l' '-1' '-v' '-w' '/tmp/graph13480584469760420937.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:56:23] [INFO ] Decomposing Gal with order
[2024-05-29 20:56:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:56:23] [INFO ] Removed a total of 498 redundant transitions.
[2024-05-29 20:56:23] [INFO ] Flatten gal took : 82 ms
[2024-05-29 20:56:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-29 20:56:23] [INFO ] Time to serialize gal into /tmp/LTL18335752373123372146.gal : 22 ms
[2024-05-29 20:56:23] [INFO ] Time to serialize properties into /tmp/LTL3084438309197865405.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18335752373123372146.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3084438309197865405.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F((G(("((i7.i1.u57.p165==0)||(i26.i1.u375.p1194==1))")U("((i1.i1.u614.p1970==0)||(i32.i3.u499.p1603==1))")))&&("((i7.i1.u57.p165=...189
Formula 0 simplified : XG(!"((i7.i1.u57.p165==0)||(i26.i1.u375.p1194==1))" | F(!"((i7.i1.u57.p165==0)||(i26.i1.u375.p1194==1))" R !"((i1.i1.u614.p1970==0)|...182
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin290092922114221685
[2024-05-29 20:56:38] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin290092922114221685
Running compilation step : cd /tmp/ltsmin290092922114221685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin290092922114221685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin290092922114221685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldRVt-PT-050B-LTLCardinality-10 finished in 113346 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 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 1962 transition count 1406
Reduce places removed 556 places and 0 transitions.
Iterating post reduction 1 with 556 rules applied. Total rules applied 1112 place count 1406 transition count 1406
Performed 389 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 389 Pre rules applied. Total rules applied 1112 place count 1406 transition count 1017
Deduced a syphon composed of 389 places in 2 ms
Reduce places removed 389 places and 0 transitions.
Iterating global reduction 2 with 778 rules applied. Total rules applied 1890 place count 1017 transition count 1017
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1897 place count 1010 transition count 1010
Iterating global reduction 2 with 7 rules applied. Total rules applied 1904 place count 1010 transition count 1010
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1904 place count 1010 transition count 1004
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1916 place count 1004 transition count 1004
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 0 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2814 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2815 place count 555 transition count 554
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2817 place count 554 transition count 553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3019 place count 453 transition count 653
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3115 place count 405 transition count 701
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3117 place count 403 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3118 place count 402 transition count 699
Applied a total of 3118 rules in 209 ms. Remains 402 /1963 variables (removed 1561) and now considering 699/1963 (removed 1264) transitions.
// Phase 1: matrix 699 rows 402 cols
[2024-05-29 20:56:41] [INFO ] Computed 200 invariants in 4 ms
[2024-05-29 20:56:42] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-29 20:56:42] [INFO ] Invariant cache hit.
[2024-05-29 20:56:42] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2024-05-29 20:56:42] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 20:56:42] [INFO ] Invariant cache hit.
[2024-05-29 20:56:43] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 402/1963 places, 699/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1346 ms. Remains : 402/1963 places, 699/1963 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s214 1) (EQ s335 1))], 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 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-13 finished in 1446 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(G(p0)) U G(p1))))'
Support contains 4 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1951 transition count 1951
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1951 transition count 1951
Applied a total of 24 rules in 146 ms. Remains 1951 /1963 variables (removed 12) and now considering 1951/1963 (removed 12) transitions.
// Phase 1: matrix 1951 rows 1951 cols
[2024-05-29 20:56:43] [INFO ] Computed 201 invariants in 13 ms
[2024-05-29 20:56:43] [INFO ] Implicit Places using invariants in 505 ms returned []
[2024-05-29 20:56:43] [INFO ] Invariant cache hit.
[2024-05-29 20:56:45] [INFO ] Implicit Places using invariants and state equation in 1759 ms returned []
Implicit Place search using SMT with State Equation took 2298 ms to find 0 implicit places.
[2024-05-29 20:56:45] [INFO ] Invariant cache hit.
[2024-05-29 20:56:46] [INFO ] Dead Transitions using invariants and state equation in 1170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1951/1963 places, 1951/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3636 ms. Remains : 1951/1963 places, 1951/1963 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s837 0) (EQ s889 1)), p0:(OR (EQ s538 0) (EQ s1050 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2 reset in 461 ms.
Product exploration explored 100000 steps with 2 reset in 599 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 20:56:48] [INFO ] Invariant cache hit.
[2024-05-29 20:56:48] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:56:48] [INFO ] [Nat]Absence check using 201 positive place invariants in 74 ms returned sat
[2024-05-29 20:56:49] [INFO ] After 1045ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:56:50] [INFO ] Deduced a trap composed of 34 places in 453 ms of which 1 ms to minimize.
[2024-05-29 20:56:50] [INFO ] Deduced a trap composed of 21 places in 462 ms of which 2 ms to minimize.
[2024-05-29 20:56:51] [INFO ] Deduced a trap composed of 20 places in 442 ms of which 1 ms to minimize.
[2024-05-29 20:56:51] [INFO ] Deduced a trap composed of 25 places in 441 ms of which 2 ms to minimize.
[2024-05-29 20:56:52] [INFO ] Deduced a trap composed of 34 places in 427 ms of which 1 ms to minimize.
[2024-05-29 20:56:52] [INFO ] Deduced a trap composed of 25 places in 425 ms of which 1 ms to minimize.
[2024-05-29 20:56:53] [INFO ] Deduced a trap composed of 34 places in 408 ms of which 1 ms to minimize.
[2024-05-29 20:56:53] [INFO ] Deduced a trap composed of 35 places in 369 ms of which 1 ms to minimize.
[2024-05-29 20:56:54] [INFO ] Deduced a trap composed of 23 places in 387 ms of which 1 ms to minimize.
[2024-05-29 20:56:54] [INFO ] Deduced a trap composed of 49 places in 359 ms of which 1 ms to minimize.
[2024-05-29 20:56:55] [INFO ] Deduced a trap composed of 43 places in 371 ms of which 1 ms to minimize.
[2024-05-29 20:56:55] [INFO ] Deduced a trap composed of 36 places in 354 ms of which 1 ms to minimize.
[2024-05-29 20:56:55] [INFO ] Deduced a trap composed of 22 places in 350 ms of which 1 ms to minimize.
[2024-05-29 20:56:56] [INFO ] Deduced a trap composed of 41 places in 338 ms of which 1 ms to minimize.
[2024-05-29 20:56:56] [INFO ] Deduced a trap composed of 40 places in 339 ms of which 1 ms to minimize.
[2024-05-29 20:56:57] [INFO ] Deduced a trap composed of 36 places in 349 ms of which 1 ms to minimize.
[2024-05-29 20:56:57] [INFO ] Deduced a trap composed of 58 places in 331 ms of which 1 ms to minimize.
[2024-05-29 20:56:57] [INFO ] Deduced a trap composed of 38 places in 322 ms of which 1 ms to minimize.
[2024-05-29 20:56:58] [INFO ] Deduced a trap composed of 38 places in 303 ms of which 1 ms to minimize.
[2024-05-29 20:56:58] [INFO ] Deduced a trap composed of 51 places in 284 ms of which 1 ms to minimize.
[2024-05-29 20:56:59] [INFO ] Deduced a trap composed of 41 places in 316 ms of which 1 ms to minimize.
[2024-05-29 20:56:59] [INFO ] Deduced a trap composed of 58 places in 291 ms of which 1 ms to minimize.
[2024-05-29 20:56:59] [INFO ] Deduced a trap composed of 58 places in 279 ms of which 1 ms to minimize.
[2024-05-29 20:57:00] [INFO ] Deduced a trap composed of 70 places in 273 ms of which 1 ms to minimize.
[2024-05-29 20:57:00] [INFO ] Deduced a trap composed of 59 places in 282 ms of which 1 ms to minimize.
[2024-05-29 20:57:00] [INFO ] Deduced a trap composed of 54 places in 275 ms of which 1 ms to minimize.
[2024-05-29 20:57:01] [INFO ] Deduced a trap composed of 53 places in 302 ms of which 0 ms to minimize.
[2024-05-29 20:57:01] [INFO ] Deduced a trap composed of 54 places in 270 ms of which 1 ms to minimize.
[2024-05-29 20:57:01] [INFO ] Deduced a trap composed of 53 places in 263 ms of which 1 ms to minimize.
[2024-05-29 20:57:02] [INFO ] Deduced a trap composed of 59 places in 269 ms of which 1 ms to minimize.
[2024-05-29 20:57:02] [INFO ] Deduced a trap composed of 63 places in 267 ms of which 1 ms to minimize.
[2024-05-29 20:57:02] [INFO ] Deduced a trap composed of 60 places in 255 ms of which 1 ms to minimize.
[2024-05-29 20:57:03] [INFO ] Deduced a trap composed of 65 places in 259 ms of which 1 ms to minimize.
[2024-05-29 20:57:03] [INFO ] Deduced a trap composed of 76 places in 229 ms of which 1 ms to minimize.
[2024-05-29 20:57:03] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 13550 ms
[2024-05-29 20:57:03] [INFO ] After 14657ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-29 20:57:03] [INFO ] After 15069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 1951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1951/1951 places, 1951/1951 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1951 transition count 1404
Reduce places removed 547 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 548 rules applied. Total rules applied 1095 place count 1404 transition count 1403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1096 place count 1403 transition count 1403
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 1096 place count 1403 transition count 1003
Deduced a syphon composed of 400 places in 2 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 1896 place count 1003 transition count 1003
Performed 448 Post agglomeration using F-continuation condition.Transition count delta: 448
Deduced a syphon composed of 448 places in 0 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 3 with 896 rules applied. Total rules applied 2792 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2793 place count 555 transition count 554
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 2795 place count 554 transition count 553
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2997 place count 453 transition count 653
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 3093 place count 405 transition count 701
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3094 place count 405 transition count 700
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3095 place count 404 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3096 place count 403 transition count 699
Applied a total of 3096 rules in 183 ms. Remains 403 /1951 variables (removed 1548) and now considering 699/1951 (removed 1252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 403/1951 places, 699/1951 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 399837 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 399837 steps, saw 262815 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 699 rows 403 cols
[2024-05-29 20:57:06] [INFO ] Computed 200 invariants in 11 ms
[2024-05-29 20:57:06] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:57:07] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2024-05-29 20:57:07] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:57:07] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-05-29 20:57:10] [INFO ] After 2925ms SMT Verify possible using 230 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:57:10] [INFO ] After 3157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-29 20:57:10] [INFO ] After 3538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 699/699 transitions.
Applied a total of 0 rules in 9 ms. Remains 403 /403 variables (removed 0) and now considering 699/699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 403/403 places, 699/699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 699/699 transitions.
Applied a total of 0 rules in 9 ms. Remains 403 /403 variables (removed 0) and now considering 699/699 (removed 0) transitions.
[2024-05-29 20:57:10] [INFO ] Invariant cache hit.
[2024-05-29 20:57:10] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-29 20:57:10] [INFO ] Invariant cache hit.
[2024-05-29 20:57:11] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-05-29 20:57:12] [INFO ] Implicit Places using invariants and state equation in 1368 ms returned []
Implicit Place search using SMT with State Equation took 1652 ms to find 0 implicit places.
[2024-05-29 20:57:12] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 20:57:12] [INFO ] Invariant cache hit.
[2024-05-29 20:57:12] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2011 ms. Remains : 403/403 places, 699/699 transitions.
Graph (trivial) has 200 edges and 403 vertex of which 4 / 403 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1474 edges and 401 vertex of which 399 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 197 edges and 397 vertex of which 4 / 397 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 395 transition count 690
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 196 edges and 393 vertex of which 6 / 393 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 390 transition count 681
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 194 edges and 387 vertex of which 8 / 387 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 383 transition count 670
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 190 edges and 379 vertex of which 8 / 379 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 375 transition count 656
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 186 edges and 371 vertex of which 8 / 371 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 367 transition count 642
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 182 edges and 363 vertex of which 8 / 363 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 359 transition count 628
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 178 edges and 355 vertex of which 8 / 355 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 351 transition count 614
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 174 edges and 347 vertex of which 8 / 347 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 600
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 170 edges and 339 vertex of which 8 / 339 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 335 transition count 586
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 166 edges and 331 vertex of which 8 / 331 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 327 transition count 572
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 162 edges and 323 vertex of which 8 / 323 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 319 transition count 558
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 158 edges and 315 vertex of which 8 / 315 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 311 transition count 544
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 154 edges and 307 vertex of which 8 / 307 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 303 transition count 530
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 150 edges and 299 vertex of which 8 / 299 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 295 transition count 516
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 146 edges and 291 vertex of which 8 / 291 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 287 transition count 502
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 142 edges and 283 vertex of which 8 / 283 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 279 transition count 488
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 138 edges and 275 vertex of which 8 / 275 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 271 transition count 474
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 134 edges and 267 vertex of which 8 / 267 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 263 transition count 460
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 130 edges and 259 vertex of which 8 / 259 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 255 transition count 446
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 126 edges and 251 vertex of which 8 / 251 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 247 transition count 432
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 122 edges and 243 vertex of which 8 / 243 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 239 transition count 418
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 118 edges and 235 vertex of which 8 / 235 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 231 transition count 404
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 114 edges and 227 vertex of which 8 / 227 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 223 transition count 390
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 110 edges and 219 vertex of which 8 / 219 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 215 transition count 376
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 106 edges and 211 vertex of which 8 / 211 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 207 transition count 362
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 102 edges and 203 vertex of which 8 / 203 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 199 transition count 348
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 98 edges and 195 vertex of which 8 / 195 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 191 transition count 334
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 91 edges and 189 vertex of which 2 / 189 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 27 with 13 rules applied. Total rules applied 504 place count 188 transition count 324
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 508 place count 187 transition count 321
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 29 with 2 rules applied. Total rules applied 510 place count 186 transition count 320
Graph (complete) has 720 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 29 with 1 rules applied. Total rules applied 511 place count 184 transition count 319
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 515 place count 184 transition count 315
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 31 with 3 rules applied. Total rules applied 518 place count 184 transition count 312
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 520 place count 182 transition count 312
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 32 with 2 rules applied. Total rules applied 522 place count 181 transition count 311
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 32 with 4 rules applied. Total rules applied 526 place count 181 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 527 place count 180 transition count 307
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 33 with 23 rules applied. Total rules applied 550 place count 180 transition count 307
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 33 with 22 rules applied. Total rules applied 572 place count 180 transition count 285
Applied a total of 572 rules in 90 ms. Remains 180 /403 variables (removed 223) and now considering 285/699 (removed 414) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 180 cols
[2024-05-29 20:57:12] [INFO ] Computed 89 invariants in 1 ms
[2024-05-29 20:57:12] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:57:12] [INFO ] [Nat]Absence check using 89 positive place invariants in 11 ms returned sat
[2024-05-29 20:57:12] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:57:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 20:57:12] [INFO ] After 12ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:57:12] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-29 20:57:12] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p0)]
Support contains 4 out of 1951 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1951/1951 places, 1951/1951 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 544 transitions
Trivial Post-agglo rules discarded 544 transitions
Performed 544 trivial Post agglomeration. Transition count delta: 544
Iterating post reduction 0 with 544 rules applied. Total rules applied 544 place count 1950 transition count 1406
Reduce places removed 544 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 546 rules applied. Total rules applied 1090 place count 1406 transition count 1404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1092 place count 1404 transition count 1404
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 1092 place count 1404 transition count 1004
Deduced a syphon composed of 400 places in 2 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 1892 place count 1004 transition count 1004
Performed 445 Post agglomeration using F-continuation condition.Transition count delta: 445
Deduced a syphon composed of 445 places in 0 ms
Reduce places removed 445 places and 0 transitions.
Iterating global reduction 3 with 890 rules applied. Total rules applied 2782 place count 559 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2783 place count 559 transition count 558
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 2785 place count 558 transition count 557
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2987 place count 457 transition count 657
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 3081 place count 410 transition count 703
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3083 place count 408 transition count 701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3084 place count 407 transition count 701
Applied a total of 3084 rules in 190 ms. Remains 407 /1951 variables (removed 1544) and now considering 701/1951 (removed 1250) transitions.
// Phase 1: matrix 701 rows 407 cols
[2024-05-29 20:57:13] [INFO ] Computed 200 invariants in 3 ms
[2024-05-29 20:57:13] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-29 20:57:13] [INFO ] Invariant cache hit.
[2024-05-29 20:57:13] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-05-29 20:57:14] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 1580 ms to find 0 implicit places.
[2024-05-29 20:57:14] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 20:57:14] [INFO ] Invariant cache hit.
[2024-05-29 20:57:15] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 407/1951 places, 701/1951 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2119 ms. Remains : 407/1951 places, 701/1951 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 20:57:15] [INFO ] Invariant cache hit.
[2024-05-29 20:57:15] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:57:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2024-05-29 20:57:15] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:57:15] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-05-29 20:57:18] [INFO ] After 2454ms SMT Verify possible using 230 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:57:18] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:57:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2024-05-29 20:57:19] [INFO ] After 3127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 658 ms.
[2024-05-29 20:57:19] [INFO ] After 4096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 407/407 places, 701/701 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 407 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 406 transition count 699
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 406 transition count 698
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 5 place count 405 transition count 698
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 7 place count 404 transition count 697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 9 place count 403 transition count 699
Applied a total of 9 rules in 30 ms. Remains 403 /407 variables (removed 4) and now considering 699/701 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 403/407 places, 699/701 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 393797 steps, run timeout after 3029 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 393797 steps, saw 291476 distinct states, run finished after 3029 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 699 rows 403 cols
[2024-05-29 20:57:22] [INFO ] Computed 200 invariants in 1 ms
[2024-05-29 20:57:22] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:57:23] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2024-05-29 20:57:23] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:57:23] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-05-29 20:57:24] [INFO ] After 1581ms SMT Verify possible using 230 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:57:29] [INFO ] After 6097ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2986 ms.
[2024-05-29 20:57:32] [INFO ] After 9404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 699/699 transitions.
Applied a total of 0 rules in 9 ms. Remains 403 /403 variables (removed 0) and now considering 699/699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 403/403 places, 699/699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 699/699 transitions.
Applied a total of 0 rules in 8 ms. Remains 403 /403 variables (removed 0) and now considering 699/699 (removed 0) transitions.
[2024-05-29 20:57:32] [INFO ] Invariant cache hit.
[2024-05-29 20:57:32] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-29 20:57:32] [INFO ] Invariant cache hit.
[2024-05-29 20:57:32] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-05-29 20:57:33] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned []
Implicit Place search using SMT with State Equation took 1651 ms to find 0 implicit places.
[2024-05-29 20:57:34] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 20:57:34] [INFO ] Invariant cache hit.
[2024-05-29 20:57:34] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1976 ms. Remains : 403/403 places, 699/699 transitions.
Graph (trivial) has 200 edges and 403 vertex of which 4 / 403 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1474 edges and 401 vertex of which 399 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 197 edges and 397 vertex of which 4 / 397 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 395 transition count 690
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 196 edges and 393 vertex of which 6 / 393 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 390 transition count 681
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 194 edges and 387 vertex of which 8 / 387 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 383 transition count 670
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 190 edges and 379 vertex of which 8 / 379 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 375 transition count 656
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 186 edges and 371 vertex of which 8 / 371 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 367 transition count 642
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 182 edges and 363 vertex of which 8 / 363 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 359 transition count 628
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 178 edges and 355 vertex of which 8 / 355 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 351 transition count 614
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 174 edges and 347 vertex of which 8 / 347 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 343 transition count 600
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 170 edges and 339 vertex of which 8 / 339 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 335 transition count 586
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 166 edges and 331 vertex of which 8 / 331 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 327 transition count 572
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 162 edges and 323 vertex of which 8 / 323 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 319 transition count 558
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 158 edges and 315 vertex of which 8 / 315 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 311 transition count 544
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 154 edges and 307 vertex of which 8 / 307 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 303 transition count 530
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 150 edges and 299 vertex of which 8 / 299 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 295 transition count 516
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 146 edges and 291 vertex of which 8 / 291 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 287 transition count 502
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 142 edges and 283 vertex of which 8 / 283 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 279 transition count 488
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 138 edges and 275 vertex of which 8 / 275 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 271 transition count 474
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 134 edges and 267 vertex of which 8 / 267 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 263 transition count 460
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 130 edges and 259 vertex of which 8 / 259 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 255 transition count 446
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 126 edges and 251 vertex of which 8 / 251 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 247 transition count 432
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 122 edges and 243 vertex of which 8 / 243 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 239 transition count 418
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 118 edges and 235 vertex of which 8 / 235 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 231 transition count 404
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 114 edges and 227 vertex of which 8 / 227 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 223 transition count 390
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 110 edges and 219 vertex of which 8 / 219 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 215 transition count 376
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 106 edges and 211 vertex of which 8 / 211 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 207 transition count 362
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 102 edges and 203 vertex of which 8 / 203 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 199 transition count 348
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 98 edges and 195 vertex of which 8 / 195 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 191 transition count 334
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 91 edges and 189 vertex of which 2 / 189 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 27 with 13 rules applied. Total rules applied 504 place count 188 transition count 324
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 508 place count 187 transition count 321
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 29 with 2 rules applied. Total rules applied 510 place count 186 transition count 320
Graph (complete) has 720 edges and 186 vertex of which 184 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 29 with 1 rules applied. Total rules applied 511 place count 184 transition count 319
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 515 place count 184 transition count 315
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 31 with 3 rules applied. Total rules applied 518 place count 184 transition count 312
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 520 place count 182 transition count 312
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 32 with 2 rules applied. Total rules applied 522 place count 181 transition count 311
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 32 with 4 rules applied. Total rules applied 526 place count 181 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 527 place count 180 transition count 307
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 33 with 23 rules applied. Total rules applied 550 place count 180 transition count 307
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 33 with 22 rules applied. Total rules applied 572 place count 180 transition count 285
Applied a total of 572 rules in 77 ms. Remains 180 /403 variables (removed 223) and now considering 285/699 (removed 414) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 180 cols
[2024-05-29 20:57:34] [INFO ] Computed 89 invariants in 3 ms
[2024-05-29 20:57:34] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:57:34] [INFO ] [Nat]Absence check using 89 positive place invariants in 12 ms returned sat
[2024-05-29 20:57:34] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:57:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 20:57:34] [INFO ] After 18ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:57:34] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-29 20:57:34] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 31 reset in 516 ms.
Product exploration explored 100000 steps with 24 reset in 605 ms.
Built C files in :
/tmp/ltsmin3316838803760912880
[2024-05-29 20:57:36] [INFO ] Computing symmetric may disable matrix : 701 transitions.
[2024-05-29 20:57:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:57:36] [INFO ] Computing symmetric may enable matrix : 701 transitions.
[2024-05-29 20:57:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:57:36] [INFO ] Computing Do-Not-Accords matrix : 701 transitions.
[2024-05-29 20:57:36] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:57:36] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3316838803760912880
Running compilation step : cd /tmp/ltsmin3316838803760912880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1817 ms.
Running link step : cd /tmp/ltsmin3316838803760912880;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin3316838803760912880;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9451108260480661796.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 407 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 407/407 places, 701/701 transitions.
Applied a total of 0 rules in 10 ms. Remains 407 /407 variables (removed 0) and now considering 701/701 (removed 0) transitions.
// Phase 1: matrix 701 rows 407 cols
[2024-05-29 20:57:51] [INFO ] Computed 200 invariants in 2 ms
[2024-05-29 20:57:51] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-29 20:57:51] [INFO ] Invariant cache hit.
[2024-05-29 20:57:51] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-05-29 20:57:52] [INFO ] Implicit Places using invariants and state equation in 1382 ms returned []
Implicit Place search using SMT with State Equation took 1653 ms to find 0 implicit places.
[2024-05-29 20:57:52] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-29 20:57:52] [INFO ] Invariant cache hit.
[2024-05-29 20:57:53] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1996 ms. Remains : 407/407 places, 701/701 transitions.
Built C files in :
/tmp/ltsmin14644858376890109151
[2024-05-29 20:57:53] [INFO ] Computing symmetric may disable matrix : 701 transitions.
[2024-05-29 20:57:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:57:53] [INFO ] Computing symmetric may enable matrix : 701 transitions.
[2024-05-29 20:57:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:57:53] [INFO ] Computing Do-Not-Accords matrix : 701 transitions.
[2024-05-29 20:57:53] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:57:53] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14644858376890109151
Running compilation step : cd /tmp/ltsmin14644858376890109151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1753 ms.
Running link step : cd /tmp/ltsmin14644858376890109151;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14644858376890109151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7536974024921916844.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 20:58:08] [INFO ] Flatten gal took : 33 ms
[2024-05-29 20:58:08] [INFO ] Flatten gal took : 40 ms
[2024-05-29 20:58:08] [INFO ] Time to serialize gal into /tmp/LTL15803423752613016388.gal : 3 ms
[2024-05-29 20:58:08] [INFO ] Time to serialize properties into /tmp/LTL4012630166476952021.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15803423752613016388.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10207205956130348266.hoa' '-atoms' '/tmp/LTL4012630166476952021.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4012630166476952021.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10207205956130348266.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t454, t456, t458, t460, t462, t464, t466, t468, t470, t472, t474, t476, t478, t479, t482,...1294
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
[2024-05-29 20:58:23] [INFO ] Flatten gal took : 28 ms
[2024-05-29 20:58:23] [INFO ] Flatten gal took : 27 ms
[2024-05-29 20:58:23] [INFO ] Time to serialize gal into /tmp/LTL12217942717056593318.gal : 3 ms
[2024-05-29 20:58:23] [INFO ] Time to serialize properties into /tmp/LTL5782118616545319889.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12217942717056593318.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5782118616545319889.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((p678==0)||(p1337==1))")))U(G("((p1063==0)||(p1131==1))")))))
Formula 0 simplified : X(GF!"((p678==0)||(p1337==1))" R F!"((p1063==0)||(p1131==1))")
Reverse transition relation is NOT exact ! Due to transitions t3, t454, t456, t458, t460, t462, t464, t466, t468, t470, t472, t474, t476, t478, t479, t482,...1294
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
[2024-05-29 20:58:38] [INFO ] Flatten gal took : 34 ms
[2024-05-29 20:58:38] [INFO ] Applying decomposition
[2024-05-29 20:58:38] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6713066328112078565.txt' '-o' '/tmp/graph6713066328112078565.bin' '-w' '/tmp/graph6713066328112078565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6713066328112078565.bin' '-l' '-1' '-v' '-w' '/tmp/graph6713066328112078565.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:58:38] [INFO ] Decomposing Gal with order
[2024-05-29 20:58:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:58:38] [INFO ] Removed a total of 1371 redundant transitions.
[2024-05-29 20:58:38] [INFO ] Flatten gal took : 37 ms
[2024-05-29 20:58:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 588 labels/synchronizations in 58 ms.
[2024-05-29 20:58:39] [INFO ] Time to serialize gal into /tmp/LTL12348606206122281802.gal : 5 ms
[2024-05-29 20:58:39] [INFO ] Time to serialize properties into /tmp/LTL1746092197015046403.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12348606206122281802.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1746092197015046403.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((i3.u52.p678==0)||(i7.u106.p1337==1))")))U(G("((i5.u84.p1063==0)||(i6.i0.i1.u91.p1131==1))")))))
Formula 0 simplified : X(GF!"((i3.u52.p678==0)||(i7.u106.p1337==1))" R F!"((i5.u84.p1063==0)||(i6.i0.i1.u91.p1131==1))")
Reverse transition relation is NOT exact ! Due to transitions t30_t25_t29, t39_t33_t37, t76_t71_t73, t85_t78_t82, t102_t97_t101, t111_t104_t109, t130_t124_...1573
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9645810837717444799
[2024-05-29 20:58:54] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9645810837717444799
Running compilation step : cd /tmp/ltsmin9645810837717444799;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1148 ms.
Running link step : cd /tmp/ltsmin9645810837717444799;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9645810837717444799;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true))) U []((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-14 finished in 146044 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(p0))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1952 transition count 1952
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1952 transition count 1952
Applied a total of 22 rules in 181 ms. Remains 1952 /1963 variables (removed 11) and now considering 1952/1963 (removed 11) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2024-05-29 20:59:09] [INFO ] Computed 201 invariants in 11 ms
[2024-05-29 20:59:09] [INFO ] Implicit Places using invariants in 512 ms returned []
[2024-05-29 20:59:09] [INFO ] Invariant cache hit.
[2024-05-29 20:59:11] [INFO ] Implicit Places using invariants and state equation in 1685 ms returned []
Implicit Place search using SMT with State Equation took 2198 ms to find 0 implicit places.
[2024-05-29 20:59:11] [INFO ] Invariant cache hit.
[2024-05-29 20:59:12] [INFO ] Dead Transitions using invariants and state equation in 1161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1952/1963 places, 1952/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3546 ms. Remains : 1952/1963 places, 1952/1963 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s231 0) (EQ s65 1))], 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1391 ms.
Product exploration explored 100000 steps with 50000 reset in 1382 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 30 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050B-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050B-LTLCardinality-15 finished in 6491 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&&G(p1)))))'
Found a Shortening insensitive property : ShieldRVt-PT-050B-LTLCardinality-01
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 551 transitions
Trivial Post-agglo rules discarded 551 transitions
Performed 551 trivial Post agglomeration. Transition count delta: 551
Iterating post reduction 0 with 551 rules applied. Total rules applied 551 place count 1962 transition count 1411
Reduce places removed 551 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 552 rules applied. Total rules applied 1103 place count 1411 transition count 1410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1104 place count 1410 transition count 1410
Performed 391 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 391 Pre rules applied. Total rules applied 1104 place count 1410 transition count 1019
Deduced a syphon composed of 391 places in 2 ms
Reduce places removed 391 places and 0 transitions.
Iterating global reduction 3 with 782 rules applied. Total rules applied 1886 place count 1019 transition count 1019
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1894 place count 1011 transition count 1011
Iterating global reduction 3 with 8 rules applied. Total rules applied 1902 place count 1011 transition count 1011
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1902 place count 1011 transition count 1004
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1916 place count 1004 transition count 1004
Performed 444 Post agglomeration using F-continuation condition.Transition count delta: 444
Deduced a syphon composed of 444 places in 0 ms
Reduce places removed 444 places and 0 transitions.
Iterating global reduction 3 with 888 rules applied. Total rules applied 2804 place count 560 transition count 560
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2805 place count 560 transition count 559
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 2807 place count 559 transition count 558
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3009 place count 458 transition count 658
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 3103 place count 411 transition count 704
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 3105 place count 411 transition count 704
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3107 place count 409 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3108 place count 408 transition count 702
Applied a total of 3108 rules in 217 ms. Remains 408 /1963 variables (removed 1555) and now considering 702/1963 (removed 1261) transitions.
// Phase 1: matrix 702 rows 408 cols
[2024-05-29 20:59:16] [INFO ] Computed 200 invariants in 3 ms
[2024-05-29 20:59:16] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-29 20:59:16] [INFO ] Invariant cache hit.
[2024-05-29 20:59:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 20:59:16] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2024-05-29 20:59:16] [INFO ] Invariant cache hit.
[2024-05-29 20:59:17] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 408/1963 places, 702/1963 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1397 ms. Remains : 408/1963 places, 702/1963 transitions.
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s230 0) (EQ s271 1)), p1:(OR (EQ s65 0) (EQ s364 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-01 finished in 1594 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + 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(F((p0&&G((p0 U p1))))))'
Found a Shortening insensitive property : ShieldRVt-PT-050B-LTLCardinality-10
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 550 transitions
Trivial Post-agglo rules discarded 550 transitions
Performed 550 trivial Post agglomeration. Transition count delta: 550
Iterating post reduction 0 with 550 rules applied. Total rules applied 550 place count 1962 transition count 1412
Reduce places removed 550 places and 0 transitions.
Iterating post reduction 1 with 550 rules applied. Total rules applied 1100 place count 1412 transition count 1412
Performed 392 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 392 Pre rules applied. Total rules applied 1100 place count 1412 transition count 1020
Deduced a syphon composed of 392 places in 1 ms
Reduce places removed 392 places and 0 transitions.
Iterating global reduction 2 with 784 rules applied. Total rules applied 1884 place count 1020 transition count 1020
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1890 place count 1014 transition count 1014
Iterating global reduction 2 with 6 rules applied. Total rules applied 1896 place count 1014 transition count 1014
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1896 place count 1014 transition count 1009
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1906 place count 1009 transition count 1009
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 0 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 2806 place count 559 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2807 place count 559 transition count 558
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2809 place count 558 transition count 557
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3011 place count 457 transition count 657
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 3103 place count 411 transition count 701
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3105 place count 409 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3106 place count 408 transition count 699
Applied a total of 3106 rules in 196 ms. Remains 408 /1963 variables (removed 1555) and now considering 699/1963 (removed 1264) transitions.
// Phase 1: matrix 699 rows 408 cols
[2024-05-29 20:59:17] [INFO ] Computed 200 invariants in 3 ms
[2024-05-29 20:59:17] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-29 20:59:17] [INFO ] Invariant cache hit.
[2024-05-29 20:59:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-29 20:59:18] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
[2024-05-29 20:59:18] [INFO ] Invariant cache hit.
[2024-05-29 20:59:18] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 408/1963 places, 699/1963 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1323 ms. Remains : 408/1963 places, 699/1963 transitions.
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(OR p0 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s21 0) (EQ s191 1)), p1:(OR (EQ s321 0) (EQ s261 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 9268 steps with 4 reset in 50 ms.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-10 finished in 1639 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + 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((F(G(p0)) U G(p1))))'
Found a Lengthening insensitive property : ShieldRVt-PT-050B-LTLCardinality-14
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 4 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 551 transitions
Trivial Post-agglo rules discarded 551 transitions
Performed 551 trivial Post agglomeration. Transition count delta: 551
Iterating post reduction 0 with 551 rules applied. Total rules applied 551 place count 1962 transition count 1411
Reduce places removed 551 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 553 rules applied. Total rules applied 1104 place count 1411 transition count 1409
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1106 place count 1409 transition count 1409
Performed 390 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 390 Pre rules applied. Total rules applied 1106 place count 1409 transition count 1019
Deduced a syphon composed of 390 places in 2 ms
Reduce places removed 390 places and 0 transitions.
Iterating global reduction 3 with 780 rules applied. Total rules applied 1886 place count 1019 transition count 1019
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1894 place count 1011 transition count 1011
Iterating global reduction 3 with 8 rules applied. Total rules applied 1902 place count 1011 transition count 1011
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1902 place count 1011 transition count 1004
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1916 place count 1004 transition count 1004
Performed 445 Post agglomeration using F-continuation condition.Transition count delta: 445
Deduced a syphon composed of 445 places in 0 ms
Reduce places removed 445 places and 0 transitions.
Iterating global reduction 3 with 890 rules applied. Total rules applied 2806 place count 559 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2807 place count 559 transition count 558
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2809 place count 558 transition count 557
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3011 place count 457 transition count 657
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 3105 place count 410 transition count 703
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3107 place count 408 transition count 701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3108 place count 407 transition count 701
Applied a total of 3108 rules in 217 ms. Remains 407 /1963 variables (removed 1556) and now considering 701/1963 (removed 1262) transitions.
// Phase 1: matrix 701 rows 407 cols
[2024-05-29 20:59:19] [INFO ] Computed 200 invariants in 1 ms
[2024-05-29 20:59:19] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-29 20:59:19] [INFO ] Invariant cache hit.
[2024-05-29 20:59:19] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-05-29 20:59:20] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned []
Implicit Place search using SMT with State Equation took 1547 ms to find 0 implicit places.
[2024-05-29 20:59:20] [INFO ] Invariant cache hit.
[2024-05-29 20:59:21] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 407/1963 places, 701/1963 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2103 ms. Remains : 407/1963 places, 701/1963 transitions.
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s170 0) (EQ s182 1)), p0:(OR (EQ s106 0) (EQ s218 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 29 reset in 474 ms.
Product exploration explored 100000 steps with 34 reset in 577 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 20:59:22] [INFO ] Invariant cache hit.
[2024-05-29 20:59:22] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:59:22] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2024-05-29 20:59:22] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:59:22] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-05-29 20:59:23] [INFO ] After 462ms SMT Verify possible using 230 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:59:23] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:59:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2891 ms
[2024-05-29 20:59:26] [INFO ] After 3404ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1528 ms.
[2024-05-29 20:59:27] [INFO ] After 5248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 2 out of 407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 407/407 places, 701/701 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 407 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 406 transition count 699
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 406 transition count 698
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 405 transition count 698
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 7 place count 404 transition count 697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 9 place count 403 transition count 699
Applied a total of 9 rules in 24 ms. Remains 403 /407 variables (removed 4) and now considering 699/701 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 403/407 places, 699/701 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 33944 steps, run visited all 1 properties in 277 ms. (steps per millisecond=122 )
Probabilistic random walk after 33944 steps, saw 21856 distinct states, run finished after 279 ms. (steps per millisecond=121 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p0)]
Support contains 4 out of 407 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 407/407 places, 701/701 transitions.
Applied a total of 0 rules in 14 ms. Remains 407 /407 variables (removed 0) and now considering 701/701 (removed 0) transitions.
[2024-05-29 20:59:28] [INFO ] Invariant cache hit.
[2024-05-29 20:59:28] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-29 20:59:28] [INFO ] Invariant cache hit.
[2024-05-29 20:59:29] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-05-29 20:59:30] [INFO ] Implicit Places using invariants and state equation in 1263 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
[2024-05-29 20:59:30] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 20:59:30] [INFO ] Invariant cache hit.
[2024-05-29 20:59:30] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2007 ms. Remains : 407/407 places, 701/701 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 20:59:30] [INFO ] Invariant cache hit.
[2024-05-29 20:59:31] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:59:31] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2024-05-29 20:59:31] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:59:31] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-05-29 20:59:31] [INFO ] After 464ms SMT Verify possible using 230 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:59:31] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 0 ms to minimize.
[2024-05-29 20:59:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2901 ms
[2024-05-29 20:59:34] [INFO ] After 3400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1529 ms.
[2024-05-29 20:59:36] [INFO ] After 5276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 407/407 places, 701/701 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 407 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 406 transition count 699
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 406 transition count 698
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 5 place count 405 transition count 698
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 7 place count 404 transition count 697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 9 place count 403 transition count 699
Applied a total of 9 rules in 24 ms. Remains 403 /407 variables (removed 4) and now considering 699/701 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 403/407 places, 699/701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Finished probabilistic random walk after 33944 steps, run visited all 1 properties in 286 ms. (steps per millisecond=118 )
Probabilistic random walk after 33944 steps, saw 21856 distinct states, run finished after 288 ms. (steps per millisecond=117 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 24 reset in 457 ms.
Product exploration explored 100000 steps with 24 reset in 549 ms.
Built C files in :
/tmp/ltsmin5238409314136529017
[2024-05-29 20:59:38] [INFO ] Computing symmetric may disable matrix : 701 transitions.
[2024-05-29 20:59:38] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:59:38] [INFO ] Computing symmetric may enable matrix : 701 transitions.
[2024-05-29 20:59:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:59:38] [INFO ] Computing Do-Not-Accords matrix : 701 transitions.
[2024-05-29 20:59:38] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:59:38] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5238409314136529017
Running compilation step : cd /tmp/ltsmin5238409314136529017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1760 ms.
Running link step : cd /tmp/ltsmin5238409314136529017;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin5238409314136529017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6015592094407977050.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 407 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 407/407 places, 701/701 transitions.
Applied a total of 0 rules in 18 ms. Remains 407 /407 variables (removed 0) and now considering 701/701 (removed 0) transitions.
[2024-05-29 20:59:53] [INFO ] Invariant cache hit.
[2024-05-29 20:59:53] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-29 20:59:53] [INFO ] Invariant cache hit.
[2024-05-29 20:59:53] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-05-29 20:59:54] [INFO ] Implicit Places using invariants and state equation in 1287 ms returned []
Implicit Place search using SMT with State Equation took 1548 ms to find 0 implicit places.
[2024-05-29 20:59:54] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 20:59:54] [INFO ] Invariant cache hit.
[2024-05-29 20:59:55] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1893 ms. Remains : 407/407 places, 701/701 transitions.
Built C files in :
/tmp/ltsmin875491975571004106
[2024-05-29 20:59:55] [INFO ] Computing symmetric may disable matrix : 701 transitions.
[2024-05-29 20:59:55] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:59:55] [INFO ] Computing symmetric may enable matrix : 701 transitions.
[2024-05-29 20:59:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:59:55] [INFO ] Computing Do-Not-Accords matrix : 701 transitions.
[2024-05-29 20:59:55] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:59:55] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin875491975571004106
Running compilation step : cd /tmp/ltsmin875491975571004106;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1788 ms.
Running link step : cd /tmp/ltsmin875491975571004106;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin875491975571004106;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5754896616294872611.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 21:00:10] [INFO ] Flatten gal took : 23 ms
[2024-05-29 21:00:10] [INFO ] Flatten gal took : 22 ms
[2024-05-29 21:00:10] [INFO ] Time to serialize gal into /tmp/LTL10632455445631944820.gal : 3 ms
[2024-05-29 21:00:10] [INFO ] Time to serialize properties into /tmp/LTL5866482188852554594.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10632455445631944820.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2358138608012437855.hoa' '-atoms' '/tmp/LTL5866482188852554594.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5866482188852554594.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2358138608012437855.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t450, t452, t455, t457, t459, t461, t463, t465, t467, t469, t472, t474, t476, t478, t480,...1294
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
[2024-05-29 21:00:25] [INFO ] Flatten gal took : 22 ms
[2024-05-29 21:00:25] [INFO ] Flatten gal took : 23 ms
[2024-05-29 21:00:25] [INFO ] Time to serialize gal into /tmp/LTL9188660395484707662.gal : 3 ms
[2024-05-29 21:00:25] [INFO ] Time to serialize properties into /tmp/LTL2680961986156536997.ltl : 81 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9188660395484707662.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2680961986156536997.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((p678==0)||(p1337==1))")))U(G("((p1063==0)||(p1131==1))")))))
Formula 0 simplified : X(GF!"((p678==0)||(p1337==1))" R F!"((p1063==0)||(p1131==1))")
Reverse transition relation is NOT exact ! Due to transitions t3, t450, t452, t455, t457, t459, t461, t463, t465, t467, t469, t472, t474, t476, t478, t480,...1294
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
[2024-05-29 21:00:40] [INFO ] Flatten gal took : 27 ms
[2024-05-29 21:00:40] [INFO ] Applying decomposition
[2024-05-29 21:00:40] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10094799556385604117.txt' '-o' '/tmp/graph10094799556385604117.bin' '-w' '/tmp/graph10094799556385604117.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10094799556385604117.bin' '-l' '-1' '-v' '-w' '/tmp/graph10094799556385604117.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:00:40] [INFO ] Decomposing Gal with order
[2024-05-29 21:00:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:00:40] [INFO ] Removed a total of 1371 redundant transitions.
[2024-05-29 21:00:40] [INFO ] Flatten gal took : 39 ms
[2024-05-29 21:00:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 546 labels/synchronizations in 27 ms.
[2024-05-29 21:00:40] [INFO ] Time to serialize gal into /tmp/LTL15826115352976405582.gal : 4 ms
[2024-05-29 21:00:40] [INFO ] Time to serialize properties into /tmp/LTL16660075990474590423.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15826115352976405582.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16660075990474590423.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((i3.i1.i0.u51.p678==0)||(i7.u106.p1337==1))")))U(G("((i5.u84.p1063==0)||(i6.u91.p1131==1))")))))
Formula 0 simplified : X(GF!"((i3.i1.i0.u51.p678==0)||(i7.u106.p1337==1))" R F!"((i5.u84.p1063==0)||(i6.u91.p1131==1))")
Reverse transition relation is NOT exact ! Due to transitions t28_t25_t26, t37_t29_t34, t54_t50_t53, t63_t56_t61, t470_t77_t80, t90_t82_t88, t125_t120_t124...1573
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin185380753881019123
[2024-05-29 21:00:55] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin185380753881019123
Running compilation step : cd /tmp/ltsmin185380753881019123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1131 ms.
Running link step : cd /tmp/ltsmin185380753881019123;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin185380753881019123;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true))) U []((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-14 finished in 112059 ms.
[2024-05-29 21:01:11] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin736622380370445429
[2024-05-29 21:01:11] [INFO ] Too many transitions (1963) to apply POR reductions. Disabling POR matrices.
[2024-05-29 21:01:11] [INFO ] Applying decomposition
[2024-05-29 21:01:11] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin736622380370445429
Running compilation step : cd /tmp/ltsmin736622380370445429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 21:01:11] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15022325173370172519.txt' '-o' '/tmp/graph15022325173370172519.bin' '-w' '/tmp/graph15022325173370172519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15022325173370172519.bin' '-l' '-1' '-v' '-w' '/tmp/graph15022325173370172519.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:01:11] [INFO ] Decomposing Gal with order
[2024-05-29 21:01:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:01:11] [INFO ] Removed a total of 490 redundant transitions.
[2024-05-29 21:01:11] [INFO ] Flatten gal took : 70 ms
[2024-05-29 21:01:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-29 21:01:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality14766187325309519396.gal : 17 ms
[2024-05-29 21:01:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality8858840849536975074.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14766187325309519396.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8858840849536975074.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((X(F(("((i32.i2.u453.p1442==0)||(i35.i4.u519.p1665==1))")&&(G("((i14.i5.u142.p434==0)||(i45.i2.u694.p2229==1))"))))))
Formula 0 simplified : XG(!"((i32.i2.u453.p1442==0)||(i35.i4.u519.p1665==1))" | F!"((i14.i5.u142.p434==0)||(i45.i2.u694.p2229==1))")
Compilation finished in 3857 ms.
Running link step : cd /tmp/ltsmin736622380370445429;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin736622380370445429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&[]((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.038: LTL layer: formula: X(<>(((LTLAPp0==true)&&[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 6/ 8), 0.039: "X(<>(((LTLAPp0==true)&&[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.044: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.047: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.046: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.775: There are 1970 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.775: State length is 1964, there are 1969 groups
pins2lts-mc-linux64( 0/ 8), 0.775: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.775: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.775: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.775: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 1.012: [Blue] ~120 levels ~960 states ~8448 transitions
pins2lts-mc-linux64( 2/ 8), 1.325: [Blue] ~240 levels ~1920 states ~28416 transitions
pins2lts-mc-linux64( 2/ 8), 1.767: [Blue] ~480 levels ~3840 states ~63976 transitions
pins2lts-mc-linux64( 3/ 8), 2.601: [Blue] ~960 levels ~7680 states ~109744 transitions
pins2lts-mc-linux64( 2/ 8), 3.535: [Blue] ~1920 levels ~15360 states ~211760 transitions
pins2lts-mc-linux64( 2/ 8), 5.817: [Blue] ~3840 levels ~30720 states ~318840 transitions
pins2lts-mc-linux64( 2/ 8), 9.982: [Blue] ~7641 levels ~61440 states ~474000 transitions
pins2lts-mc-linux64( 2/ 8), 17.936: [Blue] ~15233 levels ~122880 states ~791560 transitions
pins2lts-mc-linux64( 2/ 8), 34.210: [Blue] ~30318 levels ~245760 states ~1451576 transitions
pins2lts-mc-linux64( 2/ 8), 66.339: [Blue] ~60409 levels ~491520 states ~2786192 transitions
pins2lts-mc-linux64( 2/ 8), 132.287: [Blue] ~120398 levels ~983040 states ~5534200 transitions
pins2lts-mc-linux64( 7/ 8), 265.964: [Blue] ~217512 levels ~1966080 states ~10088480 transitions
pins2lts-mc-linux64( 7/ 8), 526.532: [Blue] ~420997 levels ~3932160 states ~20782632 transitions
pins2lts-mc-linux64( 7/ 8), 1045.957: [Blue] ~828511 levels ~7864320 states ~44756424 transitions
pins2lts-mc-linux64( 7/ 8), 1199.012: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1199.119:
pins2lts-mc-linux64( 0/ 8), 1199.119: Explored 7904673 states 50446533 transitions, fanout: 6.382
pins2lts-mc-linux64( 0/ 8), 1199.119: Total exploration time 1198.310 sec (1198.220 sec minimum, 1198.251 sec on average)
pins2lts-mc-linux64( 0/ 8), 1199.119: States per second: 6597, Transitions per second: 42098
pins2lts-mc-linux64( 0/ 8), 1199.119:
pins2lts-mc-linux64( 0/ 8), 1199.119: State space has 19731153 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1199.120: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1199.120: blue states: 7904673 (40.06%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1199.120: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1199.120: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1199.120:
pins2lts-mc-linux64( 0/ 8), 1199.120: Total memory used for local state coloring: 79.8MB
pins2lts-mc-linux64( 0/ 8), 1199.120:
pins2lts-mc-linux64( 0/ 8), 1199.120: Queue width: 8B, total height: 5228474, memory: 39.89MB
pins2lts-mc-linux64( 0/ 8), 1199.120: Tree memory: 406.5MB, 21.6 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 1199.120: Tree fill ratio (roots/leafs): 14.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1199.120: Stored 2042 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1199.120: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1199.120: Est. total memory use: 446.4MB (~1063.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin736622380370445429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin736622380370445429;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(((LTLAPp0==true)&&[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-29 21:24:17] [INFO ] Applying decomposition
[2024-05-29 21:24:17] [INFO ] Flatten gal took : 34 ms
[2024-05-29 21:24:17] [INFO ] Decomposing Gal with order
[2024-05-29 21:24:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:24:18] [INFO ] Removed a total of 149 redundant transitions.
[2024-05-29 21:24:18] [INFO ] Flatten gal took : 50 ms
[2024-05-29 21:24:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 21:24:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality7502163996660897227.gal : 14 ms
[2024-05-29 21:24:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality11630805519307649670.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7502163996660897227.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11630805519307649670.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((X(F(("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u251.p1442==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...391
Formula 0 simplified : XG(!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u251.p1442==0)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....383
Reverse transition relation is NOT exact ! Due to transitions t1861, i0.t1764, i0.i0.t1859, i0.i0.i0.t1766, i0.i0.i0.i0.t1857, i0.i0.i0.i0.i0.t1768, i0.i0....41141
Computing Next relation with stutter on 3.26648e+38 deadlock states
Detected timeout of ITS tools.
[2024-05-29 21:47:24] [INFO ] Flatten gal took : 34 ms
[2024-05-29 21:47:24] [INFO ] Input system was already deterministic with 1963 transitions.
[2024-05-29 21:47:24] [INFO ] Transformed 1963 places.
[2024-05-29 21:47:24] [INFO ] Transformed 1963 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 21:47:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality17778890035307718579.gal : 7 ms
[2024-05-29 21:47:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality15621495258522965007.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17778890035307718579.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15621495258522965007.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(("((p1442==0)||(p1665==1))")&&(G("((p434==0)||(p2229==1))"))))))
Formula 0 simplified : XG(!"((p1442==0)||(p1665==1))" | F!"((p434==0)||(p2229==1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7197376 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16036260 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ShieldRVt-PT-050B"
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 ShieldRVt-PT-050B, 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 r373-tall-171683789800647"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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