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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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 125K 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-11-LTLFireability-00
FORMULA_NAME FireWire-PT-11-LTLFireability-01
FORMULA_NAME FireWire-PT-11-LTLFireability-02
FORMULA_NAME FireWire-PT-11-LTLFireability-03
FORMULA_NAME FireWire-PT-11-LTLFireability-04
FORMULA_NAME FireWire-PT-11-LTLFireability-05
FORMULA_NAME FireWire-PT-11-LTLFireability-06
FORMULA_NAME FireWire-PT-11-LTLFireability-07
FORMULA_NAME FireWire-PT-11-LTLFireability-08
FORMULA_NAME FireWire-PT-11-LTLFireability-09
FORMULA_NAME FireWire-PT-11-LTLFireability-10
FORMULA_NAME FireWire-PT-11-LTLFireability-11
FORMULA_NAME FireWire-PT-11-LTLFireability-12
FORMULA_NAME FireWire-PT-11-LTLFireability-13
FORMULA_NAME FireWire-PT-11-LTLFireability-14
FORMULA_NAME FireWire-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717369677776

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-11
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 23:07:59] [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:07:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:07:59] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-06-02 23:07:59] [INFO ] Transformed 169 places.
[2024-06-02 23:07:59] [INFO ] Transformed 508 transitions.
[2024-06-02 23:07:59] [INFO ] Found NUPN structural information;
[2024-06-02 23:07:59] [INFO ] Parsed PT model containing 169 places and 508 transitions and 1883 arcs in 130 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 4 formulas.
Ensure Unique test removed 65 transitions
Reduce redundant transitions removed 65 transitions.
FORMULA FireWire-PT-11-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 443/443 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 166 transition count 437
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 166 transition count 437
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 166 transition count 431
Applied a total of 12 rules in 30 ms. Remains 166 /169 variables (removed 3) and now considering 431/443 (removed 12) transitions.
[2024-06-02 23:07:59] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 166 cols
[2024-06-02 23:07:59] [INFO ] Computed 10 invariants in 19 ms
[2024-06-02 23:08:00] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-06-02 23:08:00] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:00] [INFO ] Invariant cache hit.
[2024-06-02 23:08:00] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:08:00] [INFO ] Implicit Places using invariants and state equation in 330 ms returned [62, 113, 164]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 785 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/169 places, 431/443 transitions.
Applied a total of 0 rules in 8 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 824 ms. Remains : 163/169 places, 431/443 transitions.
Support contains 36 out of 163 places after structural reductions.
[2024-06-02 23:08:00] [INFO ] Flatten gal took : 52 ms
[2024-06-02 23:08:00] [INFO ] Flatten gal took : 32 ms
[2024-06-02 23:08:00] [INFO ] Input system was already deterministic with 431 transitions.
Incomplete random walk after 10000 steps, including 269 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 33) seen :17
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) 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 16) seen :0
Running SMT prover for 16 properties.
[2024-06-02 23:08:01] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 163 cols
[2024-06-02 23:08:01] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:08:01] [INFO ] After 380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-02 23:08:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:08:02] [INFO ] After 505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-06-02 23:08:02] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:08:02] [INFO ] After 439ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2024-06-02 23:08:02] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 3 ms to minimize.
[2024-06-02 23:08:02] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 0 ms to minimize.
[2024-06-02 23:08:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2024-06-02 23:08:03] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 2 ms to minimize.
[2024-06-02 23:08:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-06-02 23:08:03] [INFO ] After 1192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 399 ms.
[2024-06-02 23:08:03] [INFO ] After 2235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 205 ms.
Support contains 19 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 431/431 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 163 transition count 428
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 163 transition count 422
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 157 transition count 422
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 154 transition count 431
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 154 transition count 425
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 154 transition count 422
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 154 transition count 424
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 153 transition count 422
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 153 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 152 transition count 419
Applied a total of 37 rules in 76 ms. Remains 152 /163 variables (removed 11) and now considering 419/431 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 152/163 places, 419/431 transitions.
Incomplete random walk after 10000 steps, including 335 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-06-02 23:08:04] [INFO ] Flow matrix only has 384 transitions (discarded 35 similar events)
// Phase 1: matrix 384 rows 152 cols
[2024-06-02 23:08:04] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:08:04] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:08:04] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 23:08:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:08:05] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-06-02 23:08:05] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:08:05] [INFO ] After 187ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-06-02 23:08:05] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 2 ms to minimize.
[2024-06-02 23:08:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-06-02 23:08:05] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:08:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-06-02 23:08:05] [INFO ] After 566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 163 ms.
[2024-06-02 23:08:05] [INFO ] After 1063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 84 ms.
Support contains 15 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 419/419 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 422
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 150 transition count 419
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 150 transition count 417
Applied a total of 9 rules in 28 ms. Remains 150 /152 variables (removed 2) and now considering 417/419 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 150/152 places, 417/419 transitions.
Incomplete random walk after 10000 steps, including 335 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 107 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-06-02 23:08:06] [INFO ] Flow matrix only has 381 transitions (discarded 36 similar events)
// Phase 1: matrix 381 rows 150 cols
[2024-06-02 23:08:06] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:08:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:08:06] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 23:08:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:08:06] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-02 23:08:06] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:08:06] [INFO ] After 122ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-06-02 23:08:07] [INFO ] After 312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 126 ms.
[2024-06-02 23:08:07] [INFO ] After 681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 10 ms.
Support contains 11 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 417/417 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 150 transition count 421
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 10 place count 147 transition count 417
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 147 transition count 415
Applied a total of 12 rules in 23 ms. Remains 147 /150 variables (removed 3) and now considering 415/417 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 147/150 places, 415/417 transitions.
Incomplete random walk after 10000 steps, including 321 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1034811 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :{0=1, 1=1, 2=1, 3=1, 5=1}
Probabilistic random walk after 1034811 steps, saw 253289 distinct states, run finished after 3002 ms. (steps per millisecond=344 ) properties seen :5
Running SMT prover for 1 properties.
[2024-06-02 23:08:10] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
// Phase 1: matrix 378 rows 147 cols
[2024-06-02 23:08:10] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:08:10] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:08:10] [INFO ] After 68ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 23:08:10] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:08:10] [INFO ] After 17ms SMT Verify possible using 56 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:08:10] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:08:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:08:10] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:08:10] [INFO ] After 22ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:08:10] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-06-02 23:08:10] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 415/415 transitions.
Applied a total of 0 rules in 11 ms. Remains 147 /147 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 147/147 places, 415/415 transitions.
Incomplete random walk after 10000 steps, including 327 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1490125 steps, run timeout after 3001 ms. (steps per millisecond=496 ) properties seen :{}
Probabilistic random walk after 1490125 steps, saw 360254 distinct states, run finished after 3002 ms. (steps per millisecond=496 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:08:13] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2024-06-02 23:08:13] [INFO ] Invariant cache hit.
[2024-06-02 23:08:13] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:08:13] [INFO ] After 76ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 23:08:13] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:08:13] [INFO ] After 20ms SMT Verify possible using 56 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:08:13] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:08:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:08:14] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:08:14] [INFO ] After 14ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:08:14] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-06-02 23:08:14] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 415/415 transitions.
Applied a total of 0 rules in 10 ms. Remains 147 /147 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 147/147 places, 415/415 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 415/415 transitions.
Applied a total of 0 rules in 7 ms. Remains 147 /147 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-06-02 23:08:14] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2024-06-02 23:08:14] [INFO ] Invariant cache hit.
[2024-06-02 23:08:14] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 23:08:14] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2024-06-02 23:08:14] [INFO ] Invariant cache hit.
[2024-06-02 23:08:14] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:08:14] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-06-02 23:08:14] [INFO ] Redundant transitions in 27 ms returned []
[2024-06-02 23:08:14] [INFO ] Flow matrix only has 378 transitions (discarded 37 similar events)
[2024-06-02 23:08:14] [INFO ] Invariant cache hit.
[2024-06-02 23:08:14] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 487 ms. Remains : 147/147 places, 415/415 transitions.
Graph (trivial) has 139 edges and 147 vertex of which 29 / 147 are part of one of the 4 SCC in 3 ms
Free SCC test removed 25 places
Drop transitions removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 121 transition count 270
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 121 transition count 261
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 120 transition count 260
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 120 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 119 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 118 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 118 transition count 219
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 28 place count 118 transition count 204
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 109 transition count 201
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 109 transition count 201
Applied a total of 46 rules in 39 ms. Remains 109 /147 variables (removed 38) and now considering 201/415 (removed 214) transitions.
Running SMT prover for 1 properties.
[2024-06-02 23:08:14] [INFO ] Flow matrix only has 199 transitions (discarded 2 similar events)
// Phase 1: matrix 199 rows 109 cols
[2024-06-02 23:08:14] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:08:14] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 23:08:14] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:08:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:08:14] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:08:14] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-06-02 23:08:14] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA FireWire-PT-11-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 19 stabilizing places and 31 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' '!(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, 431/431 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 162 transition count 424
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 156 transition count 424
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 153 transition count 433
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 153 transition count 427
Applied a total of 24 rules in 30 ms. Remains 153 /163 variables (removed 10) and now considering 427/431 (removed 4) transitions.
[2024-06-02 23:08:15] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
// Phase 1: matrix 388 rows 153 cols
[2024-06-02 23:08:15] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:08:15] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 23:08:15] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:08:15] [INFO ] Invariant cache hit.
[2024-06-02 23:08:15] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:08:15] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-06-02 23:08:15] [INFO ] Redundant transitions in 9 ms returned []
[2024-06-02 23:08:15] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:08:15] [INFO ] Invariant cache hit.
[2024-06-02 23:08:15] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/163 places, 427/431 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 466 ms. Remains : 153/163 places, 427/431 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 135 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-11-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s80 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 2 ms.
FORMULA FireWire-PT-11-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-02 finished in 658 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)&&F(p1))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 162 transition count 424
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 156 transition count 424
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 153 transition count 433
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 153 transition count 427
Applied a total of 24 rules in 30 ms. Remains 153 /163 variables (removed 10) and now considering 427/431 (removed 4) transitions.
[2024-06-02 23:08:15] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:08:15] [INFO ] Invariant cache hit.
[2024-06-02 23:08:16] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 23:08:16] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:08:16] [INFO ] Invariant cache hit.
[2024-06-02 23:08:16] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:08:16] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2024-06-02 23:08:16] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:08:16] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:08:16] [INFO ] Invariant cache hit.
[2024-06-02 23:08:16] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/163 places, 427/431 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 455 ms. Remains : 153/163 places, 427/431 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-11-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s29 0)), p1:(OR (EQ s2 0) (EQ s21 0))], 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]]
Product exploration explored 100000 steps with 1 reset in 171 ms.
Product exploration explored 100000 steps with 2 reset in 92 ms.
Computed a total of 12 stabilizing places and 27 stable transitions
Computed a total of 12 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 307 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:08:17] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:08:17] [INFO ] Invariant cache hit.
[2024-06-02 23:08:17] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:08:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:08:17] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:08:17] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:08:17] [INFO ] After 42ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:08:17] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-06-02 23:08:17] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 427/427 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 153 transition count 421
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 12 place count 153 transition count 430
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 27 place count 147 transition count 421
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 33 place count 147 transition count 415
Applied a total of 33 rules in 25 ms. Remains 147 /153 variables (removed 6) and now considering 415/427 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 147/153 places, 415/427 transitions.
Incomplete random walk after 10000 steps, including 325 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3667 steps, run visited all 1 properties in 11 ms. (steps per millisecond=333 )
Probabilistic random walk after 3667 steps, saw 1721 distinct states, run finished after 12 ms. (steps per millisecond=305 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 427/427 transitions.
Applied a total of 0 rules in 24 ms. Remains 153 /153 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2024-06-02 23:08:17] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:08:17] [INFO ] Invariant cache hit.
[2024-06-02 23:08:17] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 23:08:17] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:08:17] [INFO ] Invariant cache hit.
[2024-06-02 23:08:17] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:08:18] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-06-02 23:08:18] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 23:08:18] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:08:18] [INFO ] Invariant cache hit.
[2024-06-02 23:08:18] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 453 ms. Remains : 153/153 places, 427/427 transitions.
Computed a total of 12 stabilizing places and 27 stable transitions
Computed a total of 12 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 332 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:08:18] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:08:18] [INFO ] Invariant cache hit.
[2024-06-02 23:08:18] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:08:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:08:18] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:08:18] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:08:18] [INFO ] After 34ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:08:18] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-06-02 23:08:18] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 427/427 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 153 transition count 421
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 12 place count 153 transition count 430
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 27 place count 147 transition count 421
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 33 place count 147 transition count 415
Applied a total of 33 rules in 19 ms. Remains 147 /153 variables (removed 6) and now considering 415/427 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 147/153 places, 415/427 transitions.
Finished random walk after 8306 steps, including 266 resets, run visited all 1 properties in 14 ms. (steps per millisecond=593 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 145 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 81 ms.
Product exploration explored 100000 steps with 0 reset in 119 ms.
Built C files in :
/tmp/ltsmin12098248194617313794
[2024-06-02 23:08:19] [INFO ] Computing symmetric may disable matrix : 427 transitions.
[2024-06-02 23:08:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:08:19] [INFO ] Computing symmetric may enable matrix : 427 transitions.
[2024-06-02 23:08:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:08:19] [INFO ] Computing Do-Not-Accords matrix : 427 transitions.
[2024-06-02 23:08:19] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:08:19] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12098248194617313794
Running compilation step : cd /tmp/ltsmin12098248194617313794;'/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 948 ms.
Running link step : cd /tmp/ltsmin12098248194617313794;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin12098248194617313794;'/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/stateBased12812242810861205294.hoa' '--buchi-type=spotba'
LTSmin run took 1744 ms.
FORMULA FireWire-PT-11-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-11-LTLFireability-03 finished in 6480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U (p1||X(p2)))||(X(F(p1))&&(p1 U p3))))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 23:08:22] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 163 cols
[2024-06-02 23:08:22] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:08:22] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 23:08:22] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:22] [INFO ] Invariant cache hit.
[2024-06-02 23:08:22] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:08:22] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-06-02 23:08:22] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:22] [INFO ] Invariant cache hit.
[2024-06-02 23:08:22] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 510 ms. Remains : 163/163 places, 431/431 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : FireWire-PT-11-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s7 1) (EQ s38 1)), p2:(EQ s0 1), p1:(AND (EQ s5 1) (EQ s88 1)), p3:(AND (EQ s7 1) (EQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-11-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-06 finished in 700 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 U p1)&&F(p2)))&&X(p3)))'
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 23:08:23] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:23] [INFO ] Invariant cache hit.
[2024-06-02 23:08:23] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 23:08:23] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:23] [INFO ] Invariant cache hit.
[2024-06-02 23:08:23] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:08:23] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-06-02 23:08:23] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:23] [INFO ] Invariant cache hit.
[2024-06-02 23:08:23] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 474 ms. Remains : 163/163 places, 431/431 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p2)), (NOT p3), (NOT p1), (NOT p2), true]
Running random walk in product with property : FireWire-PT-11-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s2 1) (EQ s17 1)), p0:(AND (EQ s7 1) (EQ s138 1)), p2:(OR (EQ s10 0) (EQ s16 0)), p3:(AND (EQ s5 1) (EQ s104 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-11-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-08 finished in 701 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||(F(p1)&&F(p2)))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 162 transition count 424
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 156 transition count 424
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 153 transition count 433
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 153 transition count 427
Applied a total of 24 rules in 38 ms. Remains 153 /163 variables (removed 10) and now considering 427/431 (removed 4) transitions.
[2024-06-02 23:08:23] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
// Phase 1: matrix 388 rows 153 cols
[2024-06-02 23:08:23] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:08:23] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 23:08:23] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:08:23] [INFO ] Invariant cache hit.
[2024-06-02 23:08:23] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:08:24] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-06-02 23:08:24] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:08:24] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:08:24] [INFO ] Invariant cache hit.
[2024-06-02 23:08:24] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/163 places, 427/431 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 461 ms. Remains : 153/163 places, 427/431 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FireWire-PT-11-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(AND (EQ s1 1) (EQ s126 1)), p1:(EQ s27 1), p2:(AND (EQ s5 1) (EQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-11-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-09 finished in 588 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||X(p1)))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 23:08:24] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 163 cols
[2024-06-02 23:08:24] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:08:24] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 23:08:24] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:24] [INFO ] Invariant cache hit.
[2024-06-02 23:08:24] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:08:24] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-06-02 23:08:24] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:24] [INFO ] Invariant cache hit.
[2024-06-02 23:08:24] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 449 ms. Remains : 163/163 places, 431/431 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-11-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s81 0), p1:(OR (EQ s8 0) (EQ s121 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 7 reset in 68 ms.
Product exploration explored 100000 steps with 0 reset in 88 ms.
Computed a total of 19 stabilizing places and 31 stable transitions
Computed a total of 19 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 121 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 259 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Finished Best-First random walk after 6369 steps, including 8 resets, run visited all 5 properties in 13 ms. (steps per millisecond=489 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 290 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 23:08:26] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:26] [INFO ] Invariant cache hit.
[2024-06-02 23:08:26] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 23:08:26] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:26] [INFO ] Invariant cache hit.
[2024-06-02 23:08:26] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:08:26] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-06-02 23:08:26] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:26] [INFO ] Invariant cache hit.
[2024-06-02 23:08:26] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 437 ms. Remains : 163/163 places, 431/431 transitions.
Computed a total of 19 stabilizing places and 31 stable transitions
Computed a total of 19 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 141 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 251 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :4
Running SMT prover for 1 properties.
[2024-06-02 23:08:27] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:27] [INFO ] Invariant cache hit.
[2024-06-02 23:08:27] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:08:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:08:27] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:08:27] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:08:27] [INFO ] After 33ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:08:27] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-06-02 23:08:27] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 431/431 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 163 transition count 428
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 163 transition count 422
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 157 transition count 422
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 154 transition count 431
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 154 transition count 425
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 154 transition count 422
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 35 place count 154 transition count 430
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 48 place count 149 transition count 422
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 54 place count 149 transition count 416
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 148 transition count 415
Applied a total of 55 rules in 29 ms. Remains 148 /163 variables (removed 15) and now considering 415/431 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 148/163 places, 415/431 transitions.
Incomplete random walk after 10000 steps, including 336 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 31730 steps, run visited all 1 properties in 84 ms. (steps per millisecond=377 )
Probabilistic random walk after 31730 steps, saw 10970 distinct states, run finished after 84 ms. (steps per millisecond=377 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 508 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 54 ms.
Product exploration explored 100000 steps with 6 reset in 65 ms.
Built C files in :
/tmp/ltsmin17646255835197788334
[2024-06-02 23:08:28] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17646255835197788334
Running compilation step : cd /tmp/ltsmin17646255835197788334;'/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 619 ms.
Running link step : cd /tmp/ltsmin17646255835197788334;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17646255835197788334;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7799275829468078655.hoa' '--buchi-type=spotba'
LTSmin run took 315 ms.
FORMULA FireWire-PT-11-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-11-LTLFireability-10 finished in 5221 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(p1)&&p0))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 23:08:29] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:29] [INFO ] Invariant cache hit.
[2024-06-02 23:08:29] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 23:08:29] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:29] [INFO ] Invariant cache hit.
[2024-06-02 23:08:29] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:08:29] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-06-02 23:08:29] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:29] [INFO ] Invariant cache hit.
[2024-06-02 23:08:30] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 516 ms. Remains : 163/163 places, 431/431 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-11-LTLFireability-11 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}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s114 1)), p1:(AND (EQ s10 1) (EQ s84 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-11-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-11 finished in 648 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||G(p1)))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 162 transition count 424
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 156 transition count 424
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 153 transition count 433
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 153 transition count 427
Applied a total of 24 rules in 21 ms. Remains 153 /163 variables (removed 10) and now considering 427/431 (removed 4) transitions.
[2024-06-02 23:08:30] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
// Phase 1: matrix 388 rows 153 cols
[2024-06-02 23:08:30] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:08:30] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 23:08:30] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:08:30] [INFO ] Invariant cache hit.
[2024-06-02 23:08:30] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:08:30] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-06-02 23:08:30] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 23:08:30] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:08:30] [INFO ] Invariant cache hit.
[2024-06-02 23:08:30] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/163 places, 427/431 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 479 ms. Remains : 153/163 places, 427/431 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-11-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s30 1), p0:(AND (EQ s30 1) (OR (EQ s6 0) (EQ s37 0)))], 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 0 ms.
FORMULA FireWire-PT-11-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-12 finished in 567 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(p1)&&p0) U G(p2))||F(p3))))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 23:08:30] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 163 cols
[2024-06-02 23:08:30] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:08:30] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 23:08:30] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:30] [INFO ] Invariant cache hit.
[2024-06-02 23:08:31] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:08:31] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-06-02 23:08:31] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:31] [INFO ] Invariant cache hit.
[2024-06-02 23:08:31] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 163/163 places, 431/431 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : FireWire-PT-11-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s10 1) (EQ s78 1)), p0:(AND (EQ s7 1) (EQ s39 1)), p3:(AND (EQ s7 1) (EQ s39 1)), p1:(AND (EQ s5 1) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-11-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-13 finished in 680 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' '!((((p1 U G(p2))&&p0) U X(X(X(p1)))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 23:08:31] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:31] [INFO ] Invariant cache hit.
[2024-06-02 23:08:31] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 23:08:31] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:31] [INFO ] Invariant cache hit.
[2024-06-02 23:08:31] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:08:31] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2024-06-02 23:08:31] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:31] [INFO ] Invariant cache hit.
[2024-06-02 23:08:32] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 496 ms. Remains : 163/163 places, 431/431 transitions.
Stuttering acceptance computed with spot in 843 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p2) (NOT p1)), true, (NOT p1), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-11-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 12}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 14}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 12}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 14}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 15}], [{ cond=(OR p2 p1), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 17}], [{ cond=p2, acceptance={} source=3 dest: 9}, { cond=(NOT p2), acceptance={} source=3 dest: 17}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=4 dest: 12}, { cond=(AND p2 p1), acceptance={} source=4 dest: 15}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 6}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 8}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=5 dest: 13}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 16}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 18}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=7 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=7 dest: 10}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 17}], [{ cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 3}, { cond=(NOT p2), acceptance={} source=8 dest: 16}, { cond=(AND p0 p2), acceptance={} source=8 dest: 18}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 12}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=10 dest: 11}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=10 dest: 12}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=11 dest: 4}, { cond=(NOT p2), acceptance={} source=11 dest: 12}, { cond=(AND p2 p1), acceptance={} source=11 dest: 15}], [{ cond=true, acceptance={0} source=12 dest: 12}], [{ cond=true, acceptance={} source=13 dest: 16}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=14 dest: 11}, { cond=(NOT p2), acceptance={} source=14 dest: 12}, { cond=(AND p2 p1), acceptance={} source=14 dest: 15}], [{ cond=(NOT p2), acceptance={} source=15 dest: 12}, { cond=p2, acceptance={} source=15 dest: 15}], [{ cond=true, acceptance={} source=16 dest: 17}], [{ cond=(NOT p1), acceptance={} source=17 dest: 12}], [{ cond=(AND p0 p2), acceptance={} source=18 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=18 dest: 10}, { cond=(NOT p2), acceptance={} source=18 dest: 17}]], initial=5, aps=[p0:(AND (EQ s6 1) (EQ s36 1)), p2:(EQ s88 1), p1:(AND (EQ s22 1) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-11-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-14 finished in 1371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G((X(G(p2))&&p1)) U (G(p4)&&p3))))'
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 431/431 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-06-02 23:08:32] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:32] [INFO ] Invariant cache hit.
[2024-06-02 23:08:32] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 23:08:32] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:32] [INFO ] Invariant cache hit.
[2024-06-02 23:08:33] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:08:33] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-06-02 23:08:33] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:08:33] [INFO ] Invariant cache hit.
[2024-06-02 23:08:33] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 471 ms. Remains : 163/163 places, 431/431 transitions.
Stuttering acceptance computed with spot in 637 ms :[(OR (NOT p3) (NOT p4)), (NOT p0), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4))), (AND (NOT p4) (NOT p0)), (NOT p4), (AND (NOT p0) (NOT p4)), true, (NOT p2), (OR (AND (NOT p1) p2) (AND p1 (NOT p2))), (NOT p4), (OR (NOT p3) (NOT p4)), (AND (NOT p2) (NOT p4)), (OR (AND p1 (NOT p2) (NOT p4)) (AND p0 (NOT p4)))]
Running random walk in product with property : FireWire-PT-11-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p3) (NOT p4)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p4) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p4) p1)), acceptance={} source=0 dest: 2}, { cond=(AND p3 p4 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p3 p4), acceptance={} source=0 dest: 4}, { cond=(AND p3 p4 p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 8}, { cond=(OR (AND (NOT p3) p1 (NOT p0) p2) (AND (NOT p4) p1 (NOT p0) p2)), acceptance={} source=2 dest: 10}, { cond=(AND p3 p4 p1 (NOT p0) p2), acceptance={} source=2 dest: 12}], [{ cond=(AND (NOT p4) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p4 (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=(NOT p4), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p4) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p4) p1), acceptance={} source=4 dest: 2}, { cond=(AND p4 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p4, acceptance={} source=4 dest: 4}, { cond=(AND p4 p1), acceptance={} source=4 dest: 5}], [{ cond=(OR (AND (NOT p4) (NOT p1) (NOT p0)) (AND (NOT p4) (NOT p0) (NOT p2))), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p4) p1 (NOT p0) p2), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p4) p1 (NOT p0) p2), acceptance={} source=5 dest: 8}, { cond=(OR (AND p4 (NOT p1) (NOT p0)) (AND p4 (NOT p0) (NOT p2))), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p4) p1 (NOT p0) p2), acceptance={} source=5 dest: 10}, { cond=(AND p4 p1 (NOT p0) p2), acceptance={} source=5 dest: 11}, { cond=(AND p4 p1 (NOT p0) p2), acceptance={} source=5 dest: 12}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 7}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=(NOT p4), acceptance={} source=9 dest: 6}, { cond=p4, acceptance={} source=9 dest: 9}], [{ cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p4) (NOT p1))), acceptance={} source=10 dest: 6}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p4) p1)), acceptance={} source=10 dest: 7}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p4) p1)), acceptance={} source=10 dest: 8}, { cond=(AND p3 p4 (NOT p1)), acceptance={} source=10 dest: 9}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p4) p1)), acceptance={0} source=10 dest: 10}, { cond=(AND p3 p4 p1), acceptance={} source=10 dest: 11}, { cond=(AND p3 p4 p1), acceptance={} source=10 dest: 12}], [{ cond=(AND (NOT p4) (NOT p2)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p4) p2), acceptance={} source=11 dest: 7}, { cond=(AND p4 (NOT p2)), acceptance={} source=11 dest: 9}, { cond=(AND p4 p2), acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p4) (NOT p1) p0), acceptance={} source=12 dest: 6}, { cond=(OR (AND (NOT p4) p1 p0) (AND (NOT p4) p1 (NOT p2))), acceptance={} source=12 dest: 7}, { cond=(OR (AND (NOT p4) p1 p0) (AND (NOT p4) p1 (NOT p2))), acceptance={} source=12 dest: 8}, { cond=(AND p4 (NOT p1) p0), acceptance={} source=12 dest: 9}, { cond=(OR (AND (NOT p4) p1 p0) (AND (NOT p4) p1 (NOT p2))), acceptance={0} source=12 dest: 10}, { cond=(OR (AND p4 p1 p0) (AND p4 p1 (NOT p2))), acceptance={} source=12 dest: 11}, { cond=(OR (AND p4 p1 p0) (AND p4 p1 (NOT p2))), acceptance={} source=12 dest: 12}]], initial=0, aps=[p3:(AND (EQ s5 1) (EQ s86 1)), p4:(AND (EQ s7 1) (EQ s32 1)), p1:(AND (EQ s7 1) (EQ s132 1)), p0:(AND (EQ s7 1) (EQ s29 1)), p2:(AND (EQ s10 1) (EQ s14 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-11-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLFireability-15 finished in 1146 ms.
All properties solved by simple procedures.
Total runtime 34759 ms.

BK_STOP 1717369715019

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

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