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.r571-tall-171734910400192.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 FireWire-PT-18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910400192
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 168K Jun 2 16:33 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 FireWire-PT-18-LTLCardinality-00
FORMULA_NAME FireWire-PT-18-LTLCardinality-01
FORMULA_NAME FireWire-PT-18-LTLCardinality-02
FORMULA_NAME FireWire-PT-18-LTLCardinality-03
FORMULA_NAME FireWire-PT-18-LTLCardinality-04
FORMULA_NAME FireWire-PT-18-LTLCardinality-05
FORMULA_NAME FireWire-PT-18-LTLCardinality-06
FORMULA_NAME FireWire-PT-18-LTLCardinality-07
FORMULA_NAME FireWire-PT-18-LTLCardinality-08
FORMULA_NAME FireWire-PT-18-LTLCardinality-09
FORMULA_NAME FireWire-PT-18-LTLCardinality-10
FORMULA_NAME FireWire-PT-18-LTLCardinality-11
FORMULA_NAME FireWire-PT-18-LTLCardinality-12
FORMULA_NAME FireWire-PT-18-LTLCardinality-13
FORMULA_NAME FireWire-PT-18-LTLCardinality-14
FORMULA_NAME FireWire-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717371458945

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=FireWire-PT-18
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 23:37:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:37:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:37:40] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 23:37:40] [INFO ] Transformed 437 places.
[2024-06-02 23:37:40] [INFO ] Transformed 707 transitions.
[2024-06-02 23:37:40] [INFO ] Found NUPN structural information;
[2024-06-02 23:37:40] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FireWire-PT-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-18-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 437 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 437/437 places, 707/707 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 428 transition count 707
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 104 place count 333 transition count 612
Iterating global reduction 1 with 95 rules applied. Total rules applied 199 place count 333 transition count 612
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 200 place count 333 transition count 611
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 225 place count 308 transition count 518
Iterating global reduction 2 with 25 rules applied. Total rules applied 250 place count 308 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 251 place count 308 transition count 517
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 256 place count 303 transition count 509
Iterating global reduction 3 with 5 rules applied. Total rules applied 261 place count 303 transition count 509
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 263 place count 303 transition count 507
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 265 place count 301 transition count 501
Iterating global reduction 4 with 2 rules applied. Total rules applied 267 place count 301 transition count 501
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 268 place count 300 transition count 499
Iterating global reduction 4 with 1 rules applied. Total rules applied 269 place count 300 transition count 499
Applied a total of 269 rules in 285 ms. Remains 300 /437 variables (removed 137) and now considering 499/707 (removed 208) transitions.
// Phase 1: matrix 499 rows 300 cols
[2024-06-02 23:37:41] [INFO ] Computed 7 invariants in 32 ms
[2024-06-02 23:37:41] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-06-02 23:37:41] [INFO ] Invariant cache hit.
[2024-06-02 23:37:41] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2024-06-02 23:37:41] [INFO ] Invariant cache hit.
[2024-06-02 23:37:41] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 300/437 places, 499/707 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1150 ms. Remains : 300/437 places, 499/707 transitions.
Support contains 29 out of 300 places after structural reductions.
[2024-06-02 23:37:42] [INFO ] Flatten gal took : 67 ms
[2024-06-02 23:37:42] [INFO ] Flatten gal took : 36 ms
[2024-06-02 23:37:42] [INFO ] Input system was already deterministic with 499 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 508 ms. (steps per millisecond=19 ) properties (out of 17) seen :6
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-06-02 23:37:44] [INFO ] Invariant cache hit.
[2024-06-02 23:37:44] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:37:44] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 23:37:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 23:37:45] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-06-02 23:37:45] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 5 ms to minimize.
[2024-06-02 23:37:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2024-06-02 23:37:45] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 1 ms to minimize.
[2024-06-02 23:37:45] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 0 ms to minimize.
[2024-06-02 23:37:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 323 ms
[2024-06-02 23:37:45] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 2 ms to minimize.
[2024-06-02 23:37:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-06-02 23:37:45] [INFO ] After 1093ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 174 ms.
[2024-06-02 23:37:45] [INFO ] After 1416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 1 properties in 143 ms.
Support contains 14 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 499/499 transitions.
Graph (trivial) has 199 edges and 300 vertex of which 9 / 300 are part of one of the 3 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 294 transition count 448
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 84 place count 254 transition count 445
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 84 place count 254 transition count 418
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 138 place count 227 transition count 418
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 142 place count 223 transition count 413
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 223 transition count 413
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 146 place count 223 transition count 411
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 150 place count 221 transition count 411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 220 transition count 409
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 220 transition count 409
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 194 place count 199 transition count 388
Performed 28 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 250 place count 171 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 251 place count 171 transition count 444
Free-agglomeration rule applied 19 times.
Iterating global reduction 3 with 19 rules applied. Total rules applied 270 place count 171 transition count 425
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 295 place count 152 transition count 419
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 299 place count 148 transition count 415
Iterating global reduction 4 with 4 rules applied. Total rules applied 303 place count 148 transition count 415
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 309 place count 148 transition count 409
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 326 place count 148 transition count 392
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 327 place count 148 transition count 392
Applied a total of 327 rules in 118 ms. Remains 148 /300 variables (removed 152) and now considering 392/499 (removed 107) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 148/300 places, 392/499 transitions.
Incomplete random walk after 10000 steps, including 472 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 126 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 117 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-06-02 23:37:46] [INFO ] Flow matrix only has 385 transitions (discarded 7 similar events)
// Phase 1: matrix 385 rows 148 cols
[2024-06-02 23:37:46] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:37:46] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 23:37:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:37:47] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 23:37:47] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-02 23:37:47] [INFO ] After 101ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-06-02 23:37:47] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 0 ms to minimize.
[2024-06-02 23:37:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-06-02 23:37:47] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 0 ms to minimize.
[2024-06-02 23:37:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-06-02 23:37:47] [INFO ] After 392ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-06-02 23:37:47] [INFO ] After 664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 21 ms.
Support contains 8 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 392/392 transitions.
Graph (trivial) has 22 edges and 148 vertex of which 2 / 148 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 147 transition count 389
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 146 transition count 389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 145 transition count 387
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 145 transition count 387
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 144 transition count 384
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 144 transition count 384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 143 transition count 382
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 143 transition count 382
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 142 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 142 transition count 379
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 141 transition count 377
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 141 transition count 377
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 140 transition count 374
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 140 transition count 374
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 139 transition count 372
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 139 transition count 372
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 138 transition count 369
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 138 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 137 transition count 367
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 137 transition count 367
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 0 with 2 rules applied. Total rules applied 23 place count 136 transition count 366
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 27 place count 134 transition count 372
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 31 place count 134 transition count 368
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 134 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 134 transition count 367
Applied a total of 33 rules in 62 ms. Remains 134 /148 variables (removed 14) and now considering 367/392 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 134/148 places, 367/392 transitions.
Incomplete random walk after 10000 steps, including 516 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 126 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 132 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1411836 steps, run timeout after 3001 ms. (steps per millisecond=470 ) properties seen :{0=1, 1=1, 2=1, 3=1}
Probabilistic random walk after 1411836 steps, saw 337691 distinct states, run finished after 3002 ms. (steps per millisecond=470 ) properties seen :4
Running SMT prover for 1 properties.
[2024-06-02 23:37:51] [INFO ] Flow matrix only has 360 transitions (discarded 7 similar events)
// Phase 1: matrix 360 rows 134 cols
[2024-06-02 23:37:51] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:37:51] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:37:51] [INFO ] After 86ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 23:37:51] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-02 23:37:51] [INFO ] After 25ms SMT Verify possible using 64 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:37:51] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:37:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:37:51] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:37:51] [INFO ] After 91ms SMT Verify possible using 64 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:37:51] [INFO ] After 111ms 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-06-02 23:37:51] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 367/367 transitions.
Graph (complete) has 645 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 133 transition count 364
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 130 transition count 364
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 10 place count 127 transition count 358
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 127 transition count 358
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 15 place count 125 transition count 354
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 125 transition count 354
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 124 transition count 351
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 124 transition count 351
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 123 transition count 349
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 123 transition count 349
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 122 transition count 346
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 122 transition count 346
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 121 transition count 344
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 121 transition count 344
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 26 place count 120 transition count 341
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 120 transition count 341
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 28 place count 119 transition count 339
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 119 transition count 339
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 30 place count 118 transition count 337
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 118 transition count 337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 32 place count 117 transition count 335
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 117 transition count 335
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 117 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 116 transition count 334
Applied a total of 35 rules in 47 ms. Remains 116 /134 variables (removed 18) and now considering 334/367 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 116/134 places, 334/367 transitions.
Incomplete random walk after 10000 steps, including 484 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1397945 steps, run visited all 1 properties in 2554 ms. (steps per millisecond=547 )
Probabilistic random walk after 1397945 steps, saw 339529 distinct states, run finished after 2555 ms. (steps per millisecond=547 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Computed a total of 87 stabilizing places and 131 stable transitions
Graph (complete) has 930 edges and 300 vertex of which 299 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 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(F(p2))&&p1))&&p0)))'
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 499/499 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 499
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 290 transition count 486
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 290 transition count 486
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 287 transition count 480
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 287 transition count 480
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 285 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 285 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 283 transition count 470
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 283 transition count 470
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 281 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 281 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 279 transition count 460
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 279 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 277 transition count 455
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 277 transition count 455
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 275 transition count 450
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 275 transition count 450
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 273 transition count 446
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 273 transition count 446
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 271 transition count 442
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 271 transition count 442
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 269 transition count 439
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 269 transition count 439
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 268 transition count 438
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 268 transition count 438
Applied a total of 63 rules in 69 ms. Remains 268 /300 variables (removed 32) and now considering 438/499 (removed 61) transitions.
// Phase 1: matrix 438 rows 268 cols
[2024-06-02 23:37:54] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 23:37:54] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 23:37:54] [INFO ] Invariant cache hit.
[2024-06-02 23:37:54] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-06-02 23:37:54] [INFO ] Invariant cache hit.
[2024-06-02 23:37:54] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/300 places, 438/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 600 ms. Remains : 268/300 places, 438/499 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 290 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : FireWire-PT-18-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(AND (EQ s101 0) (EQ s235 1)), p1:(AND (EQ s163 0) (EQ s152 1)), p0:(AND (EQ s33 0) (EQ s171 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA FireWire-PT-18-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLCardinality-00 finished in 957 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))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 499/499 transitions.
Graph (trivial) has 208 edges and 300 vertex of which 12 / 300 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 919 edges and 291 vertex of which 290 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 289 transition count 447
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 248 transition count 444
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 87 place count 248 transition count 417
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 141 place count 221 transition count 417
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 147 place count 215 transition count 409
Iterating global reduction 2 with 6 rules applied. Total rules applied 153 place count 215 transition count 409
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 153 place count 215 transition count 407
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 157 place count 213 transition count 407
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 159 place count 211 transition count 402
Iterating global reduction 2 with 2 rules applied. Total rules applied 161 place count 211 transition count 402
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 162 place count 210 transition count 400
Iterating global reduction 2 with 1 rules applied. Total rules applied 163 place count 210 transition count 400
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 164 place count 209 transition count 397
Iterating global reduction 2 with 1 rules applied. Total rules applied 165 place count 209 transition count 397
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 208 transition count 395
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 208 transition count 395
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 207 transition count 392
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 207 transition count 392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 206 transition count 390
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 206 transition count 390
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 205 transition count 387
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 205 transition count 387
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 204 transition count 385
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 204 transition count 385
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 176 place count 203 transition count 383
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 203 transition count 383
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 178 place count 202 transition count 381
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 202 transition count 381
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 225 place count 179 transition count 358
Performed 30 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 285 place count 149 transition count 420
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 287 place count 149 transition count 418
Applied a total of 287 rules in 90 ms. Remains 149 /300 variables (removed 151) and now considering 418/499 (removed 81) transitions.
[2024-06-02 23:37:55] [INFO ] Flow matrix only has 399 transitions (discarded 19 similar events)
// Phase 1: matrix 399 rows 149 cols
[2024-06-02 23:37:55] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:37:55] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 23:37:55] [INFO ] Flow matrix only has 399 transitions (discarded 19 similar events)
[2024-06-02 23:37:55] [INFO ] Invariant cache hit.
[2024-06-02 23:37:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 23:37:55] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-06-02 23:37:55] [INFO ] Redundant transitions in 24 ms returned []
[2024-06-02 23:37:55] [INFO ] Flow matrix only has 399 transitions (discarded 19 similar events)
[2024-06-02 23:37:55] [INFO ] Invariant cache hit.
[2024-06-02 23:37:55] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/300 places, 418/499 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 557 ms. Remains : 149/300 places, 418/499 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p1)]
Running random walk in product with property : FireWire-PT-18-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s8 1), p0:(OR (EQ s106 0) (EQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-18-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLCardinality-02 finished in 633 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X(p1)) U X((p2&&X(F(p3)))))))'
Support contains 7 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 499/499 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 499
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 289 transition count 487
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 289 transition count 487
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 285 transition count 480
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 285 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 284 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 284 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 283 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 283 transition count 475
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 282 transition count 473
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 282 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 281 transition count 470
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 281 transition count 470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 280 transition count 468
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 280 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 279 transition count 465
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 279 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 278 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 278 transition count 463
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 277 transition count 461
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 277 transition count 461
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 276 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 276 transition count 459
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 275 transition count 458
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 275 transition count 458
Applied a total of 49 rules in 35 ms. Remains 275 /300 variables (removed 25) and now considering 458/499 (removed 41) transitions.
// Phase 1: matrix 458 rows 275 cols
[2024-06-02 23:37:55] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:37:56] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 23:37:56] [INFO ] Invariant cache hit.
[2024-06-02 23:37:56] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-06-02 23:37:56] [INFO ] Invariant cache hit.
[2024-06-02 23:37:56] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/300 places, 458/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 564 ms. Remains : 275/300 places, 458/499 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (OR (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : FireWire-PT-18-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=p2, acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(OR (EQ s124 0) (EQ s24 1)), p2:(OR (EQ s142 0) (EQ s118 1)), p1:(OR (EQ s88 0) (EQ s43 1)), p3:(EQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 3 ms.
FORMULA FireWire-PT-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLCardinality-03 finished in 844 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)||(p1&&F(p2)))))'
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 499/499 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 499
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 289 transition count 486
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 289 transition count 486
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 284 transition count 477
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 284 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 282 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 282 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 280 transition count 467
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 280 transition count 467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 278 transition count 462
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 278 transition count 462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 276 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 276 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 274 transition count 452
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 274 transition count 452
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 273 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 273 transition count 450
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 272 transition count 448
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 272 transition count 448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 271 transition count 446
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 271 transition count 446
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 270 transition count 445
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 270 transition count 445
Applied a total of 59 rules in 33 ms. Remains 270 /300 variables (removed 30) and now considering 445/499 (removed 54) transitions.
// Phase 1: matrix 445 rows 270 cols
[2024-06-02 23:37:56] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:37:56] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 23:37:56] [INFO ] Invariant cache hit.
[2024-06-02 23:37:57] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-06-02 23:37:57] [INFO ] Invariant cache hit.
[2024-06-02 23:37:57] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/300 places, 445/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 559 ms. Remains : 270/300 places, 445/499 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-18-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(OR (EQ s13 0) (EQ s254 1)), p0:(AND (EQ s217 0) (EQ s260 1)), p1:(OR (EQ s260 0) (EQ s217 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 322 ms.
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Computed a total of 61 stabilizing places and 82 stable transitions
Computed a total of 61 stabilizing places and 82 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 15 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-18-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-18-LTLCardinality-04 finished in 1423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 499/499 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 291 transition count 486
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 291 transition count 486
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 287 transition count 478
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 287 transition count 478
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 285 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 285 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 283 transition count 468
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 283 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 281 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 281 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 279 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 279 transition count 458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 277 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 277 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 275 transition count 448
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 275 transition count 448
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 273 transition count 444
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 273 transition count 444
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 272 transition count 442
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 272 transition count 442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 271 transition count 441
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 271 transition count 441
Applied a total of 58 rules in 33 ms. Remains 271 /300 variables (removed 29) and now considering 441/499 (removed 58) transitions.
// Phase 1: matrix 441 rows 271 cols
[2024-06-02 23:37:58] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:37:58] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 23:37:58] [INFO ] Invariant cache hit.
[2024-06-02 23:37:58] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-06-02 23:37:58] [INFO ] Invariant cache hit.
[2024-06-02 23:37:58] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 271/300 places, 441/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 271/300 places, 441/499 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-18-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (EQ s52 0) (EQ s158 1)), p0:(OR (EQ s41 0) (EQ s213 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 221 ms.
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Computed a total of 64 stabilizing places and 81 stable transitions
Graph (complete) has 807 edges and 271 vertex of which 270 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 64 stabilizing places and 81 stable transitions
Detected a total of 64/271 stabilizing places and 81/441 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-18-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-18-LTLCardinality-05 finished in 1213 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((G(p1)||p0))))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 499/499 transitions.
Graph (trivial) has 210 edges and 300 vertex of which 12 / 300 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 919 edges and 291 vertex of which 290 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 289 transition count 445
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 246 transition count 442
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 91 place count 246 transition count 415
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 145 place count 219 transition count 415
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 151 place count 213 transition count 406
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 213 transition count 406
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 157 place count 213 transition count 404
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 161 place count 211 transition count 404
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 163 place count 209 transition count 400
Iterating global reduction 2 with 2 rules applied. Total rules applied 165 place count 209 transition count 400
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 208 transition count 397
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 208 transition count 397
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 168 place count 207 transition count 395
Iterating global reduction 2 with 1 rules applied. Total rules applied 169 place count 207 transition count 395
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 206 transition count 392
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 206 transition count 392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 205 transition count 390
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 205 transition count 390
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 204 transition count 387
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 204 transition count 387
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 176 place count 203 transition count 385
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 203 transition count 385
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 178 place count 202 transition count 383
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 202 transition count 383
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 180 place count 201 transition count 381
Iterating global reduction 2 with 1 rules applied. Total rules applied 181 place count 201 transition count 381
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 227 place count 178 transition count 358
Performed 29 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 285 place count 149 transition count 421
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 287 place count 149 transition count 419
Applied a total of 287 rules in 58 ms. Remains 149 /300 variables (removed 151) and now considering 419/499 (removed 80) transitions.
[2024-06-02 23:37:59] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
// Phase 1: matrix 400 rows 149 cols
[2024-06-02 23:37:59] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:37:59] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 23:37:59] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2024-06-02 23:37:59] [INFO ] Invariant cache hit.
[2024-06-02 23:37:59] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-02 23:37:59] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-06-02 23:37:59] [INFO ] Redundant transitions in 8 ms returned []
[2024-06-02 23:37:59] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2024-06-02 23:37:59] [INFO ] Invariant cache hit.
[2024-06-02 23:37:59] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/300 places, 419/499 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 542 ms. Remains : 149/300 places, 419/499 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-18-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s100 1), p0:(OR (EQ s135 0) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 106 ms.
Product exploration explored 100000 steps with 6 reset in 85 ms.
Computed a total of 32 stabilizing places and 62 stable transitions
Computed a total of 32 stabilizing places and 62 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 508 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 123 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1302398 steps, run timeout after 3001 ms. (steps per millisecond=433 ) properties seen :{0=1}
Probabilistic random walk after 1302398 steps, saw 324666 distinct states, run finished after 3001 ms. (steps per millisecond=433 ) properties seen :1
Running SMT prover for 1 properties.
[2024-06-02 23:38:03] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2024-06-02 23:38:03] [INFO ] Invariant cache hit.
[2024-06-02 23:38:03] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:38:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:38:03] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 117 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 149 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 419/419 transitions.
Applied a total of 0 rules in 9 ms. Remains 149 /149 variables (removed 0) and now considering 419/419 (removed 0) transitions.
[2024-06-02 23:38:03] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2024-06-02 23:38:03] [INFO ] Invariant cache hit.
[2024-06-02 23:38:04] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 23:38:04] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2024-06-02 23:38:04] [INFO ] Invariant cache hit.
[2024-06-02 23:38:04] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-02 23:38:04] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-06-02 23:38:04] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:38:04] [INFO ] Flow matrix only has 400 transitions (discarded 19 similar events)
[2024-06-02 23:38:04] [INFO ] Invariant cache hit.
[2024-06-02 23:38:04] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 468 ms. Remains : 149/149 places, 419/419 transitions.
Computed a total of 32 stabilizing places and 62 stable transitions
Computed a total of 32 stabilizing places and 62 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 518 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 122 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1744 steps, run visited all 1 properties in 9 ms. (steps per millisecond=193 )
Probabilistic random walk after 1744 steps, saw 580 distinct states, run finished after 9 ms. (steps per millisecond=193 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4 reset in 140 ms.
Product exploration explored 100000 steps with 3 reset in 77 ms.
Built C files in :
/tmp/ltsmin625468066344500999
[2024-06-02 23:38:05] [INFO ] Computing symmetric may disable matrix : 419 transitions.
[2024-06-02 23:38:05] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:38:05] [INFO ] Computing symmetric may enable matrix : 419 transitions.
[2024-06-02 23:38:05] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:38:05] [INFO ] Computing Do-Not-Accords matrix : 419 transitions.
[2024-06-02 23:38:05] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:38:05] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin625468066344500999
Running compilation step : cd /tmp/ltsmin625468066344500999;'/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 975 ms.
Running link step : cd /tmp/ltsmin625468066344500999;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin625468066344500999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12628276452601390053.hoa' '--buchi-type=spotba'
LTSmin run took 1029 ms.
FORMULA FireWire-PT-18-LTLCardinality-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-18-LTLCardinality-08 finished in 7986 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(G(p0))))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 499/499 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 499
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 287 transition count 483
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 287 transition count 483
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 282 transition count 474
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 282 transition count 474
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 280 transition count 469
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 280 transition count 469
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 278 transition count 464
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 278 transition count 464
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 276 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 276 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 274 transition count 454
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 274 transition count 454
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 272 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 272 transition count 449
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 270 transition count 444
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 270 transition count 444
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 268 transition count 440
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 268 transition count 440
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 266 transition count 436
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 266 transition count 436
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 264 transition count 433
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 264 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 263 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 263 transition count 432
Applied a total of 73 rules in 29 ms. Remains 263 /300 variables (removed 37) and now considering 432/499 (removed 67) transitions.
// Phase 1: matrix 432 rows 263 cols
[2024-06-02 23:38:07] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 23:38:07] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 23:38:07] [INFO ] Invariant cache hit.
[2024-06-02 23:38:07] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-02 23:38:07] [INFO ] Invariant cache hit.
[2024-06-02 23:38:07] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/300 places, 432/499 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 518 ms. Remains : 263/300 places, 432/499 transitions.
Stuttering acceptance computed with spot in 429 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-18-LTLCardinality-10 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: 2}]], initial=3, aps=[p0:(OR (EQ s21 0) (EQ s172 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 191 steps with 2 reset in 1 ms.
FORMULA FireWire-PT-18-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-18-LTLCardinality-10 finished in 968 ms.
All properties solved by simple procedures.
Total runtime 27859 ms.

BK_STOP 1717371489379

--------------------
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="FireWire-PT-18"
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 FireWire-PT-18, 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 r571-tall-171734910400192"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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