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-171734898800188.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734898800188
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME FireWire-PT-03-LTLFireability-01
FORMULA_NAME FireWire-PT-03-LTLFireability-02
FORMULA_NAME FireWire-PT-03-LTLFireability-03
FORMULA_NAME FireWire-PT-03-LTLFireability-04
FORMULA_NAME FireWire-PT-03-LTLFireability-05
FORMULA_NAME FireWire-PT-03-LTLFireability-06
FORMULA_NAME FireWire-PT-03-LTLFireability-07
FORMULA_NAME FireWire-PT-03-LTLFireability-08
FORMULA_NAME FireWire-PT-03-LTLFireability-09
FORMULA_NAME FireWire-PT-03-LTLFireability-10
FORMULA_NAME FireWire-PT-03-LTLFireability-11
FORMULA_NAME FireWire-PT-03-LTLFireability-12
FORMULA_NAME FireWire-PT-03-LTLFireability-13
FORMULA_NAME FireWire-PT-03-LTLFireability-14
FORMULA_NAME FireWire-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717359389152

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202405141337
[2024-06-02 20:16:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 20:16:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:16:30] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-02 20:16:30] [INFO ] Transformed 112 places.
[2024-06-02 20:16:30] [INFO ] Transformed 356 transitions.
[2024-06-02 20:16:30] [INFO ] Found NUPN structural information;
[2024-06-02 20:16:30] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-03-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-03-LTLFireability-13 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.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 110 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 110 transition count 298
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 10 place count 110 transition count 292
Applied a total of 10 rules in 35 ms. Remains 110 /112 variables (removed 2) and now considering 292/303 (removed 11) transitions.
[2024-06-02 20:16:30] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
// Phase 1: matrix 266 rows 110 cols
[2024-06-02 20:16:30] [INFO ] Computed 9 invariants in 8 ms
[2024-06-02 20:16:30] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-06-02 20:16:30] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2024-06-02 20:16:30] [INFO ] Invariant cache hit.
[2024-06-02 20:16:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:16:31] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2024-06-02 20:16:31] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2024-06-02 20:16:31] [INFO ] Invariant cache hit.
[2024-06-02 20:16:31] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 20:16:32] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 6 ms to minimize.
[2024-06-02 20:16:32] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:16:33] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:16:33] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:16:33] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:16:33] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-02 20:16:33] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:16:33] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 265/375 variables, 110/127 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 39/166 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 1/376 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 167 constraints, problems are : Problem set: 0 solved, 291 unsolved in 12530 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-02 20:16:44] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (OVERLAPS) 265/375 variables, 110/128 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 39/167 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 291/458 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 1/376 variables, 1/459 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 459 constraints, problems are : Problem set: 0 solved, 291 unsolved in 19469 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 9/9 constraints]
After SMT, in 32266ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 32282ms
Starting structural reductions in LTL mode, iteration 1 : 110/112 places, 292/303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32733 ms. Remains : 110/112 places, 292/303 transitions.
Support contains 30 out of 110 places after structural reductions.
[2024-06-02 20:17:03] [INFO ] Flatten gal took : 45 ms
[2024-06-02 20:17:03] [INFO ] Flatten gal took : 22 ms
[2024-06-02 20:17:03] [INFO ] Input system was already deterministic with 292 transitions.
Support contains 28 out of 110 places (down from 30) after GAL structural reductions.
RANDOM walk for 40000 steps (2033 resets) in 1721 ms. (23 steps per ms) remains 10/23 properties
BEST_FIRST walk for 40003 steps (476 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (502 resets) in 156 ms. (254 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (483 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (523 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (10 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (539 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (17 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (499 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (11 resets) in 58 ms. (678 steps per ms) remains 9/9 properties
[2024-06-02 20:17:04] [INFO ] Flow matrix only has 266 transitions (discarded 26 similar events)
[2024-06-02 20:17:04] [INFO ] Invariant cache hit.
[2024-06-02 20:17:04] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 66/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 30/110 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 20:17:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-02 20:17:04] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 265/375 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 39/160 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/376 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 161 constraints, problems are : Problem set: 0 solved, 9 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 66/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 30/110 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 20:17:05] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:17:05] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 265/375 variables, 110/123 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/375 variables, 9/171 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/375 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/376 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/376 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 172 constraints, problems are : Problem set: 0 solved, 9 unsolved in 915 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 110/110 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 1340ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 7529 ms.
Support contains 14 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 292/292 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 110 transition count 289
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 110 transition count 288
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 109 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 108 transition count 285
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 108 transition count 285
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 106 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 105 transition count 285
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 105 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 105 transition count 280
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 105 transition count 282
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 2 with 3 rules applied. Total rules applied 22 place count 104 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 104 transition count 278
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 26 place count 104 transition count 278
Applied a total of 26 rules in 79 ms. Remains 104 /110 variables (removed 6) and now considering 278/292 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 104/110 places, 278/292 transitions.
RANDOM walk for 40000 steps (2191 resets) in 289 ms. (137 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (515 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (582 resets) in 131 ms. (303 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (567 resets) in 101 ms. (392 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (498 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 68 ms. (579 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (574 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (20 resets) in 40 ms. (975 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (11 resets) in 40 ms. (975 steps per ms) remains 8/8 properties
[2024-06-02 20:17:13] [INFO ] Flow matrix only has 254 transitions (discarded 24 similar events)
// Phase 1: matrix 254 rows 104 cols
[2024-06-02 20:17:13] [INFO ] Computed 9 invariants in 6 ms
[2024-06-02 20:17:13] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 64/77 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 27/104 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 20:17:14] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:17:14] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:17:14] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 254/358 variables, 104/116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 39/155 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/358 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 155 constraints, problems are : Problem set: 0 solved, 8 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 64/77 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 27/104 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 254/358 variables, 104/116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 39/155 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 8/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/358 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 163 constraints, problems are : Problem set: 0 solved, 8 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 104/104 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 843ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 960 ms.
Support contains 13 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 278/278 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 276
Applied a total of 2 rules in 29 ms. Remains 103 /104 variables (removed 1) and now considering 276/278 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 103/104 places, 276/278 transitions.
RANDOM walk for 40000 steps (2242 resets) in 163 ms. (243 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (550 resets) in 44 ms. (888 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (586 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (615 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (513 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (574 resets) in 35 ms. (1111 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (19 resets) in 24 ms. (1600 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (20 resets) in 35 ms. (1111 steps per ms) remains 7/7 properties
[2024-06-02 20:17:15] [INFO ] Flow matrix only has 252 transitions (discarded 24 similar events)
// Phase 1: matrix 252 rows 103 cols
[2024-06-02 20:17:15] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:17:15] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 65/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 27/103 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:17:16] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:17:16] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:17:16] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 252/355 variables, 103/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 39/154 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/355 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 154 constraints, problems are : Problem set: 0 solved, 7 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 103/103 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 65/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 27/103 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:17:16] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 252/355 variables, 103/116 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 39/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 7/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:17:16] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/355 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/355 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 163 constraints, problems are : Problem set: 0 solved, 7 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 103/103 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints]
After SMT, in 1123ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1810 ms.
Support contains 11 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 276/276 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 102 transition count 281
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 102 transition count 278
Applied a total of 5 rules in 17 ms. Remains 102 /103 variables (removed 1) and now considering 278/276 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 102/103 places, 278/276 transitions.
RANDOM walk for 40000 steps (2177 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (622 resets) in 42 ms. (930 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (553 resets) in 50 ms. (784 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (608 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (528 resets) in 35 ms. (1111 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (578 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (21 resets) in 22 ms. (1739 steps per ms) remains 6/6 properties
[2024-06-02 20:17:19] [INFO ] Flow matrix only has 252 transitions (discarded 26 similar events)
// Phase 1: matrix 252 rows 102 cols
[2024-06-02 20:17:19] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:17:19] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 66/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 27/102 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 20:17:19] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:17:19] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:17:19] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 252/354 variables, 102/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 153 constraints, problems are : Problem set: 0 solved, 6 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 102/102 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 66/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 27/102 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 252/354 variables, 102/114 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/354 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 159 constraints, problems are : Problem set: 0 solved, 6 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 102/102 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 691ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1073 ms.
Support contains 9 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 278/278 transitions.
Applied a total of 0 rules in 18 ms. Remains 102 /102 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 102/102 places, 278/278 transitions.
RANDOM walk for 40000 steps (2195 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (606 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (523 resets) in 30 ms. (1290 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (551 resets) in 46 ms. (851 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (558 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (565 resets) in 29 ms. (1333 steps per ms) remains 5/5 properties
[2024-06-02 20:17:21] [INFO ] Flow matrix only has 252 transitions (discarded 26 similar events)
[2024-06-02 20:17:21] [INFO ] Invariant cache hit.
[2024-06-02 20:17:21] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 67/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 27/102 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:17:21] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 252/354 variables, 102/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 39/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 151 constraints, problems are : Problem set: 0 solved, 5 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 102/102 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 67/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 27/102 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 252/354 variables, 102/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 39/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 5/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 20:17:21] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:17:21] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/354 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 158 constraints, problems are : Problem set: 0 solved, 5 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 102/102 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 726ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 778 ms.
Support contains 8 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 278/278 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 102/102 places, 278/278 transitions.
RANDOM walk for 40000 steps (2153 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (558 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (546 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (585 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (552 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (606 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 981643 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :1 out of 5
Probabilistic random walk after 981643 steps, saw 184609 distinct states, run finished after 3004 ms. (steps per millisecond=326 ) properties seen :1
[2024-06-02 20:17:25] [INFO ] Flow matrix only has 252 transitions (discarded 26 similar events)
[2024-06-02 20:17:25] [INFO ] Invariant cache hit.
[2024-06-02 20:17:25] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 69/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 27/102 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 252/354 variables, 102/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 39/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/354 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 150 constraints, problems are : Problem set: 0 solved, 4 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 102/102 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 69/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 27/102 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 252/354 variables, 102/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 39/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 154 constraints, problems are : Problem set: 0 solved, 4 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 102/102 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 430ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 157 ms.
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 278/278 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 101 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 101 transition count 276
Applied a total of 2 rules in 8 ms. Remains 101 /102 variables (removed 1) and now considering 276/278 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 101/102 places, 276/278 transitions.
RANDOM walk for 40000 steps (2202 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (615 resets) in 31 ms. (1250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (549 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (579 resets) in 31 ms. (1250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (557 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1005208 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :0 out of 4
Probabilistic random walk after 1005208 steps, saw 186367 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
[2024-06-02 20:17:29] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
// Phase 1: matrix 250 rows 101 cols
[2024-06-02 20:17:29] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:17:29] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 68/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 27/101 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/351 variables, 101/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 39/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/351 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 149 constraints, problems are : Problem set: 0 solved, 4 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 68/74 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 27/101 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 250/351 variables, 101/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 39/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/351 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 153 constraints, problems are : Problem set: 0 solved, 4 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 430ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 111 ms.
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 276/276 transitions.
Applied a total of 0 rules in 10 ms. Remains 101 /101 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 101/101 places, 276/276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 276/276 transitions.
Applied a total of 0 rules in 8 ms. Remains 101 /101 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2024-06-02 20:17:29] [INFO ] Flow matrix only has 250 transitions (discarded 26 similar events)
[2024-06-02 20:17:29] [INFO ] Invariant cache hit.
[2024-06-02 20:17:30] [INFO ] Implicit Places using invariants in 58 ms returned [100]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/101 places, 276/276 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 100 transition count 275
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 99 transition count 275
Applied a total of 2 rules in 10 ms. Remains 99 /100 variables (removed 1) and now considering 275/276 (removed 1) transitions.
[2024-06-02 20:17:30] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
// Phase 1: matrix 249 rows 99 cols
[2024-06-02 20:17:30] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:17:30] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 20:17:30] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
[2024-06-02 20:17:30] [INFO ] Invariant cache hit.
[2024-06-02 20:17:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:17:30] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 99/101 places, 275/276 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 265 ms. Remains : 99/101 places, 275/276 transitions.
RANDOM walk for 40000 steps (2299 resets) in 112 ms. (353 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (633 resets) in 56 ms. (701 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (604 resets) in 32 ms. (1212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (640 resets) in 29 ms. (1333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (651 resets) in 31 ms. (1250 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 4623 steps, run visited all 4 properties in 24 ms. (steps per millisecond=192 )
Probabilistic random walk after 4623 steps, saw 2219 distinct states, run finished after 27 ms. (steps per millisecond=171 ) properties seen :4
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 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 292/292 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 110 transition count 291
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 109 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 107 transition count 286
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 106 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 106 transition count 284
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 10 place count 105 transition count 283
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 16 place count 102 transition count 290
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 24 place count 102 transition count 282
Applied a total of 24 rules in 21 ms. Remains 102 /110 variables (removed 8) and now considering 282/292 (removed 10) transitions.
[2024-06-02 20:17:30] [INFO ] Flow matrix only has 250 transitions (discarded 32 similar events)
// Phase 1: matrix 250 rows 102 cols
[2024-06-02 20:17:30] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:17:30] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 20:17:30] [INFO ] Flow matrix only has 250 transitions (discarded 32 similar events)
[2024-06-02 20:17:30] [INFO ] Invariant cache hit.
[2024-06-02 20:17:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 20:17:30] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-06-02 20:17:30] [INFO ] Redundant transitions in 16 ms returned []
Running 281 sub problems to find dead transitions.
[2024-06-02 20:17:30] [INFO ] Flow matrix only has 250 transitions (discarded 32 similar events)
[2024-06-02 20:17:30] [INFO ] Invariant cache hit.
[2024-06-02 20:17:30] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-02 20:17:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-02 20:17:32] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2024-06-02 20:17:32] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:17:32] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2024-06-02 20:17:32] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:17:32] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:17:32] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:17:32] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:17:33] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 249/351 variables, 102/120 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 39/159 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 1/352 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-06-02 20:17:37] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 10 (OVERLAPS) 0/352 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 161 constraints, problems are : Problem set: 0 solved, 281 unsolved in 12339 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 249/351 variables, 102/121 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 39/160 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 281/441 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 1/352 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 10 (OVERLAPS) 0/352 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 442 constraints, problems are : Problem set: 0 solved, 281 unsolved in 17541 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 10/10 constraints]
After SMT, in 30043ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 30046ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/110 places, 282/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30290 ms. Remains : 102/110 places, 282/292 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-00 finished in 30553 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' '!(G(F((G(p1)||p0))))'
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 292/292 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 110 transition count 291
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 109 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 107 transition count 286
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 106 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 106 transition count 284
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 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 18 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 26 place count 101 transition count 281
Applied a total of 26 rules in 28 ms. Remains 101 /110 variables (removed 9) and now considering 281/292 (removed 11) transitions.
[2024-06-02 20:18:01] [INFO ] Flow matrix only has 249 transitions (discarded 32 similar events)
// Phase 1: matrix 249 rows 101 cols
[2024-06-02 20:18:01] [INFO ] Computed 9 invariants in 4 ms
[2024-06-02 20:18:01] [INFO ] Implicit Places using invariants in 62 ms returned [100]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/110 places, 281/292 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 100 transition count 280
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 99 transition count 280
Applied a total of 2 rules in 6 ms. Remains 99 /100 variables (removed 1) and now considering 280/281 (removed 1) transitions.
[2024-06-02 20:18:01] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
// Phase 1: matrix 248 rows 99 cols
[2024-06-02 20:18:01] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:18:01] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 20:18:01] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
[2024-06-02 20:18:01] [INFO ] Invariant cache hit.
[2024-06-02 20:18:01] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:18:01] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/110 places, 280/292 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 278 ms. Remains : 99/110 places, 280/292 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-03-LTLFireability-01
Product exploration explored 100000 steps with 2 reset in 135 ms.
Product exploration explored 100000 steps with 3 reset in 80 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2348 resets) in 203 ms. (196 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (628 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
[2024-06-02 20:18:02] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
[2024-06-02 20:18:02] [INFO ] Invariant cache hit.
[2024-06-02 20:18:02] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/99 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 247/346 variables, 99/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 38/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/347 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/347 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 44/347 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 2/8 constraints, State Equation: 0/99 constraints, ReadFeed: 0/39 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 219 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 280/280 transitions.
Applied a total of 0 rules in 9 ms. Remains 99 /99 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2024-06-02 20:18:02] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
[2024-06-02 20:18:02] [INFO ] Invariant cache hit.
[2024-06-02 20:18:02] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 20:18:02] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
[2024-06-02 20:18:02] [INFO ] Invariant cache hit.
[2024-06-02 20:18:02] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:18:02] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-06-02 20:18:02] [INFO ] Redundant transitions in 4 ms returned []
Running 279 sub problems to find dead transitions.
[2024-06-02 20:18:02] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
[2024-06-02 20:18:02] [INFO ] Invariant cache hit.
[2024-06-02 20:18:02] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-06-02 20:18:04] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:18:04] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2024-06-02 20:18:04] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:18:04] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-02 20:18:04] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:18:04] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:18:04] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:18:04] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:18:04] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:18:04] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 247/346 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 38/155 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (OVERLAPS) 1/347 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (OVERLAPS) 0/347 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 156 constraints, problems are : Problem set: 0 solved, 279 unsolved in 10926 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (OVERLAPS) 247/346 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 38/155 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 279/434 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 8 (OVERLAPS) 1/347 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 10 (OVERLAPS) 0/347 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 435 constraints, problems are : Problem set: 0 solved, 279 unsolved in 15510 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 10/10 constraints]
After SMT, in 26589ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 26592ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26788 ms. Remains : 99/99 places, 280/280 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 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 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2317 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (591 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5171 steps, run visited all 1 properties in 13 ms. (steps per millisecond=397 )
Probabilistic random walk after 5171 steps, saw 2418 distinct states, run finished after 13 ms. (steps per millisecond=397 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 181 ms.
Product exploration explored 100000 steps with 0 reset in 131 ms.
Built C files in :
/tmp/ltsmin1395884059439639818
[2024-06-02 20:18:30] [INFO ] Computing symmetric may disable matrix : 280 transitions.
[2024-06-02 20:18:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:18:30] [INFO ] Computing symmetric may enable matrix : 280 transitions.
[2024-06-02 20:18:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:18:30] [INFO ] Computing Do-Not-Accords matrix : 280 transitions.
[2024-06-02 20:18:30] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:18:30] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1395884059439639818
Running compilation step : cd /tmp/ltsmin1395884059439639818;'/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 706 ms.
Running link step : cd /tmp/ltsmin1395884059439639818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin1395884059439639818;'/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/stateBased12100143632220508058.hoa' '--buchi-type=spotba'
LTSmin run took 437 ms.
FORMULA FireWire-PT-03-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-03-LTLFireability-01 finished in 30321 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)))'
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 292/292 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 109 transition count 290
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 108 transition count 290
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 106 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 106 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 105 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 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 10 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 16 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 24 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 25 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 26 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 26 place count 99 transition count 279
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 28 place count 98 transition count 279
Applied a total of 28 rules in 28 ms. Remains 98 /110 variables (removed 12) and now considering 279/292 (removed 13) transitions.
[2024-06-02 20:18:31] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
// Phase 1: matrix 247 rows 98 cols
[2024-06-02 20:18:31] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:18:31] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 20:18:31] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 20:18:31] [INFO ] Invariant cache hit.
[2024-06-02 20:18:31] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:18:31] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-06-02 20:18:31] [INFO ] Redundant transitions in 3 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 20:18:31] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 20:18:31] [INFO ] Invariant cache hit.
[2024-06-02 20:18:31] [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:18:32] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:18:32] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-06-02 20:18:32] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:18:32] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:18:32] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:18:33] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:18:33] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:18:33] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-02 20:18:33] [INFO ] Deduced a trap composed of 32 places in 36 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:18:37] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 5 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:18:39] [INFO ] Deduced a trap composed of 35 places in 48 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 13152 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 9650 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 22941ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 22943ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/110 places, 279/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23145 ms. Remains : 98/110 places, 279/292 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-02
Product exploration explored 100000 steps with 4 reset in 55 ms.
Product exploration explored 100000 steps with 0 reset in 48 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 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2486 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (622 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4975 steps, run visited all 1 properties in 10 ms. (steps per millisecond=497 )
Probabilistic random walk after 4975 steps, saw 2277 distinct states, run finished after 10 ms. (steps per millisecond=497 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 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 40 ms :[(NOT p0)]
Support contains 2 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:18:55] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 20:18:55] [INFO ] Invariant cache hit.
[2024-06-02 20:18:55] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 20:18:55] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 20:18:55] [INFO ] Invariant cache hit.
[2024-06-02 20:18:55] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:18:55] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-06-02 20:18:55] [INFO ] Redundant transitions in 3 ms returned []
Running 276 sub problems to find dead transitions.
[2024-06-02 20:18:55] [INFO ] Flow matrix only has 247 transitions (discarded 32 similar events)
[2024-06-02 20:18:55] [INFO ] Invariant cache hit.
[2024-06-02 20:18:55] [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:18:56] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:18:56] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:18:56] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:18:56] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:18:56] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:18:56] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:18:56] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:18:56] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-06-02 20:18:57] [INFO ] Deduced a trap composed of 32 places in 37 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:19:00] [INFO ] Deduced a trap composed of 35 places in 58 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:19:03] [INFO ] Deduced a trap composed of 35 places in 55 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 13002 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 9767 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 22903ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 22906ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 23098 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 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2449 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (641 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4975 steps, run visited all 1 properties in 9 ms. (steps per millisecond=552 )
Probabilistic random walk after 4975 steps, saw 2277 distinct states, run finished after 10 ms. (steps per millisecond=497 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 51 ms.
Product exploration explored 100000 steps with 4 reset in 49 ms.
Built C files in :
/tmp/ltsmin12710970027271608831
[2024-06-02 20:19:18] [INFO ] Computing symmetric may disable matrix : 279 transitions.
[2024-06-02 20:19:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:19:18] [INFO ] Computing symmetric may enable matrix : 279 transitions.
[2024-06-02 20:19:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:19:18] [INFO ] Computing Do-Not-Accords matrix : 279 transitions.
[2024-06-02 20:19:18] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:19:18] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12710970027271608831
Running compilation step : cd /tmp/ltsmin12710970027271608831;'/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 599 ms.
Running link step : cd /tmp/ltsmin12710970027271608831;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12710970027271608831;'/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/stateBased7349373433527690070.hoa' '--buchi-type=spotba'
LTSmin run took 447 ms.
FORMULA FireWire-PT-03-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-03-LTLFireability-02 finished in 48374 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((X(p0)||(p1 U G(p2)))))'
Support contains 3 out of 110 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 285
Applied a total of 6 rules in 2 ms. Remains 107 /110 variables (removed 3) and now considering 285/292 (removed 7) transitions.
[2024-06-02 20:19:19] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 20:19:19] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:19:19] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 20:19:19] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:19:19] [INFO ] Invariant cache hit.
[2024-06-02 20:19:20] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:19:20] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:19:20] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:19:20] [INFO ] Invariant cache hit.
[2024-06-02 20:19:20] [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:21] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-06-02 20:19:21] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 2 ms to minimize.
[2024-06-02 20:19:21] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:19:21] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:19:21] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:19:21] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:19:21] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:19:22] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-02 20:19:22] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-02 20:19:22] [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 11466 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:19:32] [INFO ] Deduced a trap composed of 38 places in 55 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 19890 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 31501ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31503ms
Starting structural reductions in LTL mode, iteration 1 : 107/110 places, 285/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31681 ms. Remains : 107/110 places, 285/292 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-03-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-03 finished in 31774 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))))||F(p2)))'
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 285
Applied a total of 6 rules in 2 ms. Remains 107 /110 variables (removed 3) and now considering 285/292 (removed 7) transitions.
[2024-06-02 20:19:51] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:19:51] [INFO ] Invariant cache hit.
[2024-06-02 20:19:51] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 20:19:51] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:19:51] [INFO ] Invariant cache hit.
[2024-06-02 20:19:51] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:19:51] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:19:51] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:19:51] [INFO ] Invariant cache hit.
[2024-06-02 20:19:51] [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:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-02 20:19:53] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:19:53] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:19:53] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:19:53] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:19:53] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:19:53] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:19:53] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-02 20:19:54] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:19:54] [INFO ] Deduced a trap composed of 36 places in 45 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 11498 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:04] [INFO ] Deduced a trap composed of 38 places in 57 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 20408 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 32072ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 32076ms
Starting structural reductions in LTL mode, iteration 1 : 107/110 places, 285/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32258 ms. Remains : 107/110 places, 285/292 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FireWire-PT-03-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-04 finished in 32442 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 292/292 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 110 transition count 291
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 109 transition count 291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 107 transition count 286
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 107 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 106 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 106 transition count 284
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 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 22 place count 102 transition count 281
Applied a total of 22 rules in 17 ms. Remains 102 /110 variables (removed 8) and now considering 281/292 (removed 11) transitions.
[2024-06-02 20:20:24] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
// Phase 1: matrix 252 rows 102 cols
[2024-06-02 20:20:24] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:20:24] [INFO ] Implicit Places using invariants in 58 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/110 places, 281/292 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 101 transition count 280
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 100 transition count 280
Applied a total of 2 rules in 4 ms. Remains 100 /101 variables (removed 1) and now considering 280/281 (removed 1) transitions.
[2024-06-02 20:20:24] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
// Phase 1: matrix 251 rows 100 cols
[2024-06-02 20:20:24] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:20:24] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 20:20:24] [INFO ] Flow matrix only has 251 transitions (discarded 29 similar events)
[2024-06-02 20:20:24] [INFO ] Invariant cache hit.
[2024-06-02 20:20:24] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:20:24] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/110 places, 280/292 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 258 ms. Remains : 100/110 places, 280/292 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-07 finished in 400 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' '!((G(p0) U X(X(p1))))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 285
Applied a total of 6 rules in 4 ms. Remains 107 /110 variables (removed 3) and now considering 285/292 (removed 7) transitions.
[2024-06-02 20:20:24] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 20:20:24] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 20:20:24] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 20:20:24] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:20:24] [INFO ] Invariant cache hit.
[2024-06-02 20:20:24] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:20:24] [INFO ] Implicit Places using invariants and state equation in 132 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:20:24] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:20:24] [INFO ] Invariant cache hit.
[2024-06-02 20:20:24] [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:26] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:20:26] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 0 ms to minimize.
[2024-06-02 20:20:26] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:20:26] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:20:26] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2024-06-02 20:20:26] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:20:26] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-06-02 20:20:26] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-02 20:20:27] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-06-02 20:20:27] [INFO ] Deduced a trap composed of 36 places in 49 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 11662 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:37] [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 20199 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 32001ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 32004ms
Starting structural reductions in LTL mode, iteration 1 : 107/110 places, 285/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32201 ms. Remains : 107/110 places, 285/292 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-08 finished in 32479 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)))'
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 285
Applied a total of 6 rules in 4 ms. Remains 107 /110 variables (removed 3) and now considering 285/292 (removed 7) transitions.
[2024-06-02 20:20:56] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:20:56] [INFO ] Invariant cache hit.
[2024-06-02 20:20:57] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 20:20:57] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:20:57] [INFO ] Invariant cache hit.
[2024-06-02 20:20:57] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:20:57] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:20:57] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:20:57] [INFO ] Invariant cache hit.
[2024-06-02 20:20:57] [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:58] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:20:58] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:20:58] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:20:58] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:20:58] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:20:58] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:20:58] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:20:59] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:20:59] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-02 20:20:59] [INFO ] Deduced a trap composed of 36 places in 45 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 11465 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:09] [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 20141 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 31734ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31737ms
Starting structural reductions in LTL mode, iteration 1 : 107/110 places, 285/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31922 ms. Remains : 107/110 places, 285/292 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 76 ms.
Product exploration explored 100000 steps with 4 reset in 90 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (2043 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (512 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2462774 steps, run timeout after 3001 ms. (steps per millisecond=820 ) properties seen :0 out of 1
Probabilistic random walk after 2462774 steps, saw 383173 distinct states, run finished after 3001 ms. (steps per millisecond=820 ) properties seen :0
[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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/107 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/366 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/366 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/107 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 258/365 variables, 107/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/366 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/366 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 107/107 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 249ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 285/285 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 107 transition count 282
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 107 transition count 281
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 5 place count 106 transition count 281
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 104 transition count 279
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 1 with 6 rules applied. Total rules applied 15 place count 101 transition count 286
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 21 place count 101 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 101 transition count 275
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 101 transition count 277
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 2 with 3 rules applied. Total rules applied 30 place count 100 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 100 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 99 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 98 transition count 272
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 34 place count 98 transition count 271
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 97 transition count 271
Applied a total of 36 rules in 24 ms. Remains 97 /107 variables (removed 10) and now considering 271/285 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 97/107 places, 271/285 transitions.
RANDOM walk for 40000 steps (2463 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (608 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 650 steps, run visited all 1 properties in 4 ms. (steps per millisecond=162 )
Probabilistic random walk after 650 steps, saw 329 distinct states, run finished after 4 ms. (steps per millisecond=162 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-03-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-03-LTLFireability-09 finished in 35758 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(F((p0||G(p1)))))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 287
Applied a total of 4 rules in 3 ms. Remains 108 /110 variables (removed 2) and now considering 287/292 (removed 5) transitions.
[2024-06-02 20:21:32] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
// Phase 1: matrix 261 rows 108 cols
[2024-06-02 20:21:32] [INFO ] Computed 9 invariants in 1 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 261 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:33] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-06-02 20:21:33] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:21:33] [INFO ] Invariant cache hit.
[2024-06-02 20:21:33] [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:21:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:21:34] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
[2024-06-02 20:21:34] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:21:34] [INFO ] Deduced a trap composed of 58 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 53 ms of which 1 ms to minimize.
[2024-06-02 20:21:34] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:21:35] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:21:35] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 20:21:35] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 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 11526 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 14840 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 26521ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 26528ms
Starting structural reductions in LTL mode, iteration 1 : 108/110 places, 287/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26833 ms. Remains : 108/110 places, 287/292 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-03-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 54 ms.
Product exploration explored 100000 steps with 1 reset in 166 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 : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (1985 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (471 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (490 resets) in 115 ms. (344 steps per ms) remains 3/6 properties
[2024-06-02 20:22:00] [INFO ] Flow matrix only has 261 transitions (discarded 26 similar events)
[2024-06-02 20:22:00] [INFO ] Invariant cache hit.
[2024-06-02 20:22:00] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 71/75 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/108 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 260/368 variables, 108/117 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 38/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 156 constraints, problems are : Problem set: 1 solved, 2 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 71/75 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/108 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-02 20:22:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:22:00] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 260/368 variables, 108/119 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 38/157 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 2/159 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/369 variables, 1/160 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/369 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 160 constraints, problems are : Problem set: 1 solved, 2 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 474ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 287/287 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 108 transition count 284
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 108 transition count 283
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 5 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 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 13 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 17 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 21 place count 103 transition count 277
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 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 29 place count 101 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 45 place count 101 transition count 283
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 47 place count 101 transition count 283
Applied a total of 47 rules in 22 ms. Remains 101 /108 variables (removed 7) and now considering 283/287 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 101/108 places, 283/287 transitions.
RANDOM walk for 40000 steps (2220 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (575 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (576 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 5102 steps, run visited all 2 properties in 29 ms. (steps per millisecond=175 )
Probabilistic random walk after 5102 steps, saw 2322 distinct states, run finished after 29 ms. (steps per millisecond=175 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 277 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), false]
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 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 108 transition count 286
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 107 transition count 286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 105 transition count 284
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 0 with 4 rules applied. Total rules applied 10 place count 103 transition count 288
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 16 place count 103 transition count 282
Applied a total of 16 rules in 17 ms. Remains 103 /108 variables (removed 5) and now considering 282/287 (removed 5) transitions.
[2024-06-02 20:22:01] [INFO ] Flow matrix only has 253 transitions (discarded 29 similar events)
// Phase 1: matrix 253 rows 103 cols
[2024-06-02 20:22:01] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:22:01] [INFO ] Implicit Places using invariants in 51 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/108 places, 282/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 102 transition count 281
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 101 transition count 281
Applied a total of 2 rules in 4 ms. Remains 101 /102 variables (removed 1) and now considering 281/282 (removed 1) transitions.
[2024-06-02 20:22:01] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
// Phase 1: matrix 252 rows 101 cols
[2024-06-02 20:22:01] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:22:01] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 20:22:01] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
[2024-06-02 20:22:01] [INFO ] Invariant cache hit.
[2024-06-02 20:22:01] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:22:01] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/108 places, 281/287 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 349 ms. Remains : 101/108 places, 281/287 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), false]
RANDOM walk for 40000 steps (2259 resets) in 134 ms. (296 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (551 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (648 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
[2024-06-02 20:22:02] [INFO ] Flow matrix only has 252 transitions (discarded 29 similar events)
[2024-06-02 20:22:02] [INFO ] Invariant cache hit.
[2024-06-02 20:22:02] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 28/101 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 251/352 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 38/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/353 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/353 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 148 constraints, problems are : Problem set: 0 solved, 2 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/73 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/101 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 20:22:02] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:22:02] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:22:02] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:22:02] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 251/352 variables, 101/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 38/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/353 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/353 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 154 constraints, problems are : Problem set: 0 solved, 2 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 567ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 72 ms.
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 281/281 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 101 transition count 276
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 101 transition count 302
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 1 with 6 rules applied. Total rules applied 13 place count 99 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 29 place count 99 transition count 282
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 99 transition count 282
Applied a total of 31 rules in 22 ms. Remains 99 /101 variables (removed 2) and now considering 282/281 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 99/101 places, 282/281 transitions.
RANDOM walk for 40000 steps (2350 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (602 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (603 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 5310 steps, run visited all 2 properties in 24 ms. (steps per millisecond=221 )
Probabilistic random walk after 5310 steps, saw 2313 distinct states, run finished after 24 ms. (steps per millisecond=221 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 299 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), false]
Product exploration explored 100000 steps with 4 reset in 50 ms.
Product exploration explored 100000 steps with 0 reset in 49 ms.
Built C files in :
/tmp/ltsmin17950607345724110
[2024-06-02 20:22:03] [INFO ] Computing symmetric may disable matrix : 281 transitions.
[2024-06-02 20:22:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:22:03] [INFO ] Computing symmetric may enable matrix : 281 transitions.
[2024-06-02 20:22:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:22:03] [INFO ] Computing Do-Not-Accords matrix : 281 transitions.
[2024-06-02 20:22:03] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:22:03] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17950607345724110
Running compilation step : cd /tmp/ltsmin17950607345724110;'/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 614 ms.
Running link step : cd /tmp/ltsmin17950607345724110;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17950607345724110;'/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/stateBased2845529791318554755.hoa' '--buchi-type=spotba'
LTSmin run took 399 ms.
FORMULA FireWire-PT-03-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-03-LTLFireability-10 finished in 32180 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' '!((!p0 U (G(!p0)||(!p0&&G(p1)))))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 292/292 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 109 transition count 290
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 108 transition count 290
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 106 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 106 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 105 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 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 10 place count 104 transition count 282
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 0 with 4 rules applied. Total rules applied 14 place count 102 transition count 286
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 20 place count 102 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 101 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 100 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 22 place count 100 transition count 278
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 24 place count 99 transition count 278
Applied a total of 24 rules in 19 ms. Remains 99 /110 variables (removed 11) and now considering 278/292 (removed 14) transitions.
[2024-06-02 20:22:04] [INFO ] Flow matrix only has 249 transitions (discarded 29 similar events)
// Phase 1: matrix 249 rows 99 cols
[2024-06-02 20:22:04] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:22:04] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 20:22:04] [INFO ] Flow matrix only has 249 transitions (discarded 29 similar events)
[2024-06-02 20:22:04] [INFO ] Invariant cache hit.
[2024-06-02 20:22:05] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:22:05] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-06-02 20:22:05] [INFO ] Redundant transitions in 1 ms returned []
Running 275 sub problems to find dead transitions.
[2024-06-02 20:22:05] [INFO ] Flow matrix only has 249 transitions (discarded 29 similar events)
[2024-06-02 20:22:05] [INFO ] Invariant cache hit.
[2024-06-02 20:22:05] [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, 275 unsolved
[2024-06-02 20:22:05] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:22:06] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:22:06] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:22:06] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-06-02 20:22:06] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:22:06] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:22:06] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:22:06] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-06-02 20:22:06] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 248/347 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 37/153 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (OVERLAPS) 0/347 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/348 variables, and 153 constraints, problems are : Problem set: 0 solved, 275 unsolved in 7447 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 3 (OVERLAPS) 248/347 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 37/153 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 275/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 7 (OVERLAPS) 0/347 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 275 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/348 variables, and 428 constraints, problems are : Problem set: 0 solved, 275 unsolved in 9893 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 9/9 constraints]
After SMT, in 17478ms problems are : Problem set: 0 solved, 275 unsolved
Search for dead transitions found 0 dead transitions in 17483ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/110 places, 278/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17678 ms. Remains : 99/110 places, 278/292 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-11
Entered a terminal (fully accepting) state of product in 67 steps with 1 reset in 1 ms.
FORMULA FireWire-PT-03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-11 finished in 17823 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(F((X(p1)&&p0))))'
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 285
Applied a total of 6 rules in 5 ms. Remains 107 /110 variables (removed 3) and now considering 285/292 (removed 7) transitions.
[2024-06-02 20:22:22] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 20:22:22] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 20:22:22] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 20:22:22] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:22:22] [INFO ] Invariant cache hit.
[2024-06-02 20:22:22] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:22:22] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:22:22] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:22:22] [INFO ] Invariant cache hit.
[2024-06-02 20:22:22] [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:22:24] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:22:24] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:22:24] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:22:24] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:22:24] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:22:24] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-06-02 20:22:24] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:22:24] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-02 20:22:25] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:22:25] [INFO ] Deduced a trap composed of 36 places in 49 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 11591 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:22:35] [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 20312 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 32031ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 32034ms
Starting structural reductions in LTL mode, iteration 1 : 107/110 places, 285/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32234 ms. Remains : 107/110 places, 285/292 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-03-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-12 finished in 32371 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(p0))'
Support contains 1 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 292/292 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 109 transition count 290
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 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 107 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 107 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 106 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 106 transition count 285
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 8 place count 105 transition count 284
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 102 transition count 290
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 22 place count 102 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 101 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 100 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 24 place count 100 transition count 280
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 26 place count 99 transition count 280
Applied a total of 26 rules in 23 ms. Remains 99 /110 variables (removed 11) and now considering 280/292 (removed 12) transitions.
[2024-06-02 20:22:55] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
// Phase 1: matrix 248 rows 99 cols
[2024-06-02 20:22:55] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 20:22:55] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 20:22:55] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
[2024-06-02 20:22:55] [INFO ] Invariant cache hit.
[2024-06-02 20:22:55] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:22:55] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-06-02 20:22:55] [INFO ] Redundant transitions in 1 ms returned []
Running 277 sub problems to find dead transitions.
[2024-06-02 20:22:55] [INFO ] Flow matrix only has 248 transitions (discarded 32 similar events)
[2024-06-02 20:22:55] [INFO ] Invariant cache hit.
[2024-06-02 20:22:55] [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, 277 unsolved
[2024-06-02 20:22:56] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:22:56] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 0 ms to minimize.
[2024-06-02 20:22:56] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:22:56] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-06-02 20:22:56] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:22:56] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:22:56] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:22:56] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:22:56] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:22:56] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:22:57] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:22:57] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-06-02 20:22:57] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:22:57] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (OVERLAPS) 247/346 variables, 99/121 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 0/346 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/347 variables, and 158 constraints, problems are : Problem set: 0 solved, 277 unsolved in 8191 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (OVERLAPS) 247/346 variables, 99/121 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 277/435 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 0/346 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Int declared 346/347 variables, and 435 constraints, problems are : Problem set: 0 solved, 277 unsolved in 10570 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 14/14 constraints]
After SMT, in 18890ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 18893ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/110 places, 280/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19109 ms. Remains : 99/110 places, 280/292 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-03-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-14 finished in 19163 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(p0)&&X(p1)))'
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 292/292 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 108 transition count 287
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 108 transition count 287
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 285
Applied a total of 6 rules in 5 ms. Remains 107 /110 variables (removed 3) and now considering 285/292 (removed 7) transitions.
[2024-06-02 20:23:14] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 107 cols
[2024-06-02 20:23:14] [INFO ] Computed 9 invariants in 3 ms
[2024-06-02 20:23:14] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:23:14] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:23:14] [INFO ] Invariant cache hit.
[2024-06-02 20:23:14] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 20:23:14] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-06-02 20:23:14] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 20:23:14] [INFO ] Invariant cache hit.
[2024-06-02 20:23:14] [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:23:15] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:23:15] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-06-02 20:23:15] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:23:15] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:23:16] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:23:16] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:23:16] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-06-02 20:23:16] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-02 20:23:16] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-02 20:23:16] [INFO ] Deduced a trap composed of 36 places in 51 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 11502 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:23:26] [INFO ] Deduced a trap composed of 38 places in 60 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 20201 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 31831ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 31834ms
Starting structural reductions in LTL mode, iteration 1 : 107/110 places, 285/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32022 ms. Remains : 107/110 places, 285/292 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FireWire-PT-03-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-03-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-03-LTLFireability-15 finished in 32182 ms.
All properties solved by simple procedures.
Total runtime 436212 ms.

BK_STOP 1717359826496

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-03"
export BK_EXAMINATION="LTLFireability"
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 LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734898800188"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;