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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 8.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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 97K 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-07-LTLFireability-00
FORMULA_NAME FireWire-PT-07-LTLFireability-01
FORMULA_NAME FireWire-PT-07-LTLFireability-02
FORMULA_NAME FireWire-PT-07-LTLFireability-03
FORMULA_NAME FireWire-PT-07-LTLFireability-04
FORMULA_NAME FireWire-PT-07-LTLFireability-05
FORMULA_NAME FireWire-PT-07-LTLFireability-06
FORMULA_NAME FireWire-PT-07-LTLFireability-07
FORMULA_NAME FireWire-PT-07-LTLFireability-08
FORMULA_NAME FireWire-PT-07-LTLFireability-09
FORMULA_NAME FireWire-PT-07-LTLFireability-10
FORMULA_NAME FireWire-PT-07-LTLFireability-11
FORMULA_NAME FireWire-PT-07-LTLFireability-12
FORMULA_NAME FireWire-PT-07-LTLFireability-13
FORMULA_NAME FireWire-PT-07-LTLFireability-14
FORMULA_NAME FireWire-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717369353874

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-07
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 23:02:35] [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:02:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:02:35] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-06-02 23:02:35] [INFO ] Transformed 126 places.
[2024-06-02 23:02:35] [INFO ] Transformed 396 transitions.
[2024-06-02 23:02:35] [INFO ] Found NUPN structural information;
[2024-06-02 23:02:35] [INFO ] Parsed PT model containing 126 places and 396 transitions and 1471 arcs in 125 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 3 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-07-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 343/343 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 122 transition count 335
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 122 transition count 335
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 122 transition count 332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 121 transition count 329
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 121 transition count 329
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 121 transition count 323
Applied a total of 19 rules in 29 ms. Remains 121 /126 variables (removed 5) and now considering 323/343 (removed 20) transitions.
[2024-06-02 23:02:35] [INFO ] Flow matrix only has 297 transitions (discarded 26 similar events)
// Phase 1: matrix 297 rows 121 cols
[2024-06-02 23:02:35] [INFO ] Computed 8 invariants in 21 ms
[2024-06-02 23:02:36] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-06-02 23:02:36] [INFO ] Flow matrix only has 297 transitions (discarded 26 similar events)
[2024-06-02 23:02:36] [INFO ] Invariant cache hit.
[2024-06-02 23:02:36] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 23:02:36] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2024-06-02 23:02:36] [INFO ] Flow matrix only has 297 transitions (discarded 26 similar events)
[2024-06-02 23:02:36] [INFO ] Invariant cache hit.
[2024-06-02 23:02:36] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/126 places, 323/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 791 ms. Remains : 121/126 places, 323/343 transitions.
Support contains 35 out of 121 places after structural reductions.
[2024-06-02 23:02:36] [INFO ] Flatten gal took : 51 ms
[2024-06-02 23:02:36] [INFO ] Flatten gal took : 23 ms
[2024-06-02 23:02:36] [INFO ] Input system was already deterministic with 323 transitions.
Incomplete random walk after 10000 steps, including 524 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 27) seen :11
Incomplete Best-First random walk after 1001 steps, including 36 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 40 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 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 30 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 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 27 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2024-06-02 23:02:37] [INFO ] Flow matrix only has 297 transitions (discarded 26 similar events)
[2024-06-02 23:02:37] [INFO ] Invariant cache hit.
[2024-06-02 23:02:37] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:02:37] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-06-02 23:02:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:02:37] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :12
[2024-06-02 23:02:37] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 23:02:37] [INFO ] After 217ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :2 sat :12
[2024-06-02 23:02:38] [INFO ] After 545ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :12
Attempting to minimize the solution found.
Minimization took 210 ms.
[2024-06-02 23:02:38] [INFO ] After 1104ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :12
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 95 ms.
Support contains 17 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 323/323 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 121 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 120 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 120 transition count 317
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 1 with 2 rules applied. Total rules applied 7 place count 119 transition count 316
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 117 transition count 320
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 15 place count 117 transition count 316
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 117 transition count 314
Applied a total of 17 rules in 54 ms. Remains 117 /121 variables (removed 4) and now considering 314/323 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 117/121 places, 314/323 transitions.
Incomplete random walk after 10000 steps, including 567 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 378 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 368 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 261 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 272 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-06-02 23:02:39] [INFO ] Flow matrix only has 288 transitions (discarded 26 similar events)
// Phase 1: matrix 288 rows 117 cols
[2024-06-02 23:02:39] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 23:02:39] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 23:02:39] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 23:02:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:02:39] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-06-02 23:02:39] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 23:02:40] [INFO ] After 167ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-06-02 23:02:40] [INFO ] After 400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 177 ms.
[2024-06-02 23:02:40] [INFO ] After 841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 56 ms.
Support contains 14 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 314/314 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 2 place count 116 transition count 316
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 314
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 116 transition count 313
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 115 transition count 312
Applied a total of 6 rules in 42 ms. Remains 115 /117 variables (removed 2) and now considering 312/314 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 115/117 places, 312/314 transitions.
Incomplete random walk after 10000 steps, including 565 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 388 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 377 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 276 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 266 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :2
Running SMT prover for 7 properties.
[2024-06-02 23:02:41] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
// Phase 1: matrix 284 rows 115 cols
[2024-06-02 23:02:41] [INFO ] Computed 8 invariants in 9 ms
[2024-06-02 23:02:41] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 23:02:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 23:02:41] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-02 23:02:41] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 23:02:41] [INFO ] After 113ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-06-02 23:02:41] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:02:41] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 2 ms to minimize.
[2024-06-02 23:02:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2024-06-02 23:02:41] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 129 ms.
[2024-06-02 23:02:42] [INFO ] After 762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 12 ms.
Support contains 10 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 312/312 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 115 transition count 314
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 114 transition count 312
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 114 transition count 310
Applied a total of 6 rules in 23 ms. Remains 114 /115 variables (removed 1) and now considering 310/312 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 114/115 places, 310/312 transitions.
Incomplete random walk after 10000 steps, including 554 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 270 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 1058165 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :{0=1, 3=1, 4=1, 5=1, 6=1}
Probabilistic random walk after 1058165 steps, saw 232827 distinct states, run finished after 3003 ms. (steps per millisecond=352 ) properties seen :5
Running SMT prover for 2 properties.
[2024-06-02 23:02:45] [INFO ] Flow matrix only has 281 transitions (discarded 29 similar events)
// Phase 1: matrix 281 rows 114 cols
[2024-06-02 23:02:45] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 23:02:45] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:02:45] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:02:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 23:02:45] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 23:02:45] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 23:02:45] [INFO ] After 37ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 23:02:45] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-06-02 23:02:45] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-06-02 23:02:45] [INFO ] After 293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 310/310 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 112 transition count 305
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 112 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 111 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 111 transition count 303
Applied a total of 6 rules in 16 ms. Remains 111 /114 variables (removed 3) and now considering 303/310 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 111/114 places, 303/310 transitions.
Incomplete random walk after 10000 steps, including 574 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 272 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 299 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1182453 steps, run timeout after 3001 ms. (steps per millisecond=394 ) properties seen :{}
Probabilistic random walk after 1182453 steps, saw 253080 distinct states, run finished after 3001 ms. (steps per millisecond=394 ) properties seen :0
Running SMT prover for 2 properties.
[2024-06-02 23:02:48] [INFO ] Flow matrix only has 274 transitions (discarded 29 similar events)
// Phase 1: matrix 274 rows 111 cols
[2024-06-02 23:02:48] [INFO ] Computed 8 invariants in 8 ms
[2024-06-02 23:02:48] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 23:02:49] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:02:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:02:49] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 23:02:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 23:02:49] [INFO ] After 45ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 23:02:49] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-06-02 23:02:49] [INFO ] After 218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 303/303 transitions.
Applied a total of 0 rules in 11 ms. Remains 111 /111 variables (removed 0) and now considering 303/303 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 111/111 places, 303/303 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 303/303 transitions.
Applied a total of 0 rules in 6 ms. Remains 111 /111 variables (removed 0) and now considering 303/303 (removed 0) transitions.
[2024-06-02 23:02:49] [INFO ] Flow matrix only has 274 transitions (discarded 29 similar events)
[2024-06-02 23:02:49] [INFO ] Invariant cache hit.
[2024-06-02 23:02:49] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 23:02:49] [INFO ] Flow matrix only has 274 transitions (discarded 29 similar events)
[2024-06-02 23:02:49] [INFO ] Invariant cache hit.
[2024-06-02 23:02:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 23:02:49] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-06-02 23:02:49] [INFO ] Redundant transitions in 18 ms returned []
[2024-06-02 23:02:49] [INFO ] Flow matrix only has 274 transitions (discarded 29 similar events)
[2024-06-02 23:02:49] [INFO ] Invariant cache hit.
[2024-06-02 23:02:49] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 383 ms. Remains : 111/111 places, 303/303 transitions.
Graph (trivial) has 109 edges and 111 vertex of which 29 / 111 are part of one of the 4 SCC in 2 ms
Free SCC test removed 25 places
Drop transitions removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 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 85 transition count 176
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 85 transition count 173
Free-agglomeration rule applied 4 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 85 transition count 167
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 15 place count 81 transition count 166
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 81 transition count 166
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 81 transition count 165
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 80 transition count 164
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 80 transition count 164
Applied a total of 21 rules in 28 ms. Remains 80 /111 variables (removed 31) and now considering 164/303 (removed 139) transitions.
Running SMT prover for 2 properties.
[2024-06-02 23:02:49] [INFO ] Flow matrix only has 162 transitions (discarded 2 similar events)
// Phase 1: matrix 162 rows 80 cols
[2024-06-02 23:02:49] [INFO ] Computed 8 invariants in 0 ms
[2024-06-02 23:02:49] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 23:02:49] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:02:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:02:49] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 23:02:49] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-02 23:02:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-06-02 23:02:49] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-06-02 23:02:49] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA FireWire-PT-07-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA FireWire-PT-07-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-07-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 42 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 323/323 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 118 transition count 315
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 118 transition count 315
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 115 transition count 308
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 114 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 113 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 112 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 111 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 110 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 109 transition count 293
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 108 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 107 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 106 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 106 transition count 287
Applied a total of 30 rules in 16 ms. Remains 106 /121 variables (removed 15) and now considering 287/323 (removed 36) transitions.
[2024-06-02 23:02:50] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2024-06-02 23:02:50] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 23:02:50] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 23:02:50] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 23:02:50] [INFO ] Invariant cache hit.
[2024-06-02 23:02:50] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 23:02:50] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-06-02 23:02:50] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 23:02:50] [INFO ] Invariant cache hit.
[2024-06-02 23:02:50] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/121 places, 287/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 106/121 places, 287/323 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 182 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s5 1) (EQ s104 1)), p0:(AND (EQ s5 1) (EQ s104 1) (OR (EQ s7 0) (EQ s103 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLFireability-02 finished in 650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 323/323 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 117 transition count 314
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 117 transition count 314
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 115 transition count 309
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 114 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 113 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 112 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 111 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 110 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 109 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 109 transition count 294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 108 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 107 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 106 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 106 transition count 288
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 30 place count 105 transition count 287
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
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 36 place count 102 transition count 293
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 102 transition count 287
Applied a total of 42 rules in 55 ms. Remains 102 /121 variables (removed 19) and now considering 287/323 (removed 36) transitions.
[2024-06-02 23:02:50] [INFO ] Flow matrix only has 254 transitions (discarded 33 similar events)
// Phase 1: matrix 254 rows 102 cols
[2024-06-02 23:02:50] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 23:02:50] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 23:02:50] [INFO ] Flow matrix only has 254 transitions (discarded 33 similar events)
[2024-06-02 23:02:50] [INFO ] Invariant cache hit.
[2024-06-02 23:02:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 23:02:51] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-06-02 23:02:51] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:02:51] [INFO ] Flow matrix only has 254 transitions (discarded 33 similar events)
[2024-06-02 23:02:51] [INFO ] Invariant cache hit.
[2024-06-02 23:02:51] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/121 places, 287/323 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 364 ms. Remains : 102/121 places, 287/323 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-07-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s17 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 161 ms.
Product exploration explored 100000 steps with 4 reset in 84 ms.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 565 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5845 steps, run visited all 1 properties in 13 ms. (steps per millisecond=449 )
Probabilistic random walk after 5845 steps, saw 2097 distinct states, run finished after 14 ms. (steps per millisecond=417 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 287/287 transitions.
Applied a total of 0 rules in 12 ms. Remains 102 /102 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2024-06-02 23:02:51] [INFO ] Flow matrix only has 254 transitions (discarded 33 similar events)
[2024-06-02 23:02:51] [INFO ] Invariant cache hit.
[2024-06-02 23:02:51] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 23:02:51] [INFO ] Flow matrix only has 254 transitions (discarded 33 similar events)
[2024-06-02 23:02:51] [INFO ] Invariant cache hit.
[2024-06-02 23:02:52] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 23:02:52] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-06-02 23:02:52] [INFO ] Redundant transitions in 6 ms returned []
[2024-06-02 23:02:52] [INFO ] Flow matrix only has 254 transitions (discarded 33 similar events)
[2024-06-02 23:02:52] [INFO ] Invariant cache hit.
[2024-06-02 23:02:52] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 344 ms. Remains : 102/102 places, 287/287 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 593 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5845 steps, run visited all 1 properties in 18 ms. (steps per millisecond=324 )
Probabilistic random walk after 5845 steps, saw 2097 distinct states, run finished after 18 ms. (steps per millisecond=324 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 78 ms.
Product exploration explored 100000 steps with 0 reset in 89 ms.
Built C files in :
/tmp/ltsmin914411517177775686
[2024-06-02 23:02:52] [INFO ] Computing symmetric may disable matrix : 287 transitions.
[2024-06-02 23:02:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:02:52] [INFO ] Computing symmetric may enable matrix : 287 transitions.
[2024-06-02 23:02:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:02:52] [INFO ] Computing Do-Not-Accords matrix : 287 transitions.
[2024-06-02 23:02:52] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:02:52] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin914411517177775686
Running compilation step : cd /tmp/ltsmin914411517177775686;'/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 610 ms.
Running link step : cd /tmp/ltsmin914411517177775686;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin914411517177775686;'/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/stateBased10610050192135545894.hoa' '--buchi-type=spotba'
LTSmin run took 552 ms.
FORMULA FireWire-PT-07-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-07-LTLFireability-03 finished in 3257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0) U p1)))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 323/323 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 118 transition count 315
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 118 transition count 315
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 116 transition count 310
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 115 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 114 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 113 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 112 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 112 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 111 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 110 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 109 transition count 293
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 108 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 107 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 107 transition count 289
Applied a total of 28 rules in 18 ms. Remains 107 /121 variables (removed 14) and now considering 289/323 (removed 34) transitions.
[2024-06-02 23:02:54] [INFO ] Flow matrix only has 263 transitions (discarded 26 similar events)
// Phase 1: matrix 263 rows 107 cols
[2024-06-02 23:02:54] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 23:02:54] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 23:02:54] [INFO ] Flow matrix only has 263 transitions (discarded 26 similar events)
[2024-06-02 23:02:54] [INFO ] Invariant cache hit.
[2024-06-02 23:02:54] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 23:02:54] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-06-02 23:02:54] [INFO ] Flow matrix only has 263 transitions (discarded 26 similar events)
[2024-06-02 23:02:54] [INFO ] Invariant cache hit.
[2024-06-02 23:02:54] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/121 places, 289/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 107/121 places, 289/323 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : FireWire-PT-07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s8 1) (EQ s51 1)), p0:(AND (EQ s10 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLFireability-04 finished in 474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G((!p0||F(!p1)))) U G(p2)))))'
Support contains 6 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 323/323 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 119 transition count 318
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 119 transition count 318
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 117 transition count 313
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 116 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 115 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 114 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 113 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 112 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 111 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 110 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 109 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 109 transition count 294
Applied a total of 24 rules in 16 ms. Remains 109 /121 variables (removed 12) and now considering 294/323 (removed 29) transitions.
[2024-06-02 23:02:54] [INFO ] Flow matrix only has 268 transitions (discarded 26 similar events)
// Phase 1: matrix 268 rows 109 cols
[2024-06-02 23:02:54] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 23:02:54] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 23:02:54] [INFO ] Flow matrix only has 268 transitions (discarded 26 similar events)
[2024-06-02 23:02:54] [INFO ] Invariant cache hit.
[2024-06-02 23:02:54] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 23:02:54] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-06-02 23:02:54] [INFO ] Flow matrix only has 268 transitions (discarded 26 similar events)
[2024-06-02 23:02:54] [INFO ] Invariant cache hit.
[2024-06-02 23:02:54] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/121 places, 294/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 349 ms. Remains : 109/121 places, 294/323 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 p1), (AND p1 (NOT p2) p0), p1, (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s10 1) (EQ s81 1)), p0:(AND (EQ s8 1) (EQ s55 1)), p1:(AND (EQ s3 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLFireability-05 finished in 684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||(p2&&X(F(p1)))||p0)))'
Support contains 6 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 323/323 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 119 transition count 317
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 119 transition count 317
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 117 transition count 313
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 117 transition count 313
Applied a total of 8 rules in 6 ms. Remains 117 /121 variables (removed 4) and now considering 313/323 (removed 10) transitions.
[2024-06-02 23:02:55] [INFO ] Flow matrix only has 287 transitions (discarded 26 similar events)
// Phase 1: matrix 287 rows 117 cols
[2024-06-02 23:02:55] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 23:02:55] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 23:02:55] [INFO ] Flow matrix only has 287 transitions (discarded 26 similar events)
[2024-06-02 23:02:55] [INFO ] Invariant cache hit.
[2024-06-02 23:02:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 23:02:55] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-06-02 23:02:55] [INFO ] Flow matrix only has 287 transitions (discarded 26 similar events)
[2024-06-02 23:02:55] [INFO ] Invariant cache hit.
[2024-06-02 23:02:55] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/121 places, 313/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 411 ms. Remains : 117/121 places, 313/323 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s6 0) (EQ s116 0)), p0:(OR (EQ s10 0) (EQ s69 0)), p2:(OR (EQ s12 0) (EQ s28 0))], 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]]
Product exploration explored 100000 steps with 50000 reset in 275 ms.
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Computed a total of 20 stabilizing places and 42 stable transitions
Computed a total of 20 stabilizing places and 42 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 25 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-07-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-07-LTLFireability-07 finished in 1153 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))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 323/323 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 118 transition count 315
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 118 transition count 315
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 115 transition count 308
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 114 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 113 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 112 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 111 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 110 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 109 transition count 293
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 108 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 107 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 106 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 106 transition count 287
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 32 place count 105 transition count 286
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
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 38 place count 102 transition count 292
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 102 transition count 286
Applied a total of 44 rules in 37 ms. Remains 102 /121 variables (removed 19) and now considering 286/323 (removed 37) transitions.
[2024-06-02 23:02:56] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
// Phase 1: matrix 253 rows 102 cols
[2024-06-02 23:02:56] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 23:02:56] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 23:02:56] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 23:02:56] [INFO ] Invariant cache hit.
[2024-06-02 23:02:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 23:02:56] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-06-02 23:02:56] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 23:02:56] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 23:02:56] [INFO ] Invariant cache hit.
[2024-06-02 23:02:56] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/121 places, 286/323 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 461 ms. Remains : 102/121 places, 286/323 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s34 1) (EQ s44 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][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLFireability-08 finished in 500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 323/323 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 118 transition count 315
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 118 transition count 315
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 115 transition count 308
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 114 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 113 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 112 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 111 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 110 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 109 transition count 293
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 108 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 107 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 106 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 106 transition count 287
Applied a total of 30 rules in 15 ms. Remains 106 /121 variables (removed 15) and now considering 287/323 (removed 36) transitions.
[2024-06-02 23:02:56] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2024-06-02 23:02:56] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 23:02:56] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 23:02:56] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 23:02:56] [INFO ] Invariant cache hit.
[2024-06-02 23:02:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 23:02:57] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-06-02 23:02:57] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 23:02:57] [INFO ] Invariant cache hit.
[2024-06-02 23:02:57] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/121 places, 287/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 419 ms. Remains : 106/121 places, 287/323 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s8 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLFireability-10 finished in 530 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 U p1))))'
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 323/323 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 117 transition count 314
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 117 transition count 314
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 114 transition count 307
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 114 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 113 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 113 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 112 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 112 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 111 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 110 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 110 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 109 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 109 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 108 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 107 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 107 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 106 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 106 transition count 288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 105 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 105 transition count 286
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 32 place count 104 transition count 285
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
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 38 place count 101 transition count 291
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 101 transition count 285
Applied a total of 44 rules in 30 ms. Remains 101 /121 variables (removed 20) and now considering 285/323 (removed 38) transitions.
[2024-06-02 23:02:57] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
// Phase 1: matrix 252 rows 101 cols
[2024-06-02 23:02:57] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 23:02:57] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 23:02:57] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 23:02:57] [INFO ] Invariant cache hit.
[2024-06-02 23:02:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 23:02:57] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-06-02 23:02:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 23:02:57] [INFO ] Flow matrix only has 252 transitions (discarded 33 similar events)
[2024-06-02 23:02:57] [INFO ] Invariant cache hit.
[2024-06-02 23:02:57] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/121 places, 285/323 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 305 ms. Remains : 101/121 places, 285/323 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s98 1)), p0:(AND (EQ s7 1) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLFireability-12 finished in 407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X((G(F(p2))||p1)))))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 323/323 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 118 transition count 315
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 118 transition count 315
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 115 transition count 308
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 114 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 113 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 112 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 111 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 110 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 109 transition count 293
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 108 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 107 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 106 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 106 transition count 287
Applied a total of 30 rules in 17 ms. Remains 106 /121 variables (removed 15) and now considering 287/323 (removed 36) transitions.
[2024-06-02 23:02:57] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 106 cols
[2024-06-02 23:02:57] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 23:02:57] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 23:02:57] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 23:02:57] [INFO ] Invariant cache hit.
[2024-06-02 23:02:57] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 23:02:58] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-06-02 23:02:58] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 23:02:58] [INFO ] Invariant cache hit.
[2024-06-02 23:02:58] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/121 places, 287/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 449 ms. Remains : 106/121 places, 287/323 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s97 1)), p1:(OR (EQ s8 0) (EQ s90 0)), p2:(AND (EQ s8 1) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 174 ms.
Product exploration explored 100000 steps with 33333 reset in 184 ms.
Computed a total of 9 stabilizing places and 16 stable transitions
Computed a total of 9 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-07-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-07-LTLFireability-13 finished in 1070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(X(G(p1))&&G(p2))))'
Support contains 6 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 323/323 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 118 transition count 315
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 118 transition count 315
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 115 transition count 308
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 114 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 113 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 112 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 111 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 111 transition count 298
Applied a total of 20 rules in 9 ms. Remains 111 /121 variables (removed 10) and now considering 298/323 (removed 25) transitions.
[2024-06-02 23:02:58] [INFO ] Flow matrix only has 272 transitions (discarded 26 similar events)
// Phase 1: matrix 272 rows 111 cols
[2024-06-02 23:02:58] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 23:02:58] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 23:02:58] [INFO ] Flow matrix only has 272 transitions (discarded 26 similar events)
[2024-06-02 23:02:58] [INFO ] Invariant cache hit.
[2024-06-02 23:02:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 23:02:59] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-06-02 23:02:59] [INFO ] Flow matrix only has 272 transitions (discarded 26 similar events)
[2024-06-02 23:02:59] [INFO ] Invariant cache hit.
[2024-06-02 23:02:59] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/121 places, 298/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 111/121 places, 298/323 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : FireWire-PT-07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s104 1)), p2:(OR (NEQ s8 1) (NEQ s49 1)), p1:(AND (EQ s6 1) (EQ s103 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][false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-07-LTLFireability-15 finished in 439 ms.
All properties solved by simple procedures.
Total runtime 24017 ms.

BK_STOP 1717369380346

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

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