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.r549-tall-171734898100228.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 greatspnxred
Input is FireWire-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898100228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 97K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-08-LTLFireability-00
FORMULA_NAME FireWire-PT-08-LTLFireability-01
FORMULA_NAME FireWire-PT-08-LTLFireability-02
FORMULA_NAME FireWire-PT-08-LTLFireability-03
FORMULA_NAME FireWire-PT-08-LTLFireability-04
FORMULA_NAME FireWire-PT-08-LTLFireability-05
FORMULA_NAME FireWire-PT-08-LTLFireability-06
FORMULA_NAME FireWire-PT-08-LTLFireability-07
FORMULA_NAME FireWire-PT-08-LTLFireability-08
FORMULA_NAME FireWire-PT-08-LTLFireability-09
FORMULA_NAME FireWire-PT-08-LTLFireability-10
FORMULA_NAME FireWire-PT-08-LTLFireability-11
FORMULA_NAME FireWire-PT-08-LTLFireability-12
FORMULA_NAME FireWire-PT-08-LTLFireability-13
FORMULA_NAME FireWire-PT-08-LTLFireability-14
FORMULA_NAME FireWire-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717366484159

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:14:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:14:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:14:45] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-06-02 22:14:45] [INFO ] Transformed 127 places.
[2024-06-02 22:14:45] [INFO ] Transformed 397 transitions.
[2024-06-02 22:14:45] [INFO ] Found NUPN structural information;
[2024-06-02 22:14:45] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 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-08-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 344/344 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 337
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 337
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 124 transition count 335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 123 transition count 333
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 333
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 123 transition count 327
Applied a total of 16 rules in 48 ms. Remains 123 /127 variables (removed 4) and now considering 327/344 (removed 17) transitions.
[2024-06-02 22:14:45] [INFO ] Flow matrix only has 301 transitions (discarded 26 similar events)
// Phase 1: matrix 301 rows 123 cols
[2024-06-02 22:14:45] [INFO ] Computed 8 invariants in 21 ms
[2024-06-02 22:14:46] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-06-02 22:14:46] [INFO ] Flow matrix only has 301 transitions (discarded 26 similar events)
[2024-06-02 22:14:46] [INFO ] Invariant cache hit.
[2024-06-02 22:14:46] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 22:14:46] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2024-06-02 22:14:46] [INFO ] Flow matrix only has 301 transitions (discarded 26 similar events)
[2024-06-02 22:14:46] [INFO ] Invariant cache hit.
[2024-06-02 22:14:46] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 326 unsolved
[2024-06-02 22:14:48] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 56 ms to minimize.
[2024-06-02 22:14:48] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:14:49] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 2 ms to minimize.
[2024-06-02 22:14:49] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 3 ms to minimize.
[2024-06-02 22:14:49] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-02 22:14:49] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-06-02 22:14:50] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:14:50] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (OVERLAPS) 300/423 variables, 123/139 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 43/182 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (OVERLAPS) 1/424 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 9 (OVERLAPS) 0/424 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 326 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 183 constraints, problems are : Problem set: 0 solved, 326 unsolved in 14994 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 4 (OVERLAPS) 300/423 variables, 123/139 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 43/182 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 326/508 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 8 (OVERLAPS) 1/424 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 509 constraints, problems are : Problem set: 0 solved, 326 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 8/8 constraints]
After SMT, in 45345ms problems are : Problem set: 0 solved, 326 unsolved
Search for dead transitions found 0 dead transitions in 45366ms
Starting structural reductions in LTL mode, iteration 1 : 123/127 places, 327/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45955 ms. Remains : 123/127 places, 327/344 transitions.
Support contains 34 out of 123 places after structural reductions.
[2024-06-02 22:15:31] [INFO ] Flatten gal took : 58 ms
[2024-06-02 22:15:31] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:15:31] [INFO ] Input system was already deterministic with 327 transitions.
Support contains 33 out of 123 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (2212 resets) in 1701 ms. (23 steps per ms) remains 12/27 properties
BEST_FIRST walk for 40003 steps (1063 resets) in 215 ms. (185 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (23 resets) in 292 ms. (136 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (579 resets) in 366 ms. (109 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1066 resets) in 327 ms. (121 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (20 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (613 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (20 resets) in 88 ms. (449 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (604 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (544 resets) in 154 ms. (258 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (80 resets) in 117 ms. (339 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 8/9 properties
[2024-06-02 22:15:33] [INFO ] Flow matrix only has 301 transitions (discarded 26 similar events)
[2024-06-02 22:15:33] [INFO ] Invariant cache hit.
[2024-06-02 22:15:33] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 99/113 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 7/120 variables, 3/8 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-02 22:15:33] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:15:33] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 2/10 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 300/420 variables, 120/130 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 43/173 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/173 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 3/423 variables, 3/176 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 0/176 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/424 variables, 1/177 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/177 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/424 variables, 0/177 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 177 constraints, problems are : Problem set: 2 solved, 6 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 99/108 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/120 variables, 4/8 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 2/10 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 300/420 variables, 120/130 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 43/173 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 6/179 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/179 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/423 variables, 3/182 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 0/182 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1/424 variables, 1/183 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 0/183 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/424 variables, 0/183 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 183 constraints, problems are : Problem set: 2 solved, 6 unsolved in 597 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 123/123 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 1065ms problems are : Problem set: 2 solved, 6 unsolved
Parikh walk visited 0 properties in 1811 ms.
Support contains 9 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 327/327 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 123 transition count 324
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 122 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 122 transition count 322
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 122 transition count 321
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 121 transition count 320
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 118 transition count 326
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 20 place count 118 transition count 320
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 23 place count 118 transition count 317
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 117 transition count 316
Applied a total of 24 rules in 80 ms. Remains 117 /123 variables (removed 6) and now considering 316/327 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 117/123 places, 316/327 transitions.
RANDOM walk for 40000 steps (2307 resets) in 522 ms. (76 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (563 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (548 resets) in 66 ms. (597 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (580 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (544 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (75 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
[2024-06-02 22:15:36] [INFO ] Flow matrix only has 288 transitions (discarded 28 similar events)
// Phase 1: matrix 288 rows 117 cols
[2024-06-02 22:15:36] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:15:36] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 96/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 279/382 variables, 103/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 44/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 19/401 variables, 10/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/402 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3/405 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/405 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/405 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 169 constraints, problems are : Problem set: 0 solved, 5 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 96/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 279/382 variables, 103/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 44/151 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 19/401 variables, 10/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/402 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 3/405 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/405 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/405 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 174 constraints, problems are : Problem set: 0 solved, 5 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 824ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 2701 ms.
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 316/316 transitions.
Applied a total of 0 rules in 12 ms. Remains 117 /117 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 117/117 places, 316/316 transitions.
RANDOM walk for 40000 steps (2264 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (635 resets) in 45 ms. (869 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (535 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (541 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (563 resets) in 53 ms. (740 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (65 resets) in 51 ms. (769 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1053790 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :3 out of 5
Probabilistic random walk after 1053790 steps, saw 235238 distinct states, run finished after 3005 ms. (steps per millisecond=350 ) properties seen :3
[2024-06-02 22:15:43] [INFO ] Flow matrix only has 288 transitions (discarded 28 similar events)
[2024-06-02 22:15:43] [INFO ] Invariant cache hit.
[2024-06-02 22:15:43] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 234/299 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 96/395 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 21/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/396 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/405 variables, 7/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/405 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/405 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/405 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 169 constraints, problems are : Problem set: 0 solved, 2 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 234/299 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 96/395 variables, 44/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 21/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/396 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/405 variables, 7/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/405 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/405 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 171 constraints, problems are : Problem set: 0 solved, 2 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 394ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 210 ms.
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 316/316 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 116 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 116 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 115 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 115 transition count 311
Applied a total of 4 rules in 17 ms. Remains 115 /117 variables (removed 2) and now considering 311/316 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 115/117 places, 311/316 transitions.
RANDOM walk for 40000 steps (2309 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (573 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (574 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1073919 steps, run timeout after 3001 ms. (steps per millisecond=357 ) properties seen :0 out of 2
Probabilistic random walk after 1073919 steps, saw 234960 distinct states, run finished after 3001 ms. (steps per millisecond=357 ) properties seen :0
[2024-06-02 22:15:47] [INFO ] Flow matrix only has 283 transitions (discarded 28 similar events)
// Phase 1: matrix 283 rows 115 cols
[2024-06-02 22:15:47] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:15:47] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 230/295 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 93/388 variables, 42/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/389 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/398 variables, 7/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/398 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/398 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 166 constraints, problems are : Problem set: 0 solved, 2 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 62/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 230/295 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 23/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 93/388 variables, 42/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/389 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/389 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/398 variables, 7/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/398 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/398 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/398 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 168 constraints, problems are : Problem set: 0 solved, 2 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 381ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 109 ms.
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 311/311 transitions.
Applied a total of 0 rules in 7 ms. Remains 115 /115 variables (removed 0) and now considering 311/311 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 115/115 places, 311/311 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 311/311 transitions.
Applied a total of 0 rules in 7 ms. Remains 115 /115 variables (removed 0) and now considering 311/311 (removed 0) transitions.
[2024-06-02 22:15:47] [INFO ] Flow matrix only has 283 transitions (discarded 28 similar events)
[2024-06-02 22:15:47] [INFO ] Invariant cache hit.
[2024-06-02 22:15:47] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 22:15:47] [INFO ] Flow matrix only has 283 transitions (discarded 28 similar events)
[2024-06-02 22:15:47] [INFO ] Invariant cache hit.
[2024-06-02 22:15:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 22:15:47] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-06-02 22:15:47] [INFO ] Redundant transitions in 22 ms returned []
Running 309 sub problems to find dead transitions.
[2024-06-02 22:15:47] [INFO ] Flow matrix only has 283 transitions (discarded 28 similar events)
[2024-06-02 22:15:47] [INFO ] Invariant cache hit.
[2024-06-02 22:15:47] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 22:15:48] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:15:48] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2024-06-02 22:15:49] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:15:49] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:15:49] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:15:49] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:15:49] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:15:49] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:15:49] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:15:49] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:15:50] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:15:50] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 283/397 variables, 114/134 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 43/177 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 22:15:53] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 22:15:54] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 1/398 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 10 (OVERLAPS) 0/398 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 180 constraints, problems are : Problem set: 0 solved, 309 unsolved in 16056 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 283/397 variables, 114/136 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 43/179 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 309/488 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 1/398 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 22:16:12] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 10 (OVERLAPS) 0/398 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 490 constraints, problems are : Problem set: 0 solved, 309 unsolved in 23383 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 15/15 constraints]
After SMT, in 39643ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 39647ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39957 ms. Remains : 115/115 places, 311/311 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 112 edges and 115 vertex of which 31 / 115 are part of one of the 5 SCC in 2 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 122 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 129 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 88 transition count 179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 87 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 87 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 86 transition count 176
Free-agglomeration rule applied 2 times with reduction of 1 identical transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 86 transition count 173
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 84 transition count 172
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 84 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 84 transition count 171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 83 transition count 170
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 83 transition count 170
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 83 transition count 170
Applied a total of 20 rules in 40 ms. Remains 83 /115 variables (removed 32) and now considering 170/311 (removed 141) transitions.
Running SMT prover for 2 properties.
[2024-06-02 22:16:27] [INFO ] Flow matrix only has 168 transitions (discarded 2 similar events)
// Phase 1: matrix 168 rows 83 cols
[2024-06-02 22:16:27] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:16:27] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:16:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:16:27] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 22:16:27] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-06-02 22:16:27] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-02 22:16:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
TRAPS : Iteration 1
[2024-06-02 22:16:27] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 22:16:27] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 297 ms.
FORMULA FireWire-PT-08-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA FireWire-PT-08-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 23 stabilizing places and 48 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' '!(F((p0||(X(F(p1))&&(p2 U p3)))))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 121 transition count 322
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 121 transition count 322
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 119 transition count 317
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 118 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 117 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 116 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 115 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 114 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 112 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 112 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 111 transition count 297
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 110 transition count 295
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 109 transition count 293
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 108 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 108 transition count 291
Applied a total of 30 rules in 18 ms. Remains 108 /123 variables (removed 15) and now considering 291/327 (removed 36) transitions.
[2024-06-02 22:16:28] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
// Phase 1: matrix 265 rows 108 cols
[2024-06-02 22:16:28] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:16:28] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 22:16:28] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2024-06-02 22:16:28] [INFO ] Invariant cache hit.
[2024-06-02 22:16:28] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:16:28] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2024-06-02 22:16:28] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2024-06-02 22:16:28] [INFO ] Invariant cache hit.
[2024-06-02 22:16:28] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 22:16:29] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:16:29] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:16:30] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:16:30] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-02 22:16:30] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:16:30] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 264/372 variables, 108/122 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 37/159 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 1/373 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2024-06-02 22:16:36] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 161 constraints, problems are : Problem set: 0 solved, 290 unsolved in 12233 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 264/372 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 290/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 451 constraints, problems are : Problem set: 0 solved, 290 unsolved in 22686 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 7/7 constraints]
After SMT, in 35062ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 35066ms
Starting structural reductions in LTL mode, iteration 1 : 108/123 places, 291/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35295 ms. Remains : 108/123 places, 291/327 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : FireWire-PT-08-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-08-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLFireability-00 finished in 35628 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 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 319
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 119 transition count 318
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 117 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 106 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 105 transition count 286
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 102 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 102 transition count 286
Applied a total of 47 rules in 48 ms. Remains 102 /123 variables (removed 21) and now considering 286/327 (removed 41) transitions.
[2024-06-02 22:17:03] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
// Phase 1: matrix 253 rows 102 cols
[2024-06-02 22:17:03] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:17:03] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 22:17:03] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 22:17:03] [INFO ] Invariant cache hit.
[2024-06-02 22:17:03] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:17:04] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-06-02 22:17:04] [INFO ] Redundant transitions in 4 ms returned []
Running 283 sub problems to find dead transitions.
[2024-06-02 22:17:04] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 22:17:04] [INFO ] Invariant cache hit.
[2024-06-02 22:17:04] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 22:17:04] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:17:04] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:17:05] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:17:05] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:17:05] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:17:05] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-06-02 22:17:05] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 22:17:06] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:17:06] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:17:06] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:17:06] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 0 ms to minimize.
[2024-06-02 22:17:06] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:17:06] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:17:06] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:17:06] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 252/353 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/355 variables, and 163 constraints, problems are : Problem set: 0 solved, 283 unsolved in 11678 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 283/445 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/355 variables, and 446 constraints, problems are : Problem set: 0 solved, 283 unsolved in 15891 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints]
After SMT, in 27713ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 27716ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/123 places, 286/327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27970 ms. Remains : 102/123 places, 286/327 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-01
Product exploration explored 100000 steps with 2 reset in 139 ms.
Product exploration explored 100000 steps with 0 reset in 84 ms.
Computed a total of 8 stabilizing places and 15 stable transitions
Computed a total of 8 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 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 41 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2333 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (19 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1798 steps, run visited all 1 properties in 15 ms. (steps per millisecond=119 )
Probabilistic random walk after 1798 steps, saw 935 distinct states, run finished after 19 ms. (steps per millisecond=94 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 286/286 transitions.
Applied a total of 0 rules in 11 ms. Remains 102 /102 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2024-06-02 22:17:32] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 22:17:32] [INFO ] Invariant cache hit.
[2024-06-02 22:17:32] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 22:17:32] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 22:17:32] [INFO ] Invariant cache hit.
[2024-06-02 22:17:32] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:17:32] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-06-02 22:17:32] [INFO ] Redundant transitions in 2 ms returned []
Running 283 sub problems to find dead transitions.
[2024-06-02 22:17:32] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 22:17:32] [INFO ] Invariant cache hit.
[2024-06-02 22:17:32] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 22:17:33] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:17:33] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:17:33] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:17:33] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:17:33] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:17:34] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:17:34] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 22:17:34] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:17:34] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:17:34] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:17:35] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:17:35] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:17:35] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:17:35] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:17:35] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 252/353 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/355 variables, and 163 constraints, problems are : Problem set: 0 solved, 283 unsolved in 11528 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 283/445 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/355 variables, and 446 constraints, problems are : Problem set: 0 solved, 283 unsolved in 16095 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints]
After SMT, in 27816ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 27821ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28035 ms. Remains : 102/102 places, 286/286 transitions.
Computed a total of 8 stabilizing places and 15 stable transitions
Computed a total of 8 stabilizing places and 15 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 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2334 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (16 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1798 steps, run visited all 1 properties in 6 ms. (steps per millisecond=299 )
Probabilistic random walk after 1798 steps, saw 935 distinct states, run finished after 6 ms. (steps per millisecond=299 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 140 ms.
Product exploration explored 100000 steps with 0 reset in 95 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 286/286 transitions.
Applied a total of 0 rules in 14 ms. Remains 102 /102 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2024-06-02 22:18:01] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 22:18:01] [INFO ] Invariant cache hit.
[2024-06-02 22:18:01] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 22:18:01] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 22:18:01] [INFO ] Invariant cache hit.
[2024-06-02 22:18:01] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:18:01] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-06-02 22:18:01] [INFO ] Redundant transitions in 1 ms returned []
Running 283 sub problems to find dead transitions.
[2024-06-02 22:18:01] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 22:18:01] [INFO ] Invariant cache hit.
[2024-06-02 22:18:01] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 22:18:02] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:18:02] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-06-02 22:18:02] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:18:02] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:18:02] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2024-06-02 22:18:02] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:18:03] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 22:18:03] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2024-06-02 22:18:03] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:18:03] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:18:03] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:18:04] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:18:04] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:18:04] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:18:04] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 252/353 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/355 variables, and 163 constraints, problems are : Problem set: 0 solved, 283 unsolved in 11698 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 283/445 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/355 variables, and 446 constraints, problems are : Problem set: 0 solved, 283 unsolved in 15813 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints]
After SMT, in 27656ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 27659ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27883 ms. Remains : 102/102 places, 286/286 transitions.
Treatment of property FireWire-PT-08-LTLFireability-01 finished in 85347 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)&&(!p1 U (p2||G(!p1)))))'
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 319
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 119 transition count 318
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 117 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 114 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 113 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 110 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 110 transition count 305
Applied a total of 31 rules in 28 ms. Remains 110 /123 variables (removed 13) and now considering 305/327 (removed 22) transitions.
[2024-06-02 22:18:29] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
// Phase 1: matrix 272 rows 110 cols
[2024-06-02 22:18:29] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:18:29] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 22:18:29] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 22:18:29] [INFO ] Invariant cache hit.
[2024-06-02 22:18:29] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 22:18:29] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-06-02 22:18:29] [INFO ] Redundant transitions in 1 ms returned []
Running 302 sub problems to find dead transitions.
[2024-06-02 22:18:29] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 22:18:29] [INFO ] Invariant cache hit.
[2024-06-02 22:18:29] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 22:18:30] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:18:30] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 1 ms to minimize.
[2024-06-02 22:18:30] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:18:30] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:18:30] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:18:30] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 0 ms to minimize.
[2024-06-02 22:18:31] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2024-06-02 22:18:31] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:18:31] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 271/380 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 41/167 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 1/381 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 22:18:39] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:18:40] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:18:40] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/381 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (OVERLAPS) 0/381 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/382 variables, and 171 constraints, problems are : Problem set: 0 solved, 302 unsolved in 16759 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 271/380 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 41/170 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 302/472 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 1/381 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 0/381 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/382 variables, and 473 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20793 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 12/12 constraints]
After SMT, in 37717ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 37721ms
Starting structural reductions in SI_LTL mode, iteration 1 : 110/123 places, 305/327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37959 ms. Remains : 110/123 places, 305/327 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : FireWire-PT-08-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 148 ms.
Product exploration explored 100000 steps with 5 reset in 133 ms.
Computed a total of 16 stabilizing places and 34 stable transitions
Computed a total of 16 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT p1)), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 128 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (2264 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (572 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1935857 steps, run timeout after 3001 ms. (steps per millisecond=645 ) properties seen :0 out of 1
Probabilistic random walk after 1935857 steps, saw 378676 distinct states, run finished after 3001 ms. (steps per millisecond=645 ) properties seen :0
[2024-06-02 22:19:10] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 22:19:10] [INFO ] Invariant cache hit.
[2024-06-02 22:19:10] [INFO ] State equation strengthened by 41 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) 58/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 218/278 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/371 variables, 42/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/372 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/381 variables, 7/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/381 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/381 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/381 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/382 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 41/41 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) 58/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 218/278 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/371 variables, 42/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/372 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/381 variables, 7/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/381 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/381 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/381 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/382 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 292ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 305/305 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 110 transition count 299
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 110 transition count 301
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 109 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 109 transition count 297
Applied a total of 12 rules in 23 ms. Remains 109 /110 variables (removed 1) and now considering 297/305 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 109/110 places, 297/305 transitions.
RANDOM walk for 40000 steps (2340 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (589 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1850218 steps, run timeout after 3001 ms. (steps per millisecond=616 ) properties seen :0 out of 1
Probabilistic random walk after 1850218 steps, saw 390579 distinct states, run finished after 3001 ms. (steps per millisecond=616 ) properties seen :0
[2024-06-02 22:19:14] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
// Phase 1: matrix 268 rows 109 cols
[2024-06-02 22:19:14] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:19:14] [INFO ] State equation strengthened by 41 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) 57/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 215/274 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 21/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/367 variables, 42/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/368 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/377 variables, 7/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/377 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/377 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 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) 57/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 215/274 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 21/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/367 variables, 42/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/368 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/377 variables, 7/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/377 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/377 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/377 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 300ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 109/109 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-02 22:19:14] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 22:19:14] [INFO ] Invariant cache hit.
[2024-06-02 22:19:14] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 22:19:14] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 22:19:14] [INFO ] Invariant cache hit.
[2024-06-02 22:19:14] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 22:19:14] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-06-02 22:19:14] [INFO ] Redundant transitions in 1 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 22:19:14] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 22:19:14] [INFO ] Invariant cache hit.
[2024-06-02 22:19:14] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 22:19:15] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:19:15] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-02 22:19:15] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:19:15] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:19:16] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-06-02 22:19:16] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2024-06-02 22:19:16] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:19:16] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:19:16] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-02 22:19:16] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 268/376 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 41/167 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 22:19:19] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:19:19] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/377 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/377 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 170 constraints, problems are : Problem set: 0 solved, 295 unsolved in 13781 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 268/376 variables, 108/128 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 41/169 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 295/464 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/377 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/377 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 465 constraints, problems are : Problem set: 0 solved, 295 unsolved in 20646 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 12/12 constraints]
After SMT, in 34611ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 34614ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34899 ms. Remains : 109/109 places, 297/297 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 110 edges and 109 vertex of which 29 / 109 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 83 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 83 transition count 167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 82 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 82 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 81 transition count 164
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 81 transition count 159
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 78 transition count 158
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 78 transition count 158
Applied a total of 20 rules in 25 ms. Remains 78 /109 variables (removed 31) and now considering 158/297 (removed 139) transitions.
Running SMT prover for 1 properties.
[2024-06-02 22:19:49] [INFO ] Flow matrix only has 156 transitions (discarded 2 similar events)
// Phase 1: matrix 156 rows 78 cols
[2024-06-02 22:19:49] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:19:49] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:19:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:19:49] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:19:49] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:19:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
TRAPS : Iteration 1
[2024-06-02 22:19:49] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:19:49] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 214 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT p1)), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Support contains 2 out of 110 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 305/305 transitions.
Applied a total of 0 rules in 8 ms. Remains 110 /110 variables (removed 0) and now considering 305/305 (removed 0) transitions.
[2024-06-02 22:19:49] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
// Phase 1: matrix 272 rows 110 cols
[2024-06-02 22:19:49] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:19:49] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 22:19:49] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 22:19:49] [INFO ] Invariant cache hit.
[2024-06-02 22:19:49] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 22:19:50] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-06-02 22:19:50] [INFO ] Redundant transitions in 1 ms returned []
Running 302 sub problems to find dead transitions.
[2024-06-02 22:19:50] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 22:19:50] [INFO ] Invariant cache hit.
[2024-06-02 22:19:50] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 22:19:51] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:19:51] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:19:51] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:19:51] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:19:51] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2024-06-02 22:19:51] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:19:51] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:19:51] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-06-02 22:19:52] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 271/380 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 41/167 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 1/381 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 22:20:00] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-06-02 22:20:01] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:20:01] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/381 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (OVERLAPS) 0/381 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/382 variables, and 171 constraints, problems are : Problem set: 0 solved, 302 unsolved in 16960 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 271/380 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 41/170 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 302/472 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 1/381 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 0/381 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/382 variables, and 473 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20741 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 12/12 constraints]
After SMT, in 37943ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 37948ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38236 ms. Remains : 110/110 places, 305/305 transitions.
Computed a total of 16 stabilizing places and 34 stable transitions
Computed a total of 16 stabilizing places and 34 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (2333 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (577 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1935708 steps, run timeout after 3001 ms. (steps per millisecond=645 ) properties seen :0 out of 1
Probabilistic random walk after 1935708 steps, saw 378635 distinct states, run finished after 3001 ms. (steps per millisecond=645 ) properties seen :0
[2024-06-02 22:20:31] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 22:20:31] [INFO ] Invariant cache hit.
[2024-06-02 22:20:31] [INFO ] State equation strengthened by 41 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) 58/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 218/278 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/371 variables, 42/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/372 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/381 variables, 7/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/381 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/381 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/381 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/382 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 41/41 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) 58/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 218/278 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/371 variables, 42/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/372 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/381 variables, 7/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/381 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/381 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/381 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/382 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 305/305 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 110 transition count 299
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 110 transition count 301
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 109 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 109 transition count 297
Applied a total of 12 rules in 13 ms. Remains 109 /110 variables (removed 1) and now considering 297/305 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 109/110 places, 297/305 transitions.
RANDOM walk for 40000 steps (2292 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (571 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1864931 steps, run timeout after 3001 ms. (steps per millisecond=621 ) properties seen :0 out of 1
Probabilistic random walk after 1864931 steps, saw 393172 distinct states, run finished after 3001 ms. (steps per millisecond=621 ) properties seen :0
[2024-06-02 22:20:34] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
// Phase 1: matrix 268 rows 109 cols
[2024-06-02 22:20:34] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:20:34] [INFO ] State equation strengthened by 41 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) 57/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 215/274 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 21/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/367 variables, 42/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/368 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/377 variables, 7/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/377 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/377 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 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) 57/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 215/274 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 21/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/367 variables, 42/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/368 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/377 variables, 7/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/377 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/377 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/377 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 271ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 109/109 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-02 22:20:34] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 22:20:34] [INFO ] Invariant cache hit.
[2024-06-02 22:20:34] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 22:20:34] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 22:20:34] [INFO ] Invariant cache hit.
[2024-06-02 22:20:35] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 22:20:35] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-06-02 22:20:35] [INFO ] Redundant transitions in 2 ms returned []
Running 295 sub problems to find dead transitions.
[2024-06-02 22:20:35] [INFO ] Flow matrix only has 268 transitions (discarded 29 similar events)
[2024-06-02 22:20:35] [INFO ] Invariant cache hit.
[2024-06-02 22:20:35] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 22:20:36] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:20:36] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:20:36] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:20:36] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:20:36] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:20:36] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:20:36] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:20:36] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:20:37] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-02 22:20:37] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 268/376 variables, 108/126 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 41/167 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-06-02 22:20:39] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:20:40] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/377 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/377 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 170 constraints, problems are : Problem set: 0 solved, 295 unsolved in 13424 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 3 (OVERLAPS) 268/376 variables, 108/128 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 41/169 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 295/464 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 7 (OVERLAPS) 1/377 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 9 (OVERLAPS) 0/377 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 295 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 465 constraints, problems are : Problem set: 0 solved, 295 unsolved in 20415 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 12/12 constraints]
After SMT, in 34029ms problems are : Problem set: 0 solved, 295 unsolved
Search for dead transitions found 0 dead transitions in 34032ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34269 ms. Remains : 109/109 places, 297/297 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 110 edges and 109 vertex of which 29 / 109 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 83 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 83 transition count 167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 82 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 82 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 81 transition count 164
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 81 transition count 159
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 78 transition count 158
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 78 transition count 158
Applied a total of 20 rules in 23 ms. Remains 78 /109 variables (removed 31) and now considering 158/297 (removed 139) transitions.
Running SMT prover for 1 properties.
[2024-06-02 22:21:09] [INFO ] Flow matrix only has 156 transitions (discarded 2 similar events)
// Phase 1: matrix 156 rows 78 cols
[2024-06-02 22:21:09] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:21:09] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:21:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:21:09] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:21:09] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-02 22:21:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
TRAPS : Iteration 1
[2024-06-02 22:21:09] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:21:09] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 250 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 47 ms.
Product exploration explored 100000 steps with 1 reset in 49 ms.
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 305/305 transitions.
Applied a total of 0 rules in 12 ms. Remains 110 /110 variables (removed 0) and now considering 305/305 (removed 0) transitions.
[2024-06-02 22:21:09] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
// Phase 1: matrix 272 rows 110 cols
[2024-06-02 22:21:09] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:21:09] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 22:21:09] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 22:21:09] [INFO ] Invariant cache hit.
[2024-06-02 22:21:09] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 22:21:10] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-06-02 22:21:10] [INFO ] Redundant transitions in 2 ms returned []
Running 302 sub problems to find dead transitions.
[2024-06-02 22:21:10] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2024-06-02 22:21:10] [INFO ] Invariant cache hit.
[2024-06-02 22:21:10] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 22:21:10] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:21:11] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:21:11] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:21:11] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:21:11] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:21:11] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:21:11] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:21:11] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-06-02 22:21:11] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 271/380 variables, 109/126 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 41/167 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 1/381 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-06-02 22:21:20] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:21:20] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:21:20] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/381 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (OVERLAPS) 0/381 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/382 variables, and 171 constraints, problems are : Problem set: 0 solved, 302 unsolved in 16184 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 271/380 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 41/170 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 302/472 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 1/381 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 0/381 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/382 variables, and 473 constraints, problems are : Problem set: 0 solved, 302 unsolved in 20736 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 12/12 constraints]
After SMT, in 37101ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 37104ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37340 ms. Remains : 110/110 places, 305/305 transitions.
Treatment of property FireWire-PT-08-LTLFireability-02 finished in 198023 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 U G(p1))&&G(F(p2)))))'
Support contains 3 out of 123 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 321
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 120 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 119 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 119 transition count 318
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 118 transition count 317
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 115 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 115 transition count 317
Applied a total of 21 rules in 17 ms. Remains 115 /123 variables (removed 8) and now considering 317/327 (removed 10) transitions.
[2024-06-02 22:21:47] [INFO ] Flow matrix only has 284 transitions (discarded 33 similar events)
// Phase 1: matrix 284 rows 115 cols
[2024-06-02 22:21:47] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:21:47] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 22:21:47] [INFO ] Flow matrix only has 284 transitions (discarded 33 similar events)
[2024-06-02 22:21:47] [INFO ] Invariant cache hit.
[2024-06-02 22:21:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 22:21:47] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-06-02 22:21:47] [INFO ] Redundant transitions in 2 ms returned []
Running 314 sub problems to find dead transitions.
[2024-06-02 22:21:47] [INFO ] Flow matrix only has 284 transitions (discarded 33 similar events)
[2024-06-02 22:21:47] [INFO ] Invariant cache hit.
[2024-06-02 22:21:47] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-06-02 22:21:48] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:21:48] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2024-06-02 22:21:48] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:21:48] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:21:48] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-02 22:21:48] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2024-06-02 22:21:49] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:21:49] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:21:49] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:21:49] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-06-02 22:21:50] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 283/397 variables, 114/133 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 43/176 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-06-02 22:21:52] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 8 (OVERLAPS) 1/398 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-06-02 22:21:58] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:21:58] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 11 (OVERLAPS) 0/398 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/399 variables, and 180 constraints, problems are : Problem set: 0 solved, 314 unsolved in 17736 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 283/397 variables, 114/136 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 43/179 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 314/493 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (OVERLAPS) 1/398 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/399 variables, and 494 constraints, problems are : Problem set: 0 solved, 314 unsolved in 25140 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 14/14 constraints]
After SMT, in 43069ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 43073ms
Starting structural reductions in SI_LTL mode, iteration 1 : 115/123 places, 317/327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43317 ms. Remains : 115/123 places, 317/327 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLFireability-06 finished in 43448 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 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 319
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 319
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 119 transition count 318
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 117 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 106 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 105 transition count 286
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 102 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 102 transition count 286
Applied a total of 47 rules in 26 ms. Remains 102 /123 variables (removed 21) and now considering 286/327 (removed 41) transitions.
[2024-06-02 22:22:30] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
// Phase 1: matrix 253 rows 102 cols
[2024-06-02 22:22:30] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:22:30] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 22:22:30] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 22:22:30] [INFO ] Invariant cache hit.
[2024-06-02 22:22:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:22:30] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-06-02 22:22:30] [INFO ] Redundant transitions in 2 ms returned []
Running 283 sub problems to find dead transitions.
[2024-06-02 22:22:30] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 22:22:30] [INFO ] Invariant cache hit.
[2024-06-02 22:22:30] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 22:22:31] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:22:31] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:22:31] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:22:31] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:22:32] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:22:32] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:22:32] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 22:22:32] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:22:32] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:22:32] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:22:33] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:22:33] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:22:33] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:22:33] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:22:33] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 252/353 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/355 variables, and 163 constraints, problems are : Problem set: 0 solved, 283 unsolved in 11605 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 283/445 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/355 variables, and 446 constraints, problems are : Problem set: 0 solved, 283 unsolved in 15911 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints]
After SMT, in 27713ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 27718ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/123 places, 286/327 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27974 ms. Remains : 102/123 places, 286/327 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 43 ms.
Product exploration explored 100000 steps with 1 reset in 47 ms.
Computed a total of 8 stabilizing places and 15 stable transitions
Computed a total of 8 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 19422 steps (1153 resets) in 34 ms. (554 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 286/286 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2024-06-02 22:22:59] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 22:22:59] [INFO ] Invariant cache hit.
[2024-06-02 22:22:59] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 22:22:59] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 22:22:59] [INFO ] Invariant cache hit.
[2024-06-02 22:22:59] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:22:59] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-06-02 22:22:59] [INFO ] Redundant transitions in 1 ms returned []
Running 283 sub problems to find dead transitions.
[2024-06-02 22:22:59] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 22:22:59] [INFO ] Invariant cache hit.
[2024-06-02 22:22:59] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 22:23:00] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:23:00] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:23:00] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:23:00] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:23:00] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:23:01] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-06-02 22:23:01] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 22:23:01] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:23:01] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:23:01] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:23:02] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:23:02] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:23:02] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2024-06-02 22:23:02] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-06-02 22:23:02] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 252/353 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/355 variables, and 163 constraints, problems are : Problem set: 0 solved, 283 unsolved in 11565 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 283/445 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/355 variables, and 446 constraints, problems are : Problem set: 0 solved, 283 unsolved in 15620 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints]
After SMT, in 27359ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 27363ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27606 ms. Remains : 102/102 places, 286/286 transitions.
Computed a total of 8 stabilizing places and 15 stable transitions
Computed a total of 8 stabilizing places and 15 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 18371 steps (1054 resets) in 38 ms. (471 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 41 ms.
Product exploration explored 100000 steps with 0 reset in 83 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 286/286 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2024-06-02 22:23:27] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 22:23:27] [INFO ] Invariant cache hit.
[2024-06-02 22:23:27] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-02 22:23:27] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 22:23:27] [INFO ] Invariant cache hit.
[2024-06-02 22:23:27] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:23:27] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2024-06-02 22:23:27] [INFO ] Redundant transitions in 1 ms returned []
Running 283 sub problems to find dead transitions.
[2024-06-02 22:23:27] [INFO ] Flow matrix only has 253 transitions (discarded 33 similar events)
[2024-06-02 22:23:27] [INFO ] Invariant cache hit.
[2024-06-02 22:23:27] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 22:23:28] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 1 ms to minimize.
[2024-06-02 22:23:29] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2024-06-02 22:23:29] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:23:29] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:23:29] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:23:29] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-06-02 22:23:29] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-06-02 22:23:30] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:23:30] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:23:30] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:23:30] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 0 ms to minimize.
[2024-06-02 22:23:30] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:23:30] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:23:30] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:23:31] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 252/353 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/355 variables, and 163 constraints, problems are : Problem set: 0 solved, 283 unsolved in 11561 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 252/353 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 38/162 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 283/445 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/354 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 9 (OVERLAPS) 0/354 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/355 variables, and 446 constraints, problems are : Problem set: 0 solved, 283 unsolved in 15610 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 15/15 constraints]
After SMT, in 27334ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 27336ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27839 ms. Remains : 102/102 places, 286/286 transitions.
Treatment of property FireWire-PT-08-LTLFireability-07 finished in 84768 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||(G(p0) U p1)))||X((p2 U p3))))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 320
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 120 transition count 319
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 118 transition count 314
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 299
Applied a total of 23 rules in 12 ms. Remains 112 /123 variables (removed 11) and now considering 299/327 (removed 28) transitions.
[2024-06-02 22:23:55] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
// Phase 1: matrix 273 rows 112 cols
[2024-06-02 22:23:55] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:23:55] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 22:23:55] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2024-06-02 22:23:55] [INFO ] Invariant cache hit.
[2024-06-02 22:23:55] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:23:55] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2024-06-02 22:23:55] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2024-06-02 22:23:55] [INFO ] Invariant cache hit.
[2024-06-02 22:23:55] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-02 22:23:57] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:23:57] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:23:57] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-06-02 22:23:57] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:23:57] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 0 ms to minimize.
[2024-06-02 22:23:57] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:23:58] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:23:58] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 4 ms to minimize.
[2024-06-02 22:23:58] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 272/384 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 38/167 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-02 22:24:00] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (OVERLAPS) 1/385 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 10 (OVERLAPS) 0/385 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 169 constraints, problems are : Problem set: 0 solved, 298 unsolved in 10906 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 272/384 variables, 112/130 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 38/168 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 298/466 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (OVERLAPS) 1/385 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 10 (OVERLAPS) 0/385 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 467 constraints, problems are : Problem set: 0 solved, 298 unsolved in 25768 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 10/10 constraints]
After SMT, in 36829ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 36833ms
Starting structural reductions in LTL mode, iteration 1 : 112/123 places, 299/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37190 ms. Remains : 112/123 places, 299/327 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-08-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLFireability-11 finished in 37402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(!p1) U G(p2))))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 320
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 120 transition count 319
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 118 transition count 314
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 299
Applied a total of 23 rules in 8 ms. Remains 112 /123 variables (removed 11) and now considering 299/327 (removed 28) transitions.
[2024-06-02 22:24:32] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2024-06-02 22:24:32] [INFO ] Invariant cache hit.
[2024-06-02 22:24:32] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 22:24:32] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2024-06-02 22:24:32] [INFO ] Invariant cache hit.
[2024-06-02 22:24:32] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:24:33] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 298 sub problems to find dead transitions.
[2024-06-02 22:24:33] [INFO ] Flow matrix only has 273 transitions (discarded 26 similar events)
[2024-06-02 22:24:33] [INFO ] Invariant cache hit.
[2024-06-02 22:24:33] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-02 22:24:34] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-06-02 22:24:34] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:24:34] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:24:34] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:24:34] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-06-02 22:24:35] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:24:35] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-06-02 22:24:35] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:24:35] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 272/384 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 38/167 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-02 22:24:37] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (OVERLAPS) 1/385 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 10 (OVERLAPS) 0/385 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 169 constraints, problems are : Problem set: 0 solved, 298 unsolved in 10866 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 272/384 variables, 112/130 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 38/168 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 298/466 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (OVERLAPS) 1/385 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 10 (OVERLAPS) 0/385 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Int declared 385/385 variables, and 467 constraints, problems are : Problem set: 0 solved, 298 unsolved in 26581 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 10/10 constraints]
After SMT, in 37590ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 37593ms
Starting structural reductions in LTL mode, iteration 1 : 112/123 places, 299/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37820 ms. Remains : 112/123 places, 299/327 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p2)), true, (NOT p0), (AND p2 p1), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLFireability-12 finished in 38095 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(p0)||G(p1))))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 121 transition count 323
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 121 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 121 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 120 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 120 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 109 transition count 293
Applied a total of 29 rules in 20 ms. Remains 109 /123 variables (removed 14) and now considering 293/327 (removed 34) transitions.
[2024-06-02 22:25:10] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
// Phase 1: matrix 267 rows 109 cols
[2024-06-02 22:25:10] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 22:25:10] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 22:25:10] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2024-06-02 22:25:10] [INFO ] Invariant cache hit.
[2024-06-02 22:25:11] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-06-02 22:25:11] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2024-06-02 22:25:11] [INFO ] Flow matrix only has 267 transitions (discarded 26 similar events)
[2024-06-02 22:25:11] [INFO ] Invariant cache hit.
[2024-06-02 22:25:11] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-02 22:25:12] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:25:12] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:25:12] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:25:12] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:25:13] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2024-06-02 22:25:13] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:25:13] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-02 22:25:13] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:25:13] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:25:13] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-02 22:25:14] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 266/375 variables, 109/128 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 38/166 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/376 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (OVERLAPS) 0/376 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 167 constraints, problems are : Problem set: 0 solved, 292 unsolved in 9515 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-02 22:25:21] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 266/375 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 38/167 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 292/459 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (OVERLAPS) 1/376 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 460 constraints, problems are : Problem set: 0 solved, 292 unsolved in 24723 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 12/12 constraints]
After SMT, in 34429ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 34433ms
Starting structural reductions in LTL mode, iteration 1 : 109/123 places, 293/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34686 ms. Remains : 109/123 places, 293/327 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 221 ms.
Product exploration explored 100000 steps with 33333 reset in 208 ms.
Computed a total of 10 stabilizing places and 17 stable transitions
Computed a total of 10 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 24 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-08-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-08-LTLFireability-13 finished in 35370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X((F(p2)&&p1)))))'
Support contains 8 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 327/327 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 320
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 120 transition count 319
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 118 transition count 314
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 107 transition count 288
Applied a total of 33 rules in 11 ms. Remains 107 /123 variables (removed 16) and now considering 288/327 (removed 39) transitions.
[2024-06-02 22:25:46] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
// Phase 1: matrix 262 rows 107 cols
[2024-06-02 22:25:46] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:25:46] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-06-02 22:25:46] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2024-06-02 22:25:46] [INFO ] Invariant cache hit.
[2024-06-02 22:25:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 22:25:46] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2024-06-02 22:25:46] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2024-06-02 22:25:46] [INFO ] Invariant cache hit.
[2024-06-02 22:25:46] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-02 22:25:48] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:25:48] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2024-06-02 22:25:48] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-02 22:25:48] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-02 22:25:49] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:25:49] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-06-02 22:25:53] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:25:54] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 161 constraints, problems are : Problem set: 0 solved, 287 unsolved in 11151 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/123 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 287/447 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 10 (OVERLAPS) 0/369 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 448 constraints, problems are : Problem set: 0 solved, 287 unsolved in 19079 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 8/8 constraints]
After SMT, in 30399ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 30402ms
Starting structural reductions in LTL mode, iteration 1 : 107/123 places, 288/327 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31048 ms. Remains : 107/123 places, 288/327 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FireWire-PT-08-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-08-LTLFireability-15 finished in 31232 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)))'
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)&&(!p1 U (p2||G(!p1)))))'
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)))'
[2024-06-02 22:26:17] [INFO ] Flatten gal took : 39 ms
[2024-06-02 22:26:17] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-02 22:26:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 123 places, 327 transitions and 1205 arcs took 4 ms.
Total runtime 692600 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 123
TRANSITIONS: 327
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.003s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2046
MODEL NAME: /home/mcc/execution/413/model
123 places, 327 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-08-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717367186547

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FireWire-PT-08, 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 r549-tall-171734898100228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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