About the Execution of LTSMin+red for MedleyA-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 872.960 | 622872.00 | 709723.00 | 2125.60 | FFFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r579-smll-171734921100036.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 ltsminxred
Input is MedleyA-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921100036
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 75K 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 MedleyA-PT-05-LTLFireability-00
FORMULA_NAME MedleyA-PT-05-LTLFireability-01
FORMULA_NAME MedleyA-PT-05-LTLFireability-02
FORMULA_NAME MedleyA-PT-05-LTLFireability-03
FORMULA_NAME MedleyA-PT-05-LTLFireability-04
FORMULA_NAME MedleyA-PT-05-LTLFireability-05
FORMULA_NAME MedleyA-PT-05-LTLFireability-06
FORMULA_NAME MedleyA-PT-05-LTLFireability-07
FORMULA_NAME MedleyA-PT-05-LTLFireability-08
FORMULA_NAME MedleyA-PT-05-LTLFireability-09
FORMULA_NAME MedleyA-PT-05-LTLFireability-10
FORMULA_NAME MedleyA-PT-05-LTLFireability-11
FORMULA_NAME MedleyA-PT-05-LTLFireability-12
FORMULA_NAME MedleyA-PT-05-LTLFireability-13
FORMULA_NAME MedleyA-PT-05-LTLFireability-14
FORMULA_NAME MedleyA-PT-05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717352794040
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:26:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:26:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:26:37] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2024-06-02 18:26:37] [INFO ] Transformed 115 places.
[2024-06-02 18:26:37] [INFO ] Transformed 257 transitions.
[2024-06-02 18:26:37] [INFO ] Found NUPN structural information;
[2024-06-02 18:26:37] [INFO ] Parsed PT model containing 115 places and 257 transitions and 1160 arcs in 369 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA MedleyA-PT-05-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 254/254 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 101 transition count 226
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 101 transition count 226
Applied a total of 28 rules in 53 ms. Remains 101 /115 variables (removed 14) and now considering 226/254 (removed 28) transitions.
[2024-06-02 18:26:37] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
// Phase 1: matrix 225 rows 101 cols
[2024-06-02 18:26:37] [INFO ] Computed 20 invariants in 23 ms
[2024-06-02 18:26:38] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-06-02 18:26:38] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
[2024-06-02 18:26:38] [INFO ] Invariant cache hit.
[2024-06-02 18:26:38] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:26:38] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-06-02 18:26:38] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
[2024-06-02 18:26:38] [INFO ] Invariant cache hit.
[2024-06-02 18:26:38] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 18:26:41] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 27 ms to minimize.
[2024-06-02 18:26:41] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 4 ms to minimize.
[2024-06-02 18:26:41] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 224/325 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 93/217 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 0/326 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 218 constraints, problems are : Problem set: 0 solved, 225 unsolved in 14953 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 224/325 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 93/217 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 225/442 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 1/326 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 18:27:09] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/326 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (OVERLAPS) 0/326 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 444 constraints, problems are : Problem set: 0 solved, 225 unsolved in 27948 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 4/4 constraints]
After SMT, in 43312ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 43344ms
Starting structural reductions in LTL mode, iteration 1 : 101/115 places, 226/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44308 ms. Remains : 101/115 places, 226/254 transitions.
Support contains 42 out of 101 places after structural reductions.
[2024-06-02 18:27:22] [INFO ] Flatten gal took : 107 ms
[2024-06-02 18:27:22] [INFO ] Flatten gal took : 82 ms
[2024-06-02 18:27:22] [INFO ] Input system was already deterministic with 226 transitions.
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 40000 steps (2965 resets) in 3152 ms. (12 steps per ms) remains 9/30 properties
BEST_FIRST walk for 40004 steps (451 resets) in 196 ms. (203 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (495 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (486 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (264 resets) in 68 ms. (579 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (423 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (370 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (373 resets) in 146 ms. (272 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (454 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (463 resets) in 79 ms. (500 steps per ms) remains 5/6 properties
[2024-06-02 18:27:24] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
[2024-06-02 18:27:24] [INFO ] Invariant cache hit.
[2024-06-02 18:27:24] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 53/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 24/86 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 13/99 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 18:27:24] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 223/322 variables, 99/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/325 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/326 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/326 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 216 constraints, problems are : Problem set: 0 solved, 5 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 53/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 24/86 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 13/99 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 223/322 variables, 99/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3/325 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/325 variables, 4/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/325 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/326 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/326 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/326 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 221 constraints, problems are : Problem set: 0 solved, 5 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 1018ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 1733 steps, including 21 resets, run visited all 1 properties in 9 ms. (steps per millisecond=192 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 89 ms.
Computed a total of 13 stabilizing places and 86 stable transitions
Graph (complete) has 506 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p0)&&F(!p1))||G(p0))))'
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 8 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 18:27:25] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 18:27:25] [INFO ] Computed 20 invariants in 4 ms
[2024-06-02 18:27:25] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 18:27:25] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:27:25] [INFO ] Invariant cache hit.
[2024-06-02 18:27:25] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:27:25] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:27:25] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:27:25] [INFO ] Invariant cache hit.
[2024-06-02 18:27:25] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:27:28] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 12862 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 15824 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 28900ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 28906ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29210 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 452 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-01
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-01 finished in 29773 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 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Graph (complete) has 506 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 98 transition count 223
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 6 place count 95 transition count 217
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 95 transition count 217
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 27 place count 86 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 31 place count 86 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 43 place count 86 transition count 255
Applied a total of 43 rules in 92 ms. Remains 86 /101 variables (removed 15) and now considering 255/226 (removed -29) transitions.
[2024-06-02 18:27:55] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
// Phase 1: matrix 254 rows 86 cols
[2024-06-02 18:27:55] [INFO ] Computed 20 invariants in 5 ms
[2024-06-02 18:27:55] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-02 18:27:55] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2024-06-02 18:27:55] [INFO ] Invariant cache hit.
[2024-06-02 18:27:55] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 18:27:55] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-06-02 18:27:55] [INFO ] Redundant transitions in 103 ms returned []
Running 246 sub problems to find dead transitions.
[2024-06-02 18:27:55] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2024-06-02 18:27:55] [INFO ] Invariant cache hit.
[2024-06-02 18:27:55] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-06-02 18:28:00] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 253/339 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 28/135 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 9 (OVERLAPS) 1/340 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 11 (OVERLAPS) 0/340 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 136 constraints, problems are : Problem set: 0 solved, 246 unsolved in 15764 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 253/339 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 28/135 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 246/381 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 10 (OVERLAPS) 1/340 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 12 (OVERLAPS) 0/340 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 382 constraints, problems are : Problem set: 0 solved, 246 unsolved in 19545 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 1/1 constraints]
After SMT, in 35788ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 35794ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/101 places, 255/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36402 ms. Remains : 86/101 places, 255/226 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-02
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-02 finished in 36505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 5 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 18:28:31] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 18:28:31] [INFO ] Computed 20 invariants in 4 ms
[2024-06-02 18:28:31] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-02 18:28:31] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:28:31] [INFO ] Invariant cache hit.
[2024-06-02 18:28:32] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:28:32] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:28:32] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:28:32] [INFO ] Invariant cache hit.
[2024-06-02 18:28:32] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:28:34] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 12107 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 16762 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 29073ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 29078ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29564 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-03 finished in 29729 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||(p1&&X(p1))))&&F(G(p2)))))'
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 5 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 18:29:01] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:29:01] [INFO ] Invariant cache hit.
[2024-06-02 18:29:01] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 18:29:01] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:29:01] [INFO ] Invariant cache hit.
[2024-06-02 18:29:01] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:29:01] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:29:01] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:29:01] [INFO ] Invariant cache hit.
[2024-06-02 18:29:01] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:29:03] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 12559 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 16726 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 29453ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 29456ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29770 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-04
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-04 finished in 30007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p1)&&p0))||X(G(p2)))))'
Support contains 7 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 98 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 98 transition count 220
Applied a total of 6 rules in 8 ms. Remains 98 /101 variables (removed 3) and now considering 220/226 (removed 6) transitions.
[2024-06-02 18:29:31] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
// Phase 1: matrix 219 rows 98 cols
[2024-06-02 18:29:31] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 18:29:31] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-02 18:29:31] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 18:29:31] [INFO ] Invariant cache hit.
[2024-06-02 18:29:31] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:29:31] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-06-02 18:29:31] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 18:29:31] [INFO ] Invariant cache hit.
[2024-06-02 18:29:32] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-02 18:29:34] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-02 18:29:39] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/317 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/317 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 214 constraints, problems are : Problem set: 0 solved, 219 unsolved in 15671 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 219/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/317 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/317 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 433 constraints, problems are : Problem set: 0 solved, 219 unsolved in 18780 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints]
After SMT, in 34650ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 34654ms
Starting structural reductions in LTL mode, iteration 1 : 98/101 places, 220/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35078 ms. Remains : 98/101 places, 220/226 transitions.
Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-05
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-05 finished in 35442 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(p0))))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 9 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 18:30:07] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 18:30:07] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 18:30:07] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 18:30:07] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:30:07] [INFO ] Invariant cache hit.
[2024-06-02 18:30:07] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:30:07] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:30:07] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:30:07] [INFO ] Invariant cache hit.
[2024-06-02 18:30:07] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:30:09] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 13472 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 15709 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 29391ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 29396ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29848 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-06 finished in 30007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1))||F((F(p3)&&p2)))))'
Support contains 9 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 8 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 18:30:37] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:30:37] [INFO ] Invariant cache hit.
[2024-06-02 18:30:37] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-02 18:30:37] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:30:37] [INFO ] Invariant cache hit.
[2024-06-02 18:30:37] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:30:37] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:30:37] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:30:37] [INFO ] Invariant cache hit.
[2024-06-02 18:30:37] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:30:39] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 11889 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 18305 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 30389ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 30393ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30809 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-07
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-07 finished in 31142 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(F((p0||X(F(p1)))))))'
Support contains 7 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 6 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 18:31:08] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:31:08] [INFO ] Invariant cache hit.
[2024-06-02 18:31:08] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 18:31:08] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:31:08] [INFO ] Invariant cache hit.
[2024-06-02 18:31:08] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:31:08] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:31:08] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:31:08] [INFO ] Invariant cache hit.
[2024-06-02 18:31:08] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:31:10] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 13557 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 17545 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 31218ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 31220ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31567 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-08
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-08 finished in 31798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0) U G(p1))))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 99 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 99 transition count 222
Applied a total of 4 rules in 11 ms. Remains 99 /101 variables (removed 2) and now considering 222/226 (removed 4) transitions.
[2024-06-02 18:31:39] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
// Phase 1: matrix 221 rows 99 cols
[2024-06-02 18:31:39] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:31:40] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 18:31:40] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 18:31:40] [INFO ] Invariant cache hit.
[2024-06-02 18:31:40] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:31:40] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-02 18:31:40] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 18:31:40] [INFO ] Invariant cache hit.
[2024-06-02 18:31:40] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-02 18:31:42] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-06-02 18:31:42] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:31:42] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 220/319 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 93/215 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/320 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 216 constraints, problems are : Problem set: 0 solved, 221 unsolved in 13306 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 220/319 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 93/215 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 221/436 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/320 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/320 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 437 constraints, problems are : Problem set: 0 solved, 221 unsolved in 19155 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints]
After SMT, in 32620ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 32624ms
Starting structural reductions in LTL mode, iteration 1 : 99/101 places, 222/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33025 ms. Remains : 99/101 places, 222/226 transitions.
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-09 finished in 33328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Graph (complete) has 506 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 99 transition count 224
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 7 place count 95 transition count 216
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 95 transition count 216
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -81
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 33 place count 84 transition count 297
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 37 place count 84 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 3 with 37 rules applied. Total rules applied 74 place count 84 transition count 256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 83 transition count 263
Applied a total of 76 rules in 54 ms. Remains 83 /101 variables (removed 18) and now considering 263/226 (removed -37) transitions.
[2024-06-02 18:32:13] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
// Phase 1: matrix 262 rows 83 cols
[2024-06-02 18:32:13] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 18:32:13] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 18:32:13] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 18:32:13] [INFO ] Invariant cache hit.
[2024-06-02 18:32:13] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-06-02 18:32:13] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2024-06-02 18:32:13] [INFO ] Redundant transitions in 93 ms returned []
Running 261 sub problems to find dead transitions.
[2024-06-02 18:32:13] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 18:32:13] [INFO ] Invariant cache hit.
[2024-06-02 18:32:13] [INFO ] State equation strengthened by 142 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-02 18:32:16] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 261/344 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 141/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 1/345 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 0/345 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 246 constraints, problems are : Problem set: 0 solved, 261 unsolved in 17422 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 261/344 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 141/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 261/506 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 1/345 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 0/345 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 507 constraints, problems are : Problem set: 0 solved, 261 unsolved in 23413 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
After SMT, in 41341ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 41346ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/101 places, 263/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41973 ms. Remains : 83/101 places, 263/226 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-10
Product exploration explored 100000 steps with 2 reset in 207 ms.
Product exploration explored 100000 steps with 0 reset in 232 ms.
Computed a total of 11 stabilizing places and 134 stable transitions
Computed a total of 11 stabilizing places and 134 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1401 steps (127 resets) in 20 ms. (66 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 263/263 transitions.
Applied a total of 0 rules in 16 ms. Remains 83 /83 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-06-02 18:32:56] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 18:32:56] [INFO ] Invariant cache hit.
[2024-06-02 18:32:56] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-02 18:32:56] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 18:32:56] [INFO ] Invariant cache hit.
[2024-06-02 18:32:56] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-06-02 18:32:56] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2024-06-02 18:32:57] [INFO ] Redundant transitions in 70 ms returned []
Running 261 sub problems to find dead transitions.
[2024-06-02 18:32:57] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 18:32:57] [INFO ] Invariant cache hit.
[2024-06-02 18:32:57] [INFO ] State equation strengthened by 142 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-02 18:33:00] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 261/344 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 141/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 1/345 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 0/345 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 246 constraints, problems are : Problem set: 0 solved, 261 unsolved in 14758 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 261/344 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 141/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 261/506 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 1/345 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 0/345 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 507 constraints, problems are : Problem set: 0 solved, 261 unsolved in 24622 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
After SMT, in 39877ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 39884ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40502 ms. Remains : 83/83 places, 263/263 transitions.
Computed a total of 11 stabilizing places and 134 stable transitions
Computed a total of 11 stabilizing places and 134 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1876 steps (170 resets) in 23 ms. (78 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 175 ms.
Product exploration explored 100000 steps with 0 reset in 189 ms.
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 263/263 transitions.
Applied a total of 0 rules in 15 ms. Remains 83 /83 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-06-02 18:33:38] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 18:33:38] [INFO ] Invariant cache hit.
[2024-06-02 18:33:38] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-06-02 18:33:38] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 18:33:38] [INFO ] Invariant cache hit.
[2024-06-02 18:33:38] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-06-02 18:33:38] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2024-06-02 18:33:38] [INFO ] Redundant transitions in 70 ms returned []
Running 261 sub problems to find dead transitions.
[2024-06-02 18:33:38] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 18:33:38] [INFO ] Invariant cache hit.
[2024-06-02 18:33:38] [INFO ] State equation strengthened by 142 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 261/344 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 141/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 1/345 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 0/345 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 246 constraints, problems are : Problem set: 0 solved, 261 unsolved in 15905 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 261/344 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 141/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 261/506 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 1/345 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 0/345 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 507 constraints, problems are : Problem set: 0 solved, 261 unsolved in 25138 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
After SMT, in 41547ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 41552ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42175 ms. Remains : 83/83 places, 263/263 transitions.
Treatment of property MedleyA-PT-05-LTLFireability-10 finished in 127105 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(((p1 U !p2)&&p0))))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 3 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 18:34:20] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 18:34:20] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 18:34:20] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 18:34:20] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:34:20] [INFO ] Invariant cache hit.
[2024-06-02 18:34:20] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:34:20] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:34:20] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:34:20] [INFO ] Invariant cache hit.
[2024-06-02 18:34:20] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:34:22] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 12565 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 17499 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 30195ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 30198ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30454 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) p2), p2, (OR (NOT p0) p2)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-12
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-12 finished in 30613 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(((F((G(F(!p1))||(!p2&&F(!p1))))&&p0)||(p3&&G(p4)&&F((G(F(!p1))||(!p2&&F(!p1)))))))))'
Support contains 12 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Graph (complete) has 506 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 100 transition count 224
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 99 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 7 place count 95 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 95 transition count 216
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 31 place count 85 transition count 285
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 35 place count 85 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 60 place count 85 transition count 256
Applied a total of 60 rules in 34 ms. Remains 85 /101 variables (removed 16) and now considering 256/226 (removed -30) transitions.
[2024-06-02 18:34:51] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
// Phase 1: matrix 255 rows 85 cols
[2024-06-02 18:34:51] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:34:51] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 18:34:51] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 18:34:51] [INFO ] Invariant cache hit.
[2024-06-02 18:34:51] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-06-02 18:34:51] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-06-02 18:34:51] [INFO ] Redundant transitions in 42 ms returned []
Running 255 sub problems to find dead transitions.
[2024-06-02 18:34:51] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 18:34:51] [INFO ] Invariant cache hit.
[2024-06-02 18:34:51] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-02 18:34:53] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 254/339 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 137/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 1/340 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (OVERLAPS) 0/340 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 244 constraints, problems are : Problem set: 0 solved, 255 unsolved in 14794 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 254/339 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 137/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 255/498 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (OVERLAPS) 1/340 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/340 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 499 constraints, problems are : Problem set: 0 solved, 255 unsolved in 23250 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 1/1 constraints]
After SMT, in 38418ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 38421ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/101 places, 256/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38758 ms. Remains : 85/101 places, 256/226 transitions.
Stuttering acceptance computed with spot in 439 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4)), (AND p1 (NOT p4))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 447 ms.
Product exploration explored 100000 steps with 1 reset in 409 ms.
Computed a total of 11 stabilizing places and 127 stable transitions
Computed a total of 11 stabilizing places and 127 stable transitions
Knowledge obtained : [(AND p0 p3 p4 (NOT p1) (NOT p2)), (X (NOT p2)), (X p3), (X p4), (X (NOT (OR (AND p0 p2) (AND p3 p2 p4)))), (X (NOT (AND (NOT p0) p3 p4))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))))), (X p0), (X (NOT (OR (AND p0 p1) (AND p3 p1 p4)))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X p4)), (X (X (NOT (OR (AND p0 p2) (AND p3 p2 p4))))), (X (X (NOT (AND p0 p2 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (AND (NOT p0) p3 p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4)))))), (X (X (NOT (AND p0 p1 (NOT p4))))), (X (X (NOT (AND p0 p1 (NOT p2) p4)))), (X (X p0)), (X (X (NOT (OR (AND p0 p1) (AND p3 p1 p4))))), (X (X (NOT (AND p0 p2 p4)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 185 ms. Reduced automaton from 7 states, 22 edges and 5 AP (stutter insensitive) to 7 states, 22 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 370 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4)), (AND p1 (NOT p4))]
RANDOM walk for 40000 steps (3413 resets) in 1893 ms. (21 steps per ms) remains 11/20 properties
BEST_FIRST walk for 40003 steps (239 resets) in 326 ms. (122 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (236 resets) in 347 ms. (114 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (240 resets) in 223 ms. (178 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (255 resets) in 272 ms. (146 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (232 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (247 resets) in 148 ms. (268 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (202 resets) in 529 ms. (75 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (395 resets) in 169 ms. (235 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (239 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (240 resets) in 90 ms. (439 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (246 resets) in 121 ms. (327 steps per ms) remains 11/11 properties
[2024-06-02 18:35:33] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 18:35:33] [INFO ] Invariant cache hit.
[2024-06-02 18:35:33] [INFO ] State equation strengthened by 138 read => feed constraints.
Problem apf2 is UNSAT
Problem apf18 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 46/58 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 16/74 variables, 5/15 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 11/85 variables, 5/20 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 254/339 variables, 85/105 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 137/242 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/242 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 1/340 variables, 1/243 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/243 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/340 variables, 0/243 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 243 constraints, problems are : Problem set: 2 solved, 9 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 46/58 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 16/74 variables, 5/15 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 11/85 variables, 5/20 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 254/339 variables, 85/105 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 137/242 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 9/251 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/251 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/340 variables, 1/252 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/252 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/340 variables, 0/252 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 252 constraints, problems are : Problem set: 2 solved, 9 unsolved in 1613 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 9/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 2249ms problems are : Problem set: 2 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
Finished Parikh walk after 4294 steps, including 68 resets, run visited all 9 properties in 98 ms. (steps per millisecond=43 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 100 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p4 (NOT p1) (NOT p2)), (X (NOT p2)), (X p3), (X p4), (X (NOT (OR (AND p0 p2) (AND p3 p2 p4)))), (X (NOT (AND (NOT p0) p3 p4))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))))), (X p0), (X (NOT (OR (AND p0 p1) (AND p3 p1 p4)))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X p4)), (X (X (NOT (OR (AND p0 p2) (AND p3 p2 p4))))), (X (X (NOT (AND p0 p2 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (AND (NOT p0) p3 p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4)))))), (X (X (NOT (AND p0 p1 (NOT p4))))), (X (X (NOT (AND p0 p1 (NOT p2) p4)))), (X (X p0)), (X (X (NOT (OR (AND p0 p1) (AND p3 p1 p4))))), (X (X (NOT (AND p0 p2 p4)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p2) (NOT p4))), (G (OR (NOT p2) (NOT p4)))]
False Knowledge obtained : [(F (NOT (OR p0 p4))), (F (NOT (OR p4 (NOT p1)))), (F (NOT (OR p0 (NOT p4)))), (F (NOT (OR (NOT p0) p2 (NOT p4) (NOT p1)))), (F (NOT p4)), (F (NOT (AND (OR (NOT p0) (NOT p1)) (OR (NOT p3) (NOT p4) (NOT p1))))), (F (NOT (OR (NOT p4) (NOT p1)))), (F (NOT (AND (OR (NOT p0) (NOT p2)) (OR (NOT p2) (NOT p3) (NOT p4))))), (F (NOT (OR (NOT p0) p4 (NOT p1)))), (F (NOT (OR (NOT p2) p4))), (F (NOT (OR (NOT p0) (NOT p2) p4))), (F p1), (F p2), (F (NOT p0)), (F (NOT (OR p2 (NOT p4) (NOT p1)))), (F (NOT p3)), (F (NOT (AND (OR p0 p3) (OR p0 p4)))), (F (NOT (OR p0 (NOT p3) (NOT p4))))]
Knowledge based reduction with 27 factoid took 1290 ms. Reduced automaton from 7 states, 22 edges and 5 AP (stutter insensitive) to 6 states, 17 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 392 ms :[(OR p1 (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR p1 (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Stuttering acceptance computed with spot in 417 ms :[(OR p1 (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR p1 (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Support contains 12 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 256/256 transitions.
Applied a total of 0 rules in 14 ms. Remains 85 /85 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-06-02 18:35:37] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 18:35:37] [INFO ] Invariant cache hit.
[2024-06-02 18:35:37] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 18:35:37] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 18:35:37] [INFO ] Invariant cache hit.
[2024-06-02 18:35:37] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-06-02 18:35:38] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-06-02 18:35:38] [INFO ] Redundant transitions in 68 ms returned []
Running 255 sub problems to find dead transitions.
[2024-06-02 18:35:38] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 18:35:38] [INFO ] Invariant cache hit.
[2024-06-02 18:35:38] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-02 18:35:41] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 254/339 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 137/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 1/340 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (OVERLAPS) 0/340 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 244 constraints, problems are : Problem set: 0 solved, 255 unsolved in 15618 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 254/339 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 137/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 255/498 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (OVERLAPS) 1/340 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/340 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 499 constraints, problems are : Problem set: 0 solved, 255 unsolved in 22043 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 1/1 constraints]
After SMT, in 38182ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 38187ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38667 ms. Remains : 85/85 places, 256/256 transitions.
Computed a total of 11 stabilizing places and 127 stable transitions
Computed a total of 11 stabilizing places and 127 stable transitions
Knowledge obtained : [(AND p0 p4 p3 (NOT p1) (NOT p2)), (X (NOT p2)), (X p3), (X p4), (X (NOT (AND (NOT p0) p4 p3))), (X (NOT (OR (AND p0 p1) (AND p4 p3 p1)))), (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))))), (X p0), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X p4)), (X (X (NOT (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (AND (NOT p0) p4 p3)))), (X (X (NOT (OR (AND p0 p1) (AND p4 p3 p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3)))))), (X (X (NOT (OR (AND p0 p2 p1) (AND p0 (NOT p4) p1))))), (X (X (NOT (AND p0 (NOT p2) p4 p1)))), (X (X p0)), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 215 ms. Reduced automaton from 6 states, 17 edges and 5 AP (stutter insensitive) to 6 states, 17 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 418 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
RANDOM walk for 40000 steps (3408 resets) in 1298 ms. (30 steps per ms) remains 7/15 properties
BEST_FIRST walk for 40004 steps (247 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (233 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (244 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (194 resets) in 197 ms. (202 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (386 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (248 resets) in 279 ms. (142 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (247 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
[2024-06-02 18:36:17] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 18:36:17] [INFO ] Invariant cache hit.
[2024-06-02 18:36:17] [INFO ] State equation strengthened by 138 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 46/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 16/74 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 11/85 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 254/339 variables, 85/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 137/242 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/340 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/340 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 243 constraints, problems are : Problem set: 0 solved, 7 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 46/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 16/74 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 11/85 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 254/339 variables, 85/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 137/242 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 7/249 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/340 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/340 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 250 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1523 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 2166ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 591 ms.
Support contains 12 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 256/256 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 85 transition count 254
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 15 place count 85 transition count 308
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 43 place count 72 transition count 293
Applied a total of 43 rules in 43 ms. Remains 72 /85 variables (removed 13) and now considering 293/256 (removed -37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 72/85 places, 293/256 transitions.
RANDOM walk for 40000 steps (4655 resets) in 1508 ms. (26 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (295 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (230 resets) in 215 ms. (185 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (549 resets) in 274 ms. (145 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (285 resets) in 243 ms. (163 steps per ms) remains 3/3 properties
// Phase 1: matrix 293 rows 72 cols
[2024-06-02 18:36:21] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 18:36:21] [INFO ] State equation strengthened by 163 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/63 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/72 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 293/365 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 163/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 255 constraints, problems are : Problem set: 0 solved, 3 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 72/72 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/63 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/72 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 293/365 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 163/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/365 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 258 constraints, problems are : Problem set: 0 solved, 3 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 72/72 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1025ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 225 steps, including 21 resets, run visited all 1 properties in 4 ms. (steps per millisecond=56 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 41 ms.
Knowledge obtained : [(AND p0 p4 p3 (NOT p1) (NOT p2)), (X (NOT p2)), (X p3), (X p4), (X (NOT (AND (NOT p0) p4 p3))), (X (NOT (OR (AND p0 p1) (AND p4 p3 p1)))), (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))))), (X p0), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X p4)), (X (X (NOT (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (AND (NOT p0) p4 p3)))), (X (X (NOT (OR (AND p0 p1) (AND p4 p3 p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3)))))), (X (X (NOT (OR (AND p0 p2 p1) (AND p0 (NOT p4) p1))))), (X (X (NOT (AND p0 (NOT p2) p4 p1)))), (X (X p0)), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p3) (OR p0 p4)))), (F (NOT (OR p0 (NOT p3) (NOT p4)))), (F (NOT (OR (NOT p0) (NOT p4) (NOT p1) p2))), (F (NOT (OR p4 (NOT p1)))), (F p1), (F (NOT p4)), (F (NOT (OR p0 (NOT p4)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 p4))), (F p2), (F (NOT (OR (NOT p4) (NOT p1)))), (F (NOT p3)), (F (NOT (AND (OR (NOT p0) p4 (NOT p1)) (OR (NOT p0) (NOT p1) (NOT p2))))), (F (NOT (AND (OR (NOT p0) (NOT p1)) (OR (NOT p3) (NOT p4) (NOT p1)))))]
Knowledge based reduction with 23 factoid took 1272 ms. Reduced automaton from 6 states, 17 edges and 5 AP (stutter insensitive) to 6 states, 17 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 406 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Stuttering acceptance computed with spot in 396 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Stuttering acceptance computed with spot in 398 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-13 finished in 93958 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&&F(G(p1))))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 4 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 18:36:24] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 18:36:24] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:36:25] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-02 18:36:25] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:36:25] [INFO ] Invariant cache hit.
[2024-06-02 18:36:25] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:36:25] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:36:25] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:36:25] [INFO ] Invariant cache hit.
[2024-06-02 18:36:25] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:36:27] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 13455 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 16858 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 30516ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 30520ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30979 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-15
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-15 finished in 31216 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)))'
[2024-06-02 18:36:56] [INFO ] Flatten gal took : 35 ms
[2024-06-02 18:36:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-02 18:36:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 101 places, 226 transitions and 1095 arcs took 12 ms.
Total runtime 619729 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MedleyA-PT-05-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717353416912
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name MedleyA-PT-05-LTLFireability-10
ltl formula formula --ltl=/tmp/1512/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 101 places, 226 transitions and 1095 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1512/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1512/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1512/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1512/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 103 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 102, there are 235 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~30!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1052
pnml2lts-mc( 0/ 4): unique states count: 1189
pnml2lts-mc( 0/ 4): unique transitions count: 3591
pnml2lts-mc( 0/ 4): - self-loop count: 64
pnml2lts-mc( 0/ 4): - claim dead count: 2068
pnml2lts-mc( 0/ 4): - claim found count: 72
pnml2lts-mc( 0/ 4): - claim success count: 1195
pnml2lts-mc( 0/ 4): - cum. max stack depth: 86
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1195 states 3625 transitions, fanout: 3.033
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 59750, Transitions per second: 181250
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 15.8 B/state, compr.: 3.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 226 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
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="MedleyA-PT-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is MedleyA-PT-05, 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 r579-smll-171734921100036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-05.tgz
mv MedleyA-PT-05 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 '
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 ;