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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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 125K 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-12-LTLFireability-00
FORMULA_NAME FireWire-PT-12-LTLFireability-01
FORMULA_NAME FireWire-PT-12-LTLFireability-02
FORMULA_NAME FireWire-PT-12-LTLFireability-03
FORMULA_NAME FireWire-PT-12-LTLFireability-04
FORMULA_NAME FireWire-PT-12-LTLFireability-05
FORMULA_NAME FireWire-PT-12-LTLFireability-06
FORMULA_NAME FireWire-PT-12-LTLFireability-07
FORMULA_NAME FireWire-PT-12-LTLFireability-08
FORMULA_NAME FireWire-PT-12-LTLFireability-09
FORMULA_NAME FireWire-PT-12-LTLFireability-10
FORMULA_NAME FireWire-PT-12-LTLFireability-11
FORMULA_NAME FireWire-PT-12-LTLFireability-12
FORMULA_NAME FireWire-PT-12-LTLFireability-13
FORMULA_NAME FireWire-PT-12-LTLFireability-14
FORMULA_NAME FireWire-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368495169

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-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:48:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 22:48:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:48:16] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-06-02 22:48:16] [INFO ] Transformed 169 places.
[2024-06-02 22:48:16] [INFO ] Transformed 508 transitions.
[2024-06-02 22:48:16] [INFO ] Found NUPN structural information;
[2024-06-02 22:48:16] [INFO ] Parsed PT model containing 169 places and 508 transitions and 1889 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 68 transitions
Reduce redundant transitions removed 68 transitions.
FORMULA FireWire-PT-12-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 440/440 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 166 transition count 434
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 166 transition count 434
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 166 transition count 428
Applied a total of 12 rules in 47 ms. Remains 166 /169 variables (removed 3) and now considering 428/440 (removed 12) transitions.
[2024-06-02 22:48:16] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
// Phase 1: matrix 396 rows 166 cols
[2024-06-02 22:48:16] [INFO ] Computed 10 invariants in 22 ms
[2024-06-02 22:48:17] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-06-02 22:48:17] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 22:48:17] [INFO ] Invariant cache hit.
[2024-06-02 22:48:17] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:48:17] [INFO ] Implicit Places using invariants and state equation in 478 ms returned [62, 113, 164]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 784 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/169 places, 428/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 163 /163 variables (removed 0) and now considering 428/428 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 856 ms. Remains : 163/169 places, 428/440 transitions.
Support contains 33 out of 163 places after structural reductions.
[2024-06-02 22:48:17] [INFO ] Flatten gal took : 56 ms
[2024-06-02 22:48:17] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:48:17] [INFO ] Input system was already deterministic with 428 transitions.
Support contains 32 out of 163 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (1077 resets) in 2195 ms. (18 steps per ms) remains 8/28 properties
BEST_FIRST walk for 40004 steps (246 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (211 resets) in 51 ms. (769 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (15 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (11 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (217 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (211 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (215 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (215 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
[2024-06-02 22:48:18] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
// Phase 1: matrix 396 rows 163 cols
[2024-06-02 22:48:18] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:48:18] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 129/139 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 9/148 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-02 22:48:19] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 5 ms to minimize.
[2024-06-02 22:48:19] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 383/531 variables, 148/157 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 54/211 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/211 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 27/558 variables, 15/226 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 3/229 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/558 variables, 0/229 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1/559 variables, 1/230 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/559 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/559 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 230 constraints, problems are : Problem set: 1 solved, 7 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 129/139 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 9/148 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-02 22:48:19] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 383/531 variables, 148/158 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 54/212 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 7/219 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 27/558 variables, 15/234 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 3/237 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/558 variables, 0/237 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1/559 variables, 1/238 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/559 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/559 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 238 constraints, problems are : Problem set: 1 solved, 7 unsolved in 1243 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 2066ms problems are : Problem set: 1 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 4 properties in 1817 ms.
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 428/428 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 163 transition count 425
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 163 transition count 419
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 157 transition count 419
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
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 21 place count 154 transition count 428
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 154 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 154 transition count 419
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 35 place count 154 transition count 426
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 47 place count 149 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 149 transition count 415
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 148 transition count 414
Applied a total of 52 rules in 93 ms. Remains 148 /163 variables (removed 15) and now considering 414/428 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 148/163 places, 414/428 transitions.
RANDOM walk for 40000 steps (1311 resets) in 634 ms. (62 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (373 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (280 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (263 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 660736 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :1 out of 3
Probabilistic random walk after 660736 steps, saw 177770 distinct states, run finished after 3008 ms. (steps per millisecond=219 ) properties seen :1
[2024-06-02 22:48:26] [INFO ] Flow matrix only has 378 transitions (discarded 36 similar events)
// Phase 1: matrix 378 rows 148 cols
[2024-06-02 22:48:26] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:48:26] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 86/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 329/420 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 95/515 variables, 49/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/525 variables, 7/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/526 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/526 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 86/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 329/420 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 95/515 variables, 49/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/525 variables, 7/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/526 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/526 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 639ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 414/414 transitions.
Applied a total of 0 rules in 10 ms. Remains 148 /148 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 148/148 places, 414/414 transitions.
RANDOM walk for 40000 steps (1246 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (250 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (274 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 819285 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :0 out of 2
Probabilistic random walk after 819285 steps, saw 222524 distinct states, run finished after 3001 ms. (steps per millisecond=273 ) properties seen :0
[2024-06-02 22:48:29] [INFO ] Flow matrix only has 378 transitions (discarded 36 similar events)
[2024-06-02 22:48:29] [INFO ] Invariant cache hit.
[2024-06-02 22:48:29] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 86/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 329/420 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 95/515 variables, 49/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/525 variables, 7/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/526 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/526 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 86/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 329/420 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 95/515 variables, 49/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/525 variables, 7/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/526 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/526 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 618ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 276 ms.
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 414/414 transitions.
Applied a total of 0 rules in 22 ms. Remains 148 /148 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 148/148 places, 414/414 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 414/414 transitions.
Applied a total of 0 rules in 8 ms. Remains 148 /148 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2024-06-02 22:48:30] [INFO ] Flow matrix only has 378 transitions (discarded 36 similar events)
[2024-06-02 22:48:30] [INFO ] Invariant cache hit.
[2024-06-02 22:48:31] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 22:48:31] [INFO ] Flow matrix only has 378 transitions (discarded 36 similar events)
[2024-06-02 22:48:31] [INFO ] Invariant cache hit.
[2024-06-02 22:48:31] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:48:31] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-06-02 22:48:31] [INFO ] Redundant transitions in 25 ms returned []
Running 408 sub problems to find dead transitions.
[2024-06-02 22:48:31] [INFO ] Flow matrix only has 378 transitions (discarded 36 similar events)
[2024-06-02 22:48:31] [INFO ] Invariant cache hit.
[2024-06-02 22:48:31] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:48:33] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-06-02 22:48:33] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2024-06-02 22:48:33] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-06-02 22:48:33] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-06-02 22:48:33] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:48:33] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:48:33] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:48:36] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:48:37] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (OVERLAPS) 378/526 variables, 148/164 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 56/220 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 22:48:43] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:48:43] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:48:44] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-06-02 22:48:46] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:48:46] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:48:46] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 9 (OVERLAPS) 0/526 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 226 constraints, problems are : Problem set: 0 solved, 408 unsolved in 24486 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 378/526 variables, 148/170 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 408/634 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (OVERLAPS) 0/526 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 408 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 634 constraints, problems are : Problem set: 0 solved, 408 unsolved in 21539 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 15/15 constraints]
After SMT, in 46439ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 46444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46858 ms. Remains : 148/148 places, 414/414 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 119 edges and 148 vertex of which 27 / 148 are part of one of the 3 SCC in 4 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Ensure Unique test removed 57 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 123 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 123 transition count 278
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 123 transition count 278
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 123 transition count 275
Applied a total of 15 rules in 27 ms. Remains 123 /148 variables (removed 25) and now considering 275/414 (removed 139) transitions.
Running SMT prover for 2 properties.
[2024-06-02 22:49:17] [INFO ] Flow matrix only has 273 transitions (discarded 2 similar events)
// Phase 1: matrix 273 rows 123 cols
[2024-06-02 22:49:17] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:49:17] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:49:17] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:49:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 22:49:18] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 22:49:18] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-06-02 22:49:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
TRAPS : Iteration 1
[2024-06-02 22:49:18] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 22:49:18] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 439 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 19 stabilizing places and 31 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 162 transition count 421
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 156 transition count 421
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 153 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 153 transition count 424
Applied a total of 24 rules in 29 ms. Remains 153 /163 variables (removed 10) and now considering 424/428 (removed 4) transitions.
[2024-06-02 22:49:18] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
// Phase 1: matrix 385 rows 153 cols
[2024-06-02 22:49:18] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:49:18] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-02 22:49:18] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:49:18] [INFO ] Invariant cache hit.
[2024-06-02 22:49:18] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:49:18] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-06-02 22:49:18] [INFO ] Redundant transitions in 7 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 22:49:18] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:49:18] [INFO ] Invariant cache hit.
[2024-06-02 22:49:18] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:49:20] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:49:20] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-06-02 22:49:20] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:49:21] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:49:21] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:49:21] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:49:29] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:49:29] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-06-02 22:49:29] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:49:30] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:49:37] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 28809 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:49:56] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:49:58] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:49:58] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:50:08] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 648 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 15/15 constraints]
After SMT, in 59125ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 59129ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/163 places, 424/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59542 ms. Remains : 153/163 places, 424/428 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-12-LTLFireability-00
Product exploration explored 100000 steps with 4 reset in 161 ms.
Product exploration explored 100000 steps with 5 reset in 106 ms.
Computed a total of 12 stabilizing places and 27 stable transitions
Computed a total of 12 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 143 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 11008 steps (347 resets) in 87 ms. (125 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) p0)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p0)))
Knowledge based reduction with 9 factoid took 216 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-12-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-12-LTLFireability-00 finished in 60576 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(G((F(G(!p0)) U !p1)))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Applied a total of 0 rules in 11 ms. Remains 163 /163 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-06-02 22:50:19] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
// Phase 1: matrix 396 rows 163 cols
[2024-06-02 22:50:19] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:50:19] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-06-02 22:50:19] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 22:50:19] [INFO ] Invariant cache hit.
[2024-06-02 22:50:19] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:50:19] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-02 22:50:19] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 22:50:19] [INFO ] Invariant cache hit.
[2024-06-02 22:50:19] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 22:50:22] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 5 ms to minimize.
[2024-06-02 22:50:22] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:50:22] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:50:23] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:50:23] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-06-02 22:50:23] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 395/558 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 1/559 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 22:50:34] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:50:34] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 236 constraints, problems are : Problem set: 0 solved, 427 unsolved in 24546 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 22:50:46] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 395/558 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 427/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 22:50:54] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:50:55] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:50:59] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 667 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 54872ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 54876ms
Finished structural reductions in LTL mode , in 1 iterations and 55489 ms. Remains : 163/163 places, 428/428 transitions.
Stuttering acceptance computed with spot in 196 ms :[p1, p1, p1, p0, p1]
Running random walk in product with property : FireWire-PT-12-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 200 ms.
Product exploration explored 100000 steps with 2 reset in 150 ms.
Computed a total of 19 stabilizing places and 31 stable transitions
Computed a total of 19 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[p1, p1, p1, p0, p1]
RANDOM walk for 40000 steps (1076 resets) in 178 ms. (223 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (219 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
[2024-06-02 22:51:15] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 22:51:15] [INFO ] Invariant cache hit.
[2024-06-02 22:51:15] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/148 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 383/531 variables, 148/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 54/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 27/558 variables, 15/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/559 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/559 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/559 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/148 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:51:15] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 383/531 variables, 148/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 54/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 27/558 variables, 15/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/558 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/559 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/559 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/559 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 491ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 428/428 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 163 transition count 425
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 163 transition count 419
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 157 transition count 419
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
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 21 place count 154 transition count 428
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 154 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 154 transition count 419
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 154 transition count 428
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 51 place count 148 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 57 place count 148 transition count 413
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 147 transition count 412
Applied a total of 58 rules in 46 ms. Remains 147 /163 variables (removed 16) and now considering 412/428 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 147/163 places, 412/428 transitions.
RANDOM walk for 40000 steps (1288 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (282 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1301850 steps, run timeout after 3001 ms. (steps per millisecond=433 ) properties seen :0 out of 1
Probabilistic random walk after 1301850 steps, saw 349833 distinct states, run finished after 3001 ms. (steps per millisecond=433 ) properties seen :0
[2024-06-02 22:51:19] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
// Phase 1: matrix 375 rows 147 cols
[2024-06-02 22:51:19] [INFO ] Computed 7 invariants in 7 ms
[2024-06-02 22:51:19] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/337 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 166/503 variables, 83/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 38/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/520 variables, 11/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/522 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/522 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/522 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/337 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 166/503 variables, 83/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 38/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/520 variables, 11/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/520 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/522 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/522 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 379ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 412/412 transitions.
Applied a total of 0 rules in 10 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 147/147 places, 412/412 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 412/412 transitions.
Applied a total of 0 rules in 7 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
[2024-06-02 22:51:19] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 22:51:19] [INFO ] Invariant cache hit.
[2024-06-02 22:51:19] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 22:51:19] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 22:51:19] [INFO ] Invariant cache hit.
[2024-06-02 22:51:19] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:51:19] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-06-02 22:51:19] [INFO ] Redundant transitions in 5 ms returned []
Running 406 sub problems to find dead transitions.
[2024-06-02 22:51:19] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 22:51:19] [INFO ] Invariant cache hit.
[2024-06-02 22:51:19] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 22:51:21] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-02 22:51:21] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:51:21] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:51:21] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:51:22] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-06-02 22:51:22] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:51:22] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 375/522 variables, 147/161 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 56/217 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 22:51:29] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-06-02 22:51:29] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:51:29] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (OVERLAPS) 0/522 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 220 constraints, problems are : Problem set: 0 solved, 406 unsolved in 18643 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 375/522 variables, 147/164 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 56/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 406/626 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (OVERLAPS) 0/522 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 626 constraints, problems are : Problem set: 0 solved, 406 unsolved in 22011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 10/10 constraints]
After SMT, in 41006ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 41011ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41351 ms. Remains : 147/147 places, 412/412 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 134 edges and 147 vertex of which 29 / 147 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 121 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 121 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 120 transition count 257
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 15 place count 120 transition count 256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 119 transition count 255
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 119 transition count 240
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 110 transition count 237
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 110 transition count 237
Applied a total of 44 rules in 36 ms. Remains 110 /147 variables (removed 37) and now considering 237/412 (removed 175) transitions.
Running SMT prover for 1 properties.
[2024-06-02 22:52:00] [INFO ] Flow matrix only has 235 transitions (discarded 2 similar events)
// Phase 1: matrix 235 rows 110 cols
[2024-06-02 22:52:00] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:52:00] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:52:01] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:52:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:52:01] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:52:01] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:52:01] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 246 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[p1, p1, p1, p0, p1]
Stuttering acceptance computed with spot in 230 ms :[p1, p1, p1, p0, p1]
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Applied a total of 0 rules in 6 ms. Remains 163 /163 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-06-02 22:52:01] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
// Phase 1: matrix 396 rows 163 cols
[2024-06-02 22:52:01] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 22:52:01] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 22:52:01] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 22:52:01] [INFO ] Invariant cache hit.
[2024-06-02 22:52:01] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:52:02] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-02 22:52:02] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 22:52:02] [INFO ] Invariant cache hit.
[2024-06-02 22:52:02] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 22:52:04] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:52:05] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:52:05] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:52:05] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 2 ms to minimize.
[2024-06-02 22:52:05] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:52:05] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 395/558 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 1/559 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 22:52:16] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:52:16] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 236 constraints, problems are : Problem set: 0 solved, 427 unsolved in 24032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 22:52:27] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 395/558 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 427/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 22:52:36] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2024-06-02 22:52:36] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:52:40] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 667 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 54399ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 54405ms
Finished structural reductions in LTL mode , in 1 iterations and 54726 ms. Remains : 163/163 places, 428/428 transitions.
Computed a total of 19 stabilizing places and 31 stable transitions
Computed a total of 19 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[p1, p1, p1, p0, p1]
RANDOM walk for 40000 steps (1050 resets) in 223 ms. (178 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (253 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (206 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1461117 steps, run timeout after 3001 ms. (steps per millisecond=486 ) properties seen :1 out of 2
Probabilistic random walk after 1461117 steps, saw 336463 distinct states, run finished after 3001 ms. (steps per millisecond=486 ) properties seen :1
[2024-06-02 22:52:59] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 22:52:59] [INFO ] Invariant cache hit.
[2024-06-02 22:52:59] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/148 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 383/531 variables, 148/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 54/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 27/558 variables, 15/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/559 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/559 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/559 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 228 constraints, problems are : Problem set: 0 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 93/148 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 22:53:00] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 383/531 variables, 148/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 54/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 27/558 variables, 15/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/558 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/559 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/559 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/559 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 493ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 428/428 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 163 transition count 425
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 163 transition count 419
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 157 transition count 419
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
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 21 place count 154 transition count 428
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 154 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 154 transition count 419
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 154 transition count 428
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 51 place count 148 transition count 419
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 57 place count 148 transition count 413
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 147 transition count 412
Applied a total of 58 rules in 33 ms. Remains 147 /163 variables (removed 16) and now considering 412/428 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 147/163 places, 412/428 transitions.
RANDOM walk for 40000 steps (1266 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (271 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1421559 steps, run timeout after 3001 ms. (steps per millisecond=473 ) properties seen :0 out of 1
Probabilistic random walk after 1421559 steps, saw 385139 distinct states, run finished after 3001 ms. (steps per millisecond=473 ) properties seen :0
[2024-06-02 22:53:03] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
// Phase 1: matrix 375 rows 147 cols
[2024-06-02 22:53:03] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 22:53:03] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/337 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 166/503 variables, 83/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 38/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/520 variables, 11/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/522 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/522 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/522 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/337 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 166/503 variables, 83/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 38/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/520 variables, 11/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/520 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/522 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/522 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 396ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 412/412 transitions.
Applied a total of 0 rules in 12 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 147/147 places, 412/412 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 412/412 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
[2024-06-02 22:53:03] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 22:53:03] [INFO ] Invariant cache hit.
[2024-06-02 22:53:03] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 22:53:03] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 22:53:03] [INFO ] Invariant cache hit.
[2024-06-02 22:53:04] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:53:04] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-06-02 22:53:04] [INFO ] Redundant transitions in 2 ms returned []
Running 406 sub problems to find dead transitions.
[2024-06-02 22:53:04] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 22:53:04] [INFO ] Invariant cache hit.
[2024-06-02 22:53:04] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 22:53:05] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:53:05] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:53:06] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:53:06] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:53:06] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-06-02 22:53:06] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 1 ms to minimize.
[2024-06-02 22:53:06] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 375/522 variables, 147/161 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 56/217 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 22:53:13] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-06-02 22:53:13] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-06-02 22:53:13] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (OVERLAPS) 0/522 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 220 constraints, problems are : Problem set: 0 solved, 406 unsolved in 18118 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 375/522 variables, 147/164 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 56/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 406/626 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (OVERLAPS) 0/522 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 626 constraints, problems are : Problem set: 0 solved, 406 unsolved in 20639 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 10/10 constraints]
After SMT, in 39077ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 39081ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39415 ms. Remains : 147/147 places, 412/412 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 134 edges and 147 vertex of which 29 / 147 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 121 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 121 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 120 transition count 257
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 15 place count 120 transition count 256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 119 transition count 255
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 119 transition count 240
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 110 transition count 237
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 110 transition count 237
Applied a total of 44 rules in 19 ms. Remains 110 /147 variables (removed 37) and now considering 237/412 (removed 175) transitions.
Running SMT prover for 1 properties.
[2024-06-02 22:53:43] [INFO ] Flow matrix only has 235 transitions (discarded 2 similar events)
// Phase 1: matrix 235 rows 110 cols
[2024-06-02 22:53:43] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:53:43] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 22:53:43] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:53:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 22:53:43] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 22:53:43] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:53:43] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 205 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[p1, p1, p1, p0, p1]
Stuttering acceptance computed with spot in 179 ms :[p1, p1, p1, p0, p1]
Stuttering acceptance computed with spot in 184 ms :[p1, p1, p1, p0, p1]
Product exploration explored 100000 steps with 8 reset in 49 ms.
Product exploration explored 100000 steps with 6 reset in 46 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 198 ms :[p1, p1, p1, p0, p1]
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 163 transition count 434
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 434
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 163 transition count 449
Deduced a syphon composed of 9 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 15 place count 163 transition count 443
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 15 rules in 36 ms. Remains 163 /163 variables (removed 0) and now considering 443/428 (removed -15) transitions.
[2024-06-02 22:53:44] [INFO ] Redundant transitions in 2 ms returned []
Running 442 sub problems to find dead transitions.
[2024-06-02 22:53:44] [INFO ] Flow matrix only has 404 transitions (discarded 39 similar events)
// Phase 1: matrix 404 rows 163 cols
[2024-06-02 22:53:44] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:53:44] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-06-02 22:53:47] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-02 22:53:47] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
[2024-06-02 22:53:47] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
[2024-06-02 22:53:47] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 1 ms to minimize.
[2024-06-02 22:53:47] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:53:48] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:53:48] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-06-02 22:53:48] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 2 ms to minimize.
[2024-06-02 22:53:49] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 9/16 constraints. Problems are: Problem set: 6 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 6 solved, 436 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
At refinement iteration 4 (OVERLAPS) 403/566 variables, 163/179 constraints. Problems are: Problem set: 18 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 62/241 constraints. Problems are: Problem set: 18 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 0/241 constraints. Problems are: Problem set: 18 solved, 424 unsolved
At refinement iteration 7 (OVERLAPS) 1/567 variables, 1/242 constraints. Problems are: Problem set: 18 solved, 424 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 0/242 constraints. Problems are: Problem set: 18 solved, 424 unsolved
At refinement iteration 9 (OVERLAPS) 0/567 variables, 0/242 constraints. Problems are: Problem set: 18 solved, 424 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 242 constraints, problems are : Problem set: 18 solved, 424 unsolved in 22589 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 442/442 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 18 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 424 unsolved
At refinement iteration 1 (OVERLAPS) 4/157 variables, 7/7 constraints. Problems are: Problem set: 18 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/16 constraints. Problems are: Problem set: 18 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/16 constraints. Problems are: Problem set: 18 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 403/560 variables, 157/173 constraints. Problems are: Problem set: 18 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 62/235 constraints. Problems are: Problem set: 18 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 424/659 constraints. Problems are: Problem set: 18 solved, 424 unsolved
[2024-06-02 22:54:17] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 1/660 constraints. Problems are: Problem set: 18 solved, 424 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 0/660 constraints. Problems are: Problem set: 18 solved, 424 unsolved
At refinement iteration 9 (OVERLAPS) 6/566 variables, 6/666 constraints. Problems are: Problem set: 18 solved, 424 unsolved
[2024-06-02 22:54:36] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-06-02 22:54:37] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/567 variables, and 668 constraints, problems are : Problem set: 18 solved, 424 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 424/442 constraints, Known Traps: 12/12 constraints]
After SMT, in 52936ms problems are : Problem set: 18 solved, 424 unsolved
Search for dead transitions found 18 dead transitions in 52940ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 163/163 places, 425/428 transitions.
Graph (complete) has 841 edges and 163 vertex of which 154 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 154 /163 variables (removed 9) and now considering 425/425 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 154/163 places, 425/428 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52998 ms. Remains : 154/163 places, 425/428 transitions.
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-06-02 22:54:37] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
// Phase 1: matrix 396 rows 163 cols
[2024-06-02 22:54:37] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:54:37] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 22:54:37] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 22:54:37] [INFO ] Invariant cache hit.
[2024-06-02 22:54:37] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:54:37] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-02 22:54:38] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 22:54:38] [INFO ] Invariant cache hit.
[2024-06-02 22:54:38] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 22:54:40] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 1 ms to minimize.
[2024-06-02 22:54:40] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:54:41] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:54:41] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:54:41] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:54:41] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 395/558 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 1/559 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 22:54:52] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:54:52] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 236 constraints, problems are : Problem set: 0 solved, 427 unsolved in 24182 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 22:55:04] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 395/558 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 427/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 22:55:12] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:55:13] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:55:17] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 667 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 54487ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 54493ms
Finished structural reductions in LTL mode , in 1 iterations and 54805 ms. Remains : 163/163 places, 428/428 transitions.
Treatment of property FireWire-PT-12-LTLFireability-01 finished in 313487 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||(F(p1)&&F(G(p2))))) U G(!p1)))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 162 transition count 421
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 156 transition count 421
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 153 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 153 transition count 424
Applied a total of 24 rules in 19 ms. Remains 153 /163 variables (removed 10) and now considering 424/428 (removed 4) transitions.
[2024-06-02 22:55:32] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
// Phase 1: matrix 385 rows 153 cols
[2024-06-02 22:55:32] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:55:32] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 22:55:32] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:55:32] [INFO ] Invariant cache hit.
[2024-06-02 22:55:32] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:55:32] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-06-02 22:55:32] [INFO ] Redundant transitions in 3 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 22:55:32] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:55:32] [INFO ] Invariant cache hit.
[2024-06-02 22:55:32] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:55:34] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:55:34] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:55:34] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:55:34] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2024-06-02 22:55:35] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:55:35] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:55:43] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:55:43] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:55:43] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:55:44] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:55:51] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 28656 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:56:10] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:56:12] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
[2024-06-02 22:56:12] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:56:22] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 648 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 15/15 constraints]
After SMT, in 58962ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 58966ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/163 places, 424/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59279 ms. Remains : 153/163 places, 424/428 transitions.
Stuttering acceptance computed with spot in 222 ms :[p1, (NOT p2), (AND p0 (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : FireWire-PT-12-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 106 ms.
Product exploration explored 100000 steps with 8 reset in 101 ms.
Computed a total of 12 stabilizing places and 27 stable transitions
Computed a total of 12 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 118 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[p1, (NOT p2), (AND p0 (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (1247 resets) in 149 ms. (266 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (11 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (11 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
[2024-06-02 22:56:32] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:56:32] [INFO ] Invariant cache hit.
[2024-06-02 22:56:32] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 50/53 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 291/344 variables, 53/55 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 18/73 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 172/516 variables, 85/158 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 38/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/518 variables, 2/199 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/518 variables, 2/201 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/518 variables, 0/201 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 17/535 variables, 11/212 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/535 variables, 2/214 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 0/214 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/537 variables, 2/216 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 0/216 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/537 variables, 0/216 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 216 constraints, problems are : Problem set: 1 solved, 2 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/53 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 291/344 variables, 53/55 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 18/73 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 172/516 variables, 85/158 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 38/197 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 2/199 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 0/199 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/518 variables, 2/201 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/518 variables, 2/203 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/518 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 17/535 variables, 11/214 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 2/216 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/535 variables, 0/216 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/537 variables, 2/218 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/537 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/538 variables, and 218 constraints, problems are : Problem set: 1 solved, 2 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 714ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 4525 steps, including 682 resets, run visited all 2 properties in 46 ms. (steps per millisecond=98 )
Parikh walk visited 2 properties in 50 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0), (F p2), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 16 factoid took 319 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[p1, (NOT p2), (AND p0 (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 211 ms :[p1, (NOT p2), (AND p0 (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (NOT p1)]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 424/424 transitions.
Applied a total of 0 rules in 13 ms. Remains 153 /153 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 22:56:34] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:56:34] [INFO ] Invariant cache hit.
[2024-06-02 22:56:34] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 22:56:34] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:56:34] [INFO ] Invariant cache hit.
[2024-06-02 22:56:34] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:56:34] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-06-02 22:56:34] [INFO ] Redundant transitions in 3 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 22:56:34] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:56:34] [INFO ] Invariant cache hit.
[2024-06-02 22:56:34] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:56:36] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:56:36] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:56:36] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:56:36] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-06-02 22:56:36] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2024-06-02 22:56:37] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:56:45] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
[2024-06-02 22:56:45] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 3 ms to minimize.
[2024-06-02 22:56:45] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:56:46] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:56:53] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 29516 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:57:12] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:57:15] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:57:15] [INFO ] Deduced a trap composed of 91 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:57:25] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 648 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 15/15 constraints]
After SMT, in 59844ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 59849ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60183 ms. Remains : 153/153 places, 424/424 transitions.
Computed a total of 12 stabilizing places and 27 stable transitions
Computed a total of 12 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 115 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[p1, (NOT p2), (AND p0 (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (1281 resets) in 402 ms. (99 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (18 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
[2024-06-02 22:57:35] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:57:35] [INFO ] Invariant cache hit.
[2024-06-02 22:57:35] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 53/538 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 2/7 constraints, State Equation: 0/153 constraints, ReadFeed: 0/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 28ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0), (F p2), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 16 factoid took 262 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[p1, (NOT p2), (AND p0 (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 196 ms :[p1, (NOT p2), (AND p0 (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[p1, (NOT p2), (AND p0 (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 6 reset in 73 ms.
Product exploration explored 100000 steps with 2 reset in 102 ms.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 424/424 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 22:57:36] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:57:36] [INFO ] Invariant cache hit.
[2024-06-02 22:57:36] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 22:57:36] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:57:36] [INFO ] Invariant cache hit.
[2024-06-02 22:57:36] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:57:36] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-06-02 22:57:36] [INFO ] Redundant transitions in 5 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 22:57:36] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:57:36] [INFO ] Invariant cache hit.
[2024-06-02 22:57:36] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:57:38] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:57:38] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:57:38] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:57:38] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:57:38] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-06-02 22:57:38] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:57:46] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
[2024-06-02 22:57:46] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-02 22:57:46] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:57:47] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:57:54] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 28695 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:58:13] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:58:15] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:58:16] [INFO ] Deduced a trap composed of 91 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:58:26] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 648 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 15/15 constraints]
After SMT, in 59029ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 59034ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59378 ms. Remains : 153/153 places, 424/424 transitions.
Treatment of property FireWire-PT-12-LTLFireability-02 finished in 182901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(!p1))) U G(p1)))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 162 transition count 421
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 156 transition count 421
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 153 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 153 transition count 424
Applied a total of 24 rules in 15 ms. Remains 153 /163 variables (removed 10) and now considering 424/428 (removed 4) transitions.
[2024-06-02 22:58:35] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:58:35] [INFO ] Invariant cache hit.
[2024-06-02 22:58:35] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 22:58:35] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:58:35] [INFO ] Invariant cache hit.
[2024-06-02 22:58:35] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:58:35] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-06-02 22:58:35] [INFO ] Redundant transitions in 3 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 22:58:35] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:58:35] [INFO ] Invariant cache hit.
[2024-06-02 22:58:35] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:58:37] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:58:37] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:58:37] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:58:37] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2024-06-02 22:58:38] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-06-02 22:58:38] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:58:45] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:58:46] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:58:46] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:58:47] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:58:54] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 28342 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:59:12] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:59:15] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:59:15] [INFO ] Deduced a trap composed of 91 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:59:25] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 648 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 15/15 constraints]
After SMT, in 58622ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 58625ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/163 places, 424/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59024 ms. Remains : 153/163 places, 424/428 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (AND p1 (NOT p0))]
Running random walk in product with property : FireWire-PT-12-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-12-LTLFireability-03 finished in 59123 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 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 162 transition count 421
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 156 transition count 421
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 153 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 153 transition count 424
Applied a total of 24 rules in 14 ms. Remains 153 /163 variables (removed 10) and now considering 424/428 (removed 4) transitions.
[2024-06-02 22:59:34] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:59:34] [INFO ] Invariant cache hit.
[2024-06-02 22:59:34] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 22:59:34] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:59:34] [INFO ] Invariant cache hit.
[2024-06-02 22:59:34] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:59:35] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2024-06-02 22:59:35] [INFO ] Redundant transitions in 4 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 22:59:35] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 22:59:35] [INFO ] Invariant cache hit.
[2024-06-02 22:59:35] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:59:36] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
[2024-06-02 22:59:36] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:59:37] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:59:37] [INFO ] Deduced a trap composed of 34 places in 24 ms of which 0 ms to minimize.
[2024-06-02 22:59:37] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:59:37] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:59:45] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:59:45] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
[2024-06-02 22:59:45] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:59:46] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 22:59:53] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 28594 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:00:12] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:00:14] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2024-06-02 23:00:14] [INFO ] Deduced a trap composed of 91 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:00:24] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 648 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 15/15 constraints]
After SMT, in 58921ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 58925ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/163 places, 424/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59333 ms. Remains : 153/163 places, 424/428 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-12-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-12-LTLFireability-04 finished in 59421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&(p2||F(p0))&&p1))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 162 transition count 421
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 156 transition count 421
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 153 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 153 transition count 424
Applied a total of 24 rules in 18 ms. Remains 153 /163 variables (removed 10) and now considering 424/428 (removed 4) transitions.
[2024-06-02 23:00:34] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:00:34] [INFO ] Invariant cache hit.
[2024-06-02 23:00:34] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 23:00:34] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:00:34] [INFO ] Invariant cache hit.
[2024-06-02 23:00:34] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:00:34] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-06-02 23:00:34] [INFO ] Redundant transitions in 3 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 23:00:34] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:00:34] [INFO ] Invariant cache hit.
[2024-06-02 23:00:34] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:00:36] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:00:36] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:00:36] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:00:36] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 0 ms to minimize.
[2024-06-02 23:00:36] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:00:36] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:00:44] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
[2024-06-02 23:00:44] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-06-02 23:00:44] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:00:45] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:00:52] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 28188 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:01:11] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:01:13] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:01:13] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:01:23] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 648 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 15/15 constraints]
After SMT, in 58497ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 58500ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/163 places, 424/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58871 ms. Remains : 153/163 places, 424/428 transitions.
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Running random walk in product with property : FireWire-PT-12-LTLFireability-05
Product exploration explored 100000 steps with 9 reset in 45 ms.
Product exploration explored 100000 steps with 1 reset in 52 ms.
Computed a total of 12 stabilizing places and 27 stable transitions
Computed a total of 12 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[p0, p0]
RANDOM walk for 40000 steps (1268 resets) in 135 ms. (294 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (278 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
[2024-06-02 23:01:33] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:01:33] [INFO ] Invariant cache hit.
[2024-06-02 23:01:33] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 333/427 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 36/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/525 variables, 50/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/526 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/536 variables, 7/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/536 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/536 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/537 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/537 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 333/427 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 36/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/525 variables, 50/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/526 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/536 variables, 7/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/536 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/536 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/537 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/537 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/538 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 544ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 424/424 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 153 transition count 418
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 153 transition count 425
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 148 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 148 transition count 414
Applied a total of 27 rules in 18 ms. Remains 148 /153 variables (removed 5) and now considering 414/424 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 148/153 places, 414/424 transitions.
RANDOM walk for 40000 steps (1269 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (294 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1359698 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :0 out of 1
Probabilistic random walk after 1359698 steps, saw 379335 distinct states, run finished after 3001 ms. (steps per millisecond=453 ) properties seen :0
[2024-06-02 23:01:36] [INFO ] Flow matrix only has 378 transitions (discarded 36 similar events)
// Phase 1: matrix 378 rows 148 cols
[2024-06-02 23:01:36] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:01:36] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 329/420 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 95/515 variables, 49/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/525 variables, 7/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/526 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/526 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 329/420 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 95/515 variables, 49/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/525 variables, 7/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/526 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/526 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 472ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 4 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 414/414 transitions.
Applied a total of 0 rules in 5 ms. Remains 148 /148 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 148/148 places, 414/414 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 414/414 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2024-06-02 23:01:37] [INFO ] Flow matrix only has 378 transitions (discarded 36 similar events)
[2024-06-02 23:01:37] [INFO ] Invariant cache hit.
[2024-06-02 23:01:37] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 23:01:37] [INFO ] Flow matrix only has 378 transitions (discarded 36 similar events)
[2024-06-02 23:01:37] [INFO ] Invariant cache hit.
[2024-06-02 23:01:37] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:01:37] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-06-02 23:01:37] [INFO ] Redundant transitions in 4 ms returned []
Running 408 sub problems to find dead transitions.
[2024-06-02 23:01:37] [INFO ] Flow matrix only has 378 transitions (discarded 36 similar events)
[2024-06-02 23:01:37] [INFO ] Invariant cache hit.
[2024-06-02 23:01:37] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:01:39] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:01:39] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:01:39] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:01:39] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:01:39] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
[2024-06-02 23:01:40] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:01:40] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:01:42] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:01:43] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (OVERLAPS) 378/526 variables, 148/164 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 56/220 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:01:50] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:01:50] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:01:50] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:01:52] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:01:52] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:01:52] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 9 (OVERLAPS) 0/526 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 226 constraints, problems are : Problem set: 0 solved, 408 unsolved in 24710 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 378/526 variables, 148/170 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 408/634 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (OVERLAPS) 0/526 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 408 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 634 constraints, problems are : Problem set: 0 solved, 408 unsolved in 27019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 15/15 constraints]
After SMT, in 52036ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 52040ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52385 ms. Remains : 148/148 places, 414/414 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 120 edges and 148 vertex of which 27 / 148 are part of one of the 3 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Ensure Unique test removed 57 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 123 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 123 transition count 278
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 123 transition count 278
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 123 transition count 275
Applied a total of 15 rules in 16 ms. Remains 123 /148 variables (removed 25) and now considering 275/414 (removed 139) transitions.
Running SMT prover for 1 properties.
[2024-06-02 23:02:29] [INFO ] Flow matrix only has 273 transitions (discarded 2 similar events)
// Phase 1: matrix 273 rows 123 cols
[2024-06-02 23:02:29] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:02:29] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:02:29] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:02:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:02:30] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 23:02:30] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-02 23:02:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
TRAPS : Iteration 1
[2024-06-02 23:02:30] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:02:30] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 341 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[p0, p0]
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Support contains 4 out of 153 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 : 153/153 places, 424/424 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 23:02:30] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
// Phase 1: matrix 385 rows 153 cols
[2024-06-02 23:02:30] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:02:30] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 23:02:30] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:02:30] [INFO ] Invariant cache hit.
[2024-06-02 23:02:30] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:02:30] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-06-02 23:02:30] [INFO ] Redundant transitions in 2 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 23:02:30] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:02:30] [INFO ] Invariant cache hit.
[2024-06-02 23:02:30] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:02:32] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2024-06-02 23:02:32] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-06-02 23:02:32] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:02:32] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
[2024-06-02 23:02:33] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:02:33] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:02:40] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-06-02 23:02:41] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:02:41] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:02:42] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:02:49] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 29088 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:03:08] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:03:11] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:03:11] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:03:21] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 648 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 15/15 constraints]
After SMT, in 59392ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 59396ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59737 ms. Remains : 153/153 places, 424/424 transitions.
Computed a total of 12 stabilizing places and 27 stable transitions
Computed a total of 12 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
RANDOM walk for 40000 steps (1242 resets) in 181 ms. (219 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (262 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
[2024-06-02 23:03:30] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:03:30] [INFO ] Invariant cache hit.
[2024-06-02 23:03:30] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 333/427 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 36/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/525 variables, 50/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/526 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/536 variables, 7/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/536 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/536 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/537 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/537 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/537 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 90/94 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 333/427 variables, 94/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 36/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 98/525 variables, 50/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/526 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/526 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/536 variables, 7/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/536 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/536 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/537 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/537 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/537 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 537/538 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 490ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 424/424 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 153 transition count 418
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 153 transition count 425
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 148 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 148 transition count 414
Applied a total of 27 rules in 13 ms. Remains 148 /153 variables (removed 5) and now considering 414/424 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 148/153 places, 414/424 transitions.
RANDOM walk for 40000 steps (1288 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (278 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1361300 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :0 out of 1
Probabilistic random walk after 1361300 steps, saw 379845 distinct states, run finished after 3001 ms. (steps per millisecond=453 ) properties seen :0
[2024-06-02 23:03:34] [INFO ] Flow matrix only has 378 transitions (discarded 36 similar events)
// Phase 1: matrix 378 rows 148 cols
[2024-06-02 23:03:34] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:03:34] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 329/420 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 95/515 variables, 49/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/525 variables, 7/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/526 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/526 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/526 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 329/420 variables, 91/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 36/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 95/515 variables, 49/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/525 variables, 7/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/526 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/526 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/526 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 462ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 414/414 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 148/148 places, 414/414 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 414/414 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 414/414 (removed 0) transitions.
[2024-06-02 23:03:34] [INFO ] Flow matrix only has 378 transitions (discarded 36 similar events)
[2024-06-02 23:03:34] [INFO ] Invariant cache hit.
[2024-06-02 23:03:34] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 23:03:34] [INFO ] Flow matrix only has 378 transitions (discarded 36 similar events)
[2024-06-02 23:03:34] [INFO ] Invariant cache hit.
[2024-06-02 23:03:34] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:03:34] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-06-02 23:03:34] [INFO ] Redundant transitions in 4 ms returned []
Running 408 sub problems to find dead transitions.
[2024-06-02 23:03:34] [INFO ] Flow matrix only has 378 transitions (discarded 36 similar events)
[2024-06-02 23:03:34] [INFO ] Invariant cache hit.
[2024-06-02 23:03:34] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:03:36] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:03:36] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:03:36] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:03:36] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:03:37] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 1 ms to minimize.
[2024-06-02 23:03:37] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:03:37] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:03:39] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:03:40] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (OVERLAPS) 378/526 variables, 148/164 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 56/220 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-06-02 23:03:47] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 1 ms to minimize.
[2024-06-02 23:03:47] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:03:47] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:03:49] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-06-02 23:03:49] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:03:50] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 9 (OVERLAPS) 0/526 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 226 constraints, problems are : Problem set: 0 solved, 408 unsolved in 24852 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 378/526 variables, 148/170 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 56/226 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 408/634 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 7 (OVERLAPS) 0/526 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 408 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 634 constraints, problems are : Problem set: 0 solved, 408 unsolved in 27660 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 15/15 constraints]
After SMT, in 52838ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 52843ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53181 ms. Remains : 148/148 places, 414/414 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 120 edges and 148 vertex of which 27 / 148 are part of one of the 3 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Ensure Unique test removed 57 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 123 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 123 transition count 278
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 123 transition count 278
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 123 transition count 275
Applied a total of 15 rules in 11 ms. Remains 123 /148 variables (removed 25) and now considering 275/414 (removed 139) transitions.
Running SMT prover for 1 properties.
[2024-06-02 23:04:27] [INFO ] Flow matrix only has 273 transitions (discarded 2 similar events)
// Phase 1: matrix 273 rows 123 cols
[2024-06-02 23:04:27] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:04:27] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:04:27] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:04:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:04:27] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 23:04:28] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-02 23:04:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
TRAPS : Iteration 1
[2024-06-02 23:04:28] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:04:28] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 353 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[p0, p0]
Stuttering acceptance computed with spot in 92 ms :[p0, p0]
Stuttering acceptance computed with spot in 96 ms :[p0, p0]
Product exploration explored 100000 steps with 7 reset in 52 ms.
Product exploration explored 100000 steps with 11 reset in 51 ms.
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 424/424 transitions.
Applied a total of 0 rules in 14 ms. Remains 153 /153 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 23:04:28] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
// Phase 1: matrix 385 rows 153 cols
[2024-06-02 23:04:28] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:04:28] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 23:04:28] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:04:28] [INFO ] Invariant cache hit.
[2024-06-02 23:04:28] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:04:28] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-06-02 23:04:28] [INFO ] Redundant transitions in 5 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 23:04:28] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:04:28] [INFO ] Invariant cache hit.
[2024-06-02 23:04:28] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:04:30] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:04:30] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:04:30] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:04:30] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-06-02 23:04:31] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:04:31] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:04:39] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:04:39] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 2 ms to minimize.
[2024-06-02 23:04:39] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:04:40] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:04:47] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 28961 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:05:06] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:05:08] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:05:08] [INFO ] Deduced a trap composed of 91 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:05:18] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 648 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 15/15 constraints]
After SMT, in 59272ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 59279ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 59617 ms. Remains : 153/153 places, 424/424 transitions.
Treatment of property FireWire-PT-12-LTLFireability-05 finished in 294192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 162 transition count 421
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 156 transition count 421
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 153 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 153 transition count 424
Applied a total of 24 rules in 13 ms. Remains 153 /163 variables (removed 10) and now considering 424/428 (removed 4) transitions.
[2024-06-02 23:05:28] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:05:28] [INFO ] Invariant cache hit.
[2024-06-02 23:05:28] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 23:05:28] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:05:28] [INFO ] Invariant cache hit.
[2024-06-02 23:05:28] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:05:28] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2024-06-02 23:05:28] [INFO ] Redundant transitions in 4 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 23:05:28] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:05:28] [INFO ] Invariant cache hit.
[2024-06-02 23:05:28] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:05:30] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:05:30] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:05:30] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:05:30] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
[2024-06-02 23:05:30] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:05:30] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:05:38] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:05:38] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:05:38] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:05:39] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:05:46] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 28490 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:06:05] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:06:07] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:06:08] [INFO ] Deduced a trap composed of 91 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:06:17] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 648 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 15/15 constraints]
After SMT, in 58802ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 58805ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/163 places, 424/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59160 ms. Remains : 153/163 places, 424/428 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-12-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-12-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-12-LTLFireability-07 finished in 59234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (G(p2)&&p1)))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 163 transition count 422
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 157 transition count 422
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 155 transition count 428
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 155 transition count 424
Applied a total of 20 rules in 19 ms. Remains 155 /163 variables (removed 8) and now considering 424/428 (removed 4) transitions.
[2024-06-02 23:06:27] [INFO ] Flow matrix only has 388 transitions (discarded 36 similar events)
// Phase 1: matrix 388 rows 155 cols
[2024-06-02 23:06:27] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:06:27] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 23:06:27] [INFO ] Flow matrix only has 388 transitions (discarded 36 similar events)
[2024-06-02 23:06:27] [INFO ] Invariant cache hit.
[2024-06-02 23:06:27] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:06:27] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-06-02 23:06:27] [INFO ] Redundant transitions in 3 ms returned []
Running 423 sub problems to find dead transitions.
[2024-06-02 23:06:27] [INFO ] Flow matrix only has 388 transitions (discarded 36 similar events)
[2024-06-02 23:06:27] [INFO ] Invariant cache hit.
[2024-06-02 23:06:27] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 23:06:30] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:06:30] [INFO ] Deduced a trap composed of 35 places in 26 ms of which 0 ms to minimize.
[2024-06-02 23:06:30] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:06:30] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:06:31] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:06:31] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2024-06-02 23:06:31] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (OVERLAPS) 387/542 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 59/228 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (OVERLAPS) 1/543 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 9 (OVERLAPS) 0/543 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 229 constraints, problems are : Problem set: 0 solved, 423 unsolved in 23071 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (OVERLAPS) 387/542 variables, 155/169 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 59/228 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 423/651 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 23:07:01] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:07:04] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 2/653 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-06-02 23:07:14] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:07:17] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 542/543 variables, and 655 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 59/60 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 11/11 constraints]
After SMT, in 53392ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 53396ms
Starting structural reductions in SI_LTL mode, iteration 1 : 155/163 places, 424/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53762 ms. Remains : 155/163 places, 424/428 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2)]
Running random walk in product with property : FireWire-PT-12-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-12-LTLFireability-08 finished in 53955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)||p0)))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-06-02 23:07:21] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
// Phase 1: matrix 396 rows 163 cols
[2024-06-02 23:07:21] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:07:21] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 23:07:21] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 23:07:21] [INFO ] Invariant cache hit.
[2024-06-02 23:07:21] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:07:21] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-02 23:07:21] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 23:07:21] [INFO ] Invariant cache hit.
[2024-06-02 23:07:21] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:07:24] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 0 ms to minimize.
[2024-06-02 23:07:24] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:07:24] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:07:24] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:07:25] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-06-02 23:07:25] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 395/558 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 1/559 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:07:36] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-06-02 23:07:36] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 236 constraints, problems are : Problem set: 0 solved, 427 unsolved in 24120 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:07:47] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 395/558 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 427/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:07:56] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:07:56] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:08:01] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 667 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 54408ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 54414ms
Finished structural reductions in LTL mode , in 1 iterations and 54746 ms. Remains : 163/163 places, 428/428 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-12-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Computed a total of 19 stabilizing places and 31 stable transitions
Computed a total of 19 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-12-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-12-LTLFireability-09 finished in 55198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-06-02 23:08:16] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 23:08:16] [INFO ] Invariant cache hit.
[2024-06-02 23:08:16] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 23:08:16] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 23:08:16] [INFO ] Invariant cache hit.
[2024-06-02 23:08:16] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:08:16] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-02 23:08:16] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 23:08:16] [INFO ] Invariant cache hit.
[2024-06-02 23:08:16] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:08:19] [INFO ] Deduced a trap composed of 36 places in 24 ms of which 1 ms to minimize.
[2024-06-02 23:08:19] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:08:20] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:08:20] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-06-02 23:08:20] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:08:20] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 395/558 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 1/559 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:08:31] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:08:31] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 236 constraints, problems are : Problem set: 0 solved, 427 unsolved in 24985 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:08:43] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 395/558 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 427/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:08:52] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:08:52] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-06-02 23:08:57] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 667 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 55281ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 55286ms
Finished structural reductions in LTL mode , in 1 iterations and 55629 ms. Remains : 163/163 places, 428/428 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FireWire-PT-12-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-12-LTLFireability-10 finished in 55760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1)) U X(X((p1&&G(F(p0)))))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-06-02 23:09:12] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 23:09:12] [INFO ] Invariant cache hit.
[2024-06-02 23:09:12] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 23:09:12] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 23:09:12] [INFO ] Invariant cache hit.
[2024-06-02 23:09:12] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:09:12] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-02 23:09:12] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 23:09:12] [INFO ] Invariant cache hit.
[2024-06-02 23:09:12] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:09:15] [INFO ] Deduced a trap composed of 36 places in 23 ms of which 0 ms to minimize.
[2024-06-02 23:09:15] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:09:15] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:09:15] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:09:16] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:09:16] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 395/558 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 1/559 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:09:27] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:09:27] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 236 constraints, problems are : Problem set: 0 solved, 427 unsolved in 24449 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:09:39] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 395/558 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 427/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:09:48] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:09:48] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-06-02 23:09:52] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 667 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 54743ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 54748ms
Finished structural reductions in LTL mode , in 1 iterations and 55059 ms. Remains : 163/163 places, 428/428 transitions.
Stuttering acceptance computed with spot in 817 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-12-LTLFireability-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-12-LTLFireability-11 finished in 55905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-06-02 23:10:08] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 23:10:08] [INFO ] Invariant cache hit.
[2024-06-02 23:10:08] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 23:10:08] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 23:10:08] [INFO ] Invariant cache hit.
[2024-06-02 23:10:08] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:10:08] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-02 23:10:08] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 23:10:08] [INFO ] Invariant cache hit.
[2024-06-02 23:10:08] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:10:11] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-02 23:10:11] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:10:11] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:10:11] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:10:11] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:10:12] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 395/558 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 1/559 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:10:23] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-06-02 23:10:23] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 236 constraints, problems are : Problem set: 0 solved, 427 unsolved in 24477 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:10:35] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 395/558 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 427/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:10:43] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:10:44] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2024-06-02 23:10:48] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 667 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 54825ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 54831ms
Finished structural reductions in LTL mode , in 1 iterations and 55134 ms. Remains : 163/163 places, 428/428 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-12-LTLFireability-12
Product exploration explored 100000 steps with 4 reset in 54 ms.
Product exploration explored 100000 steps with 0 reset in 167 ms.
Computed a total of 19 stabilizing places and 31 stable transitions
Computed a total of 19 stabilizing places and 31 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
RANDOM walk for 6991 steps (184 resets) in 20 ms. (332 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-12-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-12-LTLFireability-12 finished in 55678 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((X(p0)&&(p1 U X(G(!p1))))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-06-02 23:11:03] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 23:11:03] [INFO ] Invariant cache hit.
[2024-06-02 23:11:04] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 23:11:04] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 23:11:04] [INFO ] Invariant cache hit.
[2024-06-02 23:11:04] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:11:04] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-02 23:11:04] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 23:11:04] [INFO ] Invariant cache hit.
[2024-06-02 23:11:04] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:11:06] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 0 ms to minimize.
[2024-06-02 23:11:07] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:11:07] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:11:07] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:11:07] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:11:07] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 395/558 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 1/559 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:11:18] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:11:18] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 236 constraints, problems are : Problem set: 0 solved, 427 unsolved in 23932 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:11:30] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 395/558 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 427/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:11:38] [INFO ] Deduced a trap composed of 43 places in 32 ms of which 1 ms to minimize.
[2024-06-02 23:11:39] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-06-02 23:11:43] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 667 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 54244ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 54249ms
Finished structural reductions in LTL mode , in 1 iterations and 54600 ms. Remains : 163/163 places, 428/428 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) p1), true, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : FireWire-PT-12-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-12-LTLFireability-13 finished in 54749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-06-02 23:11:58] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 23:11:58] [INFO ] Invariant cache hit.
[2024-06-02 23:11:58] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 23:11:58] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 23:11:58] [INFO ] Invariant cache hit.
[2024-06-02 23:11:58] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:11:59] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-06-02 23:11:59] [INFO ] Flow matrix only has 396 transitions (discarded 32 similar events)
[2024-06-02 23:11:59] [INFO ] Invariant cache hit.
[2024-06-02 23:11:59] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:12:01] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 1 ms to minimize.
[2024-06-02 23:12:02] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2024-06-02 23:12:02] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-06-02 23:12:02] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:12:02] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:12:02] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 395/558 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 57/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (OVERLAPS) 1/559 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:12:13] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:12:13] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/559 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 0/559 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 236 constraints, problems are : Problem set: 0 solved, 427 unsolved in 24794 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:12:25] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 395/558 variables, 163/179 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 427/663 constraints. Problems are: Problem set: 0 solved, 427 unsolved
[2024-06-02 23:12:34] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:12:34] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:12:39] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 10 (OVERLAPS) 1/559 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 667 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 12/12 constraints]
After SMT, in 55086ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 55091ms
Finished structural reductions in LTL mode , in 1 iterations and 55442 ms. Remains : 163/163 places, 428/428 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-12-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-12-LTLFireability-15 finished in 55538 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(G((F(G(!p0)) U !p1)))))'
Found a Lengthening insensitive property : FireWire-PT-12-LTLFireability-01
Stuttering acceptance computed with spot in 213 ms :[p1, p1, p1, p0, p1]
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 162 transition count 421
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 156 transition count 421
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 153 transition count 430
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 21 place count 153 transition count 427
Applied a total of 21 rules in 12 ms. Remains 153 /163 variables (removed 10) and now considering 427/428 (removed 1) transitions.
[2024-06-02 23:12:54] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
// Phase 1: matrix 388 rows 153 cols
[2024-06-02 23:12:54] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:12:54] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 23:12:54] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:12:54] [INFO ] Invariant cache hit.
[2024-06-02 23:12:54] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:12:54] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2024-06-02 23:12:54] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:12:54] [INFO ] Invariant cache hit.
[2024-06-02 23:12:54] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:12:56] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:12:56] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:12:56] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:12:56] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:12:57] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:12:57] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2024-06-02 23:12:57] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:12:58] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:12:59] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 387/540 variables, 153/169 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:13:03] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:13:03] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:13:05] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:13:06] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-06-02 23:13:06] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 5/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 0/540 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/541 variables, and 230 constraints, problems are : Problem set: 0 solved, 420 unsolved in 20259 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/540 variables, 153/174 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 420/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 0/540 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Int declared 540/541 variables, and 650 constraints, problems are : Problem set: 0 solved, 420 unsolved in 26167 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 14/14 constraints]
After SMT, in 46707ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 46711ms
Starting structural reductions in LI_LTL mode, iteration 1 : 153/163 places, 427/428 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 47038 ms. Remains : 153/163 places, 427/428 transitions.
Running random walk in product with property : FireWire-PT-12-LTLFireability-01
Product exploration explored 100000 steps with 5 reset in 46 ms.
Product exploration explored 100000 steps with 2 reset in 93 ms.
Computed a total of 12 stabilizing places and 27 stable transitions
Computed a total of 12 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[p1, p1, p1, p0, p1]
RANDOM walk for 40000 steps (1318 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (393 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (283 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1553930 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :1 out of 2
Probabilistic random walk after 1553930 steps, saw 336623 distinct states, run finished after 3001 ms. (steps per millisecond=517 ) properties seen :1
[2024-06-02 23:13:45] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:13:45] [INFO ] Invariant cache hit.
[2024-06-02 23:13:45] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 294/347 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 172/519 variables, 85/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/519 variables, 38/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/519 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/521 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/521 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 17/538 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/540 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/540 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/540 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/541 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 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) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 294/347 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 172/519 variables, 85/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/519 variables, 38/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/519 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/519 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/521 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/521 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 17/538 variables, 11/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/538 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/540 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/540 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/540 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 540/541 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 374ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 427/427 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 153 transition count 421
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 153 transition count 418
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 153 transition count 427
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 147 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 147 transition count 412
Applied a total of 36 rules in 21 ms. Remains 147 /153 variables (removed 6) and now considering 412/427 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 147/153 places, 412/427 transitions.
RANDOM walk for 40000 steps (1269 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (289 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1442799 steps, run timeout after 3001 ms. (steps per millisecond=480 ) properties seen :0 out of 1
Probabilistic random walk after 1442799 steps, saw 391950 distinct states, run finished after 3003 ms. (steps per millisecond=480 ) properties seen :0
[2024-06-02 23:13:48] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
// Phase 1: matrix 375 rows 147 cols
[2024-06-02 23:13:48] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:13:48] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/337 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 166/503 variables, 83/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 38/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/520 variables, 11/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/522 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/522 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/522 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/337 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 166/503 variables, 83/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 38/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/520 variables, 11/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/520 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/522 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/522 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 387ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 412/412 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 147/147 places, 412/412 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 412/412 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
[2024-06-02 23:13:49] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 23:13:49] [INFO ] Invariant cache hit.
[2024-06-02 23:13:49] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 23:13:49] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 23:13:49] [INFO ] Invariant cache hit.
[2024-06-02 23:13:49] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:13:49] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-06-02 23:13:49] [INFO ] Redundant transitions in 6 ms returned []
Running 406 sub problems to find dead transitions.
[2024-06-02 23:13:49] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 23:13:49] [INFO ] Invariant cache hit.
[2024-06-02 23:13:49] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 23:13:50] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:13:51] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:13:51] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:13:51] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:13:51] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:13:51] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-06-02 23:13:51] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 375/522 variables, 147/161 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 56/217 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 23:13:59] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 23:14:01] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:14:01] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (OVERLAPS) 0/522 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 220 constraints, problems are : Problem set: 0 solved, 406 unsolved in 21453 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 375/522 variables, 147/164 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 56/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 406/626 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 23:14:28] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:14:28] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:14:30] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/522 variables, 3/629 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/522 variables, and 629 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 13/13 constraints]
After SMT, in 51734ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 51740ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52093 ms. Remains : 147/147 places, 412/412 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 134 edges and 147 vertex of which 29 / 147 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 121 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 121 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 120 transition count 257
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 15 place count 120 transition count 256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 119 transition count 255
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 119 transition count 240
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 110 transition count 237
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 110 transition count 237
Applied a total of 44 rules in 24 ms. Remains 110 /147 variables (removed 37) and now considering 237/412 (removed 175) transitions.
Running SMT prover for 1 properties.
[2024-06-02 23:14:41] [INFO ] Flow matrix only has 235 transitions (discarded 2 similar events)
// Phase 1: matrix 235 rows 110 cols
[2024-06-02 23:14:41] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 23:14:41] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:14:41] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:14:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 23:14:41] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 23:14:41] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:14:41] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 235 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[p1, p1, p1, p0, p1]
Stuttering acceptance computed with spot in 169 ms :[p1, p1, p1, p0, p1]
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 427/427 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2024-06-02 23:14:41] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
// Phase 1: matrix 388 rows 153 cols
[2024-06-02 23:14:41] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:14:41] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 23:14:41] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:14:41] [INFO ] Invariant cache hit.
[2024-06-02 23:14:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:14:42] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2024-06-02 23:14:42] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:14:42] [INFO ] Invariant cache hit.
[2024-06-02 23:14:42] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:14:43] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:14:43] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:14:44] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:14:44] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
[2024-06-02 23:14:44] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-06-02 23:14:44] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:14:44] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:14:46] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:14:46] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 387/540 variables, 153/169 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:14:50] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 2 ms to minimize.
[2024-06-02 23:14:50] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:14:53] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-06-02 23:14:53] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:14:53] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 5/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 0/540 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/541 variables, and 230 constraints, problems are : Problem set: 0 solved, 420 unsolved in 20344 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/540 variables, 153/174 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 420/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 0/540 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Int declared 540/541 variables, and 650 constraints, problems are : Problem set: 0 solved, 420 unsolved in 27512 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 14/14 constraints]
After SMT, in 48144ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 48149ms
Finished structural reductions in LTL mode , in 1 iterations and 48472 ms. Remains : 153/153 places, 427/427 transitions.
Computed a total of 12 stabilizing places and 27 stable transitions
Computed a total of 12 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[p1, p1, p1, p0, p1]
RANDOM walk for 40000 steps (1222 resets) in 388 ms. (102 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (374 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (287 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1561237 steps, run timeout after 3001 ms. (steps per millisecond=520 ) properties seen :1 out of 2
Probabilistic random walk after 1561237 steps, saw 338123 distinct states, run finished after 3001 ms. (steps per millisecond=520 ) properties seen :1
[2024-06-02 23:15:33] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:15:33] [INFO ] Invariant cache hit.
[2024-06-02 23:15:33] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 294/347 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 172/519 variables, 85/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/519 variables, 38/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/519 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/521 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/521 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 17/538 variables, 11/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/540 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/540 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/540 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/541 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 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) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 294/347 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 172/519 variables, 85/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/519 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/519 variables, 38/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/519 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/519 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/521 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/521 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/521 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 17/538 variables, 11/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/538 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/538 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/540 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/540 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/540 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 540/541 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 383ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 427/427 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 153 transition count 421
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 153 transition count 418
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 153 transition count 427
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 147 transition count 418
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 147 transition count 412
Applied a total of 36 rules in 23 ms. Remains 147 /153 variables (removed 6) and now considering 412/427 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 147/153 places, 412/427 transitions.
RANDOM walk for 40000 steps (1331 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (285 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1447290 steps, run timeout after 3001 ms. (steps per millisecond=482 ) properties seen :0 out of 1
Probabilistic random walk after 1447290 steps, saw 393063 distinct states, run finished after 3001 ms. (steps per millisecond=482 ) properties seen :0
[2024-06-02 23:15:37] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
// Phase 1: matrix 375 rows 147 cols
[2024-06-02 23:15:37] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:15:37] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/337 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 166/503 variables, 83/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 38/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/520 variables, 11/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/522 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/522 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/522 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/337 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 166/503 variables, 83/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 38/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/520 variables, 11/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/520 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/520 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/522 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/522 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 353ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 412/412 transitions.
Applied a total of 0 rules in 7 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 147/147 places, 412/412 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 412/412 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 412/412 (removed 0) transitions.
[2024-06-02 23:15:37] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 23:15:37] [INFO ] Invariant cache hit.
[2024-06-02 23:15:37] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 23:15:37] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 23:15:37] [INFO ] Invariant cache hit.
[2024-06-02 23:15:37] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:15:37] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-06-02 23:15:37] [INFO ] Redundant transitions in 2 ms returned []
Running 406 sub problems to find dead transitions.
[2024-06-02 23:15:37] [INFO ] Flow matrix only has 375 transitions (discarded 37 similar events)
[2024-06-02 23:15:37] [INFO ] Invariant cache hit.
[2024-06-02 23:15:37] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 23:15:39] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:15:39] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:15:39] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-02 23:15:39] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2024-06-02 23:15:39] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:15:39] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 0 ms to minimize.
[2024-06-02 23:15:40] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 375/522 variables, 147/161 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 56/217 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 23:15:47] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 23:15:50] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:15:50] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (OVERLAPS) 0/522 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 220 constraints, problems are : Problem set: 0 solved, 406 unsolved in 21880 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (OVERLAPS) 375/522 variables, 147/164 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 56/220 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 406/626 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 406 unsolved
[2024-06-02 23:16:17] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:16:17] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:16:19] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/522 variables, 3/629 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/522 variables, and 629 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 147/147 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 13/13 constraints]
After SMT, in 52186ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 52189ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52491 ms. Remains : 147/147 places, 412/412 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 134 edges and 147 vertex of which 29 / 147 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 121 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 121 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 120 transition count 257
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 15 place count 120 transition count 256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 119 transition count 255
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 119 transition count 240
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 110 transition count 237
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 110 transition count 237
Applied a total of 44 rules in 20 ms. Remains 110 /147 variables (removed 37) and now considering 237/412 (removed 175) transitions.
Running SMT prover for 1 properties.
[2024-06-02 23:16:30] [INFO ] Flow matrix only has 235 transitions (discarded 2 similar events)
// Phase 1: matrix 235 rows 110 cols
[2024-06-02 23:16:30] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:16:30] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:16:30] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:16:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:16:30] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 23:16:30] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:16:30] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 232 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[p1, p1, p1, p0, p1]
Stuttering acceptance computed with spot in 204 ms :[p1, p1, p1, p0, p1]
Stuttering acceptance computed with spot in 211 ms :[p1, p1, p1, p0, p1]
Product exploration explored 100000 steps with 14 reset in 56 ms.
Product exploration explored 100000 steps with 6 reset in 57 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 186 ms :[p1, p1, p1, p0, p1]
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 427/427 transitions.
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 3 place count 153 transition count 424
Applied a total of 3 rules in 12 ms. Remains 153 /153 variables (removed 0) and now considering 424/427 (removed 3) transitions.
[2024-06-02 23:16:31] [INFO ] Redundant transitions in 3 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 23:16:31] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
// Phase 1: matrix 385 rows 153 cols
[2024-06-02 23:16:31] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:16:31] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:16:33] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:16:33] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:16:33] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:16:33] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-06-02 23:16:33] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:16:33] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/222 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:16:41] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 0 ms to minimize.
[2024-06-02 23:16:41] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:16:41] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:16:42] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:16:49] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/537 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 537/538 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 28172 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/537 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:17:08] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:17:10] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:17:10] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/537 variables, 3/647 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 23:17:21] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/537 variables, 1/648 constraints. Problems are: Problem set: 0 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 537/538 variables, and 648 constraints, problems are : Problem set: 0 solved, 417 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 15/15 constraints]
After SMT, in 58496ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 58500ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/153 places, 424/427 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58524 ms. Remains : 153/153 places, 424/427 transitions.
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 427/427 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 427/427 (removed 0) transitions.
[2024-06-02 23:17:30] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
// Phase 1: matrix 388 rows 153 cols
[2024-06-02 23:17:30] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:17:30] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 23:17:30] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:17:30] [INFO ] Invariant cache hit.
[2024-06-02 23:17:30] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:17:30] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2024-06-02 23:17:30] [INFO ] Flow matrix only has 388 transitions (discarded 39 similar events)
[2024-06-02 23:17:30] [INFO ] Invariant cache hit.
[2024-06-02 23:17:30] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:17:32] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:17:32] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:17:32] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:17:32] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-06-02 23:17:32] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2024-06-02 23:17:32] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:17:32] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:17:34] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:17:34] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (OVERLAPS) 387/540 variables, 153/169 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-06-02 23:17:39] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:17:39] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:17:41] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 0 ms to minimize.
[2024-06-02 23:17:41] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:17:41] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 5/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 8 (OVERLAPS) 0/540 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Real declared 540/541 variables, and 230 constraints, problems are : Problem set: 0 solved, 420 unsolved in 20580 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (OVERLAPS) 387/540 variables, 153/174 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/540 variables, 56/230 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 420/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 7 (OVERLAPS) 0/540 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 420 unsolved
No progress, stopping.
After SMT solving in domain Int declared 540/541 variables, and 650 constraints, problems are : Problem set: 0 solved, 420 unsolved in 26349 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 153/153 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 14/14 constraints]
After SMT, in 47230ms problems are : Problem set: 0 solved, 420 unsolved
Search for dead transitions found 0 dead transitions in 47235ms
Finished structural reductions in LTL mode , in 1 iterations and 47568 ms. Remains : 153/153 places, 427/427 transitions.
Treatment of property FireWire-PT-12-LTLFireability-01 finished in 323379 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||(F(p1)&&F(G(p2))))) U 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' '!(F((G(F(!p0))||(F(!p0)&&(p2||F(p0))&&p1))))'
[2024-06-02 23:18:17] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:18:17] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-02 23:18:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 163 places, 428 transitions and 1570 arcs took 5 ms.
Total runtime 1801594 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-12

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 163
TRANSITIONS: 428
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.002s]


SAVING FILE /home/mcc/execution/411/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: 3632
MODEL NAME: /home/mcc/execution/411/model
163 places, 428 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-12-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-12-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-12-LTLFireability-01 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717370758555

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
MEDDLY ERROR: Insufficient memory

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

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