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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 21:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 21:08 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 364K 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-030B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717015081003

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-030B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 20:38:02] [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:38:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:38:02] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-29 20:38:02] [INFO ] Transformed 1503 places.
[2024-05-29 20:38:03] [INFO ] Transformed 1503 transitions.
[2024-05-29 20:38:03] [INFO ] Found NUPN structural information;
[2024-05-29 20:38:03] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 360 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVt-PT-030B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 1503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Discarding 318 places :
Symmetric choice reduction at 0 with 318 rule applications. Total rules 318 place count 1185 transition count 1185
Iterating global reduction 0 with 318 rules applied. Total rules applied 636 place count 1185 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 637 place count 1184 transition count 1184
Iterating global reduction 0 with 1 rules applied. Total rules applied 638 place count 1184 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 639 place count 1183 transition count 1183
Iterating global reduction 0 with 1 rules applied. Total rules applied 640 place count 1183 transition count 1183
Applied a total of 640 rules in 419 ms. Remains 1183 /1503 variables (removed 320) and now considering 1183/1503 (removed 320) transitions.
// Phase 1: matrix 1183 rows 1183 cols
[2024-05-29 20:38:03] [INFO ] Computed 121 invariants in 31 ms
[2024-05-29 20:38:04] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-29 20:38:04] [INFO ] Invariant cache hit.
[2024-05-29 20:38:04] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2024-05-29 20:38:04] [INFO ] Invariant cache hit.
[2024-05-29 20:38:05] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1183/1503 places, 1183/1503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2335 ms. Remains : 1183/1503 places, 1183/1503 transitions.
Support contains 36 out of 1183 places after structural reductions.
[2024-05-29 20:38:05] [INFO ] Flatten gal took : 92 ms
[2024-05-29 20:38:05] [INFO ] Flatten gal took : 48 ms
[2024-05-29 20:38:05] [INFO ] Input system was already deterministic with 1183 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 21) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) 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 27 ms. (steps per millisecond=370 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) 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 8) seen :0
Running SMT prover for 8 properties.
[2024-05-29 20:38:06] [INFO ] Invariant cache hit.
[2024-05-29 20:38:06] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 20:38:07] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2024-05-29 20:38:08] [INFO ] After 744ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 20:38:08] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 5 ms to minimize.
[2024-05-29 20:38:08] [INFO ] Deduced a trap composed of 24 places in 194 ms of which 1 ms to minimize.
[2024-05-29 20:38:08] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 1 ms to minimize.
[2024-05-29 20:38:09] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 9 ms to minimize.
[2024-05-29 20:38:09] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 1 ms to minimize.
[2024-05-29 20:38:09] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 0 ms to minimize.
[2024-05-29 20:38:09] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2024-05-29 20:38:09] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 0 ms to minimize.
[2024-05-29 20:38:10] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 1 ms to minimize.
[2024-05-29 20:38:10] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2024-05-29 20:38:10] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 1 ms to minimize.
[2024-05-29 20:38:10] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 2 ms to minimize.
[2024-05-29 20:38:10] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 1 ms to minimize.
[2024-05-29 20:38:11] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 0 ms to minimize.
[2024-05-29 20:38:11] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 0 ms to minimize.
[2024-05-29 20:38:11] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 0 ms to minimize.
[2024-05-29 20:38:11] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 0 ms to minimize.
[2024-05-29 20:38:11] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 1 ms to minimize.
[2024-05-29 20:38:11] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 1 ms to minimize.
[2024-05-29 20:38:12] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 0 ms to minimize.
[2024-05-29 20:38:12] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 1 ms to minimize.
[2024-05-29 20:38:12] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 1 ms to minimize.
[2024-05-29 20:38:12] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4278 ms
[2024-05-29 20:38:12] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 0 ms to minimize.
[2024-05-29 20:38:13] [INFO ] Deduced a trap composed of 46 places in 166 ms of which 1 ms to minimize.
[2024-05-29 20:38:13] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 0 ms to minimize.
[2024-05-29 20:38:13] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 0 ms to minimize.
[2024-05-29 20:38:13] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 1 ms to minimize.
[2024-05-29 20:38:13] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 1 ms to minimize.
[2024-05-29 20:38:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1224 ms
[2024-05-29 20:38:14] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 0 ms to minimize.
[2024-05-29 20:38:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2024-05-29 20:38:14] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 1 ms to minimize.
[2024-05-29 20:38:14] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 0 ms to minimize.
[2024-05-29 20:38:14] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 0 ms to minimize.
[2024-05-29 20:38:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 594 ms
[2024-05-29 20:38:14] [INFO ] After 7536ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 310 ms.
[2024-05-29 20:38:15] [INFO ] After 8302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 363 ms.
Support contains 14 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Drop transitions removed 319 transitions
Trivial Post-agglo rules discarded 319 transitions
Performed 319 trivial Post agglomeration. Transition count delta: 319
Iterating post reduction 0 with 319 rules applied. Total rules applied 319 place count 1183 transition count 864
Reduce places removed 319 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 321 rules applied. Total rules applied 640 place count 864 transition count 862
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 642 place count 862 transition count 862
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 234 Pre rules applied. Total rules applied 642 place count 862 transition count 628
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 3 with 468 rules applied. Total rules applied 1110 place count 628 transition count 628
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1114 place count 624 transition count 624
Iterating global reduction 3 with 4 rules applied. Total rules applied 1118 place count 624 transition count 624
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1118 place count 624 transition count 622
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1122 place count 622 transition count 622
Performed 274 Post agglomeration using F-continuation condition.Transition count delta: 274
Deduced a syphon composed of 274 places in 1 ms
Reduce places removed 274 places and 0 transitions.
Iterating global reduction 3 with 548 rules applied. Total rules applied 1670 place count 348 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1671 place count 348 transition count 347
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 1673 place count 347 transition count 346
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: -79
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 1845 place count 261 transition count 425
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1846 place count 261 transition count 424
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1847 place count 261 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1848 place count 260 transition count 423
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1849 place count 260 transition count 422
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1850 place count 260 transition count 422
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1851 place count 259 transition count 421
Applied a total of 1851 rules in 203 ms. Remains 259 /1183 variables (removed 924) and now considering 421/1183 (removed 762) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 259/1183 places, 421/1183 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) 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 8) seen :0
Interrupted probabilistic random walk after 292242 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{0=1, 1=1, 3=1, 4=1, 7=1}
Probabilistic random walk after 292242 steps, saw 195999 distinct states, run finished after 3002 ms. (steps per millisecond=97 ) properties seen :5
Running SMT prover for 3 properties.
// Phase 1: matrix 421 rows 259 cols
[2024-05-29 20:38:19] [INFO ] Computed 121 invariants in 4 ms
[2024-05-29 20:38:19] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:38:19] [INFO ] [Nat]Absence check using 121 positive place invariants in 19 ms returned sat
[2024-05-29 20:38:19] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 20:38:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 20:38:19] [INFO ] After 47ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 20:38:19] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-29 20:38:19] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 27 ms.
Support contains 3 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 421/421 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 259 transition count 419
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 257 transition count 419
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 257 transition count 416
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 10 place count 254 transition count 416
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 21 place count 248 transition count 411
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 29 place count 244 transition count 415
Applied a total of 29 rules in 53 ms. Remains 244 /259 variables (removed 15) and now considering 415/421 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 244/259 places, 415/421 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 610563 steps, run timeout after 3020 ms. (steps per millisecond=202 ) properties seen :{1=1}
Probabilistic random walk after 610563 steps, saw 433784 distinct states, run finished after 3020 ms. (steps per millisecond=202 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 415 rows 244 cols
[2024-05-29 20:38:23] [INFO ] Computed 120 invariants in 1 ms
[2024-05-29 20:38:23] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:38:23] [INFO ] [Nat]Absence check using 120 positive place invariants in 14 ms returned sat
[2024-05-29 20:38:23] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:38:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 20:38:23] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:38:23] [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 11 ms.
[2024-05-29 20:38:23] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 415/415 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 243 transition count 415
Applied a total of 2 rules in 24 ms. Remains 243 /244 variables (removed 1) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 243/244 places, 415/415 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=188 ) 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 650504 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 650504 steps, saw 465076 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 415 rows 243 cols
[2024-05-29 20:38:26] [INFO ] Computed 120 invariants in 1 ms
[2024-05-29 20:38:26] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:38:26] [INFO ] [Nat]Absence check using 120 positive place invariants in 12 ms returned sat
[2024-05-29 20:38:26] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:38:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 20:38:26] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:38:26] [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 12 ms.
[2024-05-29 20:38:26] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1571 steps, including 118 resets, run visited all 1 properties in 12 ms. (steps per millisecond=130 )
Parikh walk visited 1 properties in 11 ms.
Computed a total of 360 stabilizing places and 360 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(G(p0)))'
Support contains 1 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1172 transition count 1172
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1172 transition count 1172
Applied a total of 22 rules in 70 ms. Remains 1172 /1183 variables (removed 11) and now considering 1172/1183 (removed 11) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2024-05-29 20:38:27] [INFO ] Computed 121 invariants in 4 ms
[2024-05-29 20:38:27] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-29 20:38:27] [INFO ] Invariant cache hit.
[2024-05-29 20:38:28] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
[2024-05-29 20:38:28] [INFO ] Invariant cache hit.
[2024-05-29 20:38:28] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1183 places, 1172/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1888 ms. Remains : 1172/1183 places, 1172/1183 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 212 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-00 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:(EQ s549 0)], 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]]
Product exploration explored 100000 steps with 5 reset in 492 ms.
Product exploration explored 100000 steps with 1 reset in 461 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) 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 338881 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 338881 steps, saw 143030 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 20:38:33] [INFO ] Invariant cache hit.
[2024-05-29 20:38:33] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:38:33] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2024-05-29 20:38:34] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:38:34] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 1 ms to minimize.
[2024-05-29 20:38:34] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 1 ms to minimize.
[2024-05-29 20:38:34] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 0 ms to minimize.
[2024-05-29 20:38:35] [INFO ] Deduced a trap composed of 34 places in 235 ms of which 1 ms to minimize.
[2024-05-29 20:38:35] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 0 ms to minimize.
[2024-05-29 20:38:35] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 1 ms to minimize.
[2024-05-29 20:38:35] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 0 ms to minimize.
[2024-05-29 20:38:36] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 0 ms to minimize.
[2024-05-29 20:38:36] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 0 ms to minimize.
[2024-05-29 20:38:36] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 0 ms to minimize.
[2024-05-29 20:38:36] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 0 ms to minimize.
[2024-05-29 20:38:37] [INFO ] Deduced a trap composed of 30 places in 203 ms of which 1 ms to minimize.
[2024-05-29 20:38:37] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 0 ms to minimize.
[2024-05-29 20:38:37] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 1 ms to minimize.
[2024-05-29 20:38:37] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 1 ms to minimize.
[2024-05-29 20:38:38] [INFO ] Deduced a trap composed of 45 places in 183 ms of which 1 ms to minimize.
[2024-05-29 20:38:38] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 1 ms to minimize.
[2024-05-29 20:38:38] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 1 ms to minimize.
[2024-05-29 20:38:38] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 1 ms to minimize.
[2024-05-29 20:38:38] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 1 ms to minimize.
[2024-05-29 20:38:39] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 0 ms to minimize.
[2024-05-29 20:38:39] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 0 ms to minimize.
[2024-05-29 20:38:39] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 0 ms to minimize.
[2024-05-29 20:38:39] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 1 ms to minimize.
[2024-05-29 20:38:39] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 1 ms to minimize.
[2024-05-29 20:38:40] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 0 ms to minimize.
[2024-05-29 20:38:40] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 0 ms to minimize.
[2024-05-29 20:38:40] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 0 ms to minimize.
[2024-05-29 20:38:40] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 2 ms to minimize.
[2024-05-29 20:38:40] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 0 ms to minimize.
[2024-05-29 20:38:40] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2024-05-29 20:38:40] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 6900 ms
[2024-05-29 20:38:41] [INFO ] After 7385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-29 20:38:41] [INFO ] After 7625ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 1172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1172/1172 places, 1172/1172 transitions.
Drop transitions removed 328 transitions
Trivial Post-agglo rules discarded 328 transitions
Performed 328 trivial Post agglomeration. Transition count delta: 328
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 1172 transition count 844
Reduce places removed 328 places and 0 transitions.
Iterating post reduction 1 with 328 rules applied. Total rules applied 656 place count 844 transition count 844
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 240 Pre rules applied. Total rules applied 656 place count 844 transition count 604
Deduced a syphon composed of 240 places in 1 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 2 with 480 rules applied. Total rules applied 1136 place count 604 transition count 604
Performed 271 Post agglomeration using F-continuation condition.Transition count delta: 271
Deduced a syphon composed of 271 places in 1 ms
Reduce places removed 271 places and 0 transitions.
Iterating global reduction 2 with 542 rules applied. Total rules applied 1678 place count 333 transition count 333
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1679 place count 333 transition count 332
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 1681 place count 332 transition count 331
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -87
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1859 place count 243 transition count 418
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1860 place count 243 transition count 417
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1861 place count 242 transition count 416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1862 place count 241 transition count 416
Applied a total of 1862 rules in 70 ms. Remains 241 /1172 variables (removed 931) and now considering 416/1172 (removed 756) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 241/1172 places, 416/1172 transitions.
Finished random walk after 7125 steps, including 2 resets, run visited all 1 properties in 37 ms. (steps per millisecond=192 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), true]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 105 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-030B-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030B-LTLCardinality-00 finished in 14354 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(X(X(G(p0)))))'
Support contains 4 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1172 transition count 1172
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1172 transition count 1172
Applied a total of 22 rules in 66 ms. Remains 1172 /1183 variables (removed 11) and now considering 1172/1183 (removed 11) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2024-05-29 20:38:41] [INFO ] Computed 121 invariants in 9 ms
[2024-05-29 20:38:41] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-29 20:38:41] [INFO ] Invariant cache hit.
[2024-05-29 20:38:42] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2024-05-29 20:38:42] [INFO ] Invariant cache hit.
[2024-05-29 20:38:43] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1183 places, 1172/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1761 ms. Remains : 1172/1183 places, 1172/1183 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s1044 0) (EQ s564 1) (OR (EQ s334 0) (EQ s666 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-01 finished in 1943 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))&&p1) U !(X(G(p0))||p2)))'
Support contains 6 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1173 transition count 1173
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1173 transition count 1173
Applied a total of 20 rules in 75 ms. Remains 1173 /1183 variables (removed 10) and now considering 1173/1183 (removed 10) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2024-05-29 20:38:43] [INFO ] Computed 121 invariants in 10 ms
[2024-05-29 20:38:43] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-29 20:38:43] [INFO ] Invariant cache hit.
[2024-05-29 20:38:44] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
[2024-05-29 20:38:44] [INFO ] Invariant cache hit.
[2024-05-29 20:38:45] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1173/1183 places, 1173/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1777 ms. Remains : 1173/1183 places, 1173/1183 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (AND (NOT p0) (NOT p2)), false, false, (NOT p0), p0]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(OR (EQ s573 0) (EQ s677 1)), p2:(OR (EQ s1020 0) (EQ s922 1)), p0:(OR (EQ s95 0) (EQ s318 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 330 ms.
Product exploration explored 100000 steps with 1 reset in 499 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) p0))), (X (AND p1 p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 p2))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 109 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, false, (NOT p0), p0, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 20:38:46] [INFO ] Invariant cache hit.
[2024-05-29 20:38:46] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:38:46] [INFO ] [Nat]Absence check using 121 positive place invariants in 37 ms returned sat
[2024-05-29 20:38:47] [INFO ] After 511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:38:47] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 1 ms to minimize.
[2024-05-29 20:38:47] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 0 ms to minimize.
[2024-05-29 20:38:48] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 1 ms to minimize.
[2024-05-29 20:38:48] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 1 ms to minimize.
[2024-05-29 20:38:48] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 0 ms to minimize.
[2024-05-29 20:38:48] [INFO ] Deduced a trap composed of 35 places in 191 ms of which 1 ms to minimize.
[2024-05-29 20:38:49] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 1 ms to minimize.
[2024-05-29 20:38:49] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 1 ms to minimize.
[2024-05-29 20:38:49] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 1 ms to minimize.
[2024-05-29 20:38:49] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 1 ms to minimize.
[2024-05-29 20:38:50] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 0 ms to minimize.
[2024-05-29 20:38:50] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 0 ms to minimize.
[2024-05-29 20:38:50] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 0 ms to minimize.
[2024-05-29 20:38:50] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 0 ms to minimize.
[2024-05-29 20:38:50] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 1 ms to minimize.
[2024-05-29 20:38:51] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 1 ms to minimize.
[2024-05-29 20:38:51] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 1 ms to minimize.
[2024-05-29 20:38:51] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 1 ms to minimize.
[2024-05-29 20:38:51] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 1 ms to minimize.
[2024-05-29 20:38:51] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 0 ms to minimize.
[2024-05-29 20:38:52] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 0 ms to minimize.
[2024-05-29 20:38:52] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 0 ms to minimize.
[2024-05-29 20:38:52] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4791 ms
[2024-05-29 20:38:52] [INFO ] After 5405ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 89 ms.
[2024-05-29 20:38:52] [INFO ] After 5712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 35 ms.
Support contains 4 out of 1173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1173 transition count 847
Reduce places removed 326 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 328 rules applied. Total rules applied 654 place count 847 transition count 845
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 656 place count 845 transition count 845
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 656 place count 845 transition count 608
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1130 place count 608 transition count 608
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1131 place count 607 transition count 607
Iterating global reduction 3 with 1 rules applied. Total rules applied 1132 place count 607 transition count 607
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1132 place count 607 transition count 606
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 1134 place count 606 transition count 606
Performed 269 Post agglomeration using F-continuation condition.Transition count delta: 269
Deduced a syphon composed of 269 places in 0 ms
Reduce places removed 269 places and 0 transitions.
Iterating global reduction 3 with 538 rules applied. Total rules applied 1672 place count 337 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1673 place count 337 transition count 336
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 1675 place count 336 transition count 335
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1851 place count 248 transition count 421
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1852 place count 248 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1853 place count 247 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1854 place count 246 transition count 419
Applied a total of 1854 rules in 90 ms. Remains 246 /1173 variables (removed 927) and now considering 419/1173 (removed 754) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 246/1173 places, 419/1173 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Finished probabilistic random walk after 24181 steps, run visited all 2 properties in 158 ms. (steps per millisecond=153 )
Probabilistic random walk after 24181 steps, saw 15475 distinct states, run finished after 159 ms. (steps per millisecond=152 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) p0))), (X (AND p1 p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 p2))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 10 factoid took 211 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 209 ms :[true, false, (NOT p0), p0, false, false]
Support contains 6 out of 1173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Applied a total of 0 rules in 35 ms. Remains 1173 /1173 variables (removed 0) and now considering 1173/1173 (removed 0) transitions.
[2024-05-29 20:38:53] [INFO ] Invariant cache hit.
[2024-05-29 20:38:53] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-29 20:38:53] [INFO ] Invariant cache hit.
[2024-05-29 20:38:54] [INFO ] Implicit Places using invariants and state equation in 842 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
[2024-05-29 20:38:54] [INFO ] Invariant cache hit.
[2024-05-29 20:38:55] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1687 ms. Remains : 1173/1173 places, 1173/1173 transitions.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p1 p2)), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 98 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, false, (NOT p0), p0, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 20:38:55] [INFO ] Invariant cache hit.
[2024-05-29 20:38:55] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:38:56] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2024-05-29 20:38:56] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:38:56] [INFO ] Deduced a trap composed of 22 places in 217 ms of which 1 ms to minimize.
[2024-05-29 20:38:57] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 1 ms to minimize.
[2024-05-29 20:38:57] [INFO ] Deduced a trap composed of 30 places in 210 ms of which 0 ms to minimize.
[2024-05-29 20:38:57] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 1 ms to minimize.
[2024-05-29 20:38:57] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 1 ms to minimize.
[2024-05-29 20:38:58] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 1 ms to minimize.
[2024-05-29 20:38:58] [INFO ] Deduced a trap composed of 23 places in 204 ms of which 0 ms to minimize.
[2024-05-29 20:38:58] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 0 ms to minimize.
[2024-05-29 20:38:58] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 0 ms to minimize.
[2024-05-29 20:38:59] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 1 ms to minimize.
[2024-05-29 20:38:59] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 1 ms to minimize.
[2024-05-29 20:38:59] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 0 ms to minimize.
[2024-05-29 20:38:59] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 1 ms to minimize.
[2024-05-29 20:38:59] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 0 ms to minimize.
[2024-05-29 20:39:00] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 1 ms to minimize.
[2024-05-29 20:39:00] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 0 ms to minimize.
[2024-05-29 20:39:00] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 1 ms to minimize.
[2024-05-29 20:39:00] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 0 ms to minimize.
[2024-05-29 20:39:00] [INFO ] Deduced a trap composed of 50 places in 147 ms of which 0 ms to minimize.
[2024-05-29 20:39:01] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 0 ms to minimize.
[2024-05-29 20:39:01] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 1 ms to minimize.
[2024-05-29 20:39:01] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 1 ms to minimize.
[2024-05-29 20:39:01] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4863 ms
[2024-05-29 20:39:01] [INFO ] After 5481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-29 20:39:01] [INFO ] After 5776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 1173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1173 transition count 847
Reduce places removed 326 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 328 rules applied. Total rules applied 654 place count 847 transition count 845
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 656 place count 845 transition count 845
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 656 place count 845 transition count 608
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1130 place count 608 transition count 608
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1131 place count 607 transition count 607
Iterating global reduction 3 with 1 rules applied. Total rules applied 1132 place count 607 transition count 607
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1132 place count 607 transition count 606
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 1134 place count 606 transition count 606
Performed 269 Post agglomeration using F-continuation condition.Transition count delta: 269
Deduced a syphon composed of 269 places in 1 ms
Reduce places removed 269 places and 0 transitions.
Iterating global reduction 3 with 538 rules applied. Total rules applied 1672 place count 337 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1673 place count 337 transition count 336
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 1675 place count 336 transition count 335
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1851 place count 248 transition count 421
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1852 place count 248 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1853 place count 247 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1854 place count 246 transition count 419
Applied a total of 1854 rules in 76 ms. Remains 246 /1173 variables (removed 927) and now considering 419/1173 (removed 754) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 246/1173 places, 419/1173 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Finished probabilistic random walk after 24181 steps, run visited all 2 properties in 281 ms. (steps per millisecond=86 )
Probabilistic random walk after 24181 steps, saw 15475 distinct states, run finished after 281 ms. (steps per millisecond=86 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p1 p2)), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p2))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 8 factoid took 261 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 187 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 190 ms :[true, false, (NOT p0), p0, false, false]
Product exploration explored 100000 steps with 1 reset in 325 ms.
Product exploration explored 100000 steps with 2 reset in 410 ms.
Applying partial POR strategy [true, false, true, true, false, true]
Stuttering acceptance computed with spot in 195 ms :[true, false, (NOT p0), p0, false, false]
Support contains 6 out of 1173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Performed 327 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1173 transition count 1173
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 120 Pre rules applied. Total rules applied 327 place count 1173 transition count 1292
Deduced a syphon composed of 447 places in 1 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 447 place count 1173 transition count 1292
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 805 places in 1 ms
Iterating global reduction 1 with 358 rules applied. Total rules applied 805 place count 1173 transition count 1293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 806 place count 1173 transition count 1292
Renaming transitions due to excessive name length > 1024 char.
Discarding 238 places :
Symmetric choice reduction at 2 with 238 rule applications. Total rules 1044 place count 935 transition count 1054
Deduced a syphon composed of 567 places in 0 ms
Iterating global reduction 2 with 238 rules applied. Total rules applied 1282 place count 935 transition count 1054
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 568 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1283 place count 935 transition count 1054
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1285 place count 933 transition count 1052
Deduced a syphon composed of 566 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1287 place count 933 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -734
Deduced a syphon composed of 667 places in 0 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1388 place count 933 transition count 1786
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1489 place count 832 transition count 1584
Deduced a syphon composed of 566 places in 0 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1590 place count 832 transition count 1584
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -103
Deduced a syphon composed of 581 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 1605 place count 832 transition count 1687
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1620 place count 817 transition count 1657
Deduced a syphon composed of 566 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 1635 place count 817 transition count 1657
Deduced a syphon composed of 566 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 1638 place count 817 transition count 1654
Deduced a syphon composed of 566 places in 0 ms
Applied a total of 1638 rules in 603 ms. Remains 817 /1173 variables (removed 356) and now considering 1654/1173 (removed -481) transitions.
[2024-05-29 20:39:04] [INFO ] Redundant transitions in 112 ms returned []
// Phase 1: matrix 1654 rows 817 cols
[2024-05-29 20:39:04] [INFO ] Computed 121 invariants in 13 ms
[2024-05-29 20:39:05] [INFO ] Dead Transitions using invariants and state equation in 653 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 817/1173 places, 1654/1173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1379 ms. Remains : 817/1173 places, 1654/1173 transitions.
Built C files in :
/tmp/ltsmin4646440050185569250
[2024-05-29 20:39:05] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4646440050185569250
Running compilation step : cd /tmp/ltsmin4646440050185569250;'/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 2080 ms.
Running link step : cd /tmp/ltsmin4646440050185569250;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin4646440050185569250;'/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' '--hoa' '/tmp/stateBased1358489204680341648.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 1173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Applied a total of 0 rules in 31 ms. Remains 1173 /1173 variables (removed 0) and now considering 1173/1173 (removed 0) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2024-05-29 20:39:20] [INFO ] Computed 121 invariants in 7 ms
[2024-05-29 20:39:20] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-29 20:39:20] [INFO ] Invariant cache hit.
[2024-05-29 20:39:21] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
[2024-05-29 20:39:21] [INFO ] Invariant cache hit.
[2024-05-29 20:39:22] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1680 ms. Remains : 1173/1173 places, 1173/1173 transitions.
Built C files in :
/tmp/ltsmin15289286174591087361
[2024-05-29 20:39:22] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15289286174591087361
Running compilation step : cd /tmp/ltsmin15289286174591087361;'/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 1818 ms.
Running link step : cd /tmp/ltsmin15289286174591087361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15289286174591087361;'/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' '--hoa' '/tmp/stateBased12507603897238630458.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 20:39:37] [INFO ] Flatten gal took : 41 ms
[2024-05-29 20:39:37] [INFO ] Flatten gal took : 40 ms
[2024-05-29 20:39:37] [INFO ] Time to serialize gal into /tmp/LTL3651211759777159837.gal : 9 ms
[2024-05-29 20:39:37] [INFO ] Time to serialize properties into /tmp/LTL1967404674554617346.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/LTL3651211759777159837.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17110745579802397404.hoa' '-atoms' '/tmp/LTL1967404674554617346.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/LTL1967404674554617346.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17110745579802397404.hoa
Detected timeout of ITS tools.
[2024-05-29 20:39:52] [INFO ] Flatten gal took : 33 ms
[2024-05-29 20:39:52] [INFO ] Flatten gal took : 31 ms
[2024-05-29 20:39:52] [INFO ] Time to serialize gal into /tmp/LTL18008837915787272997.gal : 6 ms
[2024-05-29 20:39:52] [INFO ] Time to serialize properties into /tmp/LTL8291752166592879923.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/LTL18008837915787272997.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8291752166592879923.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("((p111==0)||(p398==1))")))&&("((p726==0)||(p860==1))"))U(!(((X(G("((p111==0)||(p398==1))")))||("(p1302==0)"))||("(p1176==1...163
Formula 0 simplified : ("((p726==0)||(p860==1))" & XF"((p111==0)||(p398==1))") U (!"(p1176==1)" & !"(p1302==0)" & XF!"((p111==0)||(p398==1))")
Detected timeout of ITS tools.
[2024-05-29 20:40:07] [INFO ] Flatten gal took : 32 ms
[2024-05-29 20:40:07] [INFO ] Applying decomposition
[2024-05-29 20:40:07] [INFO ] Flatten gal took : 28 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/graph8777303426881333224.txt' '-o' '/tmp/graph8777303426881333224.bin' '-w' '/tmp/graph8777303426881333224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8777303426881333224.bin' '-l' '-1' '-v' '-w' '/tmp/graph8777303426881333224.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:40:08] [INFO ] Decomposing Gal with order
[2024-05-29 20:40:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:40:08] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-29 20:40:08] [INFO ] Flatten gal took : 92 ms
[2024-05-29 20:40:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-29 20:40:08] [INFO ] Time to serialize gal into /tmp/LTL10706842409404701632.gal : 14 ms
[2024-05-29 20:40:08] [INFO ] Time to serialize properties into /tmp/LTL783981729262941944.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/LTL10706842409404701632.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL783981729262941944.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...254
Read 1 LTL properties
Checking formula 0 : !((!(((X(F("((i5.i3.u39.p111==0)||(i12.i2.u126.p398==1))")))&&("((i17.i1.u226.p726==0)||(i19.i5.u267.p860==1))"))U(!(((X(G("((i5.i3.u3...255
Formula 0 simplified : ("((i17.i1.u226.p726==0)||(i19.i5.u267.p860==1))" & XF"((i5.i3.u39.p111==0)||(i12.i2.u126.p398==1))") U (!"(i24.i3.u363.p1176==1)" &...234
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1990774857256024573
[2024-05-29 20:40:23] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1990774857256024573
Running compilation step : cd /tmp/ltsmin1990774857256024573;'/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 1821 ms.
Running link step : cd /tmp/ltsmin1990774857256024573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1990774857256024573;'/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)) U !(X([]((LTLAPp0==true)))||(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-030B-LTLCardinality-03 finished in 115215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1171 transition count 1171
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1171 transition count 1171
Applied a total of 24 rules in 70 ms. Remains 1171 /1183 variables (removed 12) and now considering 1171/1183 (removed 12) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2024-05-29 20:40:38] [INFO ] Computed 121 invariants in 8 ms
[2024-05-29 20:40:38] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-29 20:40:38] [INFO ] Invariant cache hit.
[2024-05-29 20:40:39] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
[2024-05-29 20:40:39] [INFO ] Invariant cache hit.
[2024-05-29 20:40:40] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1171/1183 places, 1171/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1729 ms. Remains : 1171/1183 places, 1171/1183 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s970 0) (NEQ s162 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 48865 steps with 35 reset in 199 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-04 finished in 2022 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' '!(((p0 U p1) U X(X(G(p1)))))'
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1173 transition count 1173
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1173 transition count 1173
Applied a total of 20 rules in 70 ms. Remains 1173 /1183 variables (removed 10) and now considering 1173/1183 (removed 10) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2024-05-29 20:40:40] [INFO ] Computed 121 invariants in 8 ms
[2024-05-29 20:40:40] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-29 20:40:40] [INFO ] Invariant cache hit.
[2024-05-29 20:40:41] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
[2024-05-29 20:40:41] [INFO ] Invariant cache hit.
[2024-05-29 20:40:42] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1173/1183 places, 1173/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1863 ms. Remains : 1173/1183 places, 1173/1183 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=5, aps=[p1:(OR (EQ s457 0) (EQ s942 1)), p0:(EQ s586 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 27225 steps with 0 reset in 108 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-05 finished in 2196 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 1183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1182 transition count 856
Reduce places removed 326 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 327 rules applied. Total rules applied 653 place count 856 transition count 855
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 654 place count 855 transition count 855
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 235 Pre rules applied. Total rules applied 654 place count 855 transition count 620
Deduced a syphon composed of 235 places in 0 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 3 with 470 rules applied. Total rules applied 1124 place count 620 transition count 620
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1133 place count 611 transition count 611
Iterating global reduction 3 with 9 rules applied. Total rules applied 1142 place count 611 transition count 611
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1142 place count 611 transition count 604
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 1156 place count 604 transition count 604
Performed 268 Post agglomeration using F-continuation condition.Transition count delta: 268
Deduced a syphon composed of 268 places in 0 ms
Reduce places removed 268 places and 0 transitions.
Iterating global reduction 3 with 536 rules applied. Total rules applied 1692 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1693 place count 336 transition count 335
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 1695 place count 335 transition count 334
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -87
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 1873 place count 246 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1875 place count 244 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1876 place count 243 transition count 419
Applied a total of 1876 rules in 94 ms. Remains 243 /1183 variables (removed 940) and now considering 419/1183 (removed 764) transitions.
// Phase 1: matrix 419 rows 243 cols
[2024-05-29 20:40:42] [INFO ] Computed 120 invariants in 2 ms
[2024-05-29 20:40:42] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-29 20:40:42] [INFO ] Invariant cache hit.
[2024-05-29 20:40:43] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-05-29 20:40:43] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 20:40:43] [INFO ] Invariant cache hit.
[2024-05-29 20:40:43] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/1183 places, 419/1183 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 679 ms. Remains : 243/1183 places, 419/1183 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-06 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:(AND (NEQ s38 0) (NEQ s55 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 0 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-06 finished in 773 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((F((X((!p2 U (!p3||G(!p2))))&&p1))&&p0))))'
Support contains 6 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1172 transition count 1172
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1172 transition count 1172
Applied a total of 22 rules in 68 ms. Remains 1172 /1183 variables (removed 11) and now considering 1172/1183 (removed 11) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2024-05-29 20:40:43] [INFO ] Computed 121 invariants in 11 ms
[2024-05-29 20:40:43] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-29 20:40:43] [INFO ] Invariant cache hit.
[2024-05-29 20:40:44] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
[2024-05-29 20:40:44] [INFO ] Invariant cache hit.
[2024-05-29 20:40:45] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1183 places, 1172/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1778 ms. Remains : 1172/1183 places, 1172/1183 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1) (AND p2 p3)), (OR (NOT p0) (NOT p1) (AND p2 p3)), true, (OR (NOT p1) (AND p2 p3)), (AND p2 p3)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) p3 p2), acceptance={0} source=4 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p3 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s870 0) (EQ s896 1)), p1:(AND (NEQ s509 0) (NEQ s678 1)), p3:(OR (EQ s352 0) (EQ s543 1)), p2:(OR (EQ s509 0) (EQ s678 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-07 finished in 2017 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 1183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 325 transitions
Trivial Post-agglo rules discarded 325 transitions
Performed 325 trivial Post agglomeration. Transition count delta: 325
Iterating post reduction 0 with 325 rules applied. Total rules applied 325 place count 1182 transition count 857
Reduce places removed 325 places and 0 transitions.
Iterating post reduction 1 with 325 rules applied. Total rules applied 650 place count 857 transition count 857
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 236 Pre rules applied. Total rules applied 650 place count 857 transition count 621
Deduced a syphon composed of 236 places in 1 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 2 with 472 rules applied. Total rules applied 1122 place count 621 transition count 621
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1132 place count 611 transition count 611
Iterating global reduction 2 with 10 rules applied. Total rules applied 1142 place count 611 transition count 611
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1142 place count 611 transition count 603
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1158 place count 603 transition count 603
Performed 266 Post agglomeration using F-continuation condition.Transition count delta: 266
Deduced a syphon composed of 266 places in 1 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 2 with 532 rules applied. Total rules applied 1690 place count 337 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1691 place count 337 transition count 336
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 1693 place count 336 transition count 335
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1871 place count 247 transition count 423
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1873 place count 245 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1874 place count 244 transition count 421
Applied a total of 1874 rules in 82 ms. Remains 244 /1183 variables (removed 939) and now considering 421/1183 (removed 762) transitions.
// Phase 1: matrix 421 rows 244 cols
[2024-05-29 20:40:45] [INFO ] Computed 120 invariants in 2 ms
[2024-05-29 20:40:45] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-29 20:40:45] [INFO ] Invariant cache hit.
[2024-05-29 20:40:45] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-29 20:40:45] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2024-05-29 20:40:45] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 20:40:45] [INFO ] Invariant cache hit.
[2024-05-29 20:40:46] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 244/1183 places, 421/1183 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 688 ms. Remains : 244/1183 places, 421/1183 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s157 0) (NEQ s117 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 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-09 finished in 732 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)||X(F(p1)))))'
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 324 transitions
Trivial Post-agglo rules discarded 324 transitions
Performed 324 trivial Post agglomeration. Transition count delta: 324
Iterating post reduction 0 with 324 rules applied. Total rules applied 324 place count 1182 transition count 858
Reduce places removed 324 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 325 rules applied. Total rules applied 649 place count 858 transition count 857
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 650 place count 857 transition count 857
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 236 Pre rules applied. Total rules applied 650 place count 857 transition count 621
Deduced a syphon composed of 236 places in 1 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 3 with 472 rules applied. Total rules applied 1122 place count 621 transition count 621
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1131 place count 612 transition count 612
Iterating global reduction 3 with 9 rules applied. Total rules applied 1140 place count 612 transition count 612
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1140 place count 612 transition count 605
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 1154 place count 605 transition count 605
Performed 268 Post agglomeration using F-continuation condition.Transition count delta: 268
Deduced a syphon composed of 268 places in 0 ms
Reduce places removed 268 places and 0 transitions.
Iterating global reduction 3 with 536 rules applied. Total rules applied 1690 place count 337 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1691 place count 337 transition count 336
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 1693 place count 336 transition count 335
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1869 place count 248 transition count 420
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1871 place count 246 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1872 place count 245 transition count 418
Applied a total of 1872 rules in 79 ms. Remains 245 /1183 variables (removed 938) and now considering 418/1183 (removed 765) transitions.
// Phase 1: matrix 418 rows 245 cols
[2024-05-29 20:40:46] [INFO ] Computed 120 invariants in 3 ms
[2024-05-29 20:40:46] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-29 20:40:46] [INFO ] Invariant cache hit.
[2024-05-29 20:40:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 20:40:46] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-05-29 20:40:46] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 20:40:46] [INFO ] Invariant cache hit.
[2024-05-29 20:40:46] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/1183 places, 418/1183 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 706 ms. Remains : 245/1183 places, 418/1183 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s124 1), p1:(OR (EQ s75 0) (EQ s49 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 49 steps with 18 reset in 1 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-10 finished in 786 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(X(X((G(p0) U p1)))))'
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1172 transition count 1172
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1172 transition count 1172
Applied a total of 22 rules in 67 ms. Remains 1172 /1183 variables (removed 11) and now considering 1172/1183 (removed 11) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2024-05-29 20:40:47] [INFO ] Computed 121 invariants in 9 ms
[2024-05-29 20:40:47] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-29 20:40:47] [INFO ] Invariant cache hit.
[2024-05-29 20:40:48] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
[2024-05-29 20:40:48] [INFO ] Invariant cache hit.
[2024-05-29 20:40:48] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1183 places, 1172/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1846 ms. Remains : 1172/1183 places, 1172/1183 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s957 1), p0:(OR (EQ s205 0) (EQ s646 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 432 ms.
Product exploration explored 100000 steps with 25000 reset in 427 ms.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Detected a total of 359/1172 stabilizing places and 359/1172 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Finished random walk after 480 steps, including 0 resets, run visited all 3 properties in 14 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 220 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Support contains 3 out of 1172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1172/1172 places, 1172/1172 transitions.
Applied a total of 0 rules in 37 ms. Remains 1172 /1172 variables (removed 0) and now considering 1172/1172 (removed 0) transitions.
[2024-05-29 20:40:50] [INFO ] Invariant cache hit.
[2024-05-29 20:40:51] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-29 20:40:51] [INFO ] Invariant cache hit.
[2024-05-29 20:40:52] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
[2024-05-29 20:40:52] [INFO ] Invariant cache hit.
[2024-05-29 20:40:52] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1754 ms. Remains : 1172/1172 places, 1172/1172 transitions.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Detected a total of 359/1172 stabilizing places and 359/1172 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Finished random walk after 457 steps, including 0 resets, run visited all 3 properties in 13 ms. (steps per millisecond=35 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 421 ms.
Product exploration explored 100000 steps with 25000 reset in 427 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Support contains 3 out of 1172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1172/1172 places, 1172/1172 transitions.
Performed 328 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 1172 transition count 1172
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 120 Pre rules applied. Total rules applied 328 place count 1172 transition count 1292
Deduced a syphon composed of 448 places in 1 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 448 place count 1172 transition count 1292
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 806 places in 0 ms
Iterating global reduction 1 with 358 rules applied. Total rules applied 806 place count 1172 transition count 1293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 807 place count 1172 transition count 1292
Renaming transitions due to excessive name length > 1024 char.
Discarding 238 places :
Symmetric choice reduction at 2 with 238 rule applications. Total rules 1045 place count 934 transition count 1053
Deduced a syphon composed of 568 places in 1 ms
Iterating global reduction 2 with 238 rules applied. Total rules applied 1283 place count 934 transition count 1053
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 569 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1284 place count 934 transition count 1053
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1286 place count 932 transition count 1051
Deduced a syphon composed of 567 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1288 place count 932 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 668 places in 0 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1389 place count 932 transition count 1783
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1490 place count 831 transition count 1581
Deduced a syphon composed of 567 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1591 place count 831 transition count 1581
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -123
Deduced a syphon composed of 584 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1608 place count 831 transition count 1704
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1625 place count 814 transition count 1670
Deduced a syphon composed of 567 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1642 place count 814 transition count 1670
Deduced a syphon composed of 567 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 1645 place count 814 transition count 1667
Deduced a syphon composed of 567 places in 0 ms
Applied a total of 1645 rules in 275 ms. Remains 814 /1172 variables (removed 358) and now considering 1667/1172 (removed -495) transitions.
[2024-05-29 20:40:55] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 1667 rows 814 cols
[2024-05-29 20:40:55] [INFO ] Computed 121 invariants in 12 ms
[2024-05-29 20:40:55] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 814/1172 places, 1667/1172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 954 ms. Remains : 814/1172 places, 1667/1172 transitions.
Built C files in :
/tmp/ltsmin7323111600017263826
[2024-05-29 20:40:55] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7323111600017263826
Running compilation step : cd /tmp/ltsmin7323111600017263826;'/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 1807 ms.
Running link step : cd /tmp/ltsmin7323111600017263826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7323111600017263826;'/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' '--hoa' '/tmp/stateBased10659903163050443955.hoa' '--buchi-type=spotba'
LTSmin run took 364 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-030B-LTLCardinality-11 finished in 11090 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||F(p1)))))'
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1172 transition count 1172
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1172 transition count 1172
Applied a total of 22 rules in 69 ms. Remains 1172 /1183 variables (removed 11) and now considering 1172/1183 (removed 11) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2024-05-29 20:40:58] [INFO ] Computed 121 invariants in 9 ms
[2024-05-29 20:40:58] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-29 20:40:58] [INFO ] Invariant cache hit.
[2024-05-29 20:40:59] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 1283 ms to find 0 implicit places.
[2024-05-29 20:40:59] [INFO ] Invariant cache hit.
[2024-05-29 20:40:59] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1183 places, 1172/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1929 ms. Remains : 1172/1183 places, 1172/1183 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s569 1), p1:(OR (EQ s363 0) (EQ s1140 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 347 ms.
Product exploration explored 100000 steps with 2 reset in 435 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Detected a total of 358/1172 stabilizing places and 358/1172 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 254 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 254979 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 254979 steps, saw 112577 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 20:41:04] [INFO ] Invariant cache hit.
[2024-05-29 20:41:04] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:41:04] [INFO ] [Nat]Absence check using 121 positive place invariants in 35 ms returned sat
[2024-05-29 20:41:05] [INFO ] After 504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:41:05] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 0 ms to minimize.
[2024-05-29 20:41:05] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 1 ms to minimize.
[2024-05-29 20:41:06] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 1 ms to minimize.
[2024-05-29 20:41:06] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 0 ms to minimize.
[2024-05-29 20:41:06] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 0 ms to minimize.
[2024-05-29 20:41:06] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 1 ms to minimize.
[2024-05-29 20:41:07] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 0 ms to minimize.
[2024-05-29 20:41:07] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 0 ms to minimize.
[2024-05-29 20:41:07] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 1 ms to minimize.
[2024-05-29 20:41:07] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 1 ms to minimize.
[2024-05-29 20:41:07] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 1 ms to minimize.
[2024-05-29 20:41:08] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 0 ms to minimize.
[2024-05-29 20:41:08] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 0 ms to minimize.
[2024-05-29 20:41:08] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 1 ms to minimize.
[2024-05-29 20:41:08] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 0 ms to minimize.
[2024-05-29 20:41:08] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 1 ms to minimize.
[2024-05-29 20:41:09] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 1 ms to minimize.
[2024-05-29 20:41:09] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 0 ms to minimize.
[2024-05-29 20:41:09] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:41:09] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 0 ms to minimize.
[2024-05-29 20:41:09] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 1 ms to minimize.
[2024-05-29 20:41:10] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 2 ms to minimize.
[2024-05-29 20:41:10] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2024-05-29 20:41:10] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 0 ms to minimize.
[2024-05-29 20:41:10] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 1 ms to minimize.
[2024-05-29 20:41:10] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 1 ms to minimize.
[2024-05-29 20:41:10] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 0 ms to minimize.
[2024-05-29 20:41:11] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
[2024-05-29 20:41:11] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 5889 ms
[2024-05-29 20:41:11] [INFO ] After 6507ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 81 ms.
[2024-05-29 20:41:11] [INFO ] After 6801ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 1172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1172/1172 places, 1172/1172 transitions.
Drop transitions removed 325 transitions
Trivial Post-agglo rules discarded 325 transitions
Performed 325 trivial Post agglomeration. Transition count delta: 325
Iterating post reduction 0 with 325 rules applied. Total rules applied 325 place count 1172 transition count 847
Reduce places removed 325 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 327 rules applied. Total rules applied 652 place count 847 transition count 845
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 654 place count 845 transition count 845
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 240 Pre rules applied. Total rules applied 654 place count 845 transition count 605
Deduced a syphon composed of 240 places in 1 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 3 with 480 rules applied. Total rules applied 1134 place count 605 transition count 605
Performed 269 Post agglomeration using F-continuation condition.Transition count delta: 269
Deduced a syphon composed of 269 places in 0 ms
Reduce places removed 269 places and 0 transitions.
Iterating global reduction 3 with 538 rules applied. Total rules applied 1672 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1673 place count 336 transition count 335
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 1675 place count 335 transition count 334
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1851 place count 247 transition count 420
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1852 place count 247 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1853 place count 246 transition count 418
Applied a total of 1853 rules in 70 ms. Remains 246 /1172 variables (removed 926) and now considering 418/1172 (removed 754) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 246/1172 places, 418/1172 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Finished probabilistic random walk after 40510 steps, run visited all 2 properties in 280 ms. (steps per millisecond=144 )
Probabilistic random walk after 40510 steps, saw 23890 distinct states, run finished after 280 ms. (steps per millisecond=144 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 282 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 1172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1172/1172 places, 1172/1172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 325 transitions
Trivial Post-agglo rules discarded 325 transitions
Performed 325 trivial Post agglomeration. Transition count delta: 325
Iterating post reduction 0 with 325 rules applied. Total rules applied 325 place count 1171 transition count 846
Reduce places removed 325 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 327 rules applied. Total rules applied 652 place count 846 transition count 844
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 654 place count 844 transition count 844
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 240 Pre rules applied. Total rules applied 654 place count 844 transition count 604
Deduced a syphon composed of 240 places in 1 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 3 with 480 rules applied. Total rules applied 1134 place count 604 transition count 604
Performed 267 Post agglomeration using F-continuation condition.Transition count delta: 267
Deduced a syphon composed of 267 places in 0 ms
Reduce places removed 267 places and 0 transitions.
Iterating global reduction 3 with 534 rules applied. Total rules applied 1668 place count 337 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1669 place count 337 transition count 336
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 1671 place count 336 transition count 335
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1847 place count 248 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1849 place count 246 transition count 419
Applied a total of 1849 rules in 63 ms. Remains 246 /1172 variables (removed 926) and now considering 419/1172 (removed 753) transitions.
// Phase 1: matrix 419 rows 246 cols
[2024-05-29 20:41:12] [INFO ] Computed 121 invariants in 2 ms
[2024-05-29 20:41:12] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-29 20:41:12] [INFO ] Invariant cache hit.
[2024-05-29 20:41:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 20:41:12] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2024-05-29 20:41:12] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 20:41:12] [INFO ] Invariant cache hit.
[2024-05-29 20:41:13] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 246/1172 places, 419/1172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 674 ms. Remains : 246/1172 places, 419/1172 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/246 stabilizing places and 2/419 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 446809 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 446809 steps, saw 297304 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 20:41:16] [INFO ] Invariant cache hit.
[2024-05-29 20:41:16] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:41:16] [INFO ] [Nat]Absence check using 121 positive place invariants in 14 ms returned sat
[2024-05-29 20:41:16] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:41:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 20:41:16] [INFO ] After 42ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 20:41:16] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-29 20:41:16] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 30 ms.
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 419/419 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 246 transition count 418
Applied a total of 1 rules in 5 ms. Remains 246 /246 variables (removed 0) and now considering 418/419 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 246/246 places, 418/419 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 458077 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :{}
Probabilistic random walk after 458077 steps, saw 307304 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 418 rows 246 cols
[2024-05-29 20:41:20] [INFO ] Computed 121 invariants in 2 ms
[2024-05-29 20:41:20] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:41:20] [INFO ] [Nat]Absence check using 121 positive place invariants in 12 ms returned sat
[2024-05-29 20:41:20] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:41:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 20:41:20] [INFO ] After 21ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 20:41:20] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-29 20:41:20] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 418/418 transitions.
Applied a total of 0 rules in 5 ms. Remains 246 /246 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 246/246 places, 418/418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 418/418 transitions.
Applied a total of 0 rules in 7 ms. Remains 246 /246 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2024-05-29 20:41:20] [INFO ] Invariant cache hit.
[2024-05-29 20:41:20] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-29 20:41:20] [INFO ] Invariant cache hit.
[2024-05-29 20:41:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 20:41:20] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-29 20:41:20] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 20:41:20] [INFO ] Invariant cache hit.
[2024-05-29 20:41:20] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 614 ms. Remains : 246/246 places, 418/418 transitions.
Graph (trivial) has 118 edges and 246 vertex of which 4 / 246 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 117 edges and 242 vertex of which 4 / 242 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 240 transition count 411
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 116 edges and 238 vertex of which 6 / 238 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 18 place count 235 transition count 402
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 114 edges and 232 vertex of which 8 / 232 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 33 place count 228 transition count 391
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 224 vertex of which 8 / 224 are part of one of the 4 SCC in 10 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 52 place count 220 transition count 377
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 216 vertex of which 8 / 216 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 71 place count 212 transition count 363
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 208 vertex of which 8 / 208 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 90 place count 204 transition count 349
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 200 vertex of which 8 / 200 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 109 place count 196 transition count 335
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 94 edges and 192 vertex of which 8 / 192 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 128 place count 188 transition count 321
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 90 edges and 184 vertex of which 8 / 184 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 147 place count 180 transition count 307
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 86 edges and 176 vertex of which 8 / 176 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 166 place count 172 transition count 293
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 82 edges and 168 vertex of which 8 / 168 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 185 place count 164 transition count 279
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 78 edges and 160 vertex of which 8 / 160 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 204 place count 156 transition count 265
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 74 edges and 152 vertex of which 8 / 152 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 223 place count 148 transition count 251
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 70 edges and 144 vertex of which 8 / 144 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 242 place count 140 transition count 237
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 66 edges and 136 vertex of which 8 / 136 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 261 place count 132 transition count 223
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 62 edges and 128 vertex of which 8 / 128 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 280 place count 124 transition count 209
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 57 edges and 121 vertex of which 6 / 121 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 18 rules applied. Total rules applied 298 place count 118 transition count 195
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 55 edges and 115 vertex of which 8 / 115 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 15 rules applied. Total rules applied 313 place count 111 transition count 184
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 335 edges and 107 vertex of which 104 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Graph (trivial) has 50 edges and 104 vertex of which 8 / 104 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 20 rules applied. Total rules applied 333 place count 100 transition count 167
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 46 edges and 96 vertex of which 6 / 96 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 352 place count 93 transition count 153
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 42 edges and 90 vertex of which 4 / 90 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 20 with 14 rules applied. Total rules applied 366 place count 88 transition count 143
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 39 edges and 86 vertex of which 2 / 86 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 21 with 9 rules applied. Total rules applied 375 place count 85 transition count 137
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 5 rules applied. Total rules applied 380 place count 84 transition count 133
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 23 with 2 Pre rules applied. Total rules applied 380 place count 84 transition count 131
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 6 rules applied. Total rules applied 386 place count 80 transition count 131
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 2 places and 0 transitions.
Iterating global reduction 23 with 3 rules applied. Total rules applied 389 place count 78 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 392 place count 78 transition count 127
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 393 place count 78 transition count 126
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 394 place count 78 transition count 126
Applied a total of 394 rules in 44 ms. Remains 78 /246 variables (removed 168) and now considering 126/418 (removed 292) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 126 rows 78 cols
[2024-05-29 20:41:21] [INFO ] Computed 37 invariants in 0 ms
[2024-05-29 20:41:21] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:41:21] [INFO ] [Nat]Absence check using 37 positive place invariants in 4 ms returned sat
[2024-05-29 20:41:21] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:41:21] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-29 20:41:21] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering criterion allowed to conclude after 73658 steps with 36 reset in 311 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-13 finished in 23695 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 1 out of 1183 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1182 transition count 855
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 654 place count 855 transition count 855
Performed 236 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 236 Pre rules applied. Total rules applied 654 place count 855 transition count 619
Deduced a syphon composed of 236 places in 1 ms
Reduce places removed 236 places and 0 transitions.
Iterating global reduction 2 with 472 rules applied. Total rules applied 1126 place count 619 transition count 619
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1135 place count 610 transition count 610
Iterating global reduction 2 with 9 rules applied. Total rules applied 1144 place count 610 transition count 610
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1144 place count 610 transition count 603
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1158 place count 603 transition count 603
Performed 269 Post agglomeration using F-continuation condition.Transition count delta: 269
Deduced a syphon composed of 269 places in 0 ms
Reduce places removed 269 places and 0 transitions.
Iterating global reduction 2 with 538 rules applied. Total rules applied 1696 place count 334 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1697 place count 334 transition count 333
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 1699 place count 333 transition count 332
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -87
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1877 place count 244 transition count 419
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1879 place count 242 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1880 place count 241 transition count 417
Applied a total of 1880 rules in 79 ms. Remains 241 /1183 variables (removed 942) and now considering 417/1183 (removed 766) transitions.
// Phase 1: matrix 417 rows 241 cols
[2024-05-29 20:41:21] [INFO ] Computed 120 invariants in 2 ms
[2024-05-29 20:41:21] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-29 20:41:21] [INFO ] Invariant cache hit.
[2024-05-29 20:41:22] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2024-05-29 20:41:22] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 20:41:22] [INFO ] Invariant cache hit.
[2024-05-29 20:41:22] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/1183 places, 417/1183 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 656 ms. Remains : 241/1183 places, 417/1183 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s224 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 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-14 finished in 705 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))&&p1) U !(X(G(p0))||p2)))'
Found a Lengthening insensitive property : ShieldRVt-PT-030B-LTLCardinality-03
Stuttering acceptance computed with spot in 216 ms :[true, (AND (NOT p0) (NOT p2)), false, false, (NOT p0), p0]
Support contains 6 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1183/1183 places, 1183/1183 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 323 rules applied. Total rules applied 323 place count 1182 transition count 859
Reduce places removed 323 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 325 rules applied. Total rules applied 648 place count 859 transition count 857
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 650 place count 857 transition count 857
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 235 Pre rules applied. Total rules applied 650 place count 857 transition count 622
Deduced a syphon composed of 235 places in 0 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 3 with 470 rules applied. Total rules applied 1120 place count 622 transition count 622
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1128 place count 614 transition count 614
Iterating global reduction 3 with 8 rules applied. Total rules applied 1136 place count 614 transition count 614
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1136 place count 614 transition count 608
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1148 place count 608 transition count 608
Performed 268 Post agglomeration using F-continuation condition.Transition count delta: 268
Deduced a syphon composed of 268 places in 0 ms
Reduce places removed 268 places and 0 transitions.
Iterating global reduction 3 with 536 rules applied. Total rules applied 1684 place count 340 transition count 340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1685 place count 340 transition count 339
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 1687 place count 339 transition count 338
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 1861 place count 252 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1863 place count 250 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1864 place count 249 transition count 420
Applied a total of 1864 rules in 74 ms. Remains 249 /1183 variables (removed 934) and now considering 420/1183 (removed 763) transitions.
// Phase 1: matrix 420 rows 249 cols
[2024-05-29 20:41:22] [INFO ] Computed 120 invariants in 2 ms
[2024-05-29 20:41:22] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-29 20:41:22] [INFO ] Invariant cache hit.
[2024-05-29 20:41:23] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 20:41:23] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2024-05-29 20:41:23] [INFO ] Invariant cache hit.
[2024-05-29 20:41:23] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 249/1183 places, 420/1183 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 654 ms. Remains : 249/1183 places, 420/1183 transitions.
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(OR (EQ s116 0) (EQ s142 1)), p2:(OR (EQ s218 0) (EQ s194 1)), p0:(OR (EQ s14 0) (EQ s63 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, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25 reset in 437 ms.
Product exploration explored 100000 steps with 19 reset in 466 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) p0))), (X (AND p1 p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 p2))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 92 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[true, false, (NOT p0), p0, false, false]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 20:41:24] [INFO ] Invariant cache hit.
[2024-05-29 20:41:24] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:41:24] [INFO ] [Nat]Absence check using 120 positive place invariants in 13 ms returned sat
[2024-05-29 20:41:25] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:41:25] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 20:41:25] [INFO ] After 30ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 20:41:25] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-29 20:41:25] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 420/420 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 249 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 248 transition count 418
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 5 place count 247 transition count 417
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 7 place count 246 transition count 419
Applied a total of 7 rules in 16 ms. Remains 246 /249 variables (removed 3) and now considering 419/420 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 246/249 places, 419/420 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Finished probabilistic random walk after 9934 steps, run visited all 2 properties in 98 ms. (steps per millisecond=101 )
Probabilistic random walk after 9934 steps, saw 6381 distinct states, run finished after 98 ms. (steps per millisecond=101 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) p0))), (X (AND p1 p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 p2))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 10 factoid took 214 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 179 ms :[true, false, (NOT p0), p0, false, false]
Support contains 6 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 420/420 transitions.
Applied a total of 0 rules in 5 ms. Remains 249 /249 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-05-29 20:41:26] [INFO ] Invariant cache hit.
[2024-05-29 20:41:26] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-29 20:41:26] [INFO ] Invariant cache hit.
[2024-05-29 20:41:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 20:41:26] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2024-05-29 20:41:26] [INFO ] Invariant cache hit.
[2024-05-29 20:41:26] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 588 ms. Remains : 249/249 places, 420/420 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p1 p2)), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 82 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[true, false, (NOT p0), p0, false, false]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 20:41:27] [INFO ] Invariant cache hit.
[2024-05-29 20:41:27] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:41:27] [INFO ] [Nat]Absence check using 120 positive place invariants in 15 ms returned sat
[2024-05-29 20:41:27] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:41:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 20:41:27] [INFO ] After 26ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 20:41:27] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-29 20:41:27] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 112 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=56 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p1 p2)), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p2))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 8 factoid took 212 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 192 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 168 ms :[true, false, (NOT p0), p0, false, false]
Product exploration explored 100000 steps with 23 reset in 404 ms.
Product exploration explored 100000 steps with 23 reset in 465 ms.
Applying partial POR strategy [true, false, true, true, false, true]
Stuttering acceptance computed with spot in 210 ms :[true, false, (NOT p0), p0, false, false]
Support contains 6 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 420/420 transitions.
Applied a total of 0 rules in 7 ms. Remains 249 /249 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-05-29 20:41:29] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 20:41:29] [INFO ] Invariant cache hit.
[2024-05-29 20:41:29] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 249/249 places, 420/420 transitions.
Built C files in :
/tmp/ltsmin1108860931676444071
[2024-05-29 20:41:29] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1108860931676444071
Running compilation step : cd /tmp/ltsmin1108860931676444071;'/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 637 ms.
Running link step : cd /tmp/ltsmin1108860931676444071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1108860931676444071;'/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' '--hoa' '/tmp/stateBased12488188781103149099.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 420/420 transitions.
Applied a total of 0 rules in 5 ms. Remains 249 /249 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2024-05-29 20:41:44] [INFO ] Invariant cache hit.
[2024-05-29 20:41:44] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-29 20:41:44] [INFO ] Invariant cache hit.
[2024-05-29 20:41:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 20:41:45] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2024-05-29 20:41:45] [INFO ] Invariant cache hit.
[2024-05-29 20:41:45] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 598 ms. Remains : 249/249 places, 420/420 transitions.
Built C files in :
/tmp/ltsmin6317166221109895652
[2024-05-29 20:41:45] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6317166221109895652
Running compilation step : cd /tmp/ltsmin6317166221109895652;'/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 641 ms.
Running link step : cd /tmp/ltsmin6317166221109895652;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6317166221109895652;'/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' '--hoa' '/tmp/stateBased4366922077730123042.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 20:42:00] [INFO ] Flatten gal took : 17 ms
[2024-05-29 20:42:00] [INFO ] Flatten gal took : 17 ms
[2024-05-29 20:42:00] [INFO ] Time to serialize gal into /tmp/LTL16148902988753108321.gal : 2 ms
[2024-05-29 20:42:00] [INFO ] Time to serialize properties into /tmp/LTL10621276063712475171.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/LTL16148902988753108321.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8874497482907065000.hoa' '-atoms' '/tmp/LTL10621276063712475171.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/LTL10621276063712475171.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8874497482907065000.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.36211e+22 deadlock states
Detected timeout of ITS tools.
[2024-05-29 20:42:15] [INFO ] Flatten gal took : 16 ms
[2024-05-29 20:42:15] [INFO ] Flatten gal took : 19 ms
[2024-05-29 20:42:15] [INFO ] Time to serialize gal into /tmp/LTL12348700884786022464.gal : 3 ms
[2024-05-29 20:42:15] [INFO ] Time to serialize properties into /tmp/LTL16363906366305669152.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/LTL12348700884786022464.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16363906366305669152.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("((p111==0)||(p398==1))")))&&("((p726==0)||(p860==1))"))U(!(((X(G("((p111==0)||(p398==1))")))||("(p1302==0)"))||("(p1176==1...163
Formula 0 simplified : ("((p726==0)||(p860==1))" & XF"((p111==0)||(p398==1))") U (!"(p1176==1)" & !"(p1302==0)" & XF!"((p111==0)||(p398==1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.36211e+22 deadlock states
Detected timeout of ITS tools.
[2024-05-29 20:42:30] [INFO ] Flatten gal took : 19 ms
[2024-05-29 20:42:30] [INFO ] Applying decomposition
[2024-05-29 20:42:30] [INFO ] Flatten gal took : 15 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/graph15273141793107925396.txt' '-o' '/tmp/graph15273141793107925396.bin' '-w' '/tmp/graph15273141793107925396.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15273141793107925396.bin' '-l' '-1' '-v' '-w' '/tmp/graph15273141793107925396.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:42:30] [INFO ] Decomposing Gal with order
[2024-05-29 20:42:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:42:30] [INFO ] Removed a total of 801 redundant transitions.
[2024-05-29 20:42:30] [INFO ] Flatten gal took : 24 ms
[2024-05-29 20:42:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 458 labels/synchronizations in 11 ms.
[2024-05-29 20:42:30] [INFO ] Time to serialize gal into /tmp/LTL14352434284867459125.gal : 3 ms
[2024-05-29 20:42:30] [INFO ] Time to serialize properties into /tmp/LTL2801395464084455251.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/LTL14352434284867459125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2801395464084455251.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("((i0.i1.u7.p111==0)||(i2.i1.u30.p398==1))")))&&("((i5.i0.u57.p726==0)||(i5.i2.u69.p860==1))"))U(!(((X(G("((i0.i1.u7.p111==...242
Formula 0 simplified : ("((i5.i0.u57.p726==0)||(i5.i2.u69.p860==1))" & XF"((i0.i1.u7.p111==0)||(i2.i1.u30.p398==1))") U (!"(i8.i0.u95.p1176==1)" & !"(i9.i0...221
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 7.36211e+22 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
557 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.59961,201724,1,0,280506,101,1607,1.19351e+06,125,309,128904
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property ShieldRVt-PT-030B-LTLCardinality-03 finished in 74900 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-03 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-29 20:42:37] [INFO ] Flatten gal took : 24 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 274753 ms.

BK_STOP 1717015358423

--------------------
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-030B"
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-030B, 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-171683789800627"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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