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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 90K 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-15-LTLFireability-00
FORMULA_NAME FireWire-PT-15-LTLFireability-01
FORMULA_NAME FireWire-PT-15-LTLFireability-02
FORMULA_NAME FireWire-PT-15-LTLFireability-03
FORMULA_NAME FireWire-PT-15-LTLFireability-04
FORMULA_NAME FireWire-PT-15-LTLFireability-05
FORMULA_NAME FireWire-PT-15-LTLFireability-06
FORMULA_NAME FireWire-PT-15-LTLFireability-07
FORMULA_NAME FireWire-PT-15-LTLFireability-08
FORMULA_NAME FireWire-PT-15-LTLFireability-09
FORMULA_NAME FireWire-PT-15-LTLFireability-10
FORMULA_NAME FireWire-PT-15-LTLFireability-11
FORMULA_NAME FireWire-PT-15-LTLFireability-12
FORMULA_NAME FireWire-PT-15-LTLFireability-13
FORMULA_NAME FireWire-PT-15-LTLFireability-14
FORMULA_NAME FireWire-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717370362937

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-15
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 23:19:24] [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:19:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:19:24] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-06-02 23:19:24] [INFO ] Transformed 248 places.
[2024-06-02 23:19:24] [INFO ] Transformed 383 transitions.
[2024-06-02 23:19:24] [INFO ] Found NUPN structural information;
[2024-06-02 23:19:24] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA FireWire-PT-15-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 383/383 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 243 transition count 383
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 65 place count 183 transition count 323
Iterating global reduction 1 with 60 rules applied. Total rules applied 125 place count 183 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 183 transition count 322
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 136 place count 173 transition count 298
Iterating global reduction 2 with 10 rules applied. Total rules applied 146 place count 173 transition count 298
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 149 place count 170 transition count 294
Iterating global reduction 2 with 3 rules applied. Total rules applied 152 place count 170 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 153 place count 170 transition count 293
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 154 place count 169 transition count 290
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 169 transition count 290
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 168 transition count 288
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 168 transition count 288
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 158 place count 167 transition count 285
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 167 transition count 285
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 160 place count 166 transition count 283
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 166 transition count 283
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 162 place count 165 transition count 280
Iterating global reduction 3 with 1 rules applied. Total rules applied 163 place count 165 transition count 280
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 164 place count 164 transition count 278
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 164 transition count 278
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 166 place count 163 transition count 275
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 163 transition count 275
Applied a total of 167 rules in 69 ms. Remains 163 /248 variables (removed 85) and now considering 275/383 (removed 108) transitions.
// Phase 1: matrix 275 rows 163 cols
[2024-06-02 23:19:25] [INFO ] Computed 4 invariants in 12 ms
[2024-06-02 23:19:25] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-06-02 23:19:25] [INFO ] Invariant cache hit.
[2024-06-02 23:19:25] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2024-06-02 23:19:25] [INFO ] Invariant cache hit.
[2024-06-02 23:19:25] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 163/248 places, 275/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 790 ms. Remains : 163/248 places, 275/383 transitions.
Support contains 30 out of 163 places after structural reductions.
[2024-06-02 23:19:25] [INFO ] Flatten gal took : 51 ms
[2024-06-02 23:19:25] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:19:25] [INFO ] Input system was already deterministic with 275 transitions.
Support contains 28 out of 163 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 25) seen :3
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1000 steps, including 4 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 2 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 2 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 2 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 2 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 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2024-06-02 23:19:26] [INFO ] Invariant cache hit.
[2024-06-02 23:19:26] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-02 23:19:26] [INFO ] After 126ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:19
[2024-06-02 23:19:26] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 5 ms to minimize.
[2024-06-02 23:19:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-06-02 23:19:26] [INFO ] After 251ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:20
[2024-06-02 23:19:26] [INFO ] After 434ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:20
[2024-06-02 23:19:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 23:19:27] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :20
[2024-06-02 23:19:27] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:19:27] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:19:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2024-06-02 23:19:27] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:19:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2024-06-02 23:19:28] [INFO ] After 889ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :20
Attempting to minimize the solution found.
Minimization took 197 ms.
[2024-06-02 23:19:28] [INFO ] After 1488ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :20
Fused 21 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 78 ms.
Support contains 23 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 275/275 transitions.
Graph (trivial) has 88 edges and 163 vertex of which 11 / 163 are part of one of the 3 SCC in 2 ms
Free SCC test removed 8 places
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 155 transition count 249
Reduce places removed 13 places and 0 transitions.
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 1 with 15 rules applied. Total rules applied 29 place count 142 transition count 247
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 141 transition count 245
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 34 place count 139 transition count 245
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 34 place count 139 transition count 232
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 60 place count 126 transition count 232
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 125 transition count 231
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 125 transition count 231
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 86 place count 113 transition count 219
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 102 place count 105 transition count 257
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 105 transition count 256
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 109 place count 105 transition count 250
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 115 place count 99 transition count 250
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 116 place count 98 transition count 249
Iterating global reduction 5 with 1 rules applied. Total rules applied 117 place count 98 transition count 249
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 122 place count 98 transition count 249
Applied a total of 122 rules in 64 ms. Remains 98 /163 variables (removed 65) and now considering 249/275 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 98/163 places, 249/275 transitions.
Incomplete random walk after 10000 steps, including 722 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 31 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 30 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 30 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 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 30 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 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 27 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 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 27 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 27 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Finished probabilistic random walk after 70404 steps, run visited all 20 properties in 252 ms. (steps per millisecond=279 )
Probabilistic random walk after 70404 steps, saw 19824 distinct states, run finished after 252 ms. (steps per millisecond=279 ) properties seen :20
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 36 stabilizing places and 51 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' '!(G(F(((p0 U p1)||G(p2)))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 275/275 transitions.
Graph (trivial) has 118 edges and 163 vertex of which 11 / 163 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 154 transition count 246
Reduce places removed 19 places and 0 transitions.
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 1 with 21 rules applied. Total rules applied 41 place count 135 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 134 transition count 244
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 42 place count 134 transition count 229
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 72 place count 119 transition count 229
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 77 place count 114 transition count 205
Iterating global reduction 3 with 5 rules applied. Total rules applied 82 place count 114 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 84 place count 114 transition count 203
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 87 place count 111 transition count 196
Iterating global reduction 4 with 3 rules applied. Total rules applied 90 place count 111 transition count 196
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 110 transition count 194
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 110 transition count 194
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 109 transition count 192
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 109 transition count 192
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 108 transition count 190
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 108 transition count 190
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 116 place count 98 transition count 180
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 148 place count 82 transition count 246
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 162 place count 82 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 163 place count 81 transition count 231
Applied a total of 163 rules in 49 ms. Remains 81 /163 variables (removed 82) and now considering 231/275 (removed 44) transitions.
[2024-06-02 23:19:29] [INFO ] Flow matrix only has 223 transitions (discarded 8 similar events)
// Phase 1: matrix 223 rows 81 cols
[2024-06-02 23:19:29] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:19:29] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 23:19:29] [INFO ] Flow matrix only has 223 transitions (discarded 8 similar events)
[2024-06-02 23:19:29] [INFO ] Invariant cache hit.
[2024-06-02 23:19:29] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 23:19:29] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-06-02 23:19:29] [INFO ] Redundant transitions in 8 ms returned []
[2024-06-02 23:19:29] [INFO ] Flow matrix only has 223 transitions (discarded 8 similar events)
[2024-06-02 23:19:29] [INFO ] Invariant cache hit.
[2024-06-02 23:19:29] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/163 places, 231/275 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 354 ms. Remains : 81/163 places, 231/275 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 189 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FireWire-PT-15-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s80 1), p1:(AND (EQ s23 1) (EQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA FireWire-PT-15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-00 finished in 601 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)&&X(G(p1)))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 275/275 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 156 transition count 249
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 156 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 156 transition count 248
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 154 transition count 243
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 154 transition count 243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 153 transition count 241
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 153 transition count 241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 152 transition count 239
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 152 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 151 transition count 237
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 151 transition count 237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 150 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 150 transition count 236
Applied a total of 27 rules in 19 ms. Remains 150 /163 variables (removed 13) and now considering 236/275 (removed 39) transitions.
// Phase 1: matrix 236 rows 150 cols
[2024-06-02 23:19:30] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 23:19:30] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 23:19:30] [INFO ] Invariant cache hit.
[2024-06-02 23:19:30] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-06-02 23:19:30] [INFO ] Invariant cache hit.
[2024-06-02 23:19:30] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 150/163 places, 236/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 348 ms. Remains : 150/163 places, 236/275 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-15-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(EQ s139 1), p0:(EQ s101 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-02 finished in 536 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(p0)&&X(G(p1))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 275/275 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 157 transition count 251
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 157 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 157 transition count 250
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 155 transition count 246
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 155 transition count 246
Applied a total of 17 rules in 5 ms. Remains 155 /163 variables (removed 8) and now considering 246/275 (removed 29) transitions.
// Phase 1: matrix 246 rows 155 cols
[2024-06-02 23:19:30] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:19:30] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 23:19:30] [INFO ] Invariant cache hit.
[2024-06-02 23:19:30] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-06-02 23:19:30] [INFO ] Invariant cache hit.
[2024-06-02 23:19:30] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/163 places, 246/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 155/163 places, 246/275 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-15-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s18 0) (EQ s123 0)), p0:(AND (EQ s30 1) (EQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 244 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 40 in 0 ms.
FORMULA FireWire-PT-15-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-15-LTLFireability-05 finished in 691 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)||(p1&&X(F(p2))))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 275/275 transitions.
Graph (trivial) has 121 edges and 163 vertex of which 11 / 163 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 154 transition count 247
Reduce places removed 18 places and 0 transitions.
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 1 with 20 rules applied. Total rules applied 39 place count 136 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 135 transition count 245
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 40 place count 135 transition count 230
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 70 place count 120 transition count 230
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 74 place count 116 transition count 216
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 116 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 116 transition count 215
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 81 place count 114 transition count 210
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 114 transition count 210
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 84 place count 113 transition count 208
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 113 transition count 208
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 112 transition count 206
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 112 transition count 206
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 111 transition count 204
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 111 transition count 204
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 113 place count 99 transition count 192
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 114 place count 98 transition count 190
Iterating global reduction 4 with 1 rules applied. Total rules applied 115 place count 98 transition count 190
Performed 16 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 147 place count 82 transition count 269
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 160 place count 82 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 81 transition count 255
Applied a total of 161 rules in 48 ms. Remains 81 /163 variables (removed 82) and now considering 255/275 (removed 20) transitions.
[2024-06-02 23:19:31] [INFO ] Flow matrix only has 246 transitions (discarded 9 similar events)
// Phase 1: matrix 246 rows 81 cols
[2024-06-02 23:19:31] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:19:31] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 23:19:31] [INFO ] Flow matrix only has 246 transitions (discarded 9 similar events)
[2024-06-02 23:19:31] [INFO ] Invariant cache hit.
[2024-06-02 23:19:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:19:31] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-06-02 23:19:31] [INFO ] Redundant transitions in 13 ms returned []
[2024-06-02 23:19:31] [INFO ] Flow matrix only has 246 transitions (discarded 9 similar events)
[2024-06-02 23:19:31] [INFO ] Invariant cache hit.
[2024-06-02 23:19:31] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/163 places, 255/275 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 327 ms. Remains : 81/163 places, 255/275 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s66 1), p1:(OR (EQ s12 0) (EQ s75 0)), p2:(AND (EQ s12 1) (EQ s65 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-15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-06 finished in 563 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(F((p1&&X(p2)))))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 275/275 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 157 transition count 250
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 157 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 157 transition count 249
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 155 transition count 244
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 155 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 154 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 154 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 153 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 153 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 152 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 152 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 151 transition count 237
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 151 transition count 237
Applied a total of 25 rules in 14 ms. Remains 151 /163 variables (removed 12) and now considering 237/275 (removed 38) transitions.
// Phase 1: matrix 237 rows 151 cols
[2024-06-02 23:19:31] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 23:19:31] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 23:19:31] [INFO ] Invariant cache hit.
[2024-06-02 23:19:31] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-06-02 23:19:31] [INFO ] Invariant cache hit.
[2024-06-02 23:19:32] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/163 places, 237/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 151/163 places, 237/275 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FireWire-PT-15-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s138 1), p1:(EQ s128 1), p2:(EQ s138 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 136 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA FireWire-PT-15-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-15-LTLFireability-07 finished in 541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p1)))&&p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 275/275 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 156 transition count 249
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 156 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 156 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 153 transition count 241
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 153 transition count 241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 152 transition count 239
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 152 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 151 transition count 237
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 151 transition count 237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 150 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 150 transition count 235
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 149 transition count 234
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 149 transition count 234
Applied a total of 29 rules in 11 ms. Remains 149 /163 variables (removed 14) and now considering 234/275 (removed 41) transitions.
// Phase 1: matrix 234 rows 149 cols
[2024-06-02 23:19:32] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:19:32] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 23:19:32] [INFO ] Invariant cache hit.
[2024-06-02 23:19:32] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-06-02 23:19:32] [INFO ] Invariant cache hit.
[2024-06-02 23:19:32] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 149/163 places, 234/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 149/163 places, 234/275 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(AND (EQ s135 1) (EQ s142 0)), p1:(NEQ s135 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-08 finished in 445 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 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 275/275 transitions.
Graph (trivial) has 124 edges and 163 vertex of which 11 / 163 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 154 transition count 246
Reduce places removed 19 places and 0 transitions.
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 1 with 21 rules applied. Total rules applied 41 place count 135 transition count 244
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 134 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 44 place count 133 transition count 243
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 44 place count 133 transition count 227
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 76 place count 117 transition count 227
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 81 place count 112 transition count 203
Iterating global reduction 4 with 5 rules applied. Total rules applied 86 place count 112 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 112 transition count 201
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 90 place count 110 transition count 196
Iterating global reduction 5 with 2 rules applied. Total rules applied 92 place count 110 transition count 196
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 93 place count 109 transition count 194
Iterating global reduction 5 with 1 rules applied. Total rules applied 94 place count 109 transition count 194
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 95 place count 108 transition count 192
Iterating global reduction 5 with 1 rules applied. Total rules applied 96 place count 108 transition count 192
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 97 place count 107 transition count 190
Iterating global reduction 5 with 1 rules applied. Total rules applied 98 place count 107 transition count 190
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 122 place count 95 transition count 178
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 156 place count 78 transition count 241
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 169 place count 78 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 170 place count 77 transition count 227
Applied a total of 170 rules in 41 ms. Remains 77 /163 variables (removed 86) and now considering 227/275 (removed 48) transitions.
[2024-06-02 23:19:32] [INFO ] Flow matrix only has 220 transitions (discarded 7 similar events)
// Phase 1: matrix 220 rows 77 cols
[2024-06-02 23:19:32] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:19:32] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-02 23:19:32] [INFO ] Flow matrix only has 220 transitions (discarded 7 similar events)
[2024-06-02 23:19:32] [INFO ] Invariant cache hit.
[2024-06-02 23:19:32] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 23:19:32] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-06-02 23:19:32] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 23:19:32] [INFO ] Flow matrix only has 220 transitions (discarded 7 similar events)
[2024-06-02 23:19:32] [INFO ] Invariant cache hit.
[2024-06-02 23:19:33] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/163 places, 227/275 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 301 ms. Remains : 77/163 places, 227/275 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-15-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s71 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-15-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-09 finished in 354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 275/275 transitions.
Graph (trivial) has 121 edges and 163 vertex of which 11 / 163 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 154 transition count 246
Reduce places removed 19 places and 0 transitions.
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 1 with 21 rules applied. Total rules applied 41 place count 135 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 134 transition count 244
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 42 place count 134 transition count 228
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 74 place count 118 transition count 228
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 79 place count 113 transition count 213
Iterating global reduction 3 with 5 rules applied. Total rules applied 84 place count 113 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 113 transition count 212
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 88 place count 110 transition count 205
Iterating global reduction 4 with 3 rules applied. Total rules applied 91 place count 110 transition count 205
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 92 place count 109 transition count 203
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 109 transition count 203
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 94 place count 108 transition count 201
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 108 transition count 201
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 96 place count 107 transition count 199
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 107 transition count 199
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 119 place count 96 transition count 188
Performed 17 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 153 place count 79 transition count 274
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 168 place count 79 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 169 place count 78 transition count 258
Applied a total of 169 rules in 37 ms. Remains 78 /163 variables (removed 85) and now considering 258/275 (removed 17) transitions.
[2024-06-02 23:19:33] [INFO ] Flow matrix only has 249 transitions (discarded 9 similar events)
// Phase 1: matrix 249 rows 78 cols
[2024-06-02 23:19:33] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:19:33] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 23:19:33] [INFO ] Flow matrix only has 249 transitions (discarded 9 similar events)
[2024-06-02 23:19:33] [INFO ] Invariant cache hit.
[2024-06-02 23:19:33] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:19:33] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-06-02 23:19:33] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 23:19:33] [INFO ] Flow matrix only has 249 transitions (discarded 9 similar events)
[2024-06-02 23:19:33] [INFO ] Invariant cache hit.
[2024-06-02 23:19:33] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/163 places, 258/275 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 311 ms. Remains : 78/163 places, 258/275 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-15-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s12 1) (NEQ s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 139 ms.
Product exploration explored 100000 steps with 1 reset in 79 ms.
Computed a total of 11 stabilizing places and 18 stable transitions
Computed a total of 11 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 760 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 265 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3409 steps, run visited all 1 properties in 9 ms. (steps per millisecond=378 )
Probabilistic random walk after 3409 steps, saw 1463 distinct states, run finished after 10 ms. (steps per millisecond=340 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 258/258 transitions.
Applied a total of 0 rules in 7 ms. Remains 78 /78 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-06-02 23:19:34] [INFO ] Flow matrix only has 249 transitions (discarded 9 similar events)
[2024-06-02 23:19:34] [INFO ] Invariant cache hit.
[2024-06-02 23:19:34] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 23:19:34] [INFO ] Flow matrix only has 249 transitions (discarded 9 similar events)
[2024-06-02 23:19:34] [INFO ] Invariant cache hit.
[2024-06-02 23:19:34] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:19:34] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2024-06-02 23:19:34] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 23:19:34] [INFO ] Flow matrix only has 249 transitions (discarded 9 similar events)
[2024-06-02 23:19:34] [INFO ] Invariant cache hit.
[2024-06-02 23:19:34] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 363 ms. Remains : 78/78 places, 258/258 transitions.
Computed a total of 11 stabilizing places and 18 stable transitions
Computed a total of 11 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 759 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 263 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3409 steps, run visited all 1 properties in 17 ms. (steps per millisecond=200 )
Probabilistic random walk after 3409 steps, saw 1463 distinct states, run finished after 17 ms. (steps per millisecond=200 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 73 ms.
Product exploration explored 100000 steps with 0 reset in 70 ms.
Built C files in :
/tmp/ltsmin16389704588006515984
[2024-06-02 23:19:34] [INFO ] Computing symmetric may disable matrix : 258 transitions.
[2024-06-02 23:19:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:19:34] [INFO ] Computing symmetric may enable matrix : 258 transitions.
[2024-06-02 23:19:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:19:34] [INFO ] Computing Do-Not-Accords matrix : 258 transitions.
[2024-06-02 23:19:34] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:19:35] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16389704588006515984
Running compilation step : cd /tmp/ltsmin16389704588006515984;'/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 540 ms.
Running link step : cd /tmp/ltsmin16389704588006515984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin16389704588006515984;'/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/stateBased15170201742522413262.hoa' '--buchi-type=spotba'
LTSmin run took 419 ms.
FORMULA FireWire-PT-15-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-15-LTLFireability-10 finished in 2894 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((X((X(G(p2))&&p1))&&p0))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 275/275 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 158 transition count 260
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 158 transition count 260
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 155 transition count 253
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 155 transition count 253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 154 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 154 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 153 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 153 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 152 transition count 247
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 152 transition count 247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 151 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 151 transition count 246
Applied a total of 24 rules in 8 ms. Remains 151 /163 variables (removed 12) and now considering 246/275 (removed 29) transitions.
// Phase 1: matrix 246 rows 151 cols
[2024-06-02 23:19:36] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:19:36] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 23:19:36] [INFO ] Invariant cache hit.
[2024-06-02 23:19:36] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-06-02 23:19:36] [INFO ] Invariant cache hit.
[2024-06-02 23:19:36] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/163 places, 246/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 151/163 places, 246/275 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s121 1)), p1:(AND (EQ s63 1) (EQ s134 1)), p2:(EQ s3 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 72 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA FireWire-PT-15-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-15-LTLFireability-13 finished in 601 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((p0&&X(F(p1))&&(p2||G(p3)))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 275/275 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 156 transition count 249
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 156 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 156 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 153 transition count 241
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 153 transition count 241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 152 transition count 239
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 152 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 151 transition count 237
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 151 transition count 237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 150 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 150 transition count 235
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 149 transition count 234
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 149 transition count 234
Applied a total of 29 rules in 11 ms. Remains 149 /163 variables (removed 14) and now considering 234/275 (removed 41) transitions.
// Phase 1: matrix 234 rows 149 cols
[2024-06-02 23:19:36] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:19:36] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 23:19:36] [INFO ] Invariant cache hit.
[2024-06-02 23:19:36] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-06-02 23:19:36] [INFO ] Invariant cache hit.
[2024-06-02 23:19:36] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 149/163 places, 234/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 351 ms. Remains : 149/163 places, 234/275 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FireWire-PT-15-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p3)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p2) p3)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p3), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p3 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s121 1), p2:(EQ s25 1), p3:(EQ s121 0), p1:(EQ s145 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-14 finished in 537 ms.
All properties solved by simple procedures.
Total runtime 12710 ms.

BK_STOP 1717370378138

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

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