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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 153K 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-13-LTLFireability-00
FORMULA_NAME FireWire-PT-13-LTLFireability-01
FORMULA_NAME FireWire-PT-13-LTLFireability-02
FORMULA_NAME FireWire-PT-13-LTLFireability-03
FORMULA_NAME FireWire-PT-13-LTLFireability-04
FORMULA_NAME FireWire-PT-13-LTLFireability-05
FORMULA_NAME FireWire-PT-13-LTLFireability-06
FORMULA_NAME FireWire-PT-13-LTLFireability-07
FORMULA_NAME FireWire-PT-13-LTLFireability-08
FORMULA_NAME FireWire-PT-13-LTLFireability-09
FORMULA_NAME FireWire-PT-13-LTLFireability-10
FORMULA_NAME FireWire-PT-13-LTLFireability-11
FORMULA_NAME FireWire-PT-13-LTLFireability-12
FORMULA_NAME FireWire-PT-13-LTLFireability-13
FORMULA_NAME FireWire-PT-13-LTLFireability-14
FORMULA_NAME FireWire-PT-13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717369838806

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-13
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 23:10:40] [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:10:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:10:40] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-06-02 23:10:40] [INFO ] Transformed 205 places.
[2024-06-02 23:10:40] [INFO ] Transformed 610 transitions.
[2024-06-02 23:10:40] [INFO ] Found NUPN structural information;
[2024-06-02 23:10:40] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2309 arcs in 136 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
FORMULA FireWire-PT-13-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-13-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 542/542 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 201 transition count 534
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 201 transition count 534
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 201 transition count 533
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 200 transition count 530
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 200 transition count 530
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 199 transition count 528
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 199 transition count 528
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 198 transition count 525
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 198 transition count 525
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 197 transition count 523
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 197 transition count 523
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 197 transition count 517
Applied a total of 23 rules in 184 ms. Remains 197 /205 variables (removed 8) and now considering 517/542 (removed 25) transitions.
[2024-06-02 23:10:40] [INFO ] Flow matrix only has 485 transitions (discarded 32 similar events)
// Phase 1: matrix 485 rows 197 cols
[2024-06-02 23:10:40] [INFO ] Computed 10 invariants in 15 ms
[2024-06-02 23:10:41] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-06-02 23:10:41] [INFO ] Flow matrix only has 485 transitions (discarded 32 similar events)
[2024-06-02 23:10:41] [INFO ] Invariant cache hit.
[2024-06-02 23:10:41] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 23:10:41] [INFO ] Implicit Places using invariants and state equation in 343 ms returned [21, 83, 142]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 783 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/205 places, 517/542 transitions.
Applied a total of 0 rules in 9 ms. Remains 194 /194 variables (removed 0) and now considering 517/517 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 977 ms. Remains : 194/205 places, 517/542 transitions.
Support contains 40 out of 194 places after structural reductions.
[2024-06-02 23:10:41] [INFO ] Flatten gal took : 62 ms
[2024-06-02 23:10:41] [INFO ] Flatten gal took : 35 ms
[2024-06-02 23:10:41] [INFO ] Input system was already deterministic with 517 transitions.
Incomplete random walk after 10000 steps, including 279 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 32) seen :17
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2024-06-02 23:10:42] [INFO ] Flow matrix only has 485 transitions (discarded 32 similar events)
// Phase 1: matrix 485 rows 194 cols
[2024-06-02 23:10:42] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 23:10:42] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:10:42] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:13
[2024-06-02 23:10:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:10:43] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :13
[2024-06-02 23:10:43] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 23:10:43] [INFO ] After 298ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :1 sat :13
[2024-06-02 23:10:43] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 4 ms to minimize.
[2024-06-02 23:10:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-06-02 23:10:43] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:10:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-06-02 23:10:44] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:10:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-06-02 23:10:44] [INFO ] After 986ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :13
Attempting to minimize the solution found.
Minimization took 286 ms.
[2024-06-02 23:10:44] [INFO ] After 1776ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :13
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 96 ms.
Support contains 14 out of 194 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 194/194 places, 517/517 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 194 transition count 514
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 194 transition count 511
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 191 transition count 511
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 189 transition count 507
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 189 transition count 507
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 189 transition count 505
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 187 transition count 503
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 184 transition count 509
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 31 place count 184 transition count 503
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 34 place count 184 transition count 500
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 184 transition count 504
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 42 place count 182 transition count 500
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 46 place count 182 transition count 496
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 181 transition count 495
Applied a total of 47 rules in 103 ms. Remains 181 /194 variables (removed 13) and now considering 495/517 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 181/194 places, 495/517 transitions.
Incomplete random walk after 10000 steps, including 309 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-06-02 23:10:45] [INFO ] Flow matrix only has 459 transitions (discarded 36 similar events)
// Phase 1: matrix 459 rows 181 cols
[2024-06-02 23:10:45] [INFO ] Computed 7 invariants in 8 ms
[2024-06-02 23:10:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:10:45] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 23:10:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:10:45] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-02 23:10:45] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 23:10:45] [INFO ] After 186ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-06-02 23:10:45] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:10:46] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:10:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2024-06-02 23:10:46] [INFO ] After 552ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 152 ms.
[2024-06-02 23:10:46] [INFO ] After 1019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 8 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 495/495 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 181 transition count 497
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 180 transition count 495
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 180 transition count 493
Applied a total of 6 rules in 33 ms. Remains 180 /181 variables (removed 1) and now considering 493/495 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 180/181 places, 493/495 transitions.
Incomplete random walk after 10000 steps, including 314 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 423722 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 423722 steps, saw 112986 distinct states, run finished after 3002 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 8 properties.
[2024-06-02 23:10:49] [INFO ] Flow matrix only has 456 transitions (discarded 37 similar events)
// Phase 1: matrix 456 rows 180 cols
[2024-06-02 23:10:49] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:10:50] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:10:50] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 23:10:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:10:50] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-02 23:10:50] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 23:10:50] [INFO ] After 190ms SMT Verify possible using 69 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-06-02 23:10:50] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:10:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-06-02 23:10:50] [INFO ] After 470ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 184 ms.
[2024-06-02 23:10:51] [INFO ] After 960ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 8 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 493/493 transitions.
Applied a total of 0 rules in 16 ms. Remains 180 /180 variables (removed 0) and now considering 493/493 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 180/180 places, 493/493 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 493/493 transitions.
Applied a total of 0 rules in 9 ms. Remains 180 /180 variables (removed 0) and now considering 493/493 (removed 0) transitions.
[2024-06-02 23:10:51] [INFO ] Flow matrix only has 456 transitions (discarded 37 similar events)
[2024-06-02 23:10:51] [INFO ] Invariant cache hit.
[2024-06-02 23:10:51] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 23:10:51] [INFO ] Flow matrix only has 456 transitions (discarded 37 similar events)
[2024-06-02 23:10:51] [INFO ] Invariant cache hit.
[2024-06-02 23:10:51] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 23:10:51] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2024-06-02 23:10:51] [INFO ] Redundant transitions in 32 ms returned []
[2024-06-02 23:10:51] [INFO ] Flow matrix only has 456 transitions (discarded 37 similar events)
[2024-06-02 23:10:51] [INFO ] Invariant cache hit.
[2024-06-02 23:10:51] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 615 ms. Remains : 180/180 places, 493/493 transitions.
Graph (trivial) has 147 edges and 180 vertex of which 29 / 180 are part of one of the 4 SCC in 2 ms
Free SCC test removed 25 places
Drop transitions removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 154 transition count 348
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 154 transition count 339
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 153 transition count 338
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 153 transition count 337
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 17 place count 152 transition count 336
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 152 transition count 321
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 143 transition count 318
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 143 transition count 318
Applied a total of 44 rules in 58 ms. Remains 143 /180 variables (removed 37) and now considering 318/493 (removed 175) transitions.
Running SMT prover for 8 properties.
[2024-06-02 23:10:51] [INFO ] Flow matrix only has 316 transitions (discarded 2 similar events)
// Phase 1: matrix 316 rows 143 cols
[2024-06-02 23:10:51] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:10:51] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:10:51] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 23:10:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:10:52] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-02 23:10:52] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:10:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-06-02 23:10:52] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-06-02 23:10:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-06-02 23:10:52] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-06-02 23:10:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-06-02 23:10:52] [INFO ] After 487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 112 ms.
[2024-06-02 23:10:52] [INFO ] After 656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA FireWire-PT-13-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 51 stabilizing places and 120 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)||X(G((p1||X(G(p2))))))))'
Support contains 6 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 189 transition count 504
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 189 transition count 504
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 189 transition count 502
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 186 transition count 496
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 186 transition count 496
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 183 transition count 487
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 183 transition count 487
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 180 transition count 481
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 180 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 178 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 178 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 176 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 176 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 174 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 174 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 172 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 172 transition count 461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 170 transition count 455
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 170 transition count 455
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 168 transition count 451
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 168 transition count 451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 167 transition count 449
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 167 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 166 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 166 transition count 447
Applied a total of 58 rules in 27 ms. Remains 166 /194 variables (removed 28) and now considering 447/517 (removed 70) transitions.
[2024-06-02 23:10:52] [INFO ] Flow matrix only has 415 transitions (discarded 32 similar events)
// Phase 1: matrix 415 rows 166 cols
[2024-06-02 23:10:52] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:10:52] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 23:10:52] [INFO ] Flow matrix only has 415 transitions (discarded 32 similar events)
[2024-06-02 23:10:52] [INFO ] Invariant cache hit.
[2024-06-02 23:10:52] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 23:10:53] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-06-02 23:10:53] [INFO ] Flow matrix only has 415 transitions (discarded 32 similar events)
[2024-06-02 23:10:53] [INFO ] Invariant cache hit.
[2024-06-02 23:10:53] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/194 places, 447/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 593 ms. Remains : 166/194 places, 447/517 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 350 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s111 0)), p2:(AND (EQ s9 1) (EQ s34 1)), p1:(AND (EQ s7 1) (EQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 292 ms.
Product exploration explored 100000 steps with 50000 reset in 222 ms.
Computed a total of 25 stabilizing places and 56 stable transitions
Computed a total of 25 stabilizing places and 56 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (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-13-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-13-LTLFireability-00 finished in 1541 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((F(G(p0))&&(p1||G(p2)))))'
Support contains 6 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
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 6 place count 190 transition count 513
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 186 transition count 502
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 186 transition count 502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 186 transition count 501
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 183 transition count 495
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 183 transition count 495
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 180 transition count 486
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 180 transition count 486
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 177 transition count 480
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 177 transition count 480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 174 transition count 471
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 174 transition count 471
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 171 transition count 465
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 171 transition count 465
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 168 transition count 457
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 168 transition count 457
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 165 transition count 451
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 165 transition count 451
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 163 transition count 445
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 163 transition count 445
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 161 transition count 441
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 161 transition count 441
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 159 transition count 437
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 159 transition count 437
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 157 transition count 433
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 157 transition count 433
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 79 place count 154 transition count 430
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 1 with 6 rules applied. Total rules applied 85 place count 151 transition count 436
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 91 place count 151 transition count 430
Applied a total of 91 rules in 87 ms. Remains 151 /194 variables (removed 43) and now considering 430/517 (removed 87) transitions.
[2024-06-02 23:10:54] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
// Phase 1: matrix 391 rows 151 cols
[2024-06-02 23:10:54] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:10:54] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 23:10:54] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 23:10:54] [INFO ] Invariant cache hit.
[2024-06-02 23:10:54] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:10:54] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-06-02 23:10:54] [INFO ] Redundant transitions in 11 ms returned []
[2024-06-02 23:10:54] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 23:10:54] [INFO ] Invariant cache hit.
[2024-06-02 23:10:54] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/194 places, 430/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 543 ms. Remains : 151/194 places, 430/517 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s6 1) (EQ s89 1)), p0:(AND (EQ s4 1) (EQ s134 1)), p2:(AND (EQ s62 1) (EQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-01 finished in 688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||X(p2))))'
Support contains 5 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 190 transition count 506
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 190 transition count 506
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 190 transition count 505
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 187 transition count 499
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 187 transition count 499
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 184 transition count 490
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 184 transition count 490
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 181 transition count 484
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 181 transition count 484
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 178 transition count 475
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 178 transition count 475
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 175 transition count 469
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 175 transition count 469
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 172 transition count 461
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 172 transition count 461
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 169 transition count 455
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 169 transition count 455
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 167 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 167 transition count 449
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 165 transition count 445
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 165 transition count 445
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 163 transition count 441
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 163 transition count 441
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 161 transition count 437
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 161 transition count 437
Applied a total of 67 rules in 30 ms. Remains 161 /194 variables (removed 33) and now considering 437/517 (removed 80) transitions.
[2024-06-02 23:10:54] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
// Phase 1: matrix 405 rows 161 cols
[2024-06-02 23:10:54] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:10:55] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 23:10:55] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
[2024-06-02 23:10:55] [INFO ] Invariant cache hit.
[2024-06-02 23:10:55] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:10:55] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-06-02 23:10:55] [INFO ] Flow matrix only has 405 transitions (discarded 32 similar events)
[2024-06-02 23:10:55] [INFO ] Invariant cache hit.
[2024-06-02 23:10:55] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 161/194 places, 437/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 494 ms. Remains : 161/194 places, 437/517 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s5 1) (EQ s94 1)), p0:(OR (AND (EQ s5 1) (EQ s94 1)) (AND (EQ s8 1) (EQ s46 1))), p2:(EQ s148 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-13-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-03 finished in 645 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))||(F(!p0)&&X(p2)&&p1)) U X(p3)))'
Support contains 6 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 189 transition count 504
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 189 transition count 504
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 189 transition count 502
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 186 transition count 496
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 186 transition count 496
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 183 transition count 487
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 183 transition count 487
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 180 transition count 481
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 180 transition count 481
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 177 transition count 472
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 177 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 175 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 175 transition count 468
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 173 transition count 463
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 173 transition count 463
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 171 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 171 transition count 459
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 170 transition count 456
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 170 transition count 456
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 169 transition count 454
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 169 transition count 454
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 168 transition count 452
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 168 transition count 452
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 167 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 167 transition count 450
Applied a total of 56 rules in 32 ms. Remains 167 /194 variables (removed 27) and now considering 450/517 (removed 67) transitions.
[2024-06-02 23:10:55] [INFO ] Flow matrix only has 418 transitions (discarded 32 similar events)
// Phase 1: matrix 418 rows 167 cols
[2024-06-02 23:10:55] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:10:55] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 23:10:55] [INFO ] Flow matrix only has 418 transitions (discarded 32 similar events)
[2024-06-02 23:10:55] [INFO ] Invariant cache hit.
[2024-06-02 23:10:55] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:10:56] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2024-06-02 23:10:56] [INFO ] Flow matrix only has 418 transitions (discarded 32 similar events)
[2024-06-02 23:10:56] [INFO ] Invariant cache hit.
[2024-06-02 23:10:56] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 167/194 places, 450/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 723 ms. Remains : 167/194 places, 450/517 transitions.
Stuttering acceptance computed with spot in 279 ms :[(NOT p3), (NOT p0), (NOT p3), (NOT p3), (OR (NOT p3) (NOT p0))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p1) (NOT p3) p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p1 p0 (NOT p3)) (AND p1 (NOT p3) p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) p3), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 p0 (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s8 1) (EQ s144 1)), p0:(AND (EQ s8 1) (EQ s166 1)), p3:(AND (EQ s4 1) (EQ s158 1)), p2:(AND (EQ s8 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-04 finished in 1033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
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 6 place count 190 transition count 513
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 186 transition count 503
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 186 transition count 503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 186 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 184 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 184 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 182 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 182 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 180 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 180 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 178 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 178 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 176 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 174 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 174 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 172 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 172 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 171 transition count 465
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 171 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 170 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 170 transition count 463
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 169 transition count 461
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 169 transition count 461
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 168 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 168 transition count 459
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 165 transition count 456
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 1 with 6 rules applied. Total rules applied 64 place count 162 transition count 462
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 162 transition count 456
Applied a total of 70 rules in 62 ms. Remains 162 /194 variables (removed 32) and now considering 456/517 (removed 61) transitions.
[2024-06-02 23:10:56] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
// Phase 1: matrix 417 rows 162 cols
[2024-06-02 23:10:56] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:10:56] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 23:10:56] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:10:56] [INFO ] Invariant cache hit.
[2024-06-02 23:10:56] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:10:57] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-06-02 23:10:57] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 23:10:57] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:10:57] [INFO ] Invariant cache hit.
[2024-06-02 23:10:57] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/194 places, 456/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 596 ms. Remains : 162/194 places, 456/517 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s16 1) (EQ s54 1)), p0:(AND (EQ s8 1) (EQ s21 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-06 finished in 688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X((G(F(p2))&&p1)))))))'
Support contains 6 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 190 transition count 507
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 190 transition count 507
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 190 transition count 505
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 188 transition count 501
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 188 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 186 transition count 495
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 186 transition count 495
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 184 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 184 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 182 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 182 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 180 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 180 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 178 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 178 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 176 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 176 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 174 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 174 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 172 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 172 transition count 461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 170 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 170 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 168 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 168 transition count 453
Applied a total of 54 rules in 35 ms. Remains 168 /194 variables (removed 26) and now considering 453/517 (removed 64) transitions.
[2024-06-02 23:10:57] [INFO ] Flow matrix only has 421 transitions (discarded 32 similar events)
// Phase 1: matrix 421 rows 168 cols
[2024-06-02 23:10:57] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:10:57] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 23:10:57] [INFO ] Flow matrix only has 421 transitions (discarded 32 similar events)
[2024-06-02 23:10:57] [INFO ] Invariant cache hit.
[2024-06-02 23:10:57] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:10:57] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-06-02 23:10:57] [INFO ] Flow matrix only has 421 transitions (discarded 32 similar events)
[2024-06-02 23:10:57] [INFO ] Invariant cache hit.
[2024-06-02 23:10:57] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/194 places, 453/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 539 ms. Remains : 168/194 places, 453/517 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s66 1) (EQ s106 1)), p1:(AND (EQ s3 1) (EQ s77 1)), p2:(AND (EQ s11 1) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-09 finished in 840 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||G((p1&&(F(p3)||p2))))))'
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
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 6 place count 190 transition count 513
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 186 transition count 503
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 186 transition count 503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 186 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 184 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 184 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 182 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 182 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 180 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 180 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 178 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 178 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 176 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 174 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 174 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 172 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 172 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 171 transition count 465
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 171 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 170 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 170 transition count 463
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 169 transition count 461
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 169 transition count 461
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 168 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 168 transition count 459
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 165 transition count 456
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 1 with 6 rules applied. Total rules applied 64 place count 162 transition count 462
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 162 transition count 456
Applied a total of 70 rules in 62 ms. Remains 162 /194 variables (removed 32) and now considering 456/517 (removed 61) transitions.
[2024-06-02 23:10:58] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
// Phase 1: matrix 417 rows 162 cols
[2024-06-02 23:10:58] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:10:58] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 23:10:58] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:10:58] [INFO ] Invariant cache hit.
[2024-06-02 23:10:58] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:10:58] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-06-02 23:10:58] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 23:10:58] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:10:58] [INFO ] Invariant cache hit.
[2024-06-02 23:10:58] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/194 places, 456/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 578 ms. Remains : 162/194 places, 456/517 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-10 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=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s2 0) (EQ s148 0)), p0:(AND (EQ s2 1) (EQ s96 1)), p2:(OR (EQ s2 0) (EQ s152 0)), p3:(OR (EQ s2 0) (EQ s152 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 218 ms.
Product exploration explored 100000 steps with 2 reset in 118 ms.
Computed a total of 24 stabilizing places and 65 stable transitions
Computed a total of 24 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2 p3), (X (AND p1 (NOT p0))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 110 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter insensitive) to 2 states, 5 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Incomplete random walk after 10000 steps, including 346 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 66 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-06-02 23:10:59] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:10:59] [INFO ] Invariant cache hit.
[2024-06-02 23:10:59] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-06-02 23:10:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:10:59] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-06-02 23:10:59] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:10:59] [INFO ] After 85ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-06-02 23:11:00] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-06-02 23:11:00] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 456/456 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 162 transition count 450
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 162 transition count 456
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 159 transition count 450
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 159 transition count 444
Applied a total of 24 rules in 21 ms. Remains 159 /162 variables (removed 3) and now considering 444/456 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 159/162 places, 444/456 transitions.
Incomplete random walk after 10000 steps, including 338 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 23:11:00] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
// Phase 1: matrix 407 rows 159 cols
[2024-06-02 23:11:00] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:11:00] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:11:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:11:00] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 23:11:00] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:11:00] [INFO ] After 66ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 23:11:00] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-06-02 23:11:00] [INFO ] After 287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 444/444 transitions.
Applied a total of 0 rules in 9 ms. Remains 159 /159 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 159/159 places, 444/444 transitions.
Finished random walk after 5638 steps, including 179 resets, run visited all 2 properties in 62 ms. (steps per millisecond=90 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2 p3), (X (AND p1 (NOT p0))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2) (NOT p3))))), (G (NOT (AND (NOT p0) p1 (NOT p3) p2)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) p1 (NOT p3) (NOT p2))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 12 factoid took 207 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 67 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 456/456 transitions.
Applied a total of 0 rules in 15 ms. Remains 162 /162 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2024-06-02 23:11:01] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
// Phase 1: matrix 417 rows 162 cols
[2024-06-02 23:11:01] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:11:01] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 23:11:01] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:11:01] [INFO ] Invariant cache hit.
[2024-06-02 23:11:01] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:11:01] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2024-06-02 23:11:01] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:11:01] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:11:01] [INFO ] Invariant cache hit.
[2024-06-02 23:11:01] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 530 ms. Remains : 162/162 places, 456/456 transitions.
Computed a total of 24 stabilizing places and 65 stable transitions
Computed a total of 24 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 332 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-02 23:11:02] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:11:02] [INFO ] Invariant cache hit.
[2024-06-02 23:11:02] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:11:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:11:02] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:11:02] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:11:02] [INFO ] After 68ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:11:02] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-06-02 23:11:02] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 456/456 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 162 transition count 450
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 162 transition count 456
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 159 transition count 450
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 159 transition count 444
Applied a total of 24 rules in 20 ms. Remains 159 /162 variables (removed 3) and now considering 444/456 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 159/162 places, 444/456 transitions.
Incomplete random walk after 10000 steps, including 305 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:11:02] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
// Phase 1: matrix 407 rows 159 cols
[2024-06-02 23:11:02] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:11:02] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:11:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:11:02] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:11:02] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:11:02] [INFO ] After 53ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:11:02] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-06-02 23:11:02] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 444/444 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 159/159 places, 444/444 transitions.
Incomplete random walk after 10000 steps, including 337 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 69 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 823881 steps, run visited all 1 properties in 1802 ms. (steps per millisecond=457 )
Probabilistic random walk after 823881 steps, saw 201366 distinct states, run finished after 1803 ms. (steps per millisecond=456 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p3), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) p1 (NOT p3))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 264 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 81 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 4 reset in 96 ms.
Product exploration explored 100000 steps with 1 reset in 184 ms.
Built C files in :
/tmp/ltsmin17192588302250419018
[2024-06-02 23:11:05] [INFO ] Computing symmetric may disable matrix : 456 transitions.
[2024-06-02 23:11:05] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:11:05] [INFO ] Computing symmetric may enable matrix : 456 transitions.
[2024-06-02 23:11:05] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:11:05] [INFO ] Computing Do-Not-Accords matrix : 456 transitions.
[2024-06-02 23:11:05] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:11:05] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17192588302250419018
Running compilation step : cd /tmp/ltsmin17192588302250419018;'/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 1013 ms.
Running link step : cd /tmp/ltsmin17192588302250419018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin17192588302250419018;'/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/stateBased10121618661917056515.hoa' '--buchi-type=spotba'
LTSmin run took 11354 ms.
FORMULA FireWire-PT-13-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-13-LTLFireability-10 finished in 19887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((F(p2)&&p1))||p0)))'
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 190 transition count 513
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 185 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 185 transition count 500
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 185 transition count 498
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 182 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 182 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 179 transition count 483
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 179 transition count 483
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 176 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 173 transition count 468
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 173 transition count 468
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 170 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 170 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 167 transition count 454
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 167 transition count 454
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 164 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 164 transition count 448
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 162 transition count 442
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 162 transition count 442
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 160 transition count 438
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 160 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 158 transition count 434
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 158 transition count 434
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 157 transition count 432
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 157 transition count 432
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 154 transition count 429
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 84 place count 152 transition count 433
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 152 transition count 429
Applied a total of 88 rules in 48 ms. Remains 152 /194 variables (removed 42) and now considering 429/517 (removed 88) transitions.
[2024-06-02 23:11:18] [INFO ] Flow matrix only has 393 transitions (discarded 36 similar events)
// Phase 1: matrix 393 rows 152 cols
[2024-06-02 23:11:18] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:11:18] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 23:11:18] [INFO ] Flow matrix only has 393 transitions (discarded 36 similar events)
[2024-06-02 23:11:18] [INFO ] Invariant cache hit.
[2024-06-02 23:11:18] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:11:18] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-06-02 23:11:18] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:11:18] [INFO ] Flow matrix only has 393 transitions (discarded 36 similar events)
[2024-06-02 23:11:18] [INFO ] Invariant cache hit.
[2024-06-02 23:11:18] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/194 places, 429/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 526 ms. Remains : 152/194 places, 429/517 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s100 0)), p1:(AND (EQ s3 1) (EQ s56 1)), p2:(AND (EQ s7 1) (EQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 7 reset in 78 ms.
Entered a terminal (fully accepting) state of product in 105 steps with 4 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-11 finished in 765 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 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 190 transition count 513
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 185 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 185 transition count 500
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 185 transition count 498
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 182 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 182 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 179 transition count 483
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 179 transition count 483
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 176 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 173 transition count 468
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 173 transition count 468
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 170 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 170 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 167 transition count 454
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 167 transition count 454
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 164 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 164 transition count 448
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 162 transition count 442
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 162 transition count 442
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 160 transition count 438
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 160 transition count 438
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 159 transition count 436
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 159 transition count 436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 158 transition count 434
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 158 transition count 434
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 155 transition count 431
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 1 with 6 rules applied. Total rules applied 84 place count 152 transition count 437
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 152 transition count 431
Applied a total of 90 rules in 38 ms. Remains 152 /194 variables (removed 42) and now considering 431/517 (removed 86) transitions.
[2024-06-02 23:11:18] [INFO ] Flow matrix only has 392 transitions (discarded 39 similar events)
// Phase 1: matrix 392 rows 152 cols
[2024-06-02 23:11:18] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:11:18] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 23:11:18] [INFO ] Flow matrix only has 392 transitions (discarded 39 similar events)
[2024-06-02 23:11:18] [INFO ] Invariant cache hit.
[2024-06-02 23:11:19] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:11:19] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-06-02 23:11:19] [INFO ] Redundant transitions in 5 ms returned []
[2024-06-02 23:11:19] [INFO ] Flow matrix only has 392 transitions (discarded 39 similar events)
[2024-06-02 23:11:19] [INFO ] Invariant cache hit.
[2024-06-02 23:11:19] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/194 places, 431/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 516 ms. Remains : 152/194 places, 431/517 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s148 1) (OR (EQ s6 0) (EQ s137 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-13-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-13-LTLFireability-12 finished in 576 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((!(F(G(p0)) U !p1)||F(X((G(p2)&&p3))))))'
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 190 transition count 507
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 190 transition count 507
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 190 transition count 505
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 188 transition count 501
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 188 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 186 transition count 495
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 186 transition count 495
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 184 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 184 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 182 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 182 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 180 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 180 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 178 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 178 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 176 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 176 transition count 471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 175 transition count 468
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 175 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 174 transition count 466
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 174 transition count 466
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 173 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 173 transition count 464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 172 transition count 462
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 172 transition count 462
Applied a total of 46 rules in 15 ms. Remains 172 /194 variables (removed 22) and now considering 462/517 (removed 55) transitions.
[2024-06-02 23:11:19] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
// Phase 1: matrix 430 rows 172 cols
[2024-06-02 23:11:19] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:11:19] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 23:11:19] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2024-06-02 23:11:19] [INFO ] Invariant cache hit.
[2024-06-02 23:11:19] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 23:11:19] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2024-06-02 23:11:19] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2024-06-02 23:11:19] [INFO ] Invariant cache hit.
[2024-06-02 23:11:20] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 172/194 places, 462/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 703 ms. Remains : 172/194 places, 462/517 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-13-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p3 p2), acceptance={0} source=1 dest: 4}, { cond=(AND p1 p3 p2), acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND p0 (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(AND p3 p2), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1) p3 p2), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), acceptance={1} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p1 p3 p2), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1) p3 p2), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={1} source=6 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s138 1)), p0:(AND (EQ s3 1) (EQ s77 1)), p3:(EQ s68 0), p2:(OR (EQ s3 0) (EQ s138 0))], nbAcceptance=2, 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]]
Product exploration explored 100000 steps with 3 reset in 82 ms.
Product exploration explored 100000 steps with 0 reset in 135 ms.
Computed a total of 31 stabilizing places and 71 stable transitions
Computed a total of 31 stabilizing places and 71 stable transitions
Detected a total of 31/172 stabilizing places and 71/462 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X (NOT (OR (NOT p3) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))))), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT (AND p1 p3 p2))), (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))))), (X (NOT (AND p0 p1 p3 p2))), (X (AND (NOT p1) p3 p2)), (X (AND p3 p2)), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (AND (NOT p1) p3 p2))), (X (X (AND p3 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 34 factoid took 265 ms. Reduced automaton from 7 states, 29 edges and 4 AP (stutter sensitive) to 7 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 288 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 390351 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 390351 steps, saw 91598 distinct states, run finished after 3002 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 21 properties.
[2024-06-02 23:11:24] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2024-06-02 23:11:24] [INFO ] Invariant cache hit.
[2024-06-02 23:11:24] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:11:24] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:17
[2024-06-02 23:11:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:11:25] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :14
[2024-06-02 23:11:25] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 23:11:25] [INFO ] After 287ms SMT Verify possible using 62 Read/Feed constraints in natural domain returned unsat :7 sat :14
[2024-06-02 23:11:25] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:11:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-06-02 23:11:25] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:11:26] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2024-06-02 23:11:26] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2024-06-02 23:11:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 250 ms
[2024-06-02 23:11:26] [INFO ] After 958ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :14
Attempting to minimize the solution found.
Minimization took 240 ms.
[2024-06-02 23:11:26] [INFO ] After 1621ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :14
Fused 21 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 79 ms.
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 462/462 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 172 transition count 459
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 172 transition count 456
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 169 transition count 456
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 13 place count 167 transition count 454
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 1 with 6 rules applied. Total rules applied 19 place count 164 transition count 460
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 25 place count 164 transition count 454
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 164 transition count 451
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 164 transition count 457
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 40 place count 161 transition count 451
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 161 transition count 445
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 160 transition count 444
Applied a total of 47 rules in 27 ms. Remains 160 /172 variables (removed 12) and now considering 444/462 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 160/172 places, 444/462 transitions.
Incomplete random walk after 10000 steps, including 322 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 352275 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 352275 steps, saw 95391 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 14 properties.
[2024-06-02 23:11:30] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
// Phase 1: matrix 407 rows 160 cols
[2024-06-02 23:11:30] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:11:30] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:11:30] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-06-02 23:11:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:11:31] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-06-02 23:11:31] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:11:31] [INFO ] After 241ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2024-06-02 23:11:31] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:11:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-06-02 23:11:31] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 0 ms to minimize.
[2024-06-02 23:11:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2024-06-02 23:11:31] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 0 ms to minimize.
[2024-06-02 23:11:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-06-02 23:11:32] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2024-06-02 23:11:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-06-02 23:11:32] [INFO ] After 920ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 242 ms.
[2024-06-02 23:11:32] [INFO ] After 1528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 444/444 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 160/160 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 444/444 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2024-06-02 23:11:32] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 23:11:32] [INFO ] Invariant cache hit.
[2024-06-02 23:11:32] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 23:11:32] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 23:11:32] [INFO ] Invariant cache hit.
[2024-06-02 23:11:32] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:11:32] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-06-02 23:11:32] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:11:32] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 23:11:32] [INFO ] Invariant cache hit.
[2024-06-02 23:11:33] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 557 ms. Remains : 160/160 places, 444/444 transitions.
Graph (trivial) has 140 edges and 160 vertex of which 29 / 160 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 134 transition count 299
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 134 transition count 290
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 14 place count 133 transition count 289
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 133 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 17 place count 132 transition count 287
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 132 transition count 272
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 123 transition count 269
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 123 transition count 269
Applied a total of 44 rules in 25 ms. Remains 123 /160 variables (removed 37) and now considering 269/444 (removed 175) transitions.
Running SMT prover for 14 properties.
[2024-06-02 23:11:33] [INFO ] Flow matrix only has 267 transitions (discarded 2 similar events)
// Phase 1: matrix 267 rows 123 cols
[2024-06-02 23:11:33] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:11:33] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:11:33] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-06-02 23:11:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:11:33] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-06-02 23:11:33] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:11:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-06-02 23:11:33] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-06-02 23:11:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-06-02 23:11:33] [INFO ] After 540ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 145 ms.
[2024-06-02 23:11:34] [INFO ] After 776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X (NOT (OR (NOT p3) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))))), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT (AND p1 p3 p2))), (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))))), (X (NOT (AND p0 p1 p3 p2))), (X (AND (NOT p1) p3 p2)), (X (AND p3 p2)), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (AND (NOT p1) p3 p2))), (X (X (AND p3 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 p2)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND p1 p2))), (G (NOT (AND p1 p3 p2))), (G (NOT (AND (NOT p1) (NOT p2) p0))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND p1 p3 p2 p0))), (G (NOT (AND p1 p2 p0))), (G (NOT (OR (AND (NOT p1) (NOT p3) p0) (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 41 factoid took 260 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[false, false, false]
Stuttering acceptance computed with spot in 101 ms :[false, false, false]
Support contains 3 out of 172 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 462/462 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 171 transition count 458
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 6 place count 168 transition count 458
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 166 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 163 transition count 462
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 163 transition count 456
Applied a total of 22 rules in 20 ms. Remains 163 /172 variables (removed 9) and now considering 456/462 (removed 6) transitions.
[2024-06-02 23:11:34] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
// Phase 1: matrix 417 rows 163 cols
[2024-06-02 23:11:34] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:11:34] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 23:11:34] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:11:34] [INFO ] Invariant cache hit.
[2024-06-02 23:11:34] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:11:34] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-06-02 23:11:34] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:11:34] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:11:34] [INFO ] Invariant cache hit.
[2024-06-02 23:11:35] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/172 places, 456/462 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 502 ms. Remains : 163/172 places, 456/462 transitions.
Computed a total of 25 stabilizing places and 65 stable transitions
Computed a total of 25 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X p2)), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 100 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[false, false, false]
Incomplete random walk after 10000 steps, including 330 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 566529 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 566529 steps, saw 126209 distinct states, run finished after 3001 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 4 properties.
[2024-06-02 23:11:38] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:11:38] [INFO ] Invariant cache hit.
[2024-06-02 23:11:38] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:11:38] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 23:11:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:11:38] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 23:11:38] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:11:39] [INFO ] After 80ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-02 23:11:39] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 64 ms.
[2024-06-02 23:11:39] [INFO ] After 438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 456/456 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 450
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 8 place count 162 transition count 449
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 162 transition count 455
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 20 place count 159 transition count 449
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 159 transition count 443
Applied a total of 26 rules in 19 ms. Remains 159 /163 variables (removed 4) and now considering 443/456 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 159/163 places, 443/456 transitions.
Incomplete random walk after 10000 steps, including 326 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 533894 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :{}
Probabilistic random walk after 533894 steps, saw 133868 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
Running SMT prover for 4 properties.
[2024-06-02 23:11:42] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
// Phase 1: matrix 406 rows 159 cols
[2024-06-02 23:11:42] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:11:42] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:11:42] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 23:11:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:11:42] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 23:11:42] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:11:42] [INFO ] After 115ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-02 23:11:43] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-06-02 23:11:43] [INFO ] After 447ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 443/443 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 159/159 places, 443/443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 443/443 transitions.
Applied a total of 0 rules in 5 ms. Remains 159 /159 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2024-06-02 23:11:43] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 23:11:43] [INFO ] Invariant cache hit.
[2024-06-02 23:11:43] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 23:11:43] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 23:11:43] [INFO ] Invariant cache hit.
[2024-06-02 23:11:43] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:11:43] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-06-02 23:11:43] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:11:43] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 23:11:43] [INFO ] Invariant cache hit.
[2024-06-02 23:11:43] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 159/159 places, 443/443 transitions.
Graph (trivial) has 140 edges and 159 vertex of which 29 / 159 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 298
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 133 transition count 289
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 14 place count 132 transition count 288
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 132 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 17 place count 131 transition count 286
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 131 transition count 271
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 122 transition count 268
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 122 transition count 268
Applied a total of 44 rules in 24 ms. Remains 122 /159 variables (removed 37) and now considering 268/443 (removed 175) transitions.
Running SMT prover for 4 properties.
[2024-06-02 23:11:43] [INFO ] Flow matrix only has 266 transitions (discarded 2 similar events)
// Phase 1: matrix 266 rows 122 cols
[2024-06-02 23:11:43] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:11:43] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:11:43] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 23:11:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:11:43] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 23:11:43] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:11:43] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-06-02 23:11:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-06-02 23:11:44] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-06-02 23:11:44] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X p2)), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 90 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[false, false, false]
Stuttering acceptance computed with spot in 115 ms :[false, false, false]
Stuttering acceptance computed with spot in 120 ms :[false, false, false]
Product exploration explored 100000 steps with 1 reset in 55 ms.
Product exploration explored 100000 steps with 1 reset in 55 ms.
Built C files in :
/tmp/ltsmin17357548486064615452
[2024-06-02 23:11:44] [INFO ] Computing symmetric may disable matrix : 456 transitions.
[2024-06-02 23:11:44] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:11:44] [INFO ] Computing symmetric may enable matrix : 456 transitions.
[2024-06-02 23:11:44] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:11:44] [INFO ] Computing Do-Not-Accords matrix : 456 transitions.
[2024-06-02 23:11:44] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:11:44] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17357548486064615452
Running compilation step : cd /tmp/ltsmin17357548486064615452;'/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 955 ms.
Running link step : cd /tmp/ltsmin17357548486064615452;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17357548486064615452;'/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/stateBased996672561255569831.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 456/456 transitions.
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 2 place count 162 transition count 455
Applied a total of 2 rules in 7 ms. Remains 162 /163 variables (removed 1) and now considering 455/456 (removed 1) transitions.
[2024-06-02 23:11:59] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
// Phase 1: matrix 416 rows 162 cols
[2024-06-02 23:11:59] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 23:11:59] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 23:11:59] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
[2024-06-02 23:11:59] [INFO ] Invariant cache hit.
[2024-06-02 23:12:00] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:12:00] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-06-02 23:12:00] [INFO ] Redundant transitions in 5 ms returned []
[2024-06-02 23:12:00] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
[2024-06-02 23:12:00] [INFO ] Invariant cache hit.
[2024-06-02 23:12:00] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/163 places, 455/456 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 535 ms. Remains : 162/163 places, 455/456 transitions.
Built C files in :
/tmp/ltsmin14536314907871618562
[2024-06-02 23:12:00] [INFO ] Computing symmetric may disable matrix : 455 transitions.
[2024-06-02 23:12:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:12:00] [INFO ] Computing symmetric may enable matrix : 455 transitions.
[2024-06-02 23:12:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:12:00] [INFO ] Computing Do-Not-Accords matrix : 455 transitions.
[2024-06-02 23:12:00] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:12:00] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14536314907871618562
Running compilation step : cd /tmp/ltsmin14536314907871618562;'/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 918 ms.
Running link step : cd /tmp/ltsmin14536314907871618562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14536314907871618562;'/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/stateBased1857916775712040028.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 23:12:15] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:12:15] [INFO ] Flatten gal took : 23 ms
[2024-06-02 23:12:15] [INFO ] Time to serialize gal into /tmp/LTL13198385054018886239.gal : 3 ms
[2024-06-02 23:12:15] [INFO ] Time to serialize properties into /tmp/LTL1495142194048249267.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13198385054018886239.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17799960736066234722.hoa' '-atoms' '/tmp/LTL1495142194048249267.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1495142194048249267.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17799960736066234722.hoa
Detected timeout of ITS tools.
[2024-06-02 23:12:30] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:12:30] [INFO ] Flatten gal took : 20 ms
[2024-06-02 23:12:30] [INFO ] Time to serialize gal into /tmp/LTL16151656237387767008.gal : 3 ms
[2024-06-02 23:12:30] [INFO ] Time to serialize properties into /tmp/LTL16866558557863976815.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16151656237387767008.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16866558557863976815.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((p3==1)&&(p93==1))")))U(!("((p3==1)&&(p161==1))"))))||(F(X((G("((p3==0)||(p161==0))"))&&("(p83==0)")))))))
Formula 0 simplified : G((FG"((p3==1)&&(p93==1))" U !"((p3==1)&&(p161==1))") & XG(!"(p83==0)" | F!"((p3==0)||(p161==0))"))
Detected timeout of ITS tools.
[2024-06-02 23:12:45] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:12:45] [INFO ] Applying decomposition
[2024-06-02 23:12:45] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7178870165731996014.txt' '-o' '/tmp/graph7178870165731996014.bin' '-w' '/tmp/graph7178870165731996014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7178870165731996014.bin' '-l' '-1' '-v' '-w' '/tmp/graph7178870165731996014.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:12:45] [INFO ] Decomposing Gal with order
[2024-06-02 23:12:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:12:45] [INFO ] Removed a total of 668 redundant transitions.
[2024-06-02 23:12:45] [INFO ] Flatten gal took : 71 ms
[2024-06-02 23:12:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 123 labels/synchronizations in 12 ms.
[2024-06-02 23:12:45] [INFO ] Time to serialize gal into /tmp/LTL3947496734066755898.gal : 6 ms
[2024-06-02 23:12:45] [INFO ] Time to serialize properties into /tmp/LTL3304798767294970939.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3947496734066755898.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3304798767294970939.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((i0.u0.p3==1)&&(i0.u0.p93==1))")))U(!("((i0.u0.p3==1)&&(i0.u0.p161==1))"))))||(F(X((G("((i0.u0.p3==0)||(i0.u0.p161==0))...185
Formula 0 simplified : G((FG"((i0.u0.p3==1)&&(i0.u0.p93==1))" U !"((i0.u0.p3==1)&&(i0.u0.p161==1))") & XG(!"(i6.u20.p83==0)" | F!"((i0.u0.p3==0)||(i0.u0.p1...165
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7329617255708093906
[2024-06-02 23:13:01] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7329617255708093906
Running compilation step : cd /tmp/ltsmin7329617255708093906;'/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 628 ms.
Running link step : cd /tmp/ltsmin7329617255708093906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7329617255708093906;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((!(<>([]((LTLAPp0==true))) U !(LTLAPp1==true))||<>(X(([]((LTLAPp2==true))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FireWire-PT-13-LTLFireability-13 finished in 116736 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 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 190 transition count 513
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 185 transition count 500
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 185 transition count 500
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 185 transition count 498
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 182 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 182 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 179 transition count 483
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 179 transition count 483
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 176 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 173 transition count 468
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 173 transition count 468
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 170 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 170 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 167 transition count 454
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 167 transition count 454
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 164 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 164 transition count 448
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 162 transition count 442
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 162 transition count 442
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 160 transition count 438
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 160 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 158 transition count 434
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 158 transition count 434
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 156 transition count 430
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 156 transition count 430
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 153 transition count 427
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 150 transition count 433
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 150 transition count 427
Applied a total of 94 rules in 48 ms. Remains 150 /194 variables (removed 44) and now considering 427/517 (removed 90) transitions.
[2024-06-02 23:13:16] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
// Phase 1: matrix 388 rows 150 cols
[2024-06-02 23:13:16] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:13:16] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 23:13:16] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:13:16] [INFO ] Invariant cache hit.
[2024-06-02 23:13:16] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:13:16] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-06-02 23:13:16] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 23:13:16] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:13:16] [INFO ] Invariant cache hit.
[2024-06-02 23:13:16] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/194 places, 427/517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 513 ms. Remains : 150/194 places, 427/517 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-13-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s7 1) (NEQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2 reset in 64 ms.
Product exploration explored 100000 steps with 3 reset in 48 ms.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 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)]
Finished random walk after 402 steps, including 11 resets, run visited all 1 properties in 4 ms. (steps per millisecond=100 )
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 87 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 427/427 transitions.
Applied a total of 0 rules in 8 ms. Remains 150 /150 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2024-06-02 23:13:17] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:13:17] [INFO ] Invariant cache hit.
[2024-06-02 23:13:17] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 23:13:17] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:13:17] [INFO ] Invariant cache hit.
[2024-06-02 23:13:17] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:13:17] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-06-02 23:13:17] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 23:13:17] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:13:17] [INFO ] Invariant cache hit.
[2024-06-02 23:13:17] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 465 ms. Remains : 150/150 places, 427/427 transitions.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 6998 steps, including 241 resets, run visited all 1 properties in 19 ms. (steps per millisecond=368 )
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 86 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13 reset in 51 ms.
Product exploration explored 100000 steps with 2 reset in 48 ms.
Built C files in :
/tmp/ltsmin4556956973380573984
[2024-06-02 23:13:18] [INFO ] Computing symmetric may disable matrix : 427 transitions.
[2024-06-02 23:13:18] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:13:18] [INFO ] Computing symmetric may enable matrix : 427 transitions.
[2024-06-02 23:13:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:13:18] [INFO ] Computing Do-Not-Accords matrix : 427 transitions.
[2024-06-02 23:13:18] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:13:18] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4556956973380573984
Running compilation step : cd /tmp/ltsmin4556956973380573984;'/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 930 ms.
Running link step : cd /tmp/ltsmin4556956973380573984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin4556956973380573984;'/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/stateBased16591951181515787251.hoa' '--buchi-type=spotba'
LTSmin run took 967 ms.
FORMULA FireWire-PT-13-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-13-LTLFireability-15 finished in 3905 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((!(F(G(p0)) U !p1)||F(X((G(p2)&&p3))))))'
Found a Shortening insensitive property : FireWire-PT-13-LTLFireability-13
Stuttering acceptance computed with spot in 315 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 194/194 places, 517/517 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 193 transition count 513
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 6 place count 190 transition count 513
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 186 transition count 503
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 186 transition count 503
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 186 transition count 501
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 184 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 184 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 182 transition count 491
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 182 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 180 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 180 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 178 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 178 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 176 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 176 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 174 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 174 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 172 transition count 467
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 172 transition count 467
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 171 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 171 transition count 464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 170 transition count 462
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 170 transition count 462
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 169 transition count 460
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 169 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 168 transition count 458
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 168 transition count 458
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 56 place count 166 transition count 456
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 1 with 6 rules applied. Total rules applied 62 place count 163 transition count 462
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 163 transition count 459
Applied a total of 65 rules in 49 ms. Remains 163 /194 variables (removed 31) and now considering 459/517 (removed 58) transitions.
[2024-06-02 23:13:20] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
// Phase 1: matrix 420 rows 163 cols
[2024-06-02 23:13:20] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:13:20] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 23:13:20] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
[2024-06-02 23:13:20] [INFO ] Invariant cache hit.
[2024-06-02 23:13:20] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:13:20] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-06-02 23:13:20] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
[2024-06-02 23:13:20] [INFO ] Invariant cache hit.
[2024-06-02 23:13:21] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 163/194 places, 459/517 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 562 ms. Remains : 163/194 places, 459/517 transitions.
Running random walk in product with property : FireWire-PT-13-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p3 p2), acceptance={0} source=1 dest: 4}, { cond=(AND p1 p3 p2), acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND p0 (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(AND p3 p2), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1) p3 p2), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))), acceptance={1} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p1 p3 p2), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1) p3 p2), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={1} source=6 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s2 1) (EQ s130 1)), p0:(AND (EQ s2 1) (EQ s72 1)), p3:(EQ s64 0), p2:(OR (EQ s2 0) (EQ s130 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 75 ms.
Product exploration explored 100000 steps with 1 reset in 83 ms.
Computed a total of 25 stabilizing places and 65 stable transitions
Computed a total of 25 stabilizing places and 65 stable transitions
Detected a total of 25/163 stabilizing places and 65/459 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X (NOT (OR (NOT p3) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))))), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT (AND p1 p3 p2))), (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))))), (X (NOT (AND p0 p1 p3 p2))), (X (AND (NOT p1) p3 p2)), (X (AND p3 p2)), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (AND (NOT p1) p3 p2))), (X (X (AND p3 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 34 factoid took 263 ms. Reduced automaton from 7 states, 29 edges and 4 AP (stutter sensitive) to 7 states, 27 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 319 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) 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 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 374959 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 374959 steps, saw 88642 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 21 properties.
[2024-06-02 23:13:25] [INFO ] Flow matrix only has 420 transitions (discarded 39 similar events)
[2024-06-02 23:13:25] [INFO ] Invariant cache hit.
[2024-06-02 23:13:25] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:13:25] [INFO ] After 284ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:17
[2024-06-02 23:13:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:13:25] [INFO ] After 286ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :14
[2024-06-02 23:13:25] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:13:26] [INFO ] After 265ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :7 sat :14
[2024-06-02 23:13:26] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:13:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-06-02 23:13:26] [INFO ] After 703ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :14
Attempting to minimize the solution found.
Minimization took 219 ms.
[2024-06-02 23:13:26] [INFO ] After 1325ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :14
Fused 21 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 459/459 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 453
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 163 transition count 450
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 163 transition count 456
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 21 place count 160 transition count 450
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 160 transition count 444
Applied a total of 27 rules in 29 ms. Remains 160 /163 variables (removed 3) and now considering 444/459 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 160/163 places, 444/459 transitions.
Incomplete random walk after 10000 steps, including 334 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 427689 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 427689 steps, saw 113679 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 14 properties.
[2024-06-02 23:13:30] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
// Phase 1: matrix 407 rows 160 cols
[2024-06-02 23:13:30] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:13:30] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:13:31] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-06-02 23:13:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:13:31] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-06-02 23:13:31] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:13:31] [INFO ] After 251ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2024-06-02 23:13:31] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:13:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-06-02 23:13:31] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:13:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2024-06-02 23:13:32] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 0 ms to minimize.
[2024-06-02 23:13:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2024-06-02 23:13:32] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
[2024-06-02 23:13:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-06-02 23:13:32] [INFO ] After 928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 246 ms.
[2024-06-02 23:13:32] [INFO ] After 1547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 444/444 transitions.
Applied a total of 0 rules in 8 ms. Remains 160 /160 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 160/160 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 444/444 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2024-06-02 23:13:32] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 23:13:32] [INFO ] Invariant cache hit.
[2024-06-02 23:13:32] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 23:13:32] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 23:13:32] [INFO ] Invariant cache hit.
[2024-06-02 23:13:32] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:13:33] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-06-02 23:13:33] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:13:33] [INFO ] Flow matrix only has 407 transitions (discarded 37 similar events)
[2024-06-02 23:13:33] [INFO ] Invariant cache hit.
[2024-06-02 23:13:33] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 538 ms. Remains : 160/160 places, 444/444 transitions.
Graph (trivial) has 140 edges and 160 vertex of which 29 / 160 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 134 transition count 299
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 134 transition count 290
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 133 transition count 289
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 133 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 17 place count 132 transition count 287
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 132 transition count 272
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 123 transition count 269
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 123 transition count 269
Applied a total of 44 rules in 17 ms. Remains 123 /160 variables (removed 37) and now considering 269/444 (removed 175) transitions.
Running SMT prover for 14 properties.
[2024-06-02 23:13:33] [INFO ] Flow matrix only has 267 transitions (discarded 2 similar events)
// Phase 1: matrix 267 rows 123 cols
[2024-06-02 23:13:33] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:13:33] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:13:33] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-06-02 23:13:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:13:33] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-06-02 23:13:33] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-02 23:13:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-06-02 23:13:33] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:13:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2024-06-02 23:13:34] [INFO ] After 555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 159 ms.
[2024-06-02 23:13:34] [INFO ] After 808ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 p2), (X (NOT (OR (NOT p3) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))))), (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2))))), (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2))))), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (NOT (AND p0 (NOT p1) p3 p2))), (X (NOT (AND p1 p3 p2))), (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))))), (X (NOT (AND p0 p1 p3 p2))), (X (AND (NOT p1) p3 p2)), (X (AND p3 p2)), (X (X (NOT (OR (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p3)) (AND p0 (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p3 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (AND (NOT p1) p3 p2))), (X (X (AND p3 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p0 p1 (NOT p3)) (AND p0 p1 (NOT p2)))))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND p0 (NOT p2)))))), (X (X (NOT (AND p0 p1 p3 p2)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND p1 p2))), (G (NOT (AND p1 p3 p2))), (G (NOT (AND (NOT p1) (NOT p2) p0))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND p1 p3 p2 p0))), (G (NOT (AND p1 p2 p0))), (G (NOT (OR (AND (NOT p1) (NOT p3) p0) (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 41 factoid took 256 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[false, false, false]
Stuttering acceptance computed with spot in 109 ms :[false, false, false]
Support contains 3 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 459/459 transitions.
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 163 transition count 456
Applied a total of 3 rules in 10 ms. Remains 163 /163 variables (removed 0) and now considering 456/459 (removed 3) transitions.
[2024-06-02 23:13:34] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
// Phase 1: matrix 417 rows 163 cols
[2024-06-02 23:13:34] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:13:34] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 23:13:34] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:13:34] [INFO ] Invariant cache hit.
[2024-06-02 23:13:34] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:13:35] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-06-02 23:13:35] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:13:35] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:13:35] [INFO ] Invariant cache hit.
[2024-06-02 23:13:35] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/163 places, 456/459 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 518 ms. Remains : 163/163 places, 456/459 transitions.
Computed a total of 25 stabilizing places and 65 stable transitions
Computed a total of 25 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X p2)), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 174 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[false, false, false]
Incomplete random walk after 10000 steps, including 324 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 681718 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :{}
Probabilistic random walk after 681718 steps, saw 150868 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
Running SMT prover for 4 properties.
[2024-06-02 23:13:38] [INFO ] Flow matrix only has 417 transitions (discarded 39 similar events)
[2024-06-02 23:13:38] [INFO ] Invariant cache hit.
[2024-06-02 23:13:38] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:13:38] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 23:13:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:13:39] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 23:13:39] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:13:39] [INFO ] After 80ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-02 23:13:39] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-06-02 23:13:39] [INFO ] After 419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 456/456 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 450
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 8 place count 162 transition count 449
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 162 transition count 455
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 20 place count 159 transition count 449
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 159 transition count 443
Applied a total of 26 rules in 20 ms. Remains 159 /163 variables (removed 4) and now considering 443/456 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 159/163 places, 443/456 transitions.
Incomplete random walk after 10000 steps, including 338 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 619524 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 619524 steps, saw 152599 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 4 properties.
[2024-06-02 23:13:42] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
// Phase 1: matrix 406 rows 159 cols
[2024-06-02 23:13:42] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:13:42] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:13:42] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 23:13:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:13:43] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 23:13:43] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:13:43] [INFO ] After 110ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-02 23:13:43] [INFO ] After 205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-06-02 23:13:43] [INFO ] After 445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 443/443 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 159/159 places, 443/443 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 443/443 transitions.
Applied a total of 0 rules in 5 ms. Remains 159 /159 variables (removed 0) and now considering 443/443 (removed 0) transitions.
[2024-06-02 23:13:43] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 23:13:43] [INFO ] Invariant cache hit.
[2024-06-02 23:13:43] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 23:13:43] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 23:13:43] [INFO ] Invariant cache hit.
[2024-06-02 23:13:43] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:13:43] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-06-02 23:13:43] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 23:13:43] [INFO ] Flow matrix only has 406 transitions (discarded 37 similar events)
[2024-06-02 23:13:43] [INFO ] Invariant cache hit.
[2024-06-02 23:13:43] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 159/159 places, 443/443 transitions.
Graph (trivial) has 140 edges and 159 vertex of which 29 / 159 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 298
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 133 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 132 transition count 288
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 132 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 17 place count 131 transition count 286
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 131 transition count 271
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 122 transition count 268
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 122 transition count 268
Applied a total of 44 rules in 17 ms. Remains 122 /159 variables (removed 37) and now considering 268/443 (removed 175) transitions.
Running SMT prover for 4 properties.
[2024-06-02 23:13:43] [INFO ] Flow matrix only has 266 transitions (discarded 2 similar events)
// Phase 1: matrix 266 rows 122 cols
[2024-06-02 23:13:43] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:13:43] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:13:43] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 23:13:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:13:44] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 23:13:44] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:13:44] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-02 23:13:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2024-06-02 23:13:44] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-06-02 23:13:44] [INFO ] After 337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p2 (NOT p0)), (X p2), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X p2)), true, (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 98 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[false, false, false]
Stuttering acceptance computed with spot in 119 ms :[false, false, false]
Stuttering acceptance computed with spot in 120 ms :[false, false, false]
Product exploration explored 100000 steps with 1 reset in 49 ms.
Product exploration explored 100000 steps with 0 reset in 50 ms.
Built C files in :
/tmp/ltsmin13040793477126090271
[2024-06-02 23:13:44] [INFO ] Computing symmetric may disable matrix : 456 transitions.
[2024-06-02 23:13:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:13:44] [INFO ] Computing symmetric may enable matrix : 456 transitions.
[2024-06-02 23:13:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:13:44] [INFO ] Computing Do-Not-Accords matrix : 456 transitions.
[2024-06-02 23:13:44] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:13:44] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13040793477126090271
Running compilation step : cd /tmp/ltsmin13040793477126090271;'/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 967 ms.
Running link step : cd /tmp/ltsmin13040793477126090271;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13040793477126090271;'/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/stateBased9414873486913131725.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 456/456 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 2 place count 162 transition count 455
Applied a total of 2 rules in 15 ms. Remains 162 /163 variables (removed 1) and now considering 455/456 (removed 1) transitions.
[2024-06-02 23:13:59] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
// Phase 1: matrix 416 rows 162 cols
[2024-06-02 23:13:59] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:13:59] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 23:13:59] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
[2024-06-02 23:13:59] [INFO ] Invariant cache hit.
[2024-06-02 23:14:00] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:14:00] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-06-02 23:14:00] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 23:14:00] [INFO ] Flow matrix only has 416 transitions (discarded 39 similar events)
[2024-06-02 23:14:00] [INFO ] Invariant cache hit.
[2024-06-02 23:14:00] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/163 places, 455/456 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 547 ms. Remains : 162/163 places, 455/456 transitions.
Built C files in :
/tmp/ltsmin4361200778648921971
[2024-06-02 23:14:00] [INFO ] Computing symmetric may disable matrix : 455 transitions.
[2024-06-02 23:14:00] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:14:00] [INFO ] Computing symmetric may enable matrix : 455 transitions.
[2024-06-02 23:14:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:14:00] [INFO ] Computing Do-Not-Accords matrix : 455 transitions.
[2024-06-02 23:14:00] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:14:00] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4361200778648921971
Running compilation step : cd /tmp/ltsmin4361200778648921971;'/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 936 ms.
Running link step : cd /tmp/ltsmin4361200778648921971;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4361200778648921971;'/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/stateBased10581349471934679816.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 23:14:15] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:14:15] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:14:15] [INFO ] Time to serialize gal into /tmp/LTL16331393387259453897.gal : 3 ms
[2024-06-02 23:14:15] [INFO ] Time to serialize properties into /tmp/LTL3455152254230614268.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16331393387259453897.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4519970471691293958.hoa' '-atoms' '/tmp/LTL3455152254230614268.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3455152254230614268.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4519970471691293958.hoa
Detected timeout of ITS tools.
[2024-06-02 23:14:30] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:14:30] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:14:30] [INFO ] Time to serialize gal into /tmp/LTL8440678589696200897.gal : 3 ms
[2024-06-02 23:14:30] [INFO ] Time to serialize properties into /tmp/LTL16617430732492007063.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8440678589696200897.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16617430732492007063.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((p3==1)&&(p93==1))")))U(!("((p3==1)&&(p161==1))"))))||(F(X((G("((p3==0)||(p161==0))"))&&("(p83==0)")))))))
Formula 0 simplified : G((FG"((p3==1)&&(p93==1))" U !"((p3==1)&&(p161==1))") & XG(!"(p83==0)" | F!"((p3==0)||(p161==0))"))
Detected timeout of ITS tools.
[2024-06-02 23:14:45] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:14:45] [INFO ] Applying decomposition
[2024-06-02 23:14:45] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph209860109647785711.txt' '-o' '/tmp/graph209860109647785711.bin' '-w' '/tmp/graph209860109647785711.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph209860109647785711.bin' '-l' '-1' '-v' '-w' '/tmp/graph209860109647785711.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:14:45] [INFO ] Decomposing Gal with order
[2024-06-02 23:14:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:14:45] [INFO ] Removed a total of 680 redundant transitions.
[2024-06-02 23:14:45] [INFO ] Flatten gal took : 30 ms
[2024-06-02 23:14:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 7 ms.
[2024-06-02 23:14:45] [INFO ] Time to serialize gal into /tmp/LTL6418235640267586331.gal : 3 ms
[2024-06-02 23:14:45] [INFO ] Time to serialize properties into /tmp/LTL9015120588796115228.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6418235640267586331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9015120588796115228.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((i0.u0.p3==1)&&(i0.u0.p93==1))")))U(!("((i0.u0.p3==1)&&(i0.u44.p161==1))"))))||(F(X((G("((i0.u0.p3==0)||(i0.u44.p161==0...187
Formula 0 simplified : G((FG"((i0.u0.p3==1)&&(i0.u0.p93==1))" U !"((i0.u0.p3==1)&&(i0.u44.p161==1))") & XG(!"(i5.u20.p83==0)" | F!"((i0.u0.p3==0)||(i0.u44....167
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1805613690267846130
[2024-06-02 23:15:00] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1805613690267846130
Running compilation step : cd /tmp/ltsmin1805613690267846130;'/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 631 ms.
Running link step : cd /tmp/ltsmin1805613690267846130;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin1805613690267846130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((!(<>([]((LTLAPp0==true))) U !(LTLAPp1==true))||<>(X(([]((LTLAPp2==true))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FireWire-PT-13-LTLFireability-13 finished in 116006 ms.
[2024-06-02 23:15:16] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2882189843366276858
[2024-06-02 23:15:16] [INFO ] Applying decomposition
[2024-06-02 23:15:16] [INFO ] Computing symmetric may disable matrix : 517 transitions.
[2024-06-02 23:15:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:15:16] [INFO ] Computing symmetric may enable matrix : 517 transitions.
[2024-06-02 23:15:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:15:16] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:15:16] [INFO ] Computing Do-Not-Accords matrix : 517 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11113930577604542121.txt' '-o' '/tmp/graph11113930577604542121.bin' '-w' '/tmp/graph11113930577604542121.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11113930577604542121.bin' '-l' '-1' '-v' '-w' '/tmp/graph11113930577604542121.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:15:16] [INFO ] Decomposing Gal with order
[2024-06-02 23:15:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:15:16] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:15:16] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2882189843366276858
Running compilation step : cd /tmp/ltsmin2882189843366276858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
[2024-06-02 23:15:16] [INFO ] Removed a total of 852 redundant transitions.
[2024-06-02 23:15:16] [INFO ] Flatten gal took : 29 ms
[2024-06-02 23:15:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 12 ms.
[2024-06-02 23:15:16] [INFO ] Time to serialize gal into /tmp/LTLFireability2223217566566630289.gal : 4 ms
[2024-06-02 23:15:16] [INFO ] Time to serialize properties into /tmp/LTLFireability18161927750217526495.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2223217566566630289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18161927750217526495.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((i0.u0.p3==1)&&(i0.u0.p93==1))")))U(!("((i0.u0.p3==1)&&(i0.u53.p161==1))"))))||(F(X((G("((i0.u0.p3==0)||(i0.u53.p161==0...187
Formula 0 simplified : G((FG"((i0.u0.p3==1)&&(i0.u0.p93==1))" U !"((i0.u0.p3==1)&&(i0.u53.p161==1))") & XG(!"(i4.u29.p83==0)" | F!"((i0.u0.p3==0)||(i0.u53....167
Compilation finished in 1138 ms.
Running link step : cd /tmp/ltsmin2882189843366276858;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2882189843366276858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((!(<>([]((LTLAPp0==true))) U !(LTLAPp1==true))||<>(X(([]((LTLAPp2==true))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: LTL layer: formula: <>((!(<>([]((LTLAPp0==true))) U !(LTLAPp1==true))||<>(X(([]((LTLAPp2==true))&&(LTLAPp3==true))))))
pins2lts-mc-linux64( 4/ 8), 0.023: "<>((!(<>([]((LTLAPp0==true))) U !(LTLAPp1==true))||<>(X(([]((LTLAPp2==true))&&(LTLAPp3==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.024: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.120: There are 522 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.120: State length is 195, there are 564 groups
pins2lts-mc-linux64( 0/ 8), 0.120: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.120: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.120: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.120: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.137: [Blue] ~44 levels ~960 states ~2984 transitions
pins2lts-mc-linux64( 0/ 8), 0.147: [Blue] ~98 levels ~1920 states ~5128 transitions
pins2lts-mc-linux64( 0/ 8), 0.161: [Blue] ~145 levels ~3840 states ~9752 transitions
pins2lts-mc-linux64( 0/ 8), 0.185: [Blue] ~161 levels ~7680 states ~22800 transitions
pins2lts-mc-linux64( 0/ 8), 0.233: [Blue] ~161 levels ~15360 states ~44408 transitions
pins2lts-mc-linux64( 0/ 8), 0.426: [Blue] ~161 levels ~30720 states ~80288 transitions
pins2lts-mc-linux64( 0/ 8), 0.812: [Blue] ~174 levels ~61440 states ~188672 transitions
pins2lts-mc-linux64( 0/ 8), 1.574: [Blue] ~233 levels ~122880 states ~424584 transitions
pins2lts-mc-linux64( 0/ 8), 2.988: [Blue] ~233 levels ~245760 states ~818632 transitions
pins2lts-mc-linux64( 0/ 8), 5.540: [Blue] ~241 levels ~491520 states ~1675056 transitions
pins2lts-mc-linux64( 5/ 8), 10.001: [Blue] ~287 levels ~983040 states ~3620672 transitions
pins2lts-mc-linux64( 3/ 8), 18.255: [Blue] ~1642 levels ~1966080 states ~7527072 transitions
pins2lts-mc-linux64( 4/ 8), 34.657: [Blue] ~1976 levels ~3932160 states ~15707960 transitions
pins2lts-mc-linux64( 0/ 8), 68.049: [Blue] ~1880 levels ~7864320 states ~31162016 transitions
pins2lts-mc-linux64( 3/ 8), 133.436: [Blue] ~4042 levels ~15728640 states ~65169656 transitions
pins2lts-mc-linux64( 1/ 8), 266.670: [Blue] ~3209 levels ~31457280 states ~133042784 transitions
pins2lts-mc-linux64( 1/ 8), 534.382: [Blue] ~3702 levels ~62914560 states ~276366296 transitions
pins2lts-mc-linux64( 2/ 8), 1074.569: [Blue] ~75087 levels ~125829120 states ~562269264 transitions
pins2lts-mc-linux64( 3/ 8), 1209.059: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1209.081:
pins2lts-mc-linux64( 0/ 8), 1209.082: Explored 137981134 states 671879702 transitions, fanout: 4.869
pins2lts-mc-linux64( 0/ 8), 1209.082: Total exploration time 1208.940 sec (1208.910 sec minimum, 1208.927 sec on average)
pins2lts-mc-linux64( 0/ 8), 1209.082: States per second: 114134, Transitions per second: 555759
pins2lts-mc-linux64( 0/ 8), 1209.082:
pins2lts-mc-linux64( 0/ 8), 1209.082: State space has 134217286 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1209.082: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1209.082: blue states: 137981134 (102.80%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1209.082: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1209.082: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1209.082:
pins2lts-mc-linux64( 0/ 8), 1209.082: Total memory used for local state coloring: 4.7MB
pins2lts-mc-linux64( 0/ 8), 1209.082:
pins2lts-mc-linux64( 0/ 8), 1209.082: Queue width: 8B, total height: 309705, memory: 2.36MB
pins2lts-mc-linux64( 0/ 8), 1209.082: Tree memory: 1031.3MB, 8.1 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 1209.082: Tree fill ratio (roots/leafs): 99.0%/2.0%
pins2lts-mc-linux64( 0/ 8), 1209.082: Stored 541 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1209.082: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1209.082: Est. total memory use: 1033.6MB (~1026.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2882189843366276858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((!(<>([]((LTLAPp0==true))) U !(LTLAPp1==true))||<>(X(([]((LTLAPp2==true))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2882189843366276858;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((!(<>([]((LTLAPp0==true))) U !(LTLAPp1==true))||<>(X(([]((LTLAPp2==true))&&(LTLAPp3==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-06-02 23:36:47] [INFO ] Applying decomposition
[2024-06-02 23:36:47] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:36:47] [INFO ] Decomposing Gal with order
[2024-06-02 23:36:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:36:47] [INFO ] Removed a total of 673 redundant transitions.
[2024-06-02 23:36:47] [INFO ] Flatten gal took : 37 ms
[2024-06-02 23:36:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 201 labels/synchronizations in 7 ms.
[2024-06-02 23:36:47] [INFO ] Time to serialize gal into /tmp/LTLFireability10820503121998066064.gal : 2 ms
[2024-06-02 23:36:47] [INFO ] Time to serialize properties into /tmp/LTLFireability536010299029037867.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10820503121998066064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability536010299029037867.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((!((F(G("((u1.p3==1)&&(u9.p93==1))")))U(!("((u1.p3==1)&&(u13.p161==1))"))))||(F(X((G("((u1.p3==0)||(u13.p161==0))"))&&("(u8.p83==...165
Formula 0 simplified : G((FG"((u1.p3==1)&&(u9.p93==1))" U !"((u1.p3==1)&&(u13.p161==1))") & XG(!"(u8.p83==0)" | F!"((u1.p3==0)||(u13.p161==0))"))
Reverse transition relation is NOT exact ! Due to transitions t63, t75, t76, t85, t109, t239, t283, t284, t291, t293, t334, t407, t421, t433, t434, t465, t...617
Computing Next relation with stutter on 1.52008e+06 deadlock states
Detected timeout of ITS tools.
[2024-06-02 23:58:36] [INFO ] Flatten gal took : 239 ms
[2024-06-02 23:58:37] [INFO ] Input system was already deterministic with 517 transitions.
[2024-06-02 23:58:37] [INFO ] Transformed 194 places.
[2024-06-02 23:58:37] [INFO ] Transformed 517 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-06-02 23:58:37] [INFO ] Time to serialize gal into /tmp/LTLFireability520419911264532855.gal : 10 ms
[2024-06-02 23:58:37] [INFO ] Time to serialize properties into /tmp/LTLFireability11861865575697032676.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability520419911264532855.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11861865575697032676.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((!((F(G("((p3==1)&&(p93==1))")))U(!("((p3==1)&&(p161==1))"))))||(F(X((G("((p3==0)||(p161==0))"))&&("(p83==0)")))))))
Formula 0 simplified : G((FG"((p3==1)&&(p93==1))" U !"((p3==1)&&(p161==1))") & XG(!"(p83==0)" | F!"((p3==0)||(p161==0))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 676804 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16225152 kB

BK_TIME_CONFINEMENT_REACHED

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

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