fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r550-tall-171734898800187
Last Updated
July 7, 2024

About the Execution of ITS-Tools for FireWire-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1197.636 395469.00 466370.00 1242.90 FFFFTFFFFFTFFFFF normal

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.r550-tall-171734898800187.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 itstools
Input is FireWire-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898800187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 86K 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-03-LTLCardinality-00
FORMULA_NAME FireWire-PT-03-LTLCardinality-01
FORMULA_NAME FireWire-PT-03-LTLCardinality-02
FORMULA_NAME FireWire-PT-03-LTLCardinality-03
FORMULA_NAME FireWire-PT-03-LTLCardinality-04
FORMULA_NAME FireWire-PT-03-LTLCardinality-05
FORMULA_NAME FireWire-PT-03-LTLCardinality-06
FORMULA_NAME FireWire-PT-03-LTLCardinality-07
FORMULA_NAME FireWire-PT-03-LTLCardinality-08
FORMULA_NAME FireWire-PT-03-LTLCardinality-09
FORMULA_NAME FireWire-PT-03-LTLCardinality-10
FORMULA_NAME FireWire-PT-03-LTLCardinality-11
FORMULA_NAME FireWire-PT-03-LTLCardinality-12
FORMULA_NAME FireWire-PT-03-LTLCardinality-13
FORMULA_NAME FireWire-PT-03-LTLCardinality-14
FORMULA_NAME FireWire-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717359380226

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 20:16:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:16:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:16:21] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-06-02 20:16:21] [INFO ] Transformed 112 places.
[2024-06-02 20:16:21] [INFO ] Transformed 356 transitions.
[2024-06-02 20:16:21] [INFO ] Found NUPN structural information;
[2024-06-02 20:16:21] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-03-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 303/303 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 112 transition count 297
Applied a total of 6 rules in 25 ms. Remains 112 /112 variables (removed 0) and now considering 297/303 (removed 6) transitions.
[2024-06-02 20:16:21] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
// Phase 1: matrix 271 rows 112 cols
[2024-06-02 20:16:21] [INFO ] Computed 9 invariants in 18 ms
[2024-06-02 20:16:22] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-06-02 20:16:22] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 20:16:22] [INFO ] Invariant cache hit.
[2024-06-02 20:16:22] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 20:16:22] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 296 sub problems to find dead transitions.
[2024-06-02 20:16:22] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 20:16:22] [INFO ] Invariant cache hit.
[2024-06-02 20:16:22] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 296 unsolved
[2024-06-02 20:16:24] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 6 ms to minimize.
[2024-06-02 20:16:24] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:16:24] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:16:25] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:16:25] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:16:25] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-02 20:16:25] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:16:25] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 270/382 variables, 112/241 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (OVERLAPS) 1/383 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/383 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 11 (OVERLAPS) 0/383 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 282 constraints, problems are : Problem set: 0 solved, 296 unsolved in 13214 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 270/382 variables, 112/241 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 296/577 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 10 (OVERLAPS) 1/383 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 12 (OVERLAPS) 0/383 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 578 constraints, problems are : Problem set: 0 solved, 296 unsolved in 18410 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 8/8 constraints]
After SMT, in 31900ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 31918ms
Starting structural reductions in LTL mode, iteration 1 : 112/112 places, 297/303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32418 ms. Remains : 112/112 places, 297/303 transitions.
Support contains 30 out of 112 places after structural reductions.
[2024-06-02 20:16:54] [INFO ] Flatten gal took : 47 ms
[2024-06-02 20:16:54] [INFO ] Flatten gal took : 22 ms
[2024-06-02 20:16:54] [INFO ] Input system was already deterministic with 297 transitions.
Support contains 27 out of 112 places (down from 30) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (2008 resets) in 1229 ms. (32 steps per ms) remains 5/18 properties
BEST_FIRST walk for 40002 steps (482 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (504 resets) in 72 ms. (547 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (508 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (462 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (471 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
[2024-06-02 20:16:55] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
[2024-06-02 20:16:55] [INFO ] Invariant cache hit.
[2024-06-02 20:16:55] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 70/79 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 70/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 33/112 variables, 5/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:16:55] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-02 20:16:55] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:16:55] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 270/382 variables, 112/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 40/276 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/383 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:16:55] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/383 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/383 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/383 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 278 constraints, problems are : Problem set: 0 solved, 5 unsolved in 802 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 70/79 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 70/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 33/112 variables, 5/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 4/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:16:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 270/382 variables, 112/238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 40/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 5/283 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/383 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/383 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 284 constraints, problems are : Problem set: 0 solved, 5 unsolved in 430 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 1245ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 924 ms.
Support contains 9 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 297/297 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 294
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 112 transition count 293
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 111 transition count 293
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 109 transition count 287
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 109 transition count 287
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 107 transition count 283
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 107 transition count 283
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 1 with 4 rules applied. Total rules applied 17 place count 105 transition count 281
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 21 place count 103 transition count 285
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 103 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 103 transition count 277
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 103 transition count 303
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 37 place count 101 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 50 place count 101 transition count 286
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 101 transition count 286
Applied a total of 52 rules in 91 ms. Remains 101 /112 variables (removed 11) and now considering 286/297 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 101/112 places, 286/297 transitions.
RANDOM walk for 40000 steps (2173 resets) in 683 ms. (58 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (603 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (539 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (576 resets) in 111 ms. (357 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (578 resets) in 88 ms. (449 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (549 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
[2024-06-02 20:16:57] [INFO ] Flow matrix only has 259 transitions (discarded 27 similar events)
// Phase 1: matrix 259 rows 101 cols
[2024-06-02 20:16:57] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:16:57] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 50/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 20:16:58] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 46/101 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 20:16:58] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 259/360 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 41/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/360 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 153 constraints, problems are : Problem set: 0 solved, 3 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 101/101 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 50/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 46/101 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 20:16:58] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 259/360 variables, 101/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 41/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 20:16:58] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/360 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/360 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 158 constraints, problems are : Problem set: 0 solved, 3 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 101/101 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 639ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 502 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 286/286 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 100 transition count 287
Applied a total of 2 rules in 22 ms. Remains 100 /101 variables (removed 1) and now considering 287/286 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 100/101 places, 287/286 transitions.
RANDOM walk for 40000 steps (2203 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (552 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (561 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (557 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1073798 steps, run timeout after 3001 ms. (steps per millisecond=357 ) properties seen :0 out of 3
Probabilistic random walk after 1073798 steps, saw 208702 distinct states, run finished after 3005 ms. (steps per millisecond=357 ) properties seen :0
[2024-06-02 20:17:02] [INFO ] Flow matrix only has 260 transitions (discarded 27 similar events)
// Phase 1: matrix 260 rows 100 cols
[2024-06-02 20:17:02] [INFO ] Computed 9 invariants in 3 ms
[2024-06-02 20:17:02] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 46/100 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 20:17:02] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 260/360 variables, 100/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/360 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 151 constraints, problems are : Problem set: 0 solved, 3 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 49/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 46/100 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 260/360 variables, 100/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 41/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 20:17:02] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 5 ms to minimize.
[2024-06-02 20:17:02] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/360 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/360 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 156 constraints, problems are : Problem set: 0 solved, 3 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 100/100 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 577ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 267 ms.
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 287/287 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 100/100 places, 287/287 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 287/287 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2024-06-02 20:17:03] [INFO ] Flow matrix only has 260 transitions (discarded 27 similar events)
[2024-06-02 20:17:03] [INFO ] Invariant cache hit.
[2024-06-02 20:17:03] [INFO ] Implicit Places using invariants in 61 ms returned [99]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/100 places, 287/287 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 99 transition count 286
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 98 transition count 286
Applied a total of 2 rules in 10 ms. Remains 98 /99 variables (removed 1) and now considering 286/287 (removed 1) transitions.
[2024-06-02 20:17:03] [INFO ] Flow matrix only has 259 transitions (discarded 27 similar events)
// Phase 1: matrix 259 rows 98 cols
[2024-06-02 20:17:03] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:17:03] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 20:17:03] [INFO ] Flow matrix only has 259 transitions (discarded 27 similar events)
[2024-06-02 20:17:03] [INFO ] Invariant cache hit.
[2024-06-02 20:17:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:17:03] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/100 places, 286/287 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 280 ms. Remains : 98/100 places, 286/287 transitions.
RANDOM walk for 40000 steps (2330 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (634 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (588 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (594 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 5279 steps, run visited all 3 properties in 31 ms. (steps per millisecond=170 )
Probabilistic random walk after 5279 steps, saw 3025 distinct states, run finished after 36 ms. (steps per millisecond=146 ) properties seen :3
FORMULA FireWire-PT-03-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FireWire-PT-03-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
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 110 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 107 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 105 transition count 283
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 104 transition count 282
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
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 20 place count 101 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 28 place count 101 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 100 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 99 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 30 place count 99 transition count 279
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 32 place count 98 transition count 279
Applied a total of 32 rules in 43 ms. Remains 98 /112 variables (removed 14) and now considering 279/297 (removed 18) transitions.
[2024-06-02 20:17:03] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
// Phase 1: matrix 247 rows 98 cols
[2024-06-02 20:17:03] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:17:03] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 20:17:03] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 20:17:03] [INFO ] Invariant cache hit.
[2024-06-02 20:17:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:17:04] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-06-02 20:17:04] [INFO ] Redundant transitions in 17 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 20:17:04] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 20:17:04] [INFO ] Invariant cache hit.
[2024-06-02 20:17:04] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 20:17:04] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:17:05] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:17:05] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:17:05] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:17:05] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:17:05] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:17:05] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:17:05] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:17:05] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 20:17:09] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/344 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 20:17:12] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 154 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13192 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 276/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 430 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9315 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 22684ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 22688ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/112 places, 279/297 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22943 ms. Remains : 98/112 places, 279/297 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLCardinality-00
Product exploration explored 100000 steps with 2 reset in 123 ms.
Product exploration explored 100000 steps with 0 reset in 76 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7527 steps (466 resets) in 43 ms. (171 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 279/279 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-06-02 20:17:27] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 20:17:27] [INFO ] Invariant cache hit.
[2024-06-02 20:17:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 20:17:27] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 20:17:27] [INFO ] Invariant cache hit.
[2024-06-02 20:17:27] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:17:27] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-06-02 20:17:27] [INFO ] Redundant transitions in 3 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 20:17:27] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 20:17:27] [INFO ] Invariant cache hit.
[2024-06-02 20:17:27] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 20:17:28] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:17:28] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:17:28] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:17:28] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 3 ms to minimize.
[2024-06-02 20:17:29] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:17:29] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-06-02 20:17:29] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:17:29] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-06-02 20:17:29] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 20:17:32] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/344 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 20:17:35] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 154 constraints, problems are : Problem set: 0 solved, 276 unsolved in 12767 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 276/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 430 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9391 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 22302ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 22305ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22519 ms. Remains : 98/98 places, 279/279 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 23988 steps (1431 resets) in 109 ms. (218 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 130 ms.
Product exploration explored 100000 steps with 2 reset in 73 ms.
Built C files in :
/tmp/ltsmin5507247770686233141
[2024-06-02 20:17:50] [INFO ] Computing symmetric may disable matrix : 279 transitions.
[2024-06-02 20:17:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:17:50] [INFO ] Computing symmetric may enable matrix : 279 transitions.
[2024-06-02 20:17:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:17:50] [INFO ] Computing Do-Not-Accords matrix : 279 transitions.
[2024-06-02 20:17:50] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:17:50] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5507247770686233141
Running compilation step : cd /tmp/ltsmin5507247770686233141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 711 ms.
Running link step : cd /tmp/ltsmin5507247770686233141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin5507247770686233141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18335241758210255944.hoa' '--buchi-type=spotba'
LTSmin run took 520 ms.
FORMULA FireWire-PT-03-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-03-LTLCardinality-00 finished in 48409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 1 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
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 110 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 107 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 105 transition count 283
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 104 transition count 282
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 102 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 102 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 101 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 26 place count 100 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 26 place count 100 transition count 279
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 28 place count 99 transition count 279
Applied a total of 28 rules in 33 ms. Remains 99 /112 variables (removed 13) and now considering 279/297 (removed 18) transitions.
[2024-06-02 20:17:52] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
// Phase 1: matrix 250 rows 99 cols
[2024-06-02 20:17:52] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:17:52] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 20:17:52] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 20:17:52] [INFO ] Invariant cache hit.
[2024-06-02 20:17:52] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:17:52] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-06-02 20:17:52] [INFO ] Redundant transitions in 3 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 20:17:52] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 20:17:52] [INFO ] Invariant cache hit.
[2024-06-02 20:17:52] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 20:17:53] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:17:53] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:17:53] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-06-02 20:17:53] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:17:53] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:17:53] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:17:53] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:17:53] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-02 20:17:53] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:17:54] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-02 20:17:54] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 249/348 variables, 99/118 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 37/155 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/349 variables, and 155 constraints, problems are : Problem set: 0 solved, 276 unsolved in 7797 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 249/348 variables, 99/118 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 37/155 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 276/431 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/349 variables, and 431 constraints, problems are : Problem set: 0 solved, 276 unsolved in 8743 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 16686ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 16689ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/112 places, 279/297 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16895 ms. Remains : 99/112 places, 279/297 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLCardinality-02
Product exploration explored 100000 steps with 1 reset in 139 ms.
Product exploration explored 100000 steps with 0 reset in 52 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
RANDOM walk for 420 steps (27 resets) in 4 ms. (84 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 279/279 transitions.
Applied a total of 0 rules in 14 ms. Remains 99 /99 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-06-02 20:18:09] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 20:18:09] [INFO ] Invariant cache hit.
[2024-06-02 20:18:09] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:18:09] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 20:18:09] [INFO ] Invariant cache hit.
[2024-06-02 20:18:09] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:18:09] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-06-02 20:18:09] [INFO ] Redundant transitions in 1 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 20:18:09] [INFO ] Flow matrix only has 250 transitions (discarded 29 similar events)
[2024-06-02 20:18:09] [INFO ] Invariant cache hit.
[2024-06-02 20:18:09] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 20:18:10] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:18:10] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:18:10] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:18:10] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:18:11] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:18:11] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:18:11] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2024-06-02 20:18:11] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-02 20:18:11] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:18:11] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:18:11] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 249/348 variables, 99/118 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 37/155 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/349 variables, and 155 constraints, problems are : Problem set: 0 solved, 276 unsolved in 7691 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 249/348 variables, 99/118 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 37/155 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 276/431 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/349 variables, and 431 constraints, problems are : Problem set: 0 solved, 276 unsolved in 8929 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 16762ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 16764ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16951 ms. Remains : 99/99 places, 279/279 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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)]
RANDOM walk for 312 steps (17 resets) in 7 ms. (39 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 42 ms.
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLCardinality-02 finished in 34802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p1)))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 7 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 20:18:26] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 20:18:26] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:18:27] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 20:18:27] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:18:27] [INFO ] Invariant cache hit.
[2024-06-02 20:18:27] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:18:27] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:18:27] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:18:27] [INFO ] Invariant cache hit.
[2024-06-02 20:18:27] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:18:28] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:18:29] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11546 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:18:39] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 19917 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 31604ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31607ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31809 ms. Remains : 107/112 places, 285/297 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-03-LTLCardinality-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLCardinality-03 finished in 31944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&(p2 U p0)))))'
Support contains 7 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 292
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 292
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 109 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 109 transition count 290
Applied a total of 6 rules in 7 ms. Remains 109 /112 variables (removed 3) and now considering 290/297 (removed 7) transitions.
[2024-06-02 20:18:58] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
// Phase 1: matrix 264 rows 109 cols
[2024-06-02 20:18:58] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:18:59] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 20:18:59] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 20:18:59] [INFO ] Invariant cache hit.
[2024-06-02 20:18:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:18:59] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2024-06-02 20:18:59] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2024-06-02 20:18:59] [INFO ] Invariant cache hit.
[2024-06-02 20:18:59] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-02 20:19:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:19:00] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:19:00] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:19:00] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:19:00] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:19:01] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:19:01] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-02 20:19:01] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 0/373 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 166 constraints, problems are : Problem set: 0 solved, 289 unsolved in 12035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/372 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 289/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 455 constraints, problems are : Problem set: 0 solved, 289 unsolved in 16134 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 8/8 constraints]
After SMT, in 28342ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 28345ms
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 290/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28575 ms. Remains : 109/112 places, 290/297 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLCardinality-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-03-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLCardinality-06 finished in 28776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(p1)))'
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 110 transition count 291
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 110 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 108 transition count 287
Applied a total of 8 rules in 3 ms. Remains 108 /112 variables (removed 4) and now considering 287/297 (removed 10) transitions.
[2024-06-02 20:19:27] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 108 cols
[2024-06-02 20:19:27] [INFO ] Computed 9 invariants in 3 ms
[2024-06-02 20:19:27] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:19:27] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:19:27] [INFO ] Invariant cache hit.
[2024-06-02 20:19:27] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:19:27] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 20:19:27] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:19:27] [INFO ] Invariant cache hit.
[2024-06-02 20:19:27] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-06-02 20:19:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:19:29] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:19:29] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:19:29] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-02 20:19:29] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:19:29] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:19:29] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 ms to minimize.
[2024-06-02 20:19:30] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-06-02 20:19:30] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 165 constraints, problems are : Problem set: 0 solved, 286 unsolved in 11323 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 260/368 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 286/450 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 451 constraints, problems are : Problem set: 0 solved, 286 unsolved in 14998 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 9/9 constraints]
After SMT, in 26449ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 26456ms
Starting structural reductions in LTL mode, iteration 1 : 108/112 places, 287/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26744 ms. Remains : 108/112 places, 287/297 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : FireWire-PT-03-LTLCardinality-07
Stuttering criterion allowed to conclude after 319 steps with 108 reset in 2 ms.
FORMULA FireWire-PT-03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLCardinality-07 finished in 26936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 3 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 20:19:54] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 20:19:54] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:19:54] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:19:54] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:19:54] [INFO ] Invariant cache hit.
[2024-06-02 20:19:54] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:19:54] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:19:54] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:19:54] [INFO ] Invariant cache hit.
[2024-06-02 20:19:54] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:19:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:19:56] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:19:56] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:19:56] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:19:56] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:19:56] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:19:56] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2024-06-02 20:19:56] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:19:57] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:19:57] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11493 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:20:07] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 19906 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 31532ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31535ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31744 ms. Remains : 107/112 places, 285/297 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLCardinality-10
Product exploration explored 100000 steps with 25000 reset in 121 ms.
Product exploration explored 100000 steps with 25000 reset in 139 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1969 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 25107 steps (305 resets) in 71 ms. (348 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 285/285 transitions.
Applied a total of 0 rules in 1 ms. Remains 107 /107 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-06-02 20:20:27] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:20:27] [INFO ] Invariant cache hit.
[2024-06-02 20:20:27] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:20:27] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:20:27] [INFO ] Invariant cache hit.
[2024-06-02 20:20:27] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:20:27] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:20:27] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:20:27] [INFO ] Invariant cache hit.
[2024-06-02 20:20:27] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:20:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-02 20:20:28] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:20:29] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:20:29] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:20:29] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2024-06-02 20:20:29] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:20:29] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-06-02 20:20:29] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:20:30] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-02 20:20:30] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11702 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:20:40] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 19905 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 31738ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31741ms
Finished structural reductions in LTL mode , in 1 iterations and 31939 ms. Remains : 107/107 places, 285/285 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 36368 steps (1858 resets) in 75 ms. (478 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 85 ms.
Product exploration explored 100000 steps with 25000 reset in 94 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 285/285 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 107 transition count 286
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 107 transition count 286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 107 transition count 295
Deduced a syphon composed of 5 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 107 transition count 289
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 18 ms. Remains 107 /107 variables (removed 0) and now considering 289/285 (removed -4) transitions.
[2024-06-02 20:21:00] [INFO ] Redundant transitions in 1 ms returned []
Running 288 sub problems to find dead transitions.
[2024-06-02 20:21:00] [INFO ] Flow matrix only has 260 transitions (discarded 29 similar events)
// Phase 1: matrix 260 rows 107 cols
[2024-06-02 20:21:00] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:21:00] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-06-02 20:21:01] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-02 20:21:02] [INFO ] Deduced a trap composed of 41 places in 31 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
[2024-06-02 20:21:02] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-06-02 20:21:02] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:21:02] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:21:02] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:21:02] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:21:02] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:21:02] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-02 20:21:02] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:21:03] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-06-02 20:21:03] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 12/21 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/21 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 259/366 variables, 107/128 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 40/168 constraints. Problems are: Problem set: 8 solved, 280 unsolved
[2024-06-02 20:21:05] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:21:05] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:21:05] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 0 ms to minimize.
[2024-06-02 20:21:05] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 4/172 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/172 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/173 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/173 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/173 constraints. Problems are: Problem set: 8 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 173 constraints, problems are : Problem set: 8 solved, 280 unsolved in 13198 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 8 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 1 (OVERLAPS) 6/107 variables, 9/9 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 16/25 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/25 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 259/366 variables, 107/132 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 40/172 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 280/452 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/452 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/453 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/453 constraints. Problems are: Problem set: 8 solved, 280 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/453 constraints. Problems are: Problem set: 8 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 453 constraints, problems are : Problem set: 8 solved, 280 unsolved in 17430 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 280/288 constraints, Known Traps: 16/16 constraints]
After SMT, in 30761ms problems are : Problem set: 8 solved, 280 unsolved
Search for dead transitions found 8 dead transitions in 30764ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 107/107 places, 281/285 transitions.
Graph (complete) has 553 edges and 107 vertex of which 102 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 102 /107 variables (removed 5) and now considering 281/281 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/107 places, 281/285 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30799 ms. Remains : 102/107 places, 281/285 transitions.
Built C files in :
/tmp/ltsmin3262514687715772721
[2024-06-02 20:21:31] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3262514687715772721
Running compilation step : cd /tmp/ltsmin3262514687715772721;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 459 ms.
Running link step : cd /tmp/ltsmin3262514687715772721;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3262514687715772721;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10734645664281672490.hoa' '--buchi-type=spotba'
LTSmin run took 457 ms.
FORMULA FireWire-PT-03-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-03-LTLCardinality-10 finished in 97800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&X(p2)&&p0)))'
Support contains 8 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 109 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 109 transition count 289
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 107 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 107 transition count 285
Applied a total of 10 rules in 3 ms. Remains 107 /112 variables (removed 5) and now considering 285/297 (removed 12) transitions.
[2024-06-02 20:21:32] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 20:21:32] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:21:32] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:21:32] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:21:32] [INFO ] Invariant cache hit.
[2024-06-02 20:21:32] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:21:32] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:21:32] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:21:32] [INFO ] Invariant cache hit.
[2024-06-02 20:21:32] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:21:33] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:21:33] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:21:34] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2024-06-02 20:21:34] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:21:34] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:21:34] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:21:34] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-06-02 20:21:34] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-02 20:21:34] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-02 20:21:35] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 258/365 variables, 107/126 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 38/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 1/366 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/366 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 165 constraints, problems are : Problem set: 0 solved, 284 unsolved in 11373 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-06-02 20:21:44] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/165 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 284/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 450 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20165 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
After SMT, in 31686ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31690ms
Starting structural reductions in LTL mode, iteration 1 : 107/112 places, 285/297 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31884 ms. Remains : 107/112 places, 285/297 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : FireWire-PT-03-LTLCardinality-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLCardinality-11 finished in 32047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 297/297 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 111 transition count 295
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 110 transition count 295
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 107 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 105 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 105 transition count 283
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 104 transition count 282
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
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 20 place count 101 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 28 place count 101 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 100 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 99 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 30 place count 99 transition count 279
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 32 place count 98 transition count 279
Applied a total of 32 rules in 19 ms. Remains 98 /112 variables (removed 14) and now considering 279/297 (removed 18) transitions.
[2024-06-02 20:22:04] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
// Phase 1: matrix 247 rows 98 cols
[2024-06-02 20:22:04] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:22:04] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:22:04] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 20:22:04] [INFO ] Invariant cache hit.
[2024-06-02 20:22:04] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:22:04] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-06-02 20:22:04] [INFO ] Redundant transitions in 1 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 20:22:04] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 20:22:04] [INFO ] Invariant cache hit.
[2024-06-02 20:22:04] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 20:22:05] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:22:05] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-06-02 20:22:05] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-06-02 20:22:05] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:22:05] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:22:06] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-02 20:22:06] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-06-02 20:22:06] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-06-02 20:22:06] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 20:22:10] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/344 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 20:22:12] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 154 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13139 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 276/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 430 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9499 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 22776ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 22778ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/112 places, 279/297 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23006 ms. Remains : 98/112 places, 279/297 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FireWire-PT-03-LTLCardinality-15
Product exploration explored 100000 steps with 3 reset in 46 ms.
Product exploration explored 100000 steps with 0 reset in 46 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 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 111 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (2479 resets) in 223 ms. (178 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (502 resets) in 332 ms. (120 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (589 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (599 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
[2024-06-02 20:22:28] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 20:22:28] [INFO ] Invariant cache hit.
[2024-06-02 20:22:28] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 218/288 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 53/341 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/344 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/344 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 143 constraints, problems are : Problem set: 0 solved, 3 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 218/288 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 53/341 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 20:22:28] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/344 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/344 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 147 constraints, problems are : Problem set: 0 solved, 3 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 465ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 279/279 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 98 transition count 273
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 98 transition count 275
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 97 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 97 transition count 271
Applied a total of 12 rules in 15 ms. Remains 97 /98 variables (removed 1) and now considering 271/279 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 97/98 places, 271/279 transitions.
RANDOM walk for 40000 steps (2385 resets) in 232 ms. (171 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (645 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (570 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (579 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 4659 steps, run visited all 3 properties in 52 ms. (steps per millisecond=89 )
Probabilistic random walk after 4659 steps, saw 2299 distinct states, run finished after 53 ms. (steps per millisecond=87 ) properties seen :3
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 222 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 232 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 279/279 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-06-02 20:22:29] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 20:22:29] [INFO ] Invariant cache hit.
[2024-06-02 20:22:29] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 20:22:29] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 20:22:29] [INFO ] Invariant cache hit.
[2024-06-02 20:22:29] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:22:29] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-06-02 20:22:29] [INFO ] Redundant transitions in 2 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 20:22:29] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 20:22:29] [INFO ] Invariant cache hit.
[2024-06-02 20:22:29] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 20:22:30] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:22:30] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2024-06-02 20:22:30] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:22:30] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:22:30] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:22:31] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:22:31] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:22:31] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-02 20:22:31] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/115 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 20:22:34] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/344 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-06-02 20:22:37] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/344 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 154 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 246/344 variables, 98/117 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 37/154 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 276/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/344 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 430 constraints, problems are : Problem set: 0 solved, 276 unsolved in 9657 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 22827ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 22830ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23025 ms. Remains : 98/98 places, 279/279 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 115 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 131 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (2461 resets) in 367 ms. (108 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (624 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (643 resets) in 108 ms. (366 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (592 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
[2024-06-02 20:22:53] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 20:22:53] [INFO ] Invariant cache hit.
[2024-06-02 20:22:53] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 218/288 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 53/341 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/344 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/344 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/345 variables, and 143 constraints, problems are : Problem set: 0 solved, 3 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 218/288 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 53/341 variables, 26/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 20:22:53] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/344 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/344 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/345 variables, and 147 constraints, problems are : Problem set: 0 solved, 3 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 449ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 279/279 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 98 transition count 273
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 98 transition count 275
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 97 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 97 transition count 271
Applied a total of 12 rules in 15 ms. Remains 97 /98 variables (removed 1) and now considering 271/279 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 97/98 places, 271/279 transitions.
RANDOM walk for 40000 steps (2413 resets) in 297 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (556 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (606 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (541 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 4659 steps, run visited all 3 properties in 49 ms. (steps per millisecond=95 )
Probabilistic random walk after 4659 steps, saw 2299 distinct states, run finished after 49 ms. (steps per millisecond=95 ) properties seen :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 239 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 125 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 46 ms.
Product exploration explored 100000 steps with 0 reset in 46 ms.
Built C files in :
/tmp/ltsmin1222746778072556417
[2024-06-02 20:22:54] [INFO ] Computing symmetric may disable matrix : 279 transitions.
[2024-06-02 20:22:54] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:22:54] [INFO ] Computing symmetric may enable matrix : 279 transitions.
[2024-06-02 20:22:54] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:22:54] [INFO ] Computing Do-Not-Accords matrix : 279 transitions.
[2024-06-02 20:22:54] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:22:54] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1222746778072556417
Running compilation step : cd /tmp/ltsmin1222746778072556417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 575 ms.
Running link step : cd /tmp/ltsmin1222746778072556417;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1222746778072556417;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18182274472137629992.hoa' '--buchi-type=spotba'
LTSmin run took 376 ms.
FORMULA FireWire-PT-03-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-03-LTLCardinality-15 finished in 51163 ms.
All properties solved by simple procedures.
Total runtime 394261 ms.

BK_STOP 1717359775695

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is FireWire-PT-03, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898800187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-03.tgz
mv FireWire-PT-03 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;