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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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 84K 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-01-LTLFireability-00
FORMULA_NAME FireWire-PT-01-LTLFireability-01
FORMULA_NAME FireWire-PT-01-LTLFireability-02
FORMULA_NAME FireWire-PT-01-LTLFireability-03
FORMULA_NAME FireWire-PT-01-LTLFireability-04
FORMULA_NAME FireWire-PT-01-LTLFireability-05
FORMULA_NAME FireWire-PT-01-LTLFireability-06
FORMULA_NAME FireWire-PT-01-LTLFireability-07
FORMULA_NAME FireWire-PT-01-LTLFireability-08
FORMULA_NAME FireWire-PT-01-LTLFireability-09
FORMULA_NAME FireWire-PT-01-LTLFireability-10
FORMULA_NAME FireWire-PT-01-LTLFireability-11
FORMULA_NAME FireWire-PT-01-LTLFireability-12
FORMULA_NAME FireWire-PT-01-LTLFireability-13
FORMULA_NAME FireWire-PT-01-LTLFireability-14
FORMULA_NAME FireWire-PT-01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717358776176

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-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 20:06:17] [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:06:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:06:17] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-02 20:06:17] [INFO ] Transformed 107 places.
[2024-06-02 20:06:17] [INFO ] Transformed 346 transitions.
[2024-06-02 20:06:17] [INFO ] Found NUPN structural information;
[2024-06-02 20:06:17] [INFO ] Parsed PT model containing 107 places and 346 transitions and 1271 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-01-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 293/293 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 104 transition count 285
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 104 transition count 285
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 102 transition count 281
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 102 transition count 281
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 102 transition count 275
Applied a total of 16 rules in 33 ms. Remains 102 /107 variables (removed 5) and now considering 275/293 (removed 18) transitions.
[2024-06-02 20:06:17] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
// Phase 1: matrix 249 rows 102 cols
[2024-06-02 20:06:17] [INFO ] Computed 8 invariants in 19 ms
[2024-06-02 20:06:17] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-02 20:06:17] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
[2024-06-02 20:06:17] [INFO ] Invariant cache hit.
[2024-06-02 20:06:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:06:18] [INFO ] Implicit Places using invariants and state equation in 167 ms returned [100]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 414 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 101/107 places, 275/293 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 466 ms. Remains : 101/107 places, 275/293 transitions.
Support contains 24 out of 101 places after structural reductions.
[2024-06-02 20:06:18] [INFO ] Flatten gal took : 50 ms
[2024-06-02 20:06:18] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:06:18] [INFO ] Input system was already deterministic with 275 transitions.
RANDOM walk for 40000 steps (2246 resets) in 1975 ms. (20 steps per ms) remains 7/16 properties
BEST_FIRST walk for 40003 steps (583 resets) in 285 ms. (139 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1069 resets) in 99 ms. (400 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (80 resets) in 68 ms. (579 steps per ms) remains 3/6 properties
[2024-06-02 20:06:19] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
// Phase 1: matrix 249 rows 101 cols
[2024-06-02 20:06:19] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:06:19] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/97 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 245/342 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/346 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/349 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/350 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/350 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 146 constraints, problems are : Problem set: 0 solved, 3 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 66/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/97 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 245/342 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 4/346 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/346 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/349 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/349 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1/350 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/350 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/350 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 149 constraints, problems are : Problem set: 0 solved, 3 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 944ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 368 ms.
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 275/275 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 101 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 100 transition count 271
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 100 transition count 270
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 99 transition count 270
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 96 transition count 277
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 19 place count 96 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 96 transition count 268
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 96 transition count 271
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 29 place count 94 transition count 268
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 94 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 93 transition count 265
Applied a total of 32 rules in 108 ms. Remains 93 /101 variables (removed 8) and now considering 265/275 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 93/101 places, 265/275 transitions.
RANDOM walk for 40000 steps (2564 resets) in 495 ms. (80 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (632 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1422 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (64 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 18521 steps, run visited all 3 properties in 97 ms. (steps per millisecond=190 )
Probabilistic random walk after 18521 steps, saw 7015 distinct states, run finished after 101 ms. (steps per millisecond=183 ) properties seen :3
FORMULA FireWire-PT-01-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 7 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' '!(X(X(X(p0))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 99 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 99 transition count 270
Applied a total of 4 rules in 6 ms. Remains 99 /101 variables (removed 2) and now considering 270/275 (removed 5) transitions.
[2024-06-02 20:06:21] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2024-06-02 20:06:21] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:06:21] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 20:06:21] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:06:21] [INFO ] Invariant cache hit.
[2024-06-02 20:06:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:06:21] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 20:06:21] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:06:21] [INFO ] Invariant cache hit.
[2024-06-02 20:06:21] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 20:06:23] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 8 ms to minimize.
[2024-06-02 20:06:23] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2024-06-02 20:06:23] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2024-06-02 20:06:23] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2024-06-02 20:06:23] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-06-02 20:06:23] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-06-02 20:06:24] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-06-02 20:06:24] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:06:24] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 1 ms to minimize.
[2024-06-02 20:06:24] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:06:24] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10767 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14534 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 25536ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 25541ms
Starting structural reductions in LTL mode, iteration 1 : 99/101 places, 270/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25753 ms. Remains : 99/101 places, 270/275 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-01-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 4 ms.
FORMULA FireWire-PT-01-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-00 finished in 26087 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||X(G(p0))))||F(((p2||X(p0))&&p1))))'
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 99 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 99 transition count 270
Applied a total of 4 rules in 10 ms. Remains 99 /101 variables (removed 2) and now considering 270/275 (removed 5) transitions.
[2024-06-02 20:06:47] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:06:47] [INFO ] Invariant cache hit.
[2024-06-02 20:06:47] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 20:06:47] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:06:47] [INFO ] Invariant cache hit.
[2024-06-02 20:06:47] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:06:47] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 20:06:47] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:06:47] [INFO ] Invariant cache hit.
[2024-06-02 20:06:47] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 20:06:49] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:06:49] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:06:49] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:06:49] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2024-06-02 20:06:49] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-06-02 20:06:49] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:06:49] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:06:49] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-06-02 20:06:49] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:06:49] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:06:50] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10103 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14300 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24652ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24655ms
Starting structural reductions in LTL mode, iteration 1 : 99/101 places, 270/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24913 ms. Remains : 99/101 places, 270/275 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FireWire-PT-01-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-01-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-01 finished in 25202 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||G(p1))))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 99 transition count 273
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 99 transition count 272
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 98 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 97 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 97 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 96 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 96 transition count 267
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 2 with 6 rules applied. Total rules applied 14 place count 93 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 93 transition count 268
Applied a total of 20 rules in 27 ms. Remains 93 /101 variables (removed 8) and now considering 268/275 (removed 7) transitions.
[2024-06-02 20:07:12] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
// Phase 1: matrix 235 rows 93 cols
[2024-06-02 20:07:12] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:07:12] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 20:07:12] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 20:07:12] [INFO ] Invariant cache hit.
[2024-06-02 20:07:12] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:07:12] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-06-02 20:07:12] [INFO ] Redundant transitions in 12 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 20:07:12] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 20:07:12] [INFO ] Invariant cache hit.
[2024-06-02 20:07:12] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 20:07:13] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:07:13] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:07:13] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 0 ms to minimize.
[2024-06-02 20:07:13] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2024-06-02 20:07:13] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:07:14] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:07:14] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:07:14] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/107 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/144 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 20:07:16] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/328 variables, and 146 constraints, problems are : Problem set: 0 solved, 265 unsolved in 10613 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 265/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/328 variables, and 411 constraints, problems are : Problem set: 0 solved, 265 unsolved in 13195 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
After SMT, in 23942ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 23944ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/101 places, 268/275 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24178 ms. Remains : 93/101 places, 268/275 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-01-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 154 ms.
Product exploration explored 100000 steps with 4 reset in 91 ms.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2615 resets) in 381 ms. (104 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1512 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
[2024-06-02 20:07:37] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 20:07:37] [INFO ] Invariant cache hit.
[2024-06-02 20:07:37] [INFO ] State equation strengthened by 37 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) 47/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 186/235 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 85/320 variables, 39/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/327 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/327 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/328 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 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) 47/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 186/235 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 85/320 variables, 39/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/327 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/327 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/328 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 251ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 268/268 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 93 transition count 262
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 93 transition count 265
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 91 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 91 transition count 260
Applied a total of 15 rules in 17 ms. Remains 91 /93 variables (removed 2) and now considering 260/268 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 91/93 places, 260/268 transitions.
RANDOM walk for 40000 steps (2489 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1468 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5210 steps, run visited all 1 properties in 13 ms. (steps per millisecond=400 )
Probabilistic random walk after 5210 steps, saw 2556 distinct states, run finished after 13 ms. (steps per millisecond=400 ) properties seen :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 190 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 268/268 transitions.
Applied a total of 0 rules in 12 ms. Remains 93 /93 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-06-02 20:07:38] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 20:07:38] [INFO ] Invariant cache hit.
[2024-06-02 20:07:38] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 20:07:38] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 20:07:38] [INFO ] Invariant cache hit.
[2024-06-02 20:07:38] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:07:38] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-06-02 20:07:38] [INFO ] Redundant transitions in 4 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 20:07:38] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 20:07:38] [INFO ] Invariant cache hit.
[2024-06-02 20:07:38] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 20:07:39] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:07:39] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:07:39] [INFO ] Deduced a trap composed of 34 places in 24 ms of which 1 ms to minimize.
[2024-06-02 20:07:39] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 4 ms to minimize.
[2024-06-02 20:07:39] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:07:39] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:07:39] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-06-02 20:07:39] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/107 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/144 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 20:07:42] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/328 variables, and 146 constraints, problems are : Problem set: 0 solved, 265 unsolved in 10751 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 265/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/328 variables, and 411 constraints, problems are : Problem set: 0 solved, 265 unsolved in 13287 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
After SMT, in 24194ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 24198ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 24417 ms. Remains : 93/93 places, 268/268 transitions.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2568 resets) in 105 ms. (377 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (1439 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
[2024-06-02 20:08:02] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 20:08:02] [INFO ] Invariant cache hit.
[2024-06-02 20:08:02] [INFO ] State equation strengthened by 37 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) 47/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 186/235 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 85/320 variables, 39/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/327 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/327 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/328 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 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) 47/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 186/235 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 17/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 85/320 variables, 39/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/327 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/327 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/328 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 222ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 268/268 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 93 transition count 262
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 93 transition count 265
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 91 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 91 transition count 260
Applied a total of 15 rules in 19 ms. Remains 91 /93 variables (removed 2) and now considering 260/268 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 91/93 places, 260/268 transitions.
RANDOM walk for 40000 steps (2658 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1449 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5210 steps, run visited all 1 properties in 11 ms. (steps per millisecond=473 )
Probabilistic random walk after 5210 steps, saw 2556 distinct states, run finished after 11 ms. (steps per millisecond=473 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 214 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 94 ms.
Product exploration explored 100000 steps with 0 reset in 95 ms.
Built C files in :
/tmp/ltsmin2800748252340624124
[2024-06-02 20:08:03] [INFO ] Computing symmetric may disable matrix : 268 transitions.
[2024-06-02 20:08:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:08:03] [INFO ] Computing symmetric may enable matrix : 268 transitions.
[2024-06-02 20:08:03] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:08:03] [INFO ] Computing Do-Not-Accords matrix : 268 transitions.
[2024-06-02 20:08:03] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:08:03] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2800748252340624124
Running compilation step : cd /tmp/ltsmin2800748252340624124;'/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 702 ms.
Running link step : cd /tmp/ltsmin2800748252340624124;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin2800748252340624124;'/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/stateBased16133313072633147032.hoa' '--buchi-type=spotba'
LTSmin run took 1007 ms.
FORMULA FireWire-PT-01-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-01-LTLFireability-02 finished in 52785 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)))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 99 transition count 273
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 99 transition count 272
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 98 transition count 272
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 2 with 6 rules applied. Total rules applied 10 place count 95 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 95 transition count 273
Applied a total of 16 rules in 23 ms. Remains 95 /101 variables (removed 6) and now considering 273/275 (removed 2) transitions.
[2024-06-02 20:08:05] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
// Phase 1: matrix 240 rows 95 cols
[2024-06-02 20:08:05] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:08:05] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 20:08:05] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 20:08:05] [INFO ] Invariant cache hit.
[2024-06-02 20:08:05] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 20:08:05] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-06-02 20:08:05] [INFO ] Redundant transitions in 4 ms returned []
Running 270 sub problems to find dead transitions.
[2024-06-02 20:08:05] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 20:08:05] [INFO ] Invariant cache hit.
[2024-06-02 20:08:05] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 20:08:06] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:08:06] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:08:06] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:08:06] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:08:06] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 0 ms to minimize.
[2024-06-02 20:08:07] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:08:07] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 239/333 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 38/146 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 20:08:10] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/334 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/334 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/335 variables, and 148 constraints, problems are : Problem set: 0 solved, 270 unsolved in 11288 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 239/333 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 38/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 270/417 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/334 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/334 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/335 variables, and 418 constraints, problems are : Problem set: 0 solved, 270 unsolved in 15777 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 8/8 constraints]
After SMT, in 27226ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 27229ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/101 places, 273/275 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27448 ms. Remains : 95/101 places, 273/275 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-03 finished in 27528 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 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 99 transition count 273
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 99 transition count 272
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 98 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 97 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 97 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 96 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 96 transition count 267
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 93 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 93 transition count 268
Applied a total of 20 rules in 35 ms. Remains 93 /101 variables (removed 8) and now considering 268/275 (removed 7) transitions.
[2024-06-02 20:08:33] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
// Phase 1: matrix 235 rows 93 cols
[2024-06-02 20:08:33] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:08:33] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 20:08:33] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 20:08:33] [INFO ] Invariant cache hit.
[2024-06-02 20:08:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:08:33] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-06-02 20:08:33] [INFO ] Redundant transitions in 2 ms returned []
Running 265 sub problems to find dead transitions.
[2024-06-02 20:08:33] [INFO ] Flow matrix only has 235 transitions (discarded 33 similar events)
[2024-06-02 20:08:33] [INFO ] Invariant cache hit.
[2024-06-02 20:08:33] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 20:08:34] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 0 ms to minimize.
[2024-06-02 20:08:34] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 0 ms to minimize.
[2024-06-02 20:08:34] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-06-02 20:08:34] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:08:34] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:08:34] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-06-02 20:08:34] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:08:34] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/107 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/144 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-02 20:08:37] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/328 variables, and 146 constraints, problems are : Problem set: 0 solved, 265 unsolved in 10703 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 234/326 variables, 92/108 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 37/145 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 265/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/328 variables, and 411 constraints, problems are : Problem set: 0 solved, 265 unsolved in 13516 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 93/93 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 9/9 constraints]
After SMT, in 24361ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 24363ms
Starting structural reductions in SI_LTL mode, iteration 1 : 93/101 places, 268/275 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24601 ms. Remains : 93/101 places, 268/275 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-01-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-05 finished in 24762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p1)&&p0))))))'
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 99 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 99 transition count 270
Applied a total of 4 rules in 6 ms. Remains 99 /101 variables (removed 2) and now considering 270/275 (removed 5) transitions.
[2024-06-02 20:08:57] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2024-06-02 20:08:57] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:08:57] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:08:57] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:08:57] [INFO ] Invariant cache hit.
[2024-06-02 20:08:57] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:08:57] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 20:08:57] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:08:57] [INFO ] Invariant cache hit.
[2024-06-02 20:08:57] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 20:08:59] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:08:59] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2024-06-02 20:08:59] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:08:59] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-06-02 20:08:59] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:08:59] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:08:59] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:08:59] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-02 20:08:59] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:09:00] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-02 20:09:00] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 9972 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14831 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24937ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24940ms
Starting structural reductions in LTL mode, iteration 1 : 99/101 places, 270/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25145 ms. Remains : 99/101 places, 270/275 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 90 ms.
Product exploration explored 100000 steps with 0 reset in 85 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 32161 steps (1782 resets) in 58 ms. (545 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 149 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2024-06-02 20:09:24] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:09:24] [INFO ] Invariant cache hit.
[2024-06-02 20:09:24] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 20:09:24] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-02 20:09:24] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:09:24] [INFO ] [Real]Added 37 Read/Feed constraints in 6 ms returned sat
[2024-06-02 20:09:24] [INFO ] Computed and/alt/rep : 107/423/107 causal constraints (skipped 136 transitions) in 20 ms.
[2024-06-02 20:09:24] [INFO ] Added : 0 causal constraints over 0 iterations in 41 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 270/270 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-06-02 20:09:24] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:09:24] [INFO ] Invariant cache hit.
[2024-06-02 20:09:24] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 20:09:24] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:09:24] [INFO ] Invariant cache hit.
[2024-06-02 20:09:24] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:09:24] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 20:09:24] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:09:24] [INFO ] Invariant cache hit.
[2024-06-02 20:09:24] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 20:09:25] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:09:25] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:09:26] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:09:26] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:09:26] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:09:26] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:09:26] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:09:26] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-06-02 20:09:26] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:09:26] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-02 20:09:26] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14608 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24806ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24809ms
Finished structural reductions in LTL mode , in 1 iterations and 25000 ms. Remains : 99/99 places, 270/270 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (2236 resets) in 103 ms. (384 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (17 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
[2024-06-02 20:09:49] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:09:49] [INFO ] Invariant cache hit.
[2024-06-02 20:09:49] [INFO ] State equation strengthened by 37 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) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/95 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/335 variables, 95/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 35/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/339 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/342 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/343 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/343 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/343 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 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) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/95 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 240/335 variables, 95/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 35/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/339 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/342 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/343 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/343 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/343 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 289ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 270/270 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 98 transition count 266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 98 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 97 transition count 265
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 2 with 6 rules applied. Total rules applied 13 place count 94 transition count 272
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 19 place count 94 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 94 transition count 263
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 94 transition count 266
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 29 place count 92 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 92 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 91 transition count 260
Applied a total of 32 rules in 30 ms. Remains 91 /99 variables (removed 8) and now considering 260/270 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 91/99 places, 260/270 transitions.
RANDOM walk for 36134 steps (2343 resets) in 63 ms. (564 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 215 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
[2024-06-02 20:09:50] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:09:50] [INFO ] Invariant cache hit.
[2024-06-02 20:09:50] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 20:09:50] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-02 20:09:50] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:09:50] [INFO ] [Real]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-06-02 20:09:50] [INFO ] Computed and/alt/rep : 107/423/107 causal constraints (skipped 136 transitions) in 16 ms.
[2024-06-02 20:09:50] [INFO ] Added : 0 causal constraints over 0 iterations in 37 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 52 ms.
Product exploration explored 100000 steps with 0 reset in 77 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 270/270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 99 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 99 transition count 270
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 99 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 98 transition count 269
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 98 transition count 269
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 98 transition count 278
Deduced a syphon composed of 3 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 98 transition count 274
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 10 rules in 20 ms. Remains 98 /99 variables (removed 1) and now considering 274/270 (removed -4) transitions.
[2024-06-02 20:09:51] [INFO ] Redundant transitions in 1 ms returned []
Running 273 sub problems to find dead transitions.
[2024-06-02 20:09:51] [INFO ] Flow matrix only has 244 transitions (discarded 30 similar events)
// Phase 1: matrix 244 rows 98 cols
[2024-06-02 20:09:51] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:09:51] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-06-02 20:09:52] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-02 20:09:53] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
[2024-06-02 20:09:53] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 0 ms to minimize.
[2024-06-02 20:09:53] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:09:53] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 0 ms to minimize.
[2024-06-02 20:09:53] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2024-06-02 20:09:53] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-06-02 20:09:53] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 20:09:53] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:09:53] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-02 20:09:54] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:09:54] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 12/19 constraints. Problems are: Problem set: 4 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 269 unsolved
Problem TDEAD252 is UNSAT
At refinement iteration 4 (OVERLAPS) 243/341 variables, 98/117 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 39/156 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/156 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 1/342 variables, 1/157 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/157 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 9 (OVERLAPS) 0/342 variables, 0/157 constraints. Problems are: Problem set: 5 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 157 constraints, problems are : Problem set: 5 solved, 268 unsolved in 10585 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 5 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 3/97 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 12/19 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/19 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 243/340 variables, 97/116 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 39/155 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 268/423 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/423 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 1/341 variables, 1/424 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/424 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 10 (OVERLAPS) 1/342 variables, 1/425 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/425 constraints. Problems are: Problem set: 5 solved, 268 unsolved
At refinement iteration 12 (OVERLAPS) 0/342 variables, 0/425 constraints. Problems are: Problem set: 5 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 425 constraints, problems are : Problem set: 5 solved, 268 unsolved in 22176 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 268/273 constraints, Known Traps: 12/12 constraints]
After SMT, in 32962ms problems are : Problem set: 5 solved, 268 unsolved
Search for dead transitions found 5 dead transitions in 32965ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 98/99 places, 269/270 transitions.
Graph (complete) has 521 edges and 98 vertex of which 95 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 95 /98 variables (removed 3) and now considering 269/269 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/99 places, 269/270 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33018 ms. Remains : 95/99 places, 269/270 transitions.
Built C files in :
/tmp/ltsmin2727085924422176270
[2024-06-02 20:10:24] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2727085924422176270
Running compilation step : cd /tmp/ltsmin2727085924422176270;'/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 480 ms.
Running link step : cd /tmp/ltsmin2727085924422176270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2727085924422176270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9656139910212160543.hoa' '--buchi-type=spotba'
LTSmin run took 201 ms.
FORMULA FireWire-PT-01-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-01-LTLFireability-07 finished in 87689 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 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 99 transition count 273
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 99 transition count 272
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 98 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 97 transition count 269
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 97 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 96 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 96 transition count 267
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 2 with 4 rules applied. Total rules applied 12 place count 94 transition count 271
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 16 place count 94 transition count 267
Applied a total of 16 rules in 19 ms. Remains 94 /101 variables (removed 7) and now considering 267/275 (removed 8) transitions.
[2024-06-02 20:10:25] [INFO ] Flow matrix only has 237 transitions (discarded 30 similar events)
// Phase 1: matrix 237 rows 94 cols
[2024-06-02 20:10:25] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:10:25] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 20:10:25] [INFO ] Flow matrix only has 237 transitions (discarded 30 similar events)
[2024-06-02 20:10:25] [INFO ] Invariant cache hit.
[2024-06-02 20:10:25] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:10:25] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-06-02 20:10:25] [INFO ] Redundant transitions in 2 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-02 20:10:25] [INFO ] Flow matrix only has 237 transitions (discarded 30 similar events)
[2024-06-02 20:10:25] [INFO ] Invariant cache hit.
[2024-06-02 20:10:25] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 20:10:26] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:10:26] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:10:26] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:10:26] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:10:26] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:10:26] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:10:26] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:10:27] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-06-02 20:10:27] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 236/329 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 37/146 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 20:10:29] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 1/330 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/331 variables, and 148 constraints, problems are : Problem set: 0 solved, 264 unsolved in 11049 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 236/329 variables, 93/110 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 37/147 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 264/411 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 1/330 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/331 variables, and 412 constraints, problems are : Problem set: 0 solved, 264 unsolved in 13742 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 10/10 constraints]
After SMT, in 24920ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 24923ms
Starting structural reductions in SI_LTL mode, iteration 1 : 94/101 places, 267/275 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25124 ms. Remains : 94/101 places, 267/275 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 38 ms.
Product exploration explored 100000 steps with 1 reset in 44 ms.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 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 28 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2575 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (2304 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 274 steps, run visited all 1 properties in 4 ms. (steps per millisecond=68 )
Probabilistic random walk after 274 steps, saw 210 distinct states, run finished after 4 ms. (steps per millisecond=68 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 267/267 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-06-02 20:10:51] [INFO ] Flow matrix only has 237 transitions (discarded 30 similar events)
[2024-06-02 20:10:51] [INFO ] Invariant cache hit.
[2024-06-02 20:10:51] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 20:10:51] [INFO ] Flow matrix only has 237 transitions (discarded 30 similar events)
[2024-06-02 20:10:51] [INFO ] Invariant cache hit.
[2024-06-02 20:10:51] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:10:51] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-06-02 20:10:51] [INFO ] Redundant transitions in 1 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-02 20:10:51] [INFO ] Flow matrix only has 237 transitions (discarded 30 similar events)
[2024-06-02 20:10:51] [INFO ] Invariant cache hit.
[2024-06-02 20:10:51] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 20:10:52] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:10:52] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:10:52] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2024-06-02 20:10:52] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:10:52] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:10:52] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:10:52] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-02 20:10:52] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:10:52] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 236/329 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 37/146 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-06-02 20:10:55] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 1/330 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/331 variables, and 148 constraints, problems are : Problem set: 0 solved, 264 unsolved in 10886 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 236/329 variables, 93/110 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 37/147 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 264/411 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 1/330 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 0/330 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/331 variables, and 412 constraints, problems are : Problem set: 0 solved, 264 unsolved in 13820 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 10/10 constraints]
After SMT, in 24853ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 24855ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25028 ms. Remains : 94/94 places, 267/267 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2500 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (2280 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 274 steps, run visited all 1 properties in 4 ms. (steps per millisecond=68 )
Probabilistic random walk after 274 steps, saw 210 distinct states, run finished after 4 ms. (steps per millisecond=68 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 44 ms.
Product exploration explored 100000 steps with 1 reset in 43 ms.
Built C files in :
/tmp/ltsmin6340494631553014589
[2024-06-02 20:11:16] [INFO ] Computing symmetric may disable matrix : 267 transitions.
[2024-06-02 20:11:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:11:16] [INFO ] Computing symmetric may enable matrix : 267 transitions.
[2024-06-02 20:11:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:11:16] [INFO ] Computing Do-Not-Accords matrix : 267 transitions.
[2024-06-02 20:11:16] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 20:11:16] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6340494631553014589
Running compilation step : cd /tmp/ltsmin6340494631553014589;'/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 615 ms.
Running link step : cd /tmp/ltsmin6340494631553014589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6340494631553014589;'/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/stateBased277733426480250117.hoa' '--buchi-type=spotba'
LTSmin run took 452 ms.
FORMULA FireWire-PT-01-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-01-LTLFireability-08 finished in 52316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0||G(p1)))))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 99 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 99 transition count 270
Applied a total of 4 rules in 3 ms. Remains 99 /101 variables (removed 2) and now considering 270/275 (removed 5) transitions.
[2024-06-02 20:11:17] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2024-06-02 20:11:17] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 20:11:17] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:11:17] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:11:17] [INFO ] Invariant cache hit.
[2024-06-02 20:11:17] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:11:17] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 20:11:17] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:11:17] [INFO ] Invariant cache hit.
[2024-06-02 20:11:17] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 20:11:19] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:11:19] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:11:19] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:11:19] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:11:19] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:11:19] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:11:19] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2024-06-02 20:11:19] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-02 20:11:19] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2024-06-02 20:11:19] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-02 20:11:20] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 9930 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14437 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24502ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24505ms
Starting structural reductions in LTL mode, iteration 1 : 99/101 places, 270/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24695 ms. Remains : 99/101 places, 270/275 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-01-LTLFireability-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-01-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-11 finished in 24941 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)))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 99 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 99 transition count 270
Applied a total of 4 rules in 5 ms. Remains 99 /101 variables (removed 2) and now considering 270/275 (removed 5) transitions.
[2024-06-02 20:11:42] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:11:42] [INFO ] Invariant cache hit.
[2024-06-02 20:11:42] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 20:11:42] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:11:42] [INFO ] Invariant cache hit.
[2024-06-02 20:11:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:11:42] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 20:11:42] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:11:42] [INFO ] Invariant cache hit.
[2024-06-02 20:11:42] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 20:11:44] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-06-02 20:11:44] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:11:44] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:11:44] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 0 ms to minimize.
[2024-06-02 20:11:44] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:11:44] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-06-02 20:11:44] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:11:44] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-02 20:11:44] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-06-02 20:11:44] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-02 20:11:45] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14646 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 24787ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 24789ms
Starting structural reductions in LTL mode, iteration 1 : 99/101 places, 270/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24976 ms. Remains : 99/101 places, 270/275 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-01-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-13 finished in 25075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 275/275 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 99 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 99 transition count 270
Applied a total of 4 rules in 7 ms. Remains 99 /101 variables (removed 2) and now considering 270/275 (removed 5) transitions.
[2024-06-02 20:12:07] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:12:07] [INFO ] Invariant cache hit.
[2024-06-02 20:12:07] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 20:12:07] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:12:07] [INFO ] Invariant cache hit.
[2024-06-02 20:12:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:12:07] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 20:12:07] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 20:12:07] [INFO ] Invariant cache hit.
[2024-06-02 20:12:07] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 20:12:09] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 0 ms to minimize.
[2024-06-02 20:12:09] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:12:09] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-06-02 20:12:09] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:12:09] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:12:09] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:12:09] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:12:09] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:12:09] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:12:10] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-02 20:12:10] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 14864 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 25017ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 25021ms
Starting structural reductions in LTL mode, iteration 1 : 99/101 places, 270/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25203 ms. Remains : 99/101 places, 270/275 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-01-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLFireability-15 finished in 25371 ms.
All properties solved by simple procedures.
Total runtime 375826 ms.

BK_STOP 1717359153198

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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-01"
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-01, 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-171734898700172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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