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-171734910400198.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-19, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910400198
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 221K 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-19-LTLFireability-00
FORMULA_NAME FireWire-PT-19-LTLFireability-01
FORMULA_NAME FireWire-PT-19-LTLFireability-02
FORMULA_NAME FireWire-PT-19-LTLFireability-03
FORMULA_NAME FireWire-PT-19-LTLFireability-04
FORMULA_NAME FireWire-PT-19-LTLFireability-05
FORMULA_NAME FireWire-PT-19-LTLFireability-06
FORMULA_NAME FireWire-PT-19-LTLFireability-07
FORMULA_NAME FireWire-PT-19-LTLFireability-08
FORMULA_NAME FireWire-PT-19-LTLFireability-09
FORMULA_NAME FireWire-PT-19-LTLFireability-10
FORMULA_NAME FireWire-PT-19-LTLFireability-11
FORMULA_NAME FireWire-PT-19-LTLFireability-12
FORMULA_NAME FireWire-PT-19-LTLFireability-13
FORMULA_NAME FireWire-PT-19-LTLFireability-14
FORMULA_NAME FireWire-PT-19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717371666851

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-19
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 23:41:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:41:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:41:09] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2024-06-02 23:41:09] [INFO ] Transformed 602 places.
[2024-06-02 23:41:09] [INFO ] Transformed 944 transitions.
[2024-06-02 23:41:09] [INFO ] Found NUPN structural information;
[2024-06-02 23:41:09] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 346 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FireWire-PT-19-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-19-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 944/944 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 593 transition count 944
Discarding 121 places :
Symmetric choice reduction at 1 with 121 rule applications. Total rules 130 place count 472 transition count 823
Iterating global reduction 1 with 121 rules applied. Total rules applied 251 place count 472 transition count 823
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 282 place count 441 transition count 781
Iterating global reduction 1 with 31 rules applied. Total rules applied 313 place count 441 transition count 781
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 316 place count 441 transition count 778
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 319 place count 438 transition count 775
Iterating global reduction 2 with 3 rules applied. Total rules applied 322 place count 438 transition count 775
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 324 place count 436 transition count 773
Iterating global reduction 2 with 2 rules applied. Total rules applied 326 place count 436 transition count 773
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 328 place count 434 transition count 771
Iterating global reduction 2 with 2 rules applied. Total rules applied 330 place count 434 transition count 771
Applied a total of 330 rules in 120 ms. Remains 434 /602 variables (removed 168) and now considering 771/944 (removed 173) transitions.
// Phase 1: matrix 771 rows 434 cols
[2024-06-02 23:41:09] [INFO ] Computed 10 invariants in 30 ms
[2024-06-02 23:41:09] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-06-02 23:41:09] [INFO ] Invariant cache hit.
[2024-06-02 23:41:10] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2024-06-02 23:41:10] [INFO ] Invariant cache hit.
[2024-06-02 23:41:10] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 434/602 places, 771/944 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1059 ms. Remains : 434/602 places, 771/944 transitions.
Support contains 42 out of 434 places after structural reductions.
[2024-06-02 23:41:10] [INFO ] Flatten gal took : 73 ms
[2024-06-02 23:41:10] [INFO ] Flatten gal took : 41 ms
[2024-06-02 23:41:10] [INFO ] Input system was already deterministic with 771 transitions.
Support contains 41 out of 434 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
[2024-06-02 23:41:11] [INFO ] Invariant cache hit.
[2024-06-02 23:41:11] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-06-02 23:41:11] [INFO ] After 273ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:28
[2024-06-02 23:41:12] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 5 ms to minimize.
[2024-06-02 23:41:12] [INFO ] Deduced a trap composed of 56 places in 177 ms of which 1 ms to minimize.
[2024-06-02 23:41:12] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 1 ms to minimize.
[2024-06-02 23:41:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 579 ms
[2024-06-02 23:41:12] [INFO ] After 934ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:30
[2024-06-02 23:41:12] [INFO ] After 1261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2024-06-02 23:41:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:41:14] [INFO ] After 1190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2024-06-02 23:41:15] [INFO ] After 2753ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
Attempting to minimize the solution found.
Minimization took 933 ms.
[2024-06-02 23:41:16] [INFO ] After 4172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
Parikh walk visited 2 properties in 703 ms.
Support contains 35 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 293 edges and 434 vertex of which 9 / 434 are part of one of the 2 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 427 transition count 689
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 75 rules applied. Total rules applied 146 place count 357 transition count 684
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 153 place count 355 transition count 679
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 158 place count 350 transition count 679
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 158 place count 350 transition count 639
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 238 place count 310 transition count 639
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 334 place count 262 transition count 591
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -148
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 402 place count 228 transition count 739
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 408 place count 228 transition count 733
Free-agglomeration rule applied 28 times.
Iterating global reduction 4 with 28 rules applied. Total rules applied 436 place count 228 transition count 705
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 464 place count 200 transition count 705
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 465 place count 200 transition count 704
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 471 place count 200 transition count 704
Applied a total of 471 rules in 133 ms. Remains 200 /434 variables (removed 234) and now considering 704/771 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 200/434 places, 704/771 transitions.
Incomplete random walk after 10000 steps, including 374 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 28) seen :7
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2024-06-02 23:41:17] [INFO ] Flow matrix only has 679 transitions (discarded 25 similar events)
// Phase 1: matrix 679 rows 200 cols
[2024-06-02 23:41:17] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:41:18] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:41:18] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-06-02 23:41:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:41:18] [INFO ] After 565ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2024-06-02 23:41:18] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-02 23:41:19] [INFO ] After 489ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2024-06-02 23:41:19] [INFO ] After 1174ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 426 ms.
[2024-06-02 23:41:20] [INFO ] After 2334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 11 ms.
Support contains 25 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 704/704 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 200 transition count 702
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 198 transition count 702
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 196 transition count 700
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 194 transition count 708
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 194 transition count 705
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 21 place count 194 transition count 699
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 27 place count 188 transition count 699
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 1 with 35 rules applied. Total rules applied 62 place count 188 transition count 664
Applied a total of 62 rules in 66 ms. Remains 188 /200 variables (removed 12) and now considering 664/704 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 188/200 places, 664/704 transitions.
Incomplete random walk after 10000 steps, including 324 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 20) seen :7
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-06-02 23:41:21] [INFO ] Flow matrix only has 632 transitions (discarded 32 similar events)
// Phase 1: matrix 632 rows 188 cols
[2024-06-02 23:41:21] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:41:21] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:41:21] [INFO ] After 190ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:7
[2024-06-02 23:41:21] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-02 23:41:21] [INFO ] After 73ms SMT Verify possible using 46 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 23:41:21] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 23:41:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:41:22] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-06-02 23:41:22] [INFO ] After 268ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-06-02 23:41:22] [INFO ] After 618ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 216 ms.
[2024-06-02 23:41:22] [INFO ] After 1225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 353 ms.
Support contains 12 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 664/664 transitions.
Graph (trivial) has 38 edges and 188 vertex of which 2 / 188 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 187 transition count 658
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 183 transition count 658
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 9 place count 183 transition count 656
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 13 place count 181 transition count 656
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 176 transition count 690
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 176 transition count 685
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 176 transition count 684
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 175 transition count 684
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 50 place count 175 transition count 664
Applied a total of 50 rules in 51 ms. Remains 175 /188 variables (removed 13) and now considering 664/664 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 175/188 places, 664/664 transitions.
Incomplete random walk after 10000 steps, including 330 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-06-02 23:41:23] [INFO ] Flow matrix only has 630 transitions (discarded 34 similar events)
// Phase 1: matrix 630 rows 175 cols
[2024-06-02 23:41:23] [INFO ] Computed 10 invariants in 13 ms
[2024-06-02 23:41:23] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:41:24] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 23:41:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:41:24] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 23:41:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-02 23:41:24] [INFO ] After 177ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-06-02 23:41:24] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 126 ms.
[2024-06-02 23:41:24] [INFO ] After 797ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 4 ms.
Support contains 7 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 664/664 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 174 transition count 597
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 174 transition count 597
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 0 with 2 rules applied. Total rules applied 4 place count 173 transition count 596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 172 transition count 593
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 172 transition count 593
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 11 place count 172 transition count 588
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 1 with 4 rules applied. Total rules applied 15 place count 170 transition count 594
Drop transitions removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 1 with 43 rules applied. Total rules applied 58 place count 170 transition count 551
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 170 transition count 550
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 169 transition count 550
Applied a total of 60 rules in 42 ms. Remains 169 /175 variables (removed 6) and now considering 550/664 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 169/175 places, 550/664 transitions.
Incomplete random walk after 10000 steps, including 329 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-02 23:41:25] [INFO ] Flow matrix only has 532 transitions (discarded 18 similar events)
// Phase 1: matrix 532 rows 169 cols
[2024-06-02 23:41:25] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:41:25] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:41:25] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:41:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:41:25] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:41:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 23:41:25] [INFO ] After 93ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:41:25] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 70 ms.
[2024-06-02 23:41:25] [INFO ] After 502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 13 ms.
Support contains 5 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 550/550 transitions.
Graph (trivial) has 17 edges and 169 vertex of which 2 / 169 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 0 with 59 rules applied. Total rules applied 60 place count 168 transition count 464
Applied a total of 60 rules in 13 ms. Remains 168 /169 variables (removed 1) and now considering 464/550 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 168/169 places, 464/550 transitions.
Incomplete random walk after 10000 steps, including 393 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1110097 steps, run timeout after 3001 ms. (steps per millisecond=369 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1110097 steps, saw 299509 distinct states, run finished after 3001 ms. (steps per millisecond=369 ) properties seen :2
Running SMT prover for 1 properties.
[2024-06-02 23:41:29] [INFO ] Flow matrix only has 447 transitions (discarded 17 similar events)
// Phase 1: matrix 447 rows 168 cols
[2024-06-02 23:41:29] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:41:29] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:41:29] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:41:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:41:29] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:29] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-02 23:41:29] [INFO ] After 47ms SMT Verify possible using 86 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:29] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-06-02 23:41:29] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 464/464 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 167 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 167 transition count 462
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 4 place count 166 transition count 462
Applied a total of 4 rules in 11 ms. Remains 166 /168 variables (removed 2) and now considering 462/464 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 166/168 places, 462/464 transitions.
Incomplete random walk after 10000 steps, including 394 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1140657 steps, run timeout after 3001 ms. (steps per millisecond=380 ) properties seen :{}
Probabilistic random walk after 1140657 steps, saw 311844 distinct states, run finished after 3005 ms. (steps per millisecond=379 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:41:32] [INFO ] Flow matrix only has 445 transitions (discarded 17 similar events)
// Phase 1: matrix 445 rows 166 cols
[2024-06-02 23:41:32] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:41:32] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:41:32] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:41:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:41:32] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:32] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-02 23:41:32] [INFO ] After 67ms SMT Verify possible using 87 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:32] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-06-02 23:41:32] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 462/462 transitions.
Applied a total of 0 rules in 7 ms. Remains 166 /166 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 166/166 places, 462/462 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 462/462 transitions.
Applied a total of 0 rules in 6 ms. Remains 166 /166 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2024-06-02 23:41:32] [INFO ] Flow matrix only has 445 transitions (discarded 17 similar events)
[2024-06-02 23:41:32] [INFO ] Invariant cache hit.
[2024-06-02 23:41:32] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 23:41:32] [INFO ] Flow matrix only has 445 transitions (discarded 17 similar events)
[2024-06-02 23:41:32] [INFO ] Invariant cache hit.
[2024-06-02 23:41:33] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-02 23:41:33] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2024-06-02 23:41:33] [INFO ] Redundant transitions in 51 ms returned [420]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
[2024-06-02 23:41:33] [INFO ] Flow matrix only has 444 transitions (discarded 17 similar events)
// Phase 1: matrix 444 rows 166 cols
[2024-06-02 23:41:33] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:41:33] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 166/166 places, 461/462 transitions.
Applied a total of 0 rules in 5 ms. Remains 166 /166 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 742 ms. Remains : 166/166 places, 461/462 transitions.
Incomplete random walk after 10000 steps, including 395 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1129474 steps, run timeout after 3001 ms. (steps per millisecond=376 ) properties seen :{}
Probabilistic random walk after 1129474 steps, saw 308208 distinct states, run finished after 3001 ms. (steps per millisecond=376 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:41:36] [INFO ] Flow matrix only has 444 transitions (discarded 17 similar events)
[2024-06-02 23:41:36] [INFO ] Invariant cache hit.
[2024-06-02 23:41:36] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:41:36] [INFO ] After 86ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 23:41:36] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-02 23:41:36] [INFO ] After 47ms SMT Verify possible using 87 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:41:36] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:41:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:41:36] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:37] [INFO ] After 34ms SMT Verify possible using 87 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:37] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-06-02 23:41:37] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 461/461 transitions.
Applied a total of 0 rules in 8 ms. Remains 166 /166 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 166/166 places, 461/461 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 461/461 transitions.
Applied a total of 0 rules in 5 ms. Remains 166 /166 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2024-06-02 23:41:37] [INFO ] Flow matrix only has 444 transitions (discarded 17 similar events)
[2024-06-02 23:41:37] [INFO ] Invariant cache hit.
[2024-06-02 23:41:37] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 23:41:37] [INFO ] Flow matrix only has 444 transitions (discarded 17 similar events)
[2024-06-02 23:41:37] [INFO ] Invariant cache hit.
[2024-06-02 23:41:37] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-02 23:41:37] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2024-06-02 23:41:37] [INFO ] Redundant transitions in 8 ms returned []
[2024-06-02 23:41:37] [INFO ] Flow matrix only has 444 transitions (discarded 17 similar events)
[2024-06-02 23:41:37] [INFO ] Invariant cache hit.
[2024-06-02 23:41:37] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 655 ms. Remains : 166/166 places, 461/461 transitions.
Graph (trivial) has 108 edges and 166 vertex of which 29 / 166 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions removed 75 transitions
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 128 transitions.
Graph (complete) has 626 edges and 141 vertex of which 138 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 7 place count 133 transition count 328
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 133 transition count 328
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 133 transition count 322
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 38 place count 133 transition count 302
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 133 transition count 298
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 46 place count 129 transition count 298
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 55 place count 129 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 129 transition count 297
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 128 transition count 296
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 128 transition count 296
Applied a total of 58 rules in 20 ms. Remains 128 /166 variables (removed 38) and now considering 296/461 (removed 165) transitions.
Running SMT prover for 1 properties.
[2024-06-02 23:41:37] [INFO ] Flow matrix only has 292 transitions (discarded 4 similar events)
// Phase 1: matrix 292 rows 128 cols
[2024-06-02 23:41:37] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:41:37] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:41:37] [INFO ] After 61ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 23:41:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-06-02 23:41:37] [INFO ] After 32ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:41:37] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:41:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:41:37] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:37] [INFO ] After 19ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:41:38] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-06-02 23:41:38] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 69 stabilizing places and 75 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 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 424 transition count 731
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 424 transition count 731
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 421 transition count 728
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 421 transition count 728
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 421 transition count 727
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 420 transition count 726
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 419 transition count 725
Applied a total of 31 rules in 20 ms. Remains 419 /434 variables (removed 15) and now considering 725/771 (removed 46) transitions.
// Phase 1: matrix 725 rows 419 cols
[2024-06-02 23:41:38] [INFO ] Computed 10 invariants in 11 ms
[2024-06-02 23:41:38] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-02 23:41:38] [INFO ] Invariant cache hit.
[2024-06-02 23:41:39] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-06-02 23:41:39] [INFO ] Invariant cache hit.
[2024-06-02 23:41:39] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 419/434 places, 725/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 836 ms. Remains : 419/434 places, 725/771 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 207 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-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 s336 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-19-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-00 finished in 1096 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((p0&&(p1 U (p2||G(p1)))))))'
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 423 transition count 730
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 423 transition count 730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 420 transition count 727
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 420 transition count 727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 419 transition count 725
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 418 transition count 724
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 418 transition count 724
Applied a total of 33 rules in 26 ms. Remains 418 /434 variables (removed 16) and now considering 724/771 (removed 47) transitions.
// Phase 1: matrix 724 rows 418 cols
[2024-06-02 23:41:39] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 23:41:39] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-02 23:41:39] [INFO ] Invariant cache hit.
[2024-06-02 23:41:40] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2024-06-02 23:41:40] [INFO ] Invariant cache hit.
[2024-06-02 23:41:40] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 418/434 places, 724/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 787 ms. Remains : 418/434 places, 724/771 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FireWire-PT-19-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(AND (NOT (AND (EQ s34 1) (EQ s375 1))) (NEQ s354 1)), p1:(NEQ s354 1), p0:(OR (EQ s23 0) (EQ s86 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 359 ms.
Product exploration explored 100000 steps with 33333 reset in 302 ms.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-19-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-19-LTLFireability-01 finished in 1689 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((X(X(X(X(X(F(p1))))))&&p0))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 423 transition count 730
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 423 transition count 730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 420 transition count 727
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 420 transition count 727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 419 transition count 725
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 418 transition count 724
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 418 transition count 724
Applied a total of 33 rules in 26 ms. Remains 418 /434 variables (removed 16) and now considering 724/771 (removed 47) transitions.
[2024-06-02 23:41:41] [INFO ] Invariant cache hit.
[2024-06-02 23:41:41] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 23:41:41] [INFO ] Invariant cache hit.
[2024-06-02 23:41:41] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2024-06-02 23:41:41] [INFO ] Invariant cache hit.
[2024-06-02 23:41:41] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 418/434 places, 724/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 686 ms. Remains : 418/434 places, 724/771 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=1, aps=[p0:(AND (EQ s43 1) (EQ s124 1)), p1:(AND (EQ s344 1) (EQ s391 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, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-19-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-02 finished in 987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(G(!p1)||(!p1&&F(p2)))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 425 transition count 761
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 425 transition count 761
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 422 transition count 758
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 422 transition count 758
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 422 transition count 757
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 421 transition count 756
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 421 transition count 756
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 420 transition count 755
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 420 transition count 755
Applied a total of 29 rules in 31 ms. Remains 420 /434 variables (removed 14) and now considering 755/771 (removed 16) transitions.
// Phase 1: matrix 755 rows 420 cols
[2024-06-02 23:41:42] [INFO ] Computed 10 invariants in 9 ms
[2024-06-02 23:41:42] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 23:41:42] [INFO ] Invariant cache hit.
[2024-06-02 23:41:42] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-06-02 23:41:42] [INFO ] Invariant cache hit.
[2024-06-02 23:41:42] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 420/434 places, 755/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 768 ms. Remains : 420/434 places, 755/771 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) p1), true, (NOT p0), (AND (NOT p2) p1), (NOT p2)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s146 1) (AND (EQ s39 1) (EQ s209 1))), p2:(NEQ s146 1), p0:(EQ s226 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 97 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-04 finished in 978 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 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 336 edges and 434 vertex of which 18 / 434 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 418 transition count 675
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 84 rules applied. Total rules applied 164 place count 339 transition count 670
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 166 place count 337 transition count 670
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 166 place count 337 transition count 630
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 246 place count 297 transition count 630
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 251 place count 292 transition count 566
Iterating global reduction 3 with 5 rules applied. Total rules applied 256 place count 292 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 257 place count 292 transition count 565
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 257 place count 292 transition count 563
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 261 place count 290 transition count 563
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 262 place count 289 transition count 562
Iterating global reduction 4 with 1 rules applied. Total rules applied 263 place count 289 transition count 562
Ensure Unique test 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 4 with 2 rules applied. Total rules applied 265 place count 289 transition count 560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 266 place count 288 transition count 560
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 356 place count 243 transition count 515
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -148
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 452 place count 195 transition count 663
Drop transitions removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 6 with 59 rules applied. Total rules applied 511 place count 195 transition count 604
Applied a total of 511 rules in 82 ms. Remains 195 /434 variables (removed 239) and now considering 604/771 (removed 167) transitions.
[2024-06-02 23:41:43] [INFO ] Flow matrix only has 579 transitions (discarded 25 similar events)
// Phase 1: matrix 579 rows 195 cols
[2024-06-02 23:41:43] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:41:43] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 23:41:43] [INFO ] Flow matrix only has 579 transitions (discarded 25 similar events)
[2024-06-02 23:41:43] [INFO ] Invariant cache hit.
[2024-06-02 23:41:43] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 23:41:43] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-06-02 23:41:43] [INFO ] Redundant transitions in 58 ms returned []
[2024-06-02 23:41:43] [INFO ] Flow matrix only has 579 transitions (discarded 25 similar events)
[2024-06-02 23:41:43] [INFO ] Invariant cache hit.
[2024-06-02 23:41:43] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 195/434 places, 604/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 761 ms. Remains : 195/434 places, 604/771 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-06 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 s66 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 FireWire-PT-19-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-06 finished in 823 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((F(p0)&&F(G(p1))))&&(p2||G(p3)))))'
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 423 transition count 730
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 423 transition count 730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 420 transition count 727
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 420 transition count 727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 419 transition count 725
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 418 transition count 724
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 418 transition count 724
Applied a total of 33 rules in 30 ms. Remains 418 /434 variables (removed 16) and now considering 724/771 (removed 47) transitions.
// Phase 1: matrix 724 rows 418 cols
[2024-06-02 23:41:44] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:41:44] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-02 23:41:44] [INFO ] Invariant cache hit.
[2024-06-02 23:41:44] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2024-06-02 23:41:44] [INFO ] Invariant cache hit.
[2024-06-02 23:41:44] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 418/434 places, 724/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 756 ms. Remains : 418/434 places, 724/771 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (OR (NOT p0) (NOT p1)), (NOT p3), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=true, acceptance={} source=3 dest: 6}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 6}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s327 1), p3:(EQ s97 1), p0:(EQ s219 1), p1:(AND (EQ s34 1) (EQ s226 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-07 finished in 1067 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((p0||(F(p0)&&(p1||F(p2))))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 330 edges and 434 vertex of which 18 / 434 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 418 transition count 679
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 80 rules applied. Total rules applied 156 place count 343 transition count 674
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 159 place count 341 transition count 673
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 340 transition count 673
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 160 place count 340 transition count 633
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 240 place count 300 transition count 633
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 244 place count 296 transition count 599
Iterating global reduction 4 with 4 rules applied. Total rules applied 248 place count 296 transition count 599
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 248 place count 296 transition count 597
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 252 place count 294 transition count 597
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 253 place count 293 transition count 596
Iterating global reduction 4 with 1 rules applied. Total rules applied 254 place count 293 transition count 596
Ensure Unique test 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 4 with 2 rules applied. Total rules applied 256 place count 293 transition count 594
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 257 place count 292 transition count 594
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 345 place count 248 transition count 550
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -189
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 94 rules applied. Total rules applied 439 place count 201 transition count 739
Drop transitions removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 6 with 84 rules applied. Total rules applied 523 place count 201 transition count 655
Applied a total of 523 rules in 65 ms. Remains 201 /434 variables (removed 233) and now considering 655/771 (removed 116) transitions.
[2024-06-02 23:41:45] [INFO ] Flow matrix only has 624 transitions (discarded 31 similar events)
// Phase 1: matrix 624 rows 201 cols
[2024-06-02 23:41:45] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:41:45] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 23:41:45] [INFO ] Flow matrix only has 624 transitions (discarded 31 similar events)
[2024-06-02 23:41:45] [INFO ] Invariant cache hit.
[2024-06-02 23:41:45] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 23:41:45] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2024-06-02 23:41:45] [INFO ] Redundant transitions in 54 ms returned []
[2024-06-02 23:41:45] [INFO ] Flow matrix only has 624 transitions (discarded 31 similar events)
[2024-06-02 23:41:45] [INFO ] Invariant cache hit.
[2024-06-02 23:41:45] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/434 places, 655/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 864 ms. Remains : 201/434 places, 655/771 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-08 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) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s162 1), p1:(EQ s41 1), p2:(AND (EQ s13 1) (EQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-08 finished in 999 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) U p1)) U p2) U G(!p3)))'
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 337 edges and 434 vertex of which 18 / 434 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 418 transition count 675
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 84 rules applied. Total rules applied 164 place count 339 transition count 670
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 166 place count 337 transition count 670
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 166 place count 337 transition count 629
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 248 place count 296 transition count 629
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 251 place count 293 transition count 597
Iterating global reduction 3 with 3 rules applied. Total rules applied 254 place count 293 transition count 597
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 254 place count 293 transition count 595
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 258 place count 291 transition count 595
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 290 transition count 594
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 290 transition count 594
Ensure Unique test 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 3 with 2 rules applied. Total rules applied 262 place count 290 transition count 592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 263 place count 289 transition count 592
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 353 place count 244 transition count 547
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -193
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 447 place count 197 transition count 740
Drop transitions removed 87 transitions
Redundant transition composition rules discarded 87 transitions
Iterating global reduction 5 with 87 rules applied. Total rules applied 534 place count 197 transition count 653
Applied a total of 534 rules in 54 ms. Remains 197 /434 variables (removed 237) and now considering 653/771 (removed 118) transitions.
[2024-06-02 23:41:46] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
// Phase 1: matrix 620 rows 197 cols
[2024-06-02 23:41:46] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:41:46] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 23:41:46] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-02 23:41:46] [INFO ] Invariant cache hit.
[2024-06-02 23:41:46] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 23:41:46] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2024-06-02 23:41:46] [INFO ] Redundant transitions in 51 ms returned []
[2024-06-02 23:41:46] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-02 23:41:46] [INFO ] Invariant cache hit.
[2024-06-02 23:41:46] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 197/434 places, 653/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 799 ms. Remains : 197/434 places, 653/771 transitions.
Stuttering acceptance computed with spot in 366 ms :[p3, (NOT p0), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=p3, acceptance={0} source=0 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p3 p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=(AND p3 p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p3 p2), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(OR (AND (EQ s13 1) (EQ s39 1)) (AND (EQ s15 1) (EQ s87 1))), p2:(AND (EQ s13 1) (EQ s39 1)), p1:(AND (EQ s15 1) (EQ s87 1)), p0:(AND (EQ s15 1) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 39930 reset in 468 ms.
Product exploration explored 100000 steps with 39963 reset in 497 ms.
Computed a total of 7 stabilizing places and 39 stable transitions
Computed a total of 7 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 p2))), (X (NOT (AND (NOT p3) p2))), (X (NOT p3)), (X (NOT (AND p3 (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p3 p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0)))), (X (NOT (AND p3 p1 (NOT p0)))), (X (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))), (X (NOT p1)), (X (NOT p2)), (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT (AND p3 (NOT p2)))), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND p3 p2 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 p1 (NOT p0))))), true, (X (X (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 40 factoid took 168 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 7 states, 25 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 287 ms :[p3, (NOT p0), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Incomplete random walk after 10000 steps, including 616 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Interrupted probabilistic random walk after 295364 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{0=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 12=1}
Probabilistic random walk after 295364 steps, saw 93908 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :10
Running SMT prover for 9 properties.
[2024-06-02 23:41:52] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-02 23:41:52] [INFO ] Invariant cache hit.
[2024-06-02 23:41:52] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:41:52] [INFO ] After 123ms SMT Verify possible using state equation in real domain returned unsat :5 sat :1 real:3
[2024-06-02 23:41:52] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 23:41:52] [INFO ] After 43ms SMT Verify possible using 69 Read/Feed constraints in real domain returned unsat :5 sat :0 real:4
[2024-06-02 23:41:52] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:4
[2024-06-02 23:41:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:41:52] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :4
[2024-06-02 23:41:52] [INFO ] After 150ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :5 sat :4
[2024-06-02 23:41:52] [INFO ] After 311ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :4
Attempting to minimize the solution found.
Minimization took 105 ms.
[2024-06-02 23:41:52] [INFO ] After 720ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :4
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 653/653 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 197 transition count 650
Free-agglomeration rule applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 33 place count 197 transition count 620
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 72 place count 167 transition count 611
Drop transitions removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 157 place count 167 transition count 526
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 163 place count 167 transition count 526
Applied a total of 163 rules in 49 ms. Remains 167 /197 variables (removed 30) and now considering 526/653 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 167/197 places, 526/653 transitions.
Finished random walk after 1986 steps, including 73 resets, run visited all 4 properties in 33 ms. (steps per millisecond=60 )
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 p2))), (X (NOT (AND (NOT p3) p2))), (X (NOT p3)), (X (NOT (AND p3 (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p3 p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0)))), (X (NOT (AND p3 p1 (NOT p0)))), (X (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))), (X (NOT p1)), (X (NOT p2)), (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT (AND p3 (NOT p2)))), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND p3 p2 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 p1 (NOT p0))))), true, (X (X (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p3) p1 (NOT p0)))), (G (NOT (AND p2 (NOT p3)))), (G (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p2) p3 (NOT p1)))), (G (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (F (AND p2 p3 (NOT p1))), (F (AND (NOT p2) p3)), (F (AND p2 p3 (NOT p1) (NOT p0))), (F p0), (F (AND p3 p1 (NOT p0))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F (AND p2 p3)), (F p2), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 45 factoid took 715 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 7 states, 22 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 309 ms :[(OR p3 (AND (NOT p1) p2) (AND (NOT p0) p1)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Stuttering acceptance computed with spot in 330 ms :[(OR p3 (AND (NOT p1) p2) (AND (NOT p0) p1)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 653/653 transitions.
Applied a total of 0 rules in 7 ms. Remains 197 /197 variables (removed 0) and now considering 653/653 (removed 0) transitions.
[2024-06-02 23:41:54] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-02 23:41:54] [INFO ] Invariant cache hit.
[2024-06-02 23:41:54] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 23:41:54] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-02 23:41:54] [INFO ] Invariant cache hit.
[2024-06-02 23:41:54] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 23:41:54] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-06-02 23:41:55] [INFO ] Redundant transitions in 56 ms returned []
[2024-06-02 23:41:55] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-02 23:41:55] [INFO ] Invariant cache hit.
[2024-06-02 23:41:55] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 771 ms. Remains : 197/197 places, 653/653 transitions.
Computed a total of 7 stabilizing places and 39 stable transitions
Computed a total of 7 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR (AND (NOT p2) p3) (AND p2 (NOT p3))))), (X (NOT (AND (NOT p2) p3))), (X (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))), (X (OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1)))), (X (NOT (AND p2 p3 (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p3 (NOT p1) (NOT p0)) (AND p2 (NOT p3) (NOT p0)) (AND (NOT p3) p1 (NOT p0))))), (X (NOT (AND p2 p3 (NOT p1)))), (X (OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p0)))), (X (NOT p3)), (X (NOT (AND p2 p3))), (X (NOT (AND p3 p1 (NOT p0)))), (X (AND (NOT p2) (NOT p3))), (X (NOT p1)), (X (NOT p2)), (X (NOT (OR (AND (NOT p2) p3 (NOT p1)) (AND p2 (NOT p3) (NOT p1))))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (OR (AND (NOT p2) p3) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (X (X (OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) p3 (NOT p1) (NOT p0)) (AND p2 (NOT p3) (NOT p0)) (AND (NOT p3) p1 (NOT p0)))))), (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p3 p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p3)))), true, (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p2) p3 (NOT p1)) (AND p2 (NOT p3) (NOT p1)))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 203 ms. Reduced automaton from 7 states, 22 edges and 4 AP (stutter insensitive) to 7 states, 22 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 302 ms :[(OR p3 (AND (NOT p1) p2) (AND (NOT p0) p1)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Incomplete random walk after 10000 steps, including 608 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 405512 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{0=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 13=1}
Probabilistic random walk after 405512 steps, saw 124638 distinct states, run finished after 3002 ms. (steps per millisecond=135 ) properties seen :11
Running SMT prover for 6 properties.
[2024-06-02 23:41:59] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-02 23:41:59] [INFO ] Invariant cache hit.
[2024-06-02 23:41:59] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:41:59] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2024-06-02 23:41:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:41:59] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-06-02 23:41:59] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 23:41:59] [INFO ] After 156ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2024-06-02 23:41:59] [INFO ] After 299ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 108 ms.
[2024-06-02 23:41:59] [INFO ] After 707ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 653/653 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 197 transition count 650
Free-agglomeration rule applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 33 place count 197 transition count 620
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 72 place count 167 transition count 611
Drop transitions removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 157 place count 167 transition count 526
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 163 place count 167 transition count 526
Applied a total of 163 rules in 30 ms. Remains 167 /197 variables (removed 30) and now considering 526/653 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 167/197 places, 526/653 transitions.
Finished random walk after 3108 steps, including 133 resets, run visited all 4 properties in 38 ms. (steps per millisecond=81 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR (AND (NOT p2) p3) (AND p2 (NOT p3))))), (X (NOT (AND (NOT p2) p3))), (X (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))), (X (OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1)))), (X (NOT (AND p2 p3 (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p3 (NOT p1) (NOT p0)) (AND p2 (NOT p3) (NOT p0)) (AND (NOT p3) p1 (NOT p0))))), (X (NOT (AND p2 p3 (NOT p1)))), (X (OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p0)))), (X (NOT p3)), (X (NOT (AND p2 p3))), (X (NOT (AND p3 p1 (NOT p0)))), (X (AND (NOT p2) (NOT p3))), (X (NOT p1)), (X (NOT p2)), (X (NOT (OR (AND (NOT p2) p3 (NOT p1)) (AND p2 (NOT p3) (NOT p1))))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (OR (AND (NOT p2) p3) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (X (X (OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) p3 (NOT p1) (NOT p0)) (AND p2 (NOT p3) (NOT p0)) (AND (NOT p3) p1 (NOT p0)))))), (X (X (NOT (AND p2 p3 (NOT p1))))), (X (X (OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p3 p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p3)))), true, (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p2) p3 (NOT p1)) (AND p2 (NOT p3) (NOT p1)))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (G (NOT (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) p2 (NOT p3))))), (G (NOT (OR (AND (NOT p1) (NOT p2) p3 (NOT p0)) (AND p1 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F p1), (F (AND (NOT p2) p3)), (F (AND (NOT p1) p2 p3)), (F (OR (AND (NOT p2) p3) (AND p2 (NOT p3)))), (F (AND (NOT p1) p2 p3 (NOT p0))), (F (AND p1 p3 (NOT p0))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (F p2), (F p3), (F (AND p2 p3)), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0)))))]
Knowledge based reduction with 38 factoid took 912 ms. Reduced automaton from 7 states, 22 edges and 4 AP (stutter insensitive) to 7 states, 22 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 295 ms :[(OR p3 (AND (NOT p0) p1) (AND (NOT p1) p2)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Stuttering acceptance computed with spot in 287 ms :[(OR p3 (AND (NOT p0) p1) (AND (NOT p1) p2)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Stuttering acceptance computed with spot in 279 ms :[(OR p3 (AND (NOT p0) p1) (AND (NOT p1) p2)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Product exploration explored 100000 steps with 39944 reset in 462 ms.
Product exploration explored 100000 steps with 40011 reset in 451 ms.
Built C files in :
/tmp/ltsmin3886493720994590669
[2024-06-02 23:42:02] [INFO ] Computing symmetric may disable matrix : 653 transitions.
[2024-06-02 23:42:02] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:42:02] [INFO ] Computing symmetric may enable matrix : 653 transitions.
[2024-06-02 23:42:02] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:42:02] [INFO ] Computing Do-Not-Accords matrix : 653 transitions.
[2024-06-02 23:42:02] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:42:02] [INFO ] Built C files in 133ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3886493720994590669
Running compilation step : cd /tmp/ltsmin3886493720994590669;'/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 1574 ms.
Running link step : cd /tmp/ltsmin3886493720994590669;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin3886493720994590669;'/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/stateBased12600734283897317029.hoa' '--buchi-type=spotba'
LTSmin run took 3467 ms.
FORMULA FireWire-PT-19-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-19-LTLFireability-09 finished in 21824 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)||(G((p2||X(X(p3))))&&p1))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 424 transition count 731
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 424 transition count 731
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 422 transition count 729
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 422 transition count 729
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 421 transition count 728
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 421 transition count 728
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 420 transition count 727
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 420 transition count 727
Applied a total of 28 rules in 20 ms. Remains 420 /434 variables (removed 14) and now considering 727/771 (removed 44) transitions.
// Phase 1: matrix 727 rows 420 cols
[2024-06-02 23:42:07] [INFO ] Computed 10 invariants in 8 ms
[2024-06-02 23:42:08] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-02 23:42:08] [INFO ] Invariant cache hit.
[2024-06-02 23:42:08] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-06-02 23:42:08] [INFO ] Invariant cache hit.
[2024-06-02 23:42:08] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 420/434 places, 727/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 755 ms. Remains : 420/434 places, 727/771 transitions.
Stuttering acceptance computed with spot in 344 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p0), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : FireWire-PT-19-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 6}, { cond=(AND p0 p1), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 8}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 8}, { cond=p0, acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(NOT p3), acceptance={} source=8 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=9 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=9 dest: 3}]], initial=0, aps=[p0:(EQ s201 1), p1:(AND (EQ s42 0) (EQ s17 1) (EQ s123 1)), p2:(EQ s42 1), p3:(AND (EQ s17 1) (EQ s123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-10 finished in 1122 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((!p0&&X(!p0))) U p1))'
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 337 edges and 434 vertex of which 18 / 434 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 418 transition count 677
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 82 rules applied. Total rules applied 160 place count 341 transition count 672
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 339 transition count 672
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 162 place count 339 transition count 631
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 244 place count 298 transition count 631
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 249 place count 293 transition count 567
Iterating global reduction 3 with 5 rules applied. Total rules applied 254 place count 293 transition count 567
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 255 place count 293 transition count 566
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 255 place count 293 transition count 564
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 259 place count 291 transition count 564
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 260 place count 290 transition count 563
Iterating global reduction 4 with 1 rules applied. Total rules applied 261 place count 290 transition count 563
Ensure Unique test 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 4 with 2 rules applied. Total rules applied 263 place count 290 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 264 place count 289 transition count 561
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 354 place count 244 transition count 516
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -140
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 450 place count 196 transition count 656
Drop transitions removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 6 with 59 rules applied. Total rules applied 509 place count 196 transition count 597
Applied a total of 509 rules in 47 ms. Remains 196 /434 variables (removed 238) and now considering 597/771 (removed 174) transitions.
[2024-06-02 23:42:09] [INFO ] Flow matrix only has 570 transitions (discarded 27 similar events)
// Phase 1: matrix 570 rows 196 cols
[2024-06-02 23:42:09] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:42:09] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-02 23:42:09] [INFO ] Flow matrix only has 570 transitions (discarded 27 similar events)
[2024-06-02 23:42:09] [INFO ] Invariant cache hit.
[2024-06-02 23:42:09] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 23:42:09] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2024-06-02 23:42:09] [INFO ] Redundant transitions in 63 ms returned []
[2024-06-02 23:42:09] [INFO ] Flow matrix only has 570 transitions (discarded 27 similar events)
[2024-06-02 23:42:09] [INFO ] Invariant cache hit.
[2024-06-02 23:42:09] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 196/434 places, 597/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 855 ms. Remains : 196/434 places, 597/771 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), true, p0]
Running random walk in product with property : FireWire-PT-19-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s77 1), p0:(AND (EQ s14 1) (EQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-11 finished in 938 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((F(G(p0)) U p1)))))'
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 424 transition count 731
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 424 transition count 731
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 421 transition count 728
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 421 transition count 728
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 421 transition count 727
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 420 transition count 726
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 419 transition count 725
Applied a total of 31 rules in 21 ms. Remains 419 /434 variables (removed 15) and now considering 725/771 (removed 46) transitions.
// Phase 1: matrix 725 rows 419 cols
[2024-06-02 23:42:09] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:42:10] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-02 23:42:10] [INFO ] Invariant cache hit.
[2024-06-02 23:42:10] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2024-06-02 23:42:10] [INFO ] Invariant cache hit.
[2024-06-02 23:42:10] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 419/434 places, 725/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 735 ms. Remains : 419/434 places, 725/771 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s23 1) (EQ s227 1)), p0:(EQ s22 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]]
Stuttering criterion allowed to conclude after 133 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-12 finished in 927 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((X(G(p0))&&G((p1&&(p2 U p3))))))'
Support contains 6 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 331 edges and 434 vertex of which 18 / 434 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 418 transition count 678
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 80 rules applied. Total rules applied 157 place count 342 transition count 674
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 159 place count 340 transition count 674
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 159 place count 340 transition count 634
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 239 place count 300 transition count 634
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 244 place count 295 transition count 570
Iterating global reduction 3 with 5 rules applied. Total rules applied 249 place count 295 transition count 570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 250 place count 295 transition count 569
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 250 place count 295 transition count 567
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 254 place count 293 transition count 567
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 255 place count 292 transition count 566
Iterating global reduction 4 with 1 rules applied. Total rules applied 256 place count 292 transition count 566
Ensure Unique test 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 4 with 2 rules applied. Total rules applied 258 place count 292 transition count 564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 259 place count 291 transition count 564
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 349 place count 246 transition count 519
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -152
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 6 with 92 rules applied. Total rules applied 441 place count 200 transition count 671
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 6 with 57 rules applied. Total rules applied 498 place count 200 transition count 614
Applied a total of 498 rules in 43 ms. Remains 200 /434 variables (removed 234) and now considering 614/771 (removed 157) transitions.
[2024-06-02 23:42:10] [INFO ] Flow matrix only has 587 transitions (discarded 27 similar events)
// Phase 1: matrix 587 rows 200 cols
[2024-06-02 23:42:10] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:42:11] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 23:42:11] [INFO ] Flow matrix only has 587 transitions (discarded 27 similar events)
[2024-06-02 23:42:11] [INFO ] Invariant cache hit.
[2024-06-02 23:42:11] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-02 23:42:11] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-06-02 23:42:11] [INFO ] Redundant transitions in 68 ms returned []
[2024-06-02 23:42:11] [INFO ] Flow matrix only has 587 transitions (discarded 27 similar events)
[2024-06-02 23:42:11] [INFO ] Invariant cache hit.
[2024-06-02 23:42:11] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/434 places, 614/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 870 ms. Remains : 200/434 places, 614/771 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p3) (NOT p0)), (NOT p0), (NOT p3), (OR (NOT p1) (NOT p3))]
Running random walk in product with property : FireWire-PT-19-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p1 (NOT p3) p2), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={1} source=0 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={0, 1} source=1 dest: 2}, { cond=(OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0))), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=2 dest: 2}], [{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p1 (NOT p3) p2), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s140 0), p3:(AND (EQ s9 1) (EQ s47 1)), p2:(NEQ s44 1), p0:(AND (EQ s12 1) (EQ s102 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-14 finished in 1132 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(F((G(F(((!p0&&X(p1)) U (G((!p0&&X(p1)))||(!p0&&X((p1&&X(p2))))))))||(X(p1)&&F(((!p0&&X(p1)) U (G((!p0&&X(p1)))||(!p0&&X((p1&&X(p2)))))))))))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 425 transition count 761
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 425 transition count 761
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 422 transition count 758
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 422 transition count 758
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 422 transition count 757
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 421 transition count 756
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 421 transition count 756
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 420 transition count 755
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 420 transition count 755
Applied a total of 29 rules in 24 ms. Remains 420 /434 variables (removed 14) and now considering 755/771 (removed 16) transitions.
// Phase 1: matrix 755 rows 420 cols
[2024-06-02 23:42:12] [INFO ] Computed 10 invariants in 8 ms
[2024-06-02 23:42:12] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-02 23:42:12] [INFO ] Invariant cache hit.
[2024-06-02 23:42:12] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2024-06-02 23:42:12] [INFO ] Invariant cache hit.
[2024-06-02 23:42:12] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 420/434 places, 755/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 768 ms. Remains : 420/434 places, 755/771 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 p1 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : FireWire-PT-19-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 6}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=6 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 4}]], initial=0, aps=[p0:(AND (EQ s32 1) (EQ s339 1)), p1:(NEQ s302 1), p2:(NEQ s91 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22253 reset in 223 ms.
Product exploration explored 100000 steps with 22235 reset in 267 ms.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 p1 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 488953 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 488953 steps, saw 87927 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 11 properties.
[2024-06-02 23:42:18] [INFO ] Invariant cache hit.
[2024-06-02 23:42:18] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:42:19] [INFO ] After 453ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:9
[2024-06-02 23:42:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:42:19] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2024-06-02 23:42:20] [INFO ] After 834ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 253 ms.
[2024-06-02 23:42:20] [INFO ] After 1240ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 41 ms.
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 755/755 transitions.
Graph (trivial) has 320 edges and 420 vertex of which 18 / 420 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 405 transition count 663
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 76 rules applied. Total rules applied 147 place count 335 transition count 657
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 150 place count 332 transition count 657
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 150 place count 332 transition count 610
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 244 place count 285 transition count 610
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 245 place count 284 transition count 580
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 284 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 284 transition count 579
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 327 place count 244 transition count 539
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -162
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 415 place count 200 transition count 701
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 424 place count 200 transition count 692
Drop transitions removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 5 with 75 rules applied. Total rules applied 499 place count 200 transition count 617
Free-agglomeration rule applied 32 times.
Iterating global reduction 5 with 32 rules applied. Total rules applied 531 place count 200 transition count 585
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 18 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 5 with 86 rules applied. Total rules applied 617 place count 168 transition count 531
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 6 with 45 rules applied. Total rules applied 662 place count 168 transition count 486
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 665 place count 168 transition count 486
Applied a total of 665 rules in 51 ms. Remains 168 /420 variables (removed 252) and now considering 486/755 (removed 269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 168/420 places, 486/755 transitions.
Incomplete random walk after 10000 steps, including 385 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :7
Finished Best-First random walk after 6820 steps, including 2 resets, run visited all 2 properties in 26 ms. (steps per millisecond=262 )
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0))), (G (NOT (AND (NOT p1) p0 (NOT p2)))), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (AND p1 p0)), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F p0), (F (AND (NOT p1) (NOT p0))), (F (AND p1 p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 4 factoid took 314 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 755/755 transitions.
Applied a total of 0 rules in 3 ms. Remains 420 /420 variables (removed 0) and now considering 755/755 (removed 0) transitions.
[2024-06-02 23:42:21] [INFO ] Invariant cache hit.
[2024-06-02 23:42:21] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-02 23:42:21] [INFO ] Invariant cache hit.
[2024-06-02 23:42:21] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2024-06-02 23:42:21] [INFO ] Invariant cache hit.
[2024-06-02 23:42:22] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 780 ms. Remains : 420/420 places, 755/755 transitions.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 596280 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 596280 steps, saw 105643 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 7 properties.
[2024-06-02 23:42:26] [INFO ] Invariant cache hit.
[2024-06-02 23:42:26] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:42:26] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 23:42:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:42:27] [INFO ] After 394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-02 23:42:27] [INFO ] After 716ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 205 ms.
[2024-06-02 23:42:28] [INFO ] After 1062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 40 ms.
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 755/755 transitions.
Graph (trivial) has 320 edges and 420 vertex of which 18 / 420 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 405 transition count 663
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 76 rules applied. Total rules applied 147 place count 335 transition count 657
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 150 place count 332 transition count 657
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 150 place count 332 transition count 610
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 244 place count 285 transition count 610
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 245 place count 284 transition count 580
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 284 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 284 transition count 579
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 327 place count 244 transition count 539
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -162
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 415 place count 200 transition count 701
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 424 place count 200 transition count 692
Drop transitions removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 5 with 75 rules applied. Total rules applied 499 place count 200 transition count 617
Free-agglomeration rule applied 32 times.
Iterating global reduction 5 with 32 rules applied. Total rules applied 531 place count 200 transition count 585
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 18 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 5 with 86 rules applied. Total rules applied 617 place count 168 transition count 531
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 6 with 45 rules applied. Total rules applied 662 place count 168 transition count 486
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 665 place count 168 transition count 486
Applied a total of 665 rules in 52 ms. Remains 168 /420 variables (removed 252) and now considering 486/755 (removed 269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 168/420 places, 486/755 transitions.
Incomplete random walk after 10000 steps, including 411 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :6
Finished Best-First random walk after 738 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=369 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F p0), (F (NOT (AND p1 (NOT p0)))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 239 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Product exploration explored 100000 steps with 22230 reset in 238 ms.
Product exploration explored 100000 steps with 22232 reset in 246 ms.
Built C files in :
/tmp/ltsmin12091084490811033811
[2024-06-02 23:42:30] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12091084490811033811
Running compilation step : cd /tmp/ltsmin12091084490811033811;'/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 1142 ms.
Running link step : cd /tmp/ltsmin12091084490811033811;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12091084490811033811;'/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/stateBased13893771469652299619.hoa' '--buchi-type=spotba'
LTSmin run took 113 ms.
FORMULA FireWire-PT-19-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-19-LTLFireability-15 finished in 19411 ms.
All properties solved by simple procedures.
Total runtime 82753 ms.

BK_STOP 1717371752484

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-19"
export BK_EXAMINATION="LTLFireability"
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-19, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r571-tall-171734910400198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-19.tgz
mv FireWire-PT-19 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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