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-171734921300116.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-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921300116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 110K 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-15-LTLFireability-00
FORMULA_NAME MedleyA-PT-15-LTLFireability-01
FORMULA_NAME MedleyA-PT-15-LTLFireability-02
FORMULA_NAME MedleyA-PT-15-LTLFireability-03
FORMULA_NAME MedleyA-PT-15-LTLFireability-04
FORMULA_NAME MedleyA-PT-15-LTLFireability-05
FORMULA_NAME MedleyA-PT-15-LTLFireability-06
FORMULA_NAME MedleyA-PT-15-LTLFireability-07
FORMULA_NAME MedleyA-PT-15-LTLFireability-08
FORMULA_NAME MedleyA-PT-15-LTLFireability-09
FORMULA_NAME MedleyA-PT-15-LTLFireability-10
FORMULA_NAME MedleyA-PT-15-LTLFireability-11
FORMULA_NAME MedleyA-PT-15-LTLFireability-12
FORMULA_NAME MedleyA-PT-15-LTLFireability-13
FORMULA_NAME MedleyA-PT-15-LTLFireability-14
FORMULA_NAME MedleyA-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717357824090

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-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:50:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:50:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:50:26] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2024-06-02 19:50:26] [INFO ] Transformed 192 places.
[2024-06-02 19:50:26] [INFO ] Transformed 475 transitions.
[2024-06-02 19:50:26] [INFO ] Found NUPN structural information;
[2024-06-02 19:50:26] [INFO ] Parsed PT model containing 192 places and 475 transitions and 1522 arcs in 399 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 108 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-15-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-15-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 473/473 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 151 transition count 406
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 151 transition count 406
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 105 place count 151 transition count 383
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 149 transition count 379
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 149 transition count 379
Applied a total of 109 rules in 102 ms. Remains 149 /192 variables (removed 43) and now considering 379/473 (removed 94) transitions.
// Phase 1: matrix 379 rows 149 cols
[2024-06-02 19:50:26] [INFO ] Computed 7 invariants in 43 ms
[2024-06-02 19:50:27] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-06-02 19:50:27] [INFO ] Invariant cache hit.
[2024-06-02 19:50:27] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2024-06-02 19:50:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 19:50:32] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 27 ms to minimize.
[2024-06-02 19:50:33] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 3 ms to minimize.
[2024-06-02 19:50:33] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 3 ms to minimize.
[2024-06-02 19:50:33] [INFO ] Deduced a trap composed of 83 places in 165 ms of which 3 ms to minimize.
[2024-06-02 19:50:33] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 4 ms to minimize.
[2024-06-02 19:50:33] [INFO ] Deduced a trap composed of 87 places in 161 ms of which 3 ms to minimize.
[2024-06-02 19:50:33] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-06-02 19:50:34] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 2 ms to minimize.
[2024-06-02 19:50:34] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 3 ms to minimize.
[2024-06-02 19:50:35] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 3 ms to minimize.
[2024-06-02 19:50:35] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 3 ms to minimize.
[2024-06-02 19:50:35] [INFO ] Deduced a trap composed of 37 places in 143 ms of which 2 ms to minimize.
[2024-06-02 19:50:35] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-06-02 19:50:35] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
[2024-06-02 19:50:35] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 3 ms to minimize.
[2024-06-02 19:50:37] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 19:50:38] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 19:50:43] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 3 ms to minimize.
[2024-06-02 19:50:44] [INFO ] Deduced a trap composed of 101 places in 183 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 19:50:46] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 2 ms to minimize.
[2024-06-02 19:50:47] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 19:50:49] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 8 (OVERLAPS) 379/528 variables, 149/178 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/528 variables, and 178 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 19:51:01] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (OVERLAPS) 379/528 variables, 149/179 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 378/557 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-06-02 19:51:11] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 2 ms to minimize.
[2024-06-02 19:51:12] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/528 variables, and 559 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 25/25 constraints]
After SMT, in 60617ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 60669ms
Starting structural reductions in LTL mode, iteration 1 : 149/192 places, 379/473 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61779 ms. Remains : 149/192 places, 379/473 transitions.
Support contains 38 out of 149 places after structural reductions.
[2024-06-02 19:51:28] [INFO ] Flatten gal took : 79 ms
[2024-06-02 19:51:28] [INFO ] Flatten gal took : 37 ms
[2024-06-02 19:51:28] [INFO ] Input system was already deterministic with 379 transitions.
Support contains 37 out of 149 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2443 ms. (16 steps per ms) remains 24/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 109 ms. (36 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 94 ms. (42 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 74 ms. (53 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
[2024-06-02 19:51:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 118/149 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 21 unsolved
[2024-06-02 19:51:30] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2024-06-02 19:51:30] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-06-02 19:51:30] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 3/10 constraints. Problems are: Problem set: 3 solved, 21 unsolved
[2024-06-02 19:51:31] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 379/528 variables, 149/160 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 0/160 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/528 variables, 0/160 constraints. Problems are: Problem set: 3 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 160 constraints, problems are : Problem set: 3 solved, 21 unsolved in 1585 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 120/149 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 4/11 constraints. Problems are: Problem set: 3 solved, 21 unsolved
[2024-06-02 19:51:32] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
[2024-06-02 19:51:32] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 2/13 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 379/528 variables, 149/162 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 21/183 constraints. Problems are: Problem set: 3 solved, 21 unsolved
[2024-06-02 19:51:33] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 3 ms to minimize.
[2024-06-02 19:51:33] [INFO ] Deduced a trap composed of 39 places in 120 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 2/185 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/528 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 185 constraints, problems are : Problem set: 3 solved, 21 unsolved in 3758 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 21/24 constraints, Known Traps: 8/8 constraints]
After SMT, in 5397ms problems are : Problem set: 3 solved, 21 unsolved
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 1 properties in 2623 ms.
Support contains 28 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 379/379 transitions.
Graph (trivial) has 101 edges and 149 vertex of which 9 / 149 are part of one of the 3 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 143 transition count 355
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 128 transition count 354
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 127 transition count 354
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 33 place count 127 transition count 347
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 47 place count 120 transition count 347
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 52 place count 115 transition count 339
Iterating global reduction 3 with 5 rules applied. Total rules applied 57 place count 115 transition count 339
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 115 transition count 336
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 60 place count 115 transition count 335
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 62 place count 114 transition count 335
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 88 place count 101 transition count 322
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 100 transition count 318
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 100 transition count 318
Performed 12 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 114 place count 88 transition count 403
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 4 with 33 rules applied. Total rules applied 147 place count 88 transition count 370
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 151 place count 86 transition count 384
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 163 place count 86 transition count 372
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 176 place count 74 transition count 371
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 179 place count 74 transition count 368
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 180 place count 74 transition count 380
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 182 place count 73 transition count 379
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 73 transition count 378
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 184 place count 72 transition count 377
Applied a total of 184 rules in 285 ms. Remains 72 /149 variables (removed 77) and now considering 377/379 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 72/149 places, 377/379 transitions.
RANDOM walk for 40000 steps (8 resets) in 867 ms. (46 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 17/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4001 steps (8 resets) in 61 ms. (64 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 11/11 properties
[2024-06-02 19:51:39] [INFO ] Flow matrix only has 355 transitions (discarded 22 similar events)
// Phase 1: matrix 355 rows 72 cols
[2024-06-02 19:51:39] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:51:39] [INFO ] State equation strengthened by 52 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 37/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 293/346 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 24/81 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 73/419 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2/421 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 6/427 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/427 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/427 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 131 constraints, problems are : Problem set: 0 solved, 11 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 37/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 293/346 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 24/81 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 73/419 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 8/114 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 2/421 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 19:51:40] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 6/427 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/427 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 0/427 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 143 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1676 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 2389ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 0 properties in 2882 ms.
Support contains 16 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 377/377 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 72 transition count 376
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 376
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 68 transition count 364
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 68 transition count 364
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 67 transition count 363
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 63 transition count 382
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 20 place count 63 transition count 380
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 63 transition count 376
Free-agglomeration rule applied 7 times with reduction of 2 identical transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 63 transition count 367
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 46 place count 56 transition count 359
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 56 transition count 353
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 56 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 55 transition count 365
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 59 place count 55 transition count 360
Applied a total of 59 rules in 63 ms. Remains 55 /72 variables (removed 17) and now considering 360/377 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 55/72 places, 360/377 transitions.
RANDOM walk for 40000 steps (8 resets) in 191 ms. (208 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 147 ms. (270 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 201 ms. (198 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 117 ms. (339 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
[2024-06-02 19:51:45] [INFO ] Flow matrix only has 307 transitions (discarded 53 similar events)
// Phase 1: matrix 307 rows 55 cols
[2024-06-02 19:51:45] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:51:45] [INFO ] State equation strengthened by 54 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 24/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 248/285 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 73/358 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 11/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 4/362 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/362 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 116 constraints, problems are : Problem set: 0 solved, 8 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 55/55 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 24/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 248/285 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 73/358 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 11/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:51:46] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 4/362 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:51:46] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/362 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/362 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/362 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 126 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1281 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 55/55 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 1887ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 1 properties in 763 ms.
Support contains 12 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 360/360 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 55 transition count 358
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 51 transition count 358
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 13 place count 51 transition count 351
Drop transitions (Redundant composition of simpler transitions.) removed 89 transitions
Redundant transition composition rules discarded 89 transitions
Iterating global reduction 1 with 89 rules applied. Total rules applied 102 place count 51 transition count 262
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 1 with 1 rules applied. Total rules applied 103 place count 51 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 50 transition count 261
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 49 transition count 259
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 49 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 48 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 48 transition count 257
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 48 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 47 transition count 256
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 47 transition count 288
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 113 place count 46 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 117 place count 46 transition count 284
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 118 place count 46 transition count 284
Applied a total of 118 rules in 59 ms. Remains 46 /55 variables (removed 9) and now considering 284/360 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 46/55 places, 284/360 transitions.
RANDOM walk for 40000 steps (14 resets) in 287 ms. (138 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40000 steps (17 resets) in 315 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (20 resets) in 191 ms. (208 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40001 steps (17 resets) in 150 ms. (264 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40000 steps (13 resets) in 106 ms. (373 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (16 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
[2024-06-02 19:51:48] [INFO ] Flow matrix only has 268 transitions (discarded 16 similar events)
// Phase 1: matrix 268 rows 46 cols
[2024-06-02 19:51:48] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:51:48] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 210/242 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 68/310 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:51:48] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/314 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 32/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/314 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 96 constraints, problems are : Problem set: 0 solved, 3 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 46/46 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 210/242 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 68/310 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/314 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 32/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:51:48] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/314 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 100 constraints, problems are : Problem set: 0 solved, 3 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 46/46 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 608ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 3240 steps, including 579 resets, run visited all 3 properties in 122 ms. (steps per millisecond=26 )
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 3 properties in 133 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA MedleyA-PT-15-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 15 stabilizing places and 15 stable transitions
FORMULA MedleyA-PT-15-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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&&(G(p0)||X(X(F(p1)))))))'
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 141 transition count 367
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 141 transition count 367
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 141 transition count 364
Applied a total of 19 rules in 16 ms. Remains 141 /149 variables (removed 8) and now considering 364/379 (removed 15) transitions.
// Phase 1: matrix 364 rows 141 cols
[2024-06-02 19:51:49] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:51:49] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-02 19:51:49] [INFO ] Invariant cache hit.
[2024-06-02 19:51:50] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-02 19:51:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:51:54] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-06-02 19:51:54] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 5 ms to minimize.
[2024-06-02 19:51:54] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:51:54] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:51:54] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-06-02 19:51:55] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 3 ms to minimize.
[2024-06-02 19:51:55] [INFO ] Deduced a trap composed of 82 places in 162 ms of which 3 ms to minimize.
[2024-06-02 19:51:55] [INFO ] Deduced a trap composed of 87 places in 160 ms of which 3 ms to minimize.
[2024-06-02 19:51:55] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 2 ms to minimize.
[2024-06-02 19:51:55] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 2 ms to minimize.
[2024-06-02 19:51:55] [INFO ] Deduced a trap composed of 86 places in 176 ms of which 2 ms to minimize.
[2024-06-02 19:51:56] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 2 ms to minimize.
[2024-06-02 19:51:56] [INFO ] Deduced a trap composed of 81 places in 160 ms of which 3 ms to minimize.
[2024-06-02 19:51:56] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 2 ms to minimize.
[2024-06-02 19:51:56] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-06-02 19:51:56] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:51:57] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 2 ms to minimize.
[2024-06-02 19:51:57] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 2 ms to minimize.
[2024-06-02 19:51:57] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 3 ms to minimize.
[2024-06-02 19:51:58] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:51:58] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 1 ms to minimize.
[2024-06-02 19:51:58] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:51:59] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:52:03] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:52:06] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/505 variables, 141/173 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:52:14] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:52:18] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 175 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 363/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 538 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
After SMT, in 60321ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60329ms
Starting structural reductions in LTL mode, iteration 1 : 141/149 places, 364/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60841 ms. Remains : 141/149 places, 364/379 transitions.
Stuttering acceptance computed with spot in 743 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 546 ms.
Product exploration explored 100000 steps with 0 reset in 282 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 426 ms. (93 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 376 ms. (106 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 327 ms. (121 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 343 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 254 ms. (156 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 30684 steps, run visited all 4 properties in 217 ms. (steps per millisecond=141 )
Probabilistic random walk after 30684 steps, saw 6862 distinct states, run finished after 222 ms. (steps per millisecond=138 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 229 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 364/364 transitions.
Applied a total of 0 rules in 6 ms. Remains 141 /141 variables (removed 0) and now considering 364/364 (removed 0) transitions.
[2024-06-02 19:52:54] [INFO ] Invariant cache hit.
[2024-06-02 19:52:54] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-02 19:52:54] [INFO ] Invariant cache hit.
[2024-06-02 19:52:54] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-02 19:52:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:52:58] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-06-02 19:52:58] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:52:59] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 2 ms to minimize.
[2024-06-02 19:52:59] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-06-02 19:52:59] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 3 ms to minimize.
[2024-06-02 19:52:59] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 2 ms to minimize.
[2024-06-02 19:52:59] [INFO ] Deduced a trap composed of 82 places in 166 ms of which 3 ms to minimize.
[2024-06-02 19:52:59] [INFO ] Deduced a trap composed of 87 places in 163 ms of which 2 ms to minimize.
[2024-06-02 19:53:00] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 2 ms to minimize.
[2024-06-02 19:53:00] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 3 ms to minimize.
[2024-06-02 19:53:00] [INFO ] Deduced a trap composed of 86 places in 185 ms of which 3 ms to minimize.
[2024-06-02 19:53:00] [INFO ] Deduced a trap composed of 81 places in 178 ms of which 3 ms to minimize.
[2024-06-02 19:53:00] [INFO ] Deduced a trap composed of 81 places in 152 ms of which 2 ms to minimize.
[2024-06-02 19:53:01] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 2 ms to minimize.
[2024-06-02 19:53:01] [INFO ] Deduced a trap composed of 94 places in 161 ms of which 3 ms to minimize.
[2024-06-02 19:53:01] [INFO ] Deduced a trap composed of 92 places in 167 ms of which 3 ms to minimize.
[2024-06-02 19:53:01] [INFO ] Deduced a trap composed of 92 places in 178 ms of which 2 ms to minimize.
[2024-06-02 19:53:02] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:53:02] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-06-02 19:53:02] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:53:02] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 3 ms to minimize.
[2024-06-02 19:53:03] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 2 ms to minimize.
[2024-06-02 19:53:03] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:53:08] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:53:11] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/505 variables, 141/173 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:53:18] [INFO ] Deduced a trap composed of 103 places in 164 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:53:23] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 175 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 363/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 538 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
After SMT, in 60304ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60312ms
Finished structural reductions in LTL mode , in 1 iterations and 60828 ms. Remains : 141/141 places, 364/364 transitions.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 451 ms. (88 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 257 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 30684 steps, run visited all 4 properties in 146 ms. (steps per millisecond=210 )
Probabilistic random walk after 30684 steps, saw 6862 distinct states, run finished after 147 ms. (steps per millisecond=208 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 350 ms.
Product exploration explored 100000 steps with 0 reset in 247 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 364/364 transitions.
Graph (trivial) has 135 edges and 141 vertex of which 9 / 141 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 135 transition count 358
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 20 place count 135 transition count 360
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 135 transition count 360
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 133 transition count 356
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 133 transition count 356
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 47 place count 133 transition count 358
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 123 transition count 343
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 123 transition count 343
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -155
Deduced a syphon composed of 51 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 123 transition count 498
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 117 transition count 486
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 117 transition count 486
Deduced a syphon composed of 45 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 134 place count 117 transition count 448
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 136 place count 115 transition count 446
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 138 place count 115 transition count 446
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 142 place count 115 transition count 504
Deduced a syphon composed of 47 places in 1 ms
Applied a total of 142 rules in 72 ms. Remains 115 /141 variables (removed 26) and now considering 504/364 (removed -140) transitions.
[2024-06-02 19:53:58] [INFO ] Redundant transitions in 49 ms returned []
Running 503 sub problems to find dead transitions.
[2024-06-02 19:53:58] [INFO ] Flow matrix only has 459 transitions (discarded 45 similar events)
// Phase 1: matrix 459 rows 115 cols
[2024-06-02 19:53:58] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:53:58] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-02 19:54:03] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-02 19:54:03] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 3 ms to minimize.
[2024-06-02 19:54:03] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:54:03] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
[2024-06-02 19:54:04] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-02 19:54:04] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
[2024-06-02 19:54:04] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
[2024-06-02 19:54:04] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 2 ms to minimize.
[2024-06-02 19:54:04] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 2 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD188 is UNSAT
[2024-06-02 19:54:05] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 2 ms to minimize.
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
[2024-06-02 19:54:05] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 3 ms to minimize.
[2024-06-02 19:54:06] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 2 ms to minimize.
[2024-06-02 19:54:06] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 2 ms to minimize.
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 13/20 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/20 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 458/573 variables, 115/135 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 76/211 constraints. Problems are: Problem set: 70 solved, 433 unsolved
[2024-06-02 19:54:15] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 1/212 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/212 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 8 (OVERLAPS) 1/574 variables, 1/213 constraints. Problems are: Problem set: 70 solved, 433 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/574 variables, and 213 constraints, problems are : Problem set: 70 solved, 433 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 115/115 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 70 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 1 (OVERLAPS) 48/115 variables, 7/7 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 14/21 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/21 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 458/573 variables, 115/136 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 76/212 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 433/645 constraints. Problems are: Problem set: 70 solved, 433 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/645 constraints. Problems are: Problem set: 70 solved, 433 unsolved
SMT process timed out in 60568ms, After SMT, problems are : Problem set: 70 solved, 433 unsolved
Search for dead transitions found 70 dead transitions in 60573ms
Found 70 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 70 transitions
Dead transitions reduction (with SMT) removed 70 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 115/141 places, 434/364 transitions.
Graph (complete) has 590 edges and 115 vertex of which 68 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.3 ms
Discarding 47 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 68 /115 variables (removed 47) and now considering 434/434 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 68/141 places, 434/364 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60724 ms. Remains : 68/141 places, 434/364 transitions.
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 364/364 transitions.
Applied a total of 0 rules in 1 ms. Remains 141 /141 variables (removed 0) and now considering 364/364 (removed 0) transitions.
// Phase 1: matrix 364 rows 141 cols
[2024-06-02 19:54:59] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:54:59] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 19:54:59] [INFO ] Invariant cache hit.
[2024-06-02 19:54:59] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-02 19:54:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:55:03] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-06-02 19:55:03] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-06-02 19:55:03] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:55:03] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:55:03] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:55:03] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-06-02 19:55:03] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 1 ms to minimize.
[2024-06-02 19:55:03] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:55:04] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
[2024-06-02 19:55:04] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 2 ms to minimize.
[2024-06-02 19:55:04] [INFO ] Deduced a trap composed of 86 places in 182 ms of which 3 ms to minimize.
[2024-06-02 19:55:04] [INFO ] Deduced a trap composed of 81 places in 176 ms of which 2 ms to minimize.
[2024-06-02 19:55:04] [INFO ] Deduced a trap composed of 81 places in 154 ms of which 2 ms to minimize.
[2024-06-02 19:55:04] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 3 ms to minimize.
[2024-06-02 19:55:05] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-06-02 19:55:05] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 2 ms to minimize.
[2024-06-02 19:55:05] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-06-02 19:55:06] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 2 ms to minimize.
[2024-06-02 19:55:06] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 2 ms to minimize.
[2024-06-02 19:55:06] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:55:06] [INFO ] Deduced a trap composed of 79 places in 152 ms of which 3 ms to minimize.
[2024-06-02 19:55:07] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 2 ms to minimize.
[2024-06-02 19:55:07] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:55:10] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:55:13] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/505 variables, 141/173 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:55:21] [INFO ] Deduced a trap composed of 103 places in 156 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:55:25] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 175 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 363/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 538 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
After SMT, in 60254ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60261ms
Finished structural reductions in LTL mode , in 1 iterations and 60592 ms. Remains : 141/141 places, 364/364 transitions.
Treatment of property MedleyA-PT-15-LTLFireability-00 finished in 250280 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 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Graph (trivial) has 148 edges and 149 vertex of which 9 / 149 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 142 transition count 351
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 121 transition count 351
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 43 place count 121 transition count 343
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 59 place count 113 transition count 343
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 67 place count 105 transition count 329
Iterating global reduction 2 with 8 rules applied. Total rules applied 75 place count 105 transition count 329
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 78 place count 105 transition count 326
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 78 place count 105 transition count 324
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 103 transition count 324
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 112 place count 88 transition count 309
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 86 transition count 302
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 86 transition count 302
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -122
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 150 place count 69 transition count 424
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 3 with 49 rules applied. Total rules applied 199 place count 69 transition count 375
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 205 place count 66 transition count 410
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 206 place count 65 transition count 409
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 70 edges and 63 vertex of which 27 / 63 are part of one of the 11 SCC in 1 ms
Free SCC test removed 16 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 209 place count 47 transition count 409
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 279 place count 47 transition count 339
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 283 place count 43 transition count 278
Iterating global reduction 5 with 4 rules applied. Total rules applied 287 place count 43 transition count 278
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 299 place count 43 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 6 with 85 rules applied. Total rules applied 384 place count 43 transition count 181
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 384 place count 43 transition count 178
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 390 place count 40 transition count 178
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 394 place count 38 transition count 176
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 395 place count 37 transition count 172
Iterating global reduction 6 with 1 rules applied. Total rules applied 396 place count 37 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 400 place count 37 transition count 168
Applied a total of 400 rules in 103 ms. Remains 37 /149 variables (removed 112) and now considering 168/379 (removed 211) transitions.
[2024-06-02 19:56:00] [INFO ] Flow matrix only has 152 transitions (discarded 16 similar events)
// Phase 1: matrix 152 rows 37 cols
[2024-06-02 19:56:00] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:56:00] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 19:56:00] [INFO ] Flow matrix only has 152 transitions (discarded 16 similar events)
[2024-06-02 19:56:00] [INFO ] Invariant cache hit.
[2024-06-02 19:56:00] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 19:56:00] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2024-06-02 19:56:00] [INFO ] Redundant transitions in 51 ms returned [156, 159, 160, 163, 164, 165]
Found 6 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
Running 156 sub problems to find dead transitions.
[2024-06-02 19:56:00] [INFO ] Flow matrix only has 146 transitions (discarded 16 similar events)
// Phase 1: matrix 146 rows 37 cols
[2024-06-02 19:56:00] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:56:00] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-02 19:56:00] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:56:00] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-02 19:56:01] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:56:01] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 145/182 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 36/82 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-06-02 19:56:03] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/183 variables, and 83 constraints, problems are : Problem set: 0 solved, 156 unsolved in 6323 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 145/182 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 36/83 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 156/239 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/183 variables, and 239 constraints, problems are : Problem set: 0 solved, 156 unsolved in 7006 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 5/5 constraints]
After SMT, in 13497ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 13501ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/149 places, 162/379 transitions.
Applied a total of 0 rules in 4 ms. Remains 37 /37 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13932 ms. Remains : 37/149 places, 162/379 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLFireability-02 finished in 14039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 142 transition count 369
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 142 transition count 369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 142 transition count 366
Applied a total of 17 rules in 5 ms. Remains 142 /149 variables (removed 7) and now considering 366/379 (removed 13) transitions.
// Phase 1: matrix 366 rows 142 cols
[2024-06-02 19:56:13] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:56:14] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-06-02 19:56:14] [INFO ] Invariant cache hit.
[2024-06-02 19:56:14] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2024-06-02 19:56:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 19:56:18] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-06-02 19:56:18] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:56:19] [INFO ] Deduced a trap composed of 37 places in 166 ms of which 3 ms to minimize.
[2024-06-02 19:56:19] [INFO ] Deduced a trap composed of 85 places in 168 ms of which 3 ms to minimize.
[2024-06-02 19:56:19] [INFO ] Deduced a trap composed of 81 places in 156 ms of which 4 ms to minimize.
[2024-06-02 19:56:19] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 2 ms to minimize.
[2024-06-02 19:56:19] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-06-02 19:56:20] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2024-06-02 19:56:20] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-06-02 19:56:20] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-06-02 19:56:20] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:56:21] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 2 ms to minimize.
[2024-06-02 19:56:21] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
[2024-06-02 19:56:21] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 19:56:23] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:56:23] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 3 ms to minimize.
[2024-06-02 19:56:24] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 2 ms to minimize.
[2024-06-02 19:56:24] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 2 ms to minimize.
[2024-06-02 19:56:24] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 2 ms to minimize.
[2024-06-02 19:56:24] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 19:56:28] [INFO ] Deduced a trap composed of 106 places in 171 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (OVERLAPS) 366/508 variables, 142/170 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (OVERLAPS) 0/508 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 365 unsolved
No progress, stopping.
After SMT solving in domain Real declared 508/508 variables, and 170 constraints, problems are : Problem set: 0 solved, 365 unsolved in 29219 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
[2024-06-02 19:56:46] [INFO ] Deduced a trap composed of 24 places in 191 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/508 variables, 142/171 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/508 variables, 365/536 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/508 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/508 variables, and 536 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 22/22 constraints]
After SMT, in 59430ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 59436ms
Starting structural reductions in LTL mode, iteration 1 : 142/149 places, 366/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59906 ms. Remains : 142/149 places, 366/379 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-15-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLFireability-03 finished in 60055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((p1&&F(p2)))))'
Support contains 5 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 141 transition count 367
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 141 transition count 367
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 141 transition count 364
Applied a total of 19 rules in 8 ms. Remains 141 /149 variables (removed 8) and now considering 364/379 (removed 15) transitions.
// Phase 1: matrix 364 rows 141 cols
[2024-06-02 19:57:14] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:57:14] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-02 19:57:14] [INFO ] Invariant cache hit.
[2024-06-02 19:57:14] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-02 19:57:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:57:18] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-06-02 19:57:18] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:57:18] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 2 ms to minimize.
[2024-06-02 19:57:18] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 2 ms to minimize.
[2024-06-02 19:57:19] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 5 ms to minimize.
[2024-06-02 19:57:19] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 3 ms to minimize.
[2024-06-02 19:57:19] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 1 ms to minimize.
[2024-06-02 19:57:19] [INFO ] Deduced a trap composed of 87 places in 174 ms of which 2 ms to minimize.
[2024-06-02 19:57:19] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 3 ms to minimize.
[2024-06-02 19:57:19] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:57:20] [INFO ] Deduced a trap composed of 86 places in 166 ms of which 3 ms to minimize.
[2024-06-02 19:57:20] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 3 ms to minimize.
[2024-06-02 19:57:20] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 4 ms to minimize.
[2024-06-02 19:57:20] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 3 ms to minimize.
[2024-06-02 19:57:21] [INFO ] Deduced a trap composed of 94 places in 191 ms of which 3 ms to minimize.
[2024-06-02 19:57:21] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 3 ms to minimize.
[2024-06-02 19:57:21] [INFO ] Deduced a trap composed of 92 places in 164 ms of which 2 ms to minimize.
[2024-06-02 19:57:21] [INFO ] Deduced a trap composed of 97 places in 170 ms of which 2 ms to minimize.
[2024-06-02 19:57:22] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 3 ms to minimize.
[2024-06-02 19:57:22] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:57:22] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 3 ms to minimize.
[2024-06-02 19:57:23] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 3 ms to minimize.
[2024-06-02 19:57:23] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:57:28] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:57:31] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/505 variables, 141/173 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:57:39] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:57:44] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 175 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 363/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 538 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
After SMT, in 60209ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60214ms
Starting structural reductions in LTL mode, iteration 1 : 141/149 places, 364/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60701 ms. Remains : 141/149 places, 364/379 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 277 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 1 ms.
FORMULA MedleyA-PT-15-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-15-LTLFireability-05 finished in 61183 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 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Graph (trivial) has 148 edges and 149 vertex of which 9 / 149 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 142 transition count 352
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 122 transition count 352
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 41 place count 122 transition count 344
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 57 place count 114 transition count 344
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 65 place count 106 transition count 330
Iterating global reduction 2 with 8 rules applied. Total rules applied 73 place count 106 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 106 transition count 327
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 76 place count 106 transition count 325
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 104 transition count 325
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 110 place count 89 transition count 310
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 87 transition count 303
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 87 transition count 303
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -123
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 148 place count 70 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 3 with 49 rules applied. Total rules applied 197 place count 70 transition count 377
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 203 place count 67 transition count 412
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 204 place count 66 transition count 411
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 70 edges and 64 vertex of which 28 / 64 are part of one of the 11 SCC in 0 ms
Free SCC test removed 17 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 207 place count 47 transition count 411
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 4 with 87 rules applied. Total rules applied 294 place count 47 transition count 324
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 298 place count 43 transition count 272
Iterating global reduction 5 with 4 rules applied. Total rules applied 302 place count 43 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 5 with 85 rules applied. Total rules applied 387 place count 43 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 387 place count 43 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 391 place count 41 transition count 185
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 395 place count 39 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 401 place count 39 transition count 177
Applied a total of 401 rules in 87 ms. Remains 39 /149 variables (removed 110) and now considering 177/379 (removed 202) transitions.
[2024-06-02 19:58:15] [INFO ] Flow matrix only has 161 transitions (discarded 16 similar events)
// Phase 1: matrix 161 rows 39 cols
[2024-06-02 19:58:15] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:58:15] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 19:58:15] [INFO ] Flow matrix only has 161 transitions (discarded 16 similar events)
[2024-06-02 19:58:15] [INFO ] Invariant cache hit.
[2024-06-02 19:58:15] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 19:58:15] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-06-02 19:58:15] [INFO ] Redundant transitions in 61 ms returned [91, 134, 135, 138, 139, 163, 165, 168, 169, 171, 172, 175, 176]
Found 13 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 13 transitions
Redundant transitions reduction (with SMT) removed 13 transitions.
Running 158 sub problems to find dead transitions.
[2024-06-02 19:58:15] [INFO ] Flow matrix only has 148 transitions (discarded 16 similar events)
// Phase 1: matrix 148 rows 39 cols
[2024-06-02 19:58:15] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:58:15] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-02 19:58:16] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:58:16] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:58:16] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-06-02 19:58:16] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 147/186 variables, 39/48 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 36/84 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-02 19:58:18] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/187 variables, and 85 constraints, problems are : Problem set: 0 solved, 158 unsolved in 6315 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 147/186 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 36/85 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 158/243 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/187 variables, and 243 constraints, problems are : Problem set: 0 solved, 158 unsolved in 5285 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 5/5 constraints]
After SMT, in 11785ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 11788ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/149 places, 164/379 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 39 transition count 163
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 37 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 37 transition count 161
Applied a total of 4 rules in 4 ms. Remains 37 /39 variables (removed 2) and now considering 161/164 (removed 3) transitions.
[2024-06-02 19:58:27] [INFO ] Flow matrix only has 145 transitions (discarded 16 similar events)
// Phase 1: matrix 145 rows 37 cols
[2024-06-02 19:58:27] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:58:27] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 19:58:27] [INFO ] Flow matrix only has 145 transitions (discarded 16 similar events)
[2024-06-02 19:58:27] [INFO ] Invariant cache hit.
[2024-06-02 19:58:27] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 19:58:27] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/149 places, 161/379 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12408 ms. Remains : 37/149 places, 161/379 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 58 ms.
Product exploration explored 100000 steps with 0 reset in 284 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9942 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1561 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 172 steps, run visited all 1 properties in 5 ms. (steps per millisecond=34 )
Probabilistic random walk after 172 steps, saw 109 distinct states, run finished after 6 ms. (steps per millisecond=28 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 161/161 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2024-06-02 19:58:28] [INFO ] Flow matrix only has 145 transitions (discarded 16 similar events)
[2024-06-02 19:58:28] [INFO ] Invariant cache hit.
[2024-06-02 19:58:28] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 19:58:28] [INFO ] Flow matrix only has 145 transitions (discarded 16 similar events)
[2024-06-02 19:58:28] [INFO ] Invariant cache hit.
[2024-06-02 19:58:28] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 19:58:28] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-06-02 19:58:28] [INFO ] Redundant transitions in 23 ms returned []
Running 155 sub problems to find dead transitions.
[2024-06-02 19:58:28] [INFO ] Flow matrix only has 145 transitions (discarded 16 similar events)
[2024-06-02 19:58:28] [INFO ] Invariant cache hit.
[2024-06-02 19:58:28] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-02 19:58:29] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:58:29] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:58:29] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:58:29] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:58:29] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 144/181 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 36/83 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-02 19:58:31] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/182 variables, and 84 constraints, problems are : Problem set: 0 solved, 155 unsolved in 6019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 144/181 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 36/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 155/239 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/182 variables, and 239 constraints, problems are : Problem set: 0 solved, 155 unsolved in 6962 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 6/6 constraints]
After SMT, in 13101ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 13103ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13323 ms. Remains : 37/37 places, 161/161 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 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 205 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 37698 steps (9487 resets) in 67 ms. (554 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 127 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 108 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 78 ms.
Product exploration explored 100000 steps with 0 reset in 88 ms.
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 161/161 transitions.
Applied a total of 0 rules in 10 ms. Remains 37 /37 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2024-06-02 19:58:42] [INFO ] Flow matrix only has 145 transitions (discarded 16 similar events)
[2024-06-02 19:58:42] [INFO ] Invariant cache hit.
[2024-06-02 19:58:42] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 19:58:42] [INFO ] Flow matrix only has 145 transitions (discarded 16 similar events)
[2024-06-02 19:58:42] [INFO ] Invariant cache hit.
[2024-06-02 19:58:43] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 19:58:43] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-06-02 19:58:43] [INFO ] Redundant transitions in 27 ms returned []
Running 155 sub problems to find dead transitions.
[2024-06-02 19:58:43] [INFO ] Flow matrix only has 145 transitions (discarded 16 similar events)
[2024-06-02 19:58:43] [INFO ] Invariant cache hit.
[2024-06-02 19:58:43] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-02 19:58:43] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:58:44] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-06-02 19:58:44] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:58:44] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:58:44] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 144/181 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 36/83 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-02 19:58:46] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/182 variables, and 84 constraints, problems are : Problem set: 0 solved, 155 unsolved in 6286 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 144/181 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 36/84 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 155/239 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/182 variables, and 239 constraints, problems are : Problem set: 0 solved, 155 unsolved in 6258 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 37/37 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 6/6 constraints]
After SMT, in 12739ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 12745ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13057 ms. Remains : 37/37 places, 161/161 transitions.
Treatment of property MedleyA-PT-15-LTLFireability-06 finished in 40852 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 5 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 141 transition count 367
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 141 transition count 367
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 141 transition count 364
Applied a total of 19 rules in 7 ms. Remains 141 /149 variables (removed 8) and now considering 364/379 (removed 15) transitions.
// Phase 1: matrix 364 rows 141 cols
[2024-06-02 19:58:56] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:58:56] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 19:58:56] [INFO ] Invariant cache hit.
[2024-06-02 19:58:56] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-02 19:58:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:59:00] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-06-02 19:59:00] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
[2024-06-02 19:59:00] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 2 ms to minimize.
[2024-06-02 19:59:01] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:59:01] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 2 ms to minimize.
[2024-06-02 19:59:01] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 3 ms to minimize.
[2024-06-02 19:59:01] [INFO ] Deduced a trap composed of 82 places in 152 ms of which 3 ms to minimize.
[2024-06-02 19:59:01] [INFO ] Deduced a trap composed of 87 places in 153 ms of which 2 ms to minimize.
[2024-06-02 19:59:01] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 2 ms to minimize.
[2024-06-02 19:59:02] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 2 ms to minimize.
[2024-06-02 19:59:02] [INFO ] Deduced a trap composed of 86 places in 177 ms of which 3 ms to minimize.
[2024-06-02 19:59:02] [INFO ] Deduced a trap composed of 81 places in 173 ms of which 2 ms to minimize.
[2024-06-02 19:59:02] [INFO ] Deduced a trap composed of 81 places in 156 ms of which 3 ms to minimize.
[2024-06-02 19:59:02] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 3 ms to minimize.
[2024-06-02 19:59:03] [INFO ] Deduced a trap composed of 94 places in 163 ms of which 3 ms to minimize.
[2024-06-02 19:59:03] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 3 ms to minimize.
[2024-06-02 19:59:03] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 3 ms to minimize.
[2024-06-02 19:59:04] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
[2024-06-02 19:59:04] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 2 ms to minimize.
[2024-06-02 19:59:04] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:59:05] [INFO ] Deduced a trap composed of 79 places in 158 ms of which 2 ms to minimize.
[2024-06-02 19:59:05] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 2 ms to minimize.
[2024-06-02 19:59:06] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:59:10] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:59:13] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/505 variables, 141/173 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:59:21] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 19:59:25] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 175 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 363/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 538 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
After SMT, in 60204ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Starting structural reductions in LTL mode, iteration 1 : 141/149 places, 364/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60597 ms. Remains : 141/149 places, 364/379 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 183 ms.
Product exploration explored 100000 steps with 0 reset in 195 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 217434 steps, run visited all 1 properties in 739 ms. (steps per millisecond=294 )
Probabilistic random walk after 217434 steps, saw 43918 distinct states, run finished after 740 ms. (steps per millisecond=293 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Support contains 2 out of 141 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 364/364 transitions.
Graph (trivial) has 129 edges and 141 vertex of which 9 / 141 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 134 transition count 338
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 115 transition count 338
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 39 place count 115 transition count 330
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 55 place count 107 transition count 330
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 105 transition count 326
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 105 transition count 326
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 85 place count 92 transition count 313
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 90 transition count 306
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 90 transition count 306
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 119 place count 75 transition count 405
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 130 place count 75 transition count 394
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 138 place count 71 transition count 442
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 139 place count 70 transition count 441
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 69 edges and 68 vertex of which 25 / 68 are part of one of the 10 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 142 place count 53 transition count 441
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 3 with 70 rules applied. Total rules applied 212 place count 53 transition count 371
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 216 place count 49 transition count 313
Iterating global reduction 4 with 4 rules applied. Total rules applied 220 place count 49 transition count 313
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 230 place count 49 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 5 with 99 rules applied. Total rules applied 329 place count 49 transition count 204
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 329 place count 49 transition count 203
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 331 place count 48 transition count 203
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 332 place count 47 transition count 196
Iterating global reduction 5 with 1 rules applied. Total rules applied 333 place count 47 transition count 196
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 337 place count 45 transition count 194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 341 place count 43 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 361 place count 43 transition count 190
Applied a total of 361 rules in 84 ms. Remains 43 /141 variables (removed 98) and now considering 190/364 (removed 174) transitions.
[2024-06-02 19:59:58] [INFO ] Flow matrix only has 171 transitions (discarded 19 similar events)
// Phase 1: matrix 171 rows 43 cols
[2024-06-02 19:59:58] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 19:59:58] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 19:59:58] [INFO ] Flow matrix only has 171 transitions (discarded 19 similar events)
[2024-06-02 19:59:58] [INFO ] Invariant cache hit.
[2024-06-02 19:59:58] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 19:59:58] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-06-02 19:59:58] [INFO ] Redundant transitions in 60 ms returned [97, 98, 100, 127, 128, 129, 159, 163, 164, 165, 166, 167, 172, 173]
Found 14 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 14 transitions
Redundant transitions reduction (with SMT) removed 14 transitions.
Running 172 sub problems to find dead transitions.
[2024-06-02 19:59:59] [INFO ] Flow matrix only has 157 transitions (discarded 19 similar events)
// Phase 1: matrix 157 rows 43 cols
[2024-06-02 19:59:59] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 19:59:59] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 20:00:00] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-06-02 20:00:00] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-06-02 20:00:00] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:00:00] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 2 ms to minimize.
[2024-06-02 20:00:01] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-02 20:00:01] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 156/199 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 37/91 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/200 variables, and 91 constraints, problems are : Problem set: 0 solved, 172 unsolved in 6725 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 3/43 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 156/199 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 37/91 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 172/263 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 20:00:11] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/199 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (OVERLAPS) 0/199 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/200 variables, and 264 constraints, problems are : Problem set: 0 solved, 172 unsolved in 13763 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 7/7 constraints]
After SMT, in 20669ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 20673ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/141 places, 176/364 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 43 transition count 175
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 42 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 41 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 41 transition count 173
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 39 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 29 place count 39 transition count 150
Applied a total of 29 rules in 19 ms. Remains 39 /43 variables (removed 4) and now considering 150/176 (removed 26) transitions.
[2024-06-02 20:00:19] [INFO ] Flow matrix only has 137 transitions (discarded 13 similar events)
// Phase 1: matrix 137 rows 39 cols
[2024-06-02 20:00:19] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:00:19] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 20:00:19] [INFO ] Flow matrix only has 137 transitions (discarded 13 similar events)
[2024-06-02 20:00:19] [INFO ] Invariant cache hit.
[2024-06-02 20:00:19] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-02 20:00:19] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/141 places, 150/364 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21341 ms. Remains : 39/141 places, 150/364 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
RANDOM walk for 40000 steps (6411 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (901 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 618 steps, run visited all 1 properties in 6 ms. (steps per millisecond=103 )
Probabilistic random walk after 618 steps, saw 219 distinct states, run finished after 7 ms. (steps per millisecond=88 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 87 ms.
Product exploration explored 100000 steps with 0 reset in 93 ms.
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 150/150 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 39 transition count 149
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 149
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 34 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 32 place count 34 transition count 143
Applied a total of 32 rules in 12 ms. Remains 34 /39 variables (removed 5) and now considering 143/150 (removed 7) transitions.
[2024-06-02 20:00:20] [INFO ] Flow matrix only has 130 transitions (discarded 13 similar events)
// Phase 1: matrix 130 rows 34 cols
[2024-06-02 20:00:20] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:00:20] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 20:00:20] [INFO ] Flow matrix only has 130 transitions (discarded 13 similar events)
[2024-06-02 20:00:20] [INFO ] Invariant cache hit.
[2024-06-02 20:00:20] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-02 20:00:20] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-06-02 20:00:20] [INFO ] Redundant transitions in 17 ms returned []
Running 137 sub problems to find dead transitions.
[2024-06-02 20:00:20] [INFO ] Flow matrix only has 130 transitions (discarded 13 similar events)
[2024-06-02 20:00:20] [INFO ] Invariant cache hit.
[2024-06-02 20:00:20] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-06-02 20:00:21] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-06-02 20:00:21] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:00:21] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-06-02 20:00:21] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:00:21] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 129/163 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 31/75 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 0/163 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/164 variables, and 75 constraints, problems are : Problem set: 0 solved, 137 unsolved in 4772 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 34/34 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 129/163 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 31/75 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 137/212 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/164 variables, and 212 constraints, problems are : Problem set: 0 solved, 137 unsolved in 4440 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 34/34 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 5/5 constraints]
After SMT, in 9363ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 9365ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/39 places, 143/150 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9599 ms. Remains : 34/39 places, 143/150 transitions.
Treatment of property MedleyA-PT-15-LTLFireability-07 finished in 94191 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((X((X(p2)&&p1))&&p0)))))'
Support contains 7 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 141 transition count 367
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 141 transition count 367
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 141 transition count 364
Applied a total of 19 rules in 6 ms. Remains 141 /149 variables (removed 8) and now considering 364/379 (removed 15) transitions.
// Phase 1: matrix 364 rows 141 cols
[2024-06-02 20:00:30] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:00:30] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 20:00:30] [INFO ] Invariant cache hit.
[2024-06-02 20:00:30] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2024-06-02 20:00:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 20:00:34] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-06-02 20:00:34] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:00:34] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-06-02 20:00:35] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:00:35] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 1 ms to minimize.
[2024-06-02 20:00:35] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-06-02 20:00:35] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-06-02 20:00:35] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-06-02 20:00:35] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 1 ms to minimize.
[2024-06-02 20:00:35] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-06-02 20:00:35] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 1 ms to minimize.
[2024-06-02 20:00:35] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-06-02 20:00:36] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 5 ms to minimize.
[2024-06-02 20:00:36] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 3 ms to minimize.
[2024-06-02 20:00:36] [INFO ] Deduced a trap composed of 94 places in 159 ms of which 3 ms to minimize.
[2024-06-02 20:00:36] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 2 ms to minimize.
[2024-06-02 20:00:37] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 2 ms to minimize.
[2024-06-02 20:00:37] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 2 ms to minimize.
[2024-06-02 20:00:37] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 2 ms to minimize.
[2024-06-02 20:00:37] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 20:00:38] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-06-02 20:00:38] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 3 ms to minimize.
[2024-06-02 20:00:39] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 20:00:43] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 20:00:46] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/505 variables, 141/173 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 20:00:53] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 363 unsolved
[2024-06-02 20:00:58] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/505 variables, and 175 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (OVERLAPS) 364/505 variables, 141/175 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 363/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/505 variables, and 538 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 27/27 constraints]
After SMT, in 60239ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60246ms
Starting structural reductions in LTL mode, iteration 1 : 141/149 places, 364/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60592 ms. Remains : 141/149 places, 364/379 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 186 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 1 ms.
FORMULA MedleyA-PT-15-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-15-LTLFireability-08 finished in 61108 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||X(X(p1))))))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 142 transition count 368
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 142 transition count 368
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 142 transition count 365
Applied a total of 17 rules in 8 ms. Remains 142 /149 variables (removed 7) and now considering 365/379 (removed 14) transitions.
// Phase 1: matrix 365 rows 142 cols
[2024-06-02 20:01:31] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:01:31] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-02 20:01:31] [INFO ] Invariant cache hit.
[2024-06-02 20:01:31] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 364 sub problems to find dead transitions.
[2024-06-02 20:01:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 20:01:36] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-02 20:01:36] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:01:36] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 5 ms to minimize.
[2024-06-02 20:01:36] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 1 ms to minimize.
[2024-06-02 20:01:36] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 1 ms to minimize.
[2024-06-02 20:01:36] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:01:36] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 3 ms to minimize.
[2024-06-02 20:01:37] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 2 ms to minimize.
[2024-06-02 20:01:37] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 3 ms to minimize.
[2024-06-02 20:01:37] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 1 ms to minimize.
[2024-06-02 20:01:37] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:01:38] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 2 ms to minimize.
[2024-06-02 20:01:38] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 3 ms to minimize.
[2024-06-02 20:01:38] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 3 ms to minimize.
[2024-06-02 20:01:38] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 2 ms to minimize.
[2024-06-02 20:01:38] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-06-02 20:01:38] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 20:01:41] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 1 ms to minimize.
[2024-06-02 20:01:41] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 20:01:45] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 2 ms to minimize.
[2024-06-02 20:01:45] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 20:01:48] [INFO ] Deduced a trap composed of 97 places in 165 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (OVERLAPS) 365/507 variables, 142/171 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 20:01:55] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/507 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-06-02 20:02:00] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 507/507 variables, and 173 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (OVERLAPS) 1/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 365/507 variables, 142/173 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 364/537 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (OVERLAPS) 0/507 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 537 constraints, problems are : Problem set: 0 solved, 364 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 24/24 constraints]
After SMT, in 60236ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 60242ms
Starting structural reductions in LTL mode, iteration 1 : 142/149 places, 365/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60713 ms. Remains : 142/149 places, 365/379 transitions.
Stuttering acceptance computed with spot in 185 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-15-LTLFireability-09
Product exploration explored 100000 steps with 9104 reset in 253 ms.
Stack based approach found an accepted trace after 98964 steps with 9046 reset with depth 15 and stack size 15 in 552 ms.
FORMULA MedleyA-PT-15-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-15-LTLFireability-09 finished in 61727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Graph (trivial) has 148 edges and 149 vertex of which 9 / 149 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 142 transition count 352
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 122 transition count 352
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 41 place count 122 transition count 344
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 57 place count 114 transition count 344
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 65 place count 106 transition count 330
Iterating global reduction 2 with 8 rules applied. Total rules applied 73 place count 106 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 106 transition count 327
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 76 place count 106 transition count 325
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 104 transition count 325
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 110 place count 89 transition count 310
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 87 transition count 303
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 87 transition count 303
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -102
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 146 place count 71 transition count 405
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 3 with 34 rules applied. Total rules applied 180 place count 71 transition count 371
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 188 place count 67 transition count 418
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 66 transition count 417
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 72 edges and 64 vertex of which 27 / 64 are part of one of the 11 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 192 place count 48 transition count 417
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 4 with 79 rules applied. Total rules applied 271 place count 48 transition count 338
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 276 place count 43 transition count 272
Iterating global reduction 5 with 5 rules applied. Total rules applied 281 place count 43 transition count 272
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 290 place count 43 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 79 transitions
Redundant transition composition rules discarded 79 transitions
Iterating global reduction 6 with 79 rules applied. Total rules applied 369 place count 43 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 369 place count 43 transition count 183
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 371 place count 42 transition count 183
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 372 place count 41 transition count 177
Iterating global reduction 6 with 1 rules applied. Total rules applied 373 place count 41 transition count 177
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 377 place count 39 transition count 175
Applied a total of 377 rules in 47 ms. Remains 39 /149 variables (removed 110) and now considering 175/379 (removed 204) transitions.
[2024-06-02 20:02:33] [INFO ] Flow matrix only has 155 transitions (discarded 20 similar events)
// Phase 1: matrix 155 rows 39 cols
[2024-06-02 20:02:33] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:02:33] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 20:02:33] [INFO ] Flow matrix only has 155 transitions (discarded 20 similar events)
[2024-06-02 20:02:33] [INFO ] Invariant cache hit.
[2024-06-02 20:02:33] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 20:02:33] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-06-02 20:02:33] [INFO ] Redundant transitions in 31 ms returned [16, 99, 125, 127, 169, 171, 173, 174]
Found 8 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 8 transitions
Redundant transitions reduction (with SMT) removed 8 transitions.
Running 161 sub problems to find dead transitions.
[2024-06-02 20:02:33] [INFO ] Flow matrix only has 147 transitions (discarded 20 similar events)
// Phase 1: matrix 147 rows 39 cols
[2024-06-02 20:02:33] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:02:33] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-02 20:02:33] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:02:33] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-06-02 20:02:33] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:02:34] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-06-02 20:02:34] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:02:34] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 146/185 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 36/86 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-06-02 20:02:36] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/186 variables, and 87 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5772 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 146/185 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 36/87 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 161/248 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/186 variables, and 248 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5560 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 7/7 constraints]
After SMT, in 11446ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 11448ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/149 places, 167/379 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 39 transition count 166
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 166
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 37 transition count 165
Applied a total of 4 rules in 9 ms. Remains 37 /39 variables (removed 2) and now considering 165/167 (removed 2) transitions.
[2024-06-02 20:02:44] [INFO ] Flow matrix only has 145 transitions (discarded 20 similar events)
// Phase 1: matrix 145 rows 37 cols
[2024-06-02 20:02:44] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:02:44] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 20:02:44] [INFO ] Flow matrix only has 145 transitions (discarded 20 similar events)
[2024-06-02 20:02:44] [INFO ] Invariant cache hit.
[2024-06-02 20:02:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 20:02:45] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/149 places, 165/379 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11955 ms. Remains : 37/149 places, 165/379 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-15-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-15-LTLFireability-10 finished in 12013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G(p1) U (p0&&G(p1)))))))'
Support contains 2 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 143 transition count 370
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 143 transition count 370
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 143 transition count 367
Applied a total of 15 rules in 5 ms. Remains 143 /149 variables (removed 6) and now considering 367/379 (removed 12) transitions.
// Phase 1: matrix 367 rows 143 cols
[2024-06-02 20:02:45] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:02:45] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 20:02:45] [INFO ] Invariant cache hit.
[2024-06-02 20:02:45] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 366 sub problems to find dead transitions.
[2024-06-02 20:02:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 20:02:49] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-06-02 20:02:49] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-06-02 20:02:49] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 2 ms to minimize.
[2024-06-02 20:02:49] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2024-06-02 20:02:49] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 2 ms to minimize.
[2024-06-02 20:02:49] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 3 ms to minimize.
[2024-06-02 20:02:50] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 2 ms to minimize.
[2024-06-02 20:02:50] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 3 ms to minimize.
[2024-06-02 20:02:50] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 2 ms to minimize.
[2024-06-02 20:02:50] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 2 ms to minimize.
[2024-06-02 20:02:50] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 2 ms to minimize.
[2024-06-02 20:02:51] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-06-02 20:02:51] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-06-02 20:02:51] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2024-06-02 20:02:51] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:02:52] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 3 ms to minimize.
[2024-06-02 20:02:52] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 20:02:54] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 3 ms to minimize.
[2024-06-02 20:02:54] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:02:54] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 1 ms to minimize.
[2024-06-02 20:02:54] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 20:02:58] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 2 ms to minimize.
[2024-06-02 20:02:59] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 20:03:02] [INFO ] Deduced a trap composed of 78 places in 160 ms of which 2 ms to minimize.
[2024-06-02 20:03:03] [INFO ] Deduced a trap composed of 97 places in 164 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (OVERLAPS) 367/510 variables, 143/175 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 20:03:11] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 510/510 variables, and 176 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-06-02 20:03:18] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 367/510 variables, 143/177 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 366/543 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 510/510 variables, and 543 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 27/27 constraints]
After SMT, in 60260ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Starting structural reductions in LTL mode, iteration 1 : 143/149 places, 367/379 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60734 ms. Remains : 143/149 places, 367/379 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 180 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA MedleyA-PT-15-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-15-LTLFireability-13 finished in 61195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p1)||p0))&&F(G((p2||F((G(p1)||p3))))))))'
Support contains 6 out of 149 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Graph (trivial) has 133 edges and 149 vertex of which 9 / 149 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 142 transition count 351
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 121 transition count 351
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 43 place count 121 transition count 344
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 114 transition count 344
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 65 place count 106 transition count 330
Iterating global reduction 2 with 8 rules applied. Total rules applied 73 place count 106 transition count 330
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 106 transition count 327
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 76 place count 106 transition count 325
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 104 transition count 325
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 110 place count 89 transition count 310
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 87 transition count 303
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 87 transition count 303
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 142 place count 73 transition count 397
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 182 place count 73 transition count 357
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 188 place count 70 transition count 389
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 69 transition count 388
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 51 edges and 68 vertex of which 15 / 68 are part of one of the 6 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 191 place count 59 transition count 388
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 218 place count 59 transition count 361
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 220 place count 57 transition count 323
Iterating global reduction 5 with 2 rules applied. Total rules applied 222 place count 57 transition count 323
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 236 place count 57 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 6 with 33 rules applied. Total rules applied 269 place count 57 transition count 276
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 271 place count 56 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 292 place count 56 transition count 268
Applied a total of 292 rules in 74 ms. Remains 56 /149 variables (removed 93) and now considering 268/379 (removed 111) transitions.
[2024-06-02 20:03:46] [INFO ] Flow matrix only has 215 transitions (discarded 53 similar events)
// Phase 1: matrix 215 rows 56 cols
[2024-06-02 20:03:46] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 20:03:46] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-02 20:03:46] [INFO ] Flow matrix only has 215 transitions (discarded 53 similar events)
[2024-06-02 20:03:46] [INFO ] Invariant cache hit.
[2024-06-02 20:03:46] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 20:03:46] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-06-02 20:03:46] [INFO ] Redundant transitions in 21 ms returned [261, 265]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 260 sub problems to find dead transitions.
[2024-06-02 20:03:46] [INFO ] Flow matrix only has 213 transitions (discarded 53 similar events)
// Phase 1: matrix 213 rows 56 cols
[2024-06-02 20:03:46] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 20:03:46] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 20:03:48] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-06-02 20:03:48] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:03:48] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-06-02 20:03:48] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:03:48] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/56 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 212/268 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 43/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 20:03:54] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 1/269 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (OVERLAPS) 0/269 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 112 constraints, problems are : Problem set: 0 solved, 260 unsolved in 16536 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/56 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 212/268 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 43/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 260/371 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 20:04:10] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 20:04:14] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (OVERLAPS) 1/269 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 13 (OVERLAPS) 0/269 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 374 constraints, problems are : Problem set: 0 solved, 260 unsolved in 28220 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 8/8 constraints]
After SMT, in 45019ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 45024ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/149 places, 266/379 transitions.
Applied a total of 0 rules in 5 ms. Remains 56 /56 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45490 ms. Remains : 56/149 places, 266/379 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : MedleyA-PT-15-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 306 ms.
Product exploration explored 100000 steps with 0 reset in 336 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p3 (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 205 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter insensitive) to 3 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 902 ms. (44 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1900 ms. (21 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1724 ms. (23 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1509 ms. (26 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1460 ms. (27 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1169 ms. (34 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1322 ms. (30 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1343 ms. (29 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1441 ms. (27 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 2273 ms. (17 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1049 ms. (38 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1325 ms. (30 steps per ms) remains 11/11 properties
Probably explored full state space saw : 22808 states, properties seen :9
Probabilistic random walk after 154542 steps, saw 22808 distinct states, run finished after 773 ms. (steps per millisecond=199 ) properties seen :9
Explored full state space saw : 22808 states, properties seen :0
Exhaustive walk after 154542 steps, saw 22808 distinct states, run finished after 760 ms. (steps per millisecond=203 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p3 (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p2) p3)), (G (OR p1 (NOT p2) p3))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR p1 p2 p3))), (F (NOT p0)), (F p2), (F (NOT p3)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p1) p2 p3))), (F p1), (F (NOT (AND (OR p1 p3) (OR p2 p3))))]
Knowledge based reduction with 23 factoid took 648 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3))]
Support contains 5 out of 56 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 266/266 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-06-02 20:04:41] [INFO ] Flow matrix only has 213 transitions (discarded 53 similar events)
[2024-06-02 20:04:41] [INFO ] Invariant cache hit.
[2024-06-02 20:04:41] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 20:04:41] [INFO ] Flow matrix only has 213 transitions (discarded 53 similar events)
[2024-06-02 20:04:41] [INFO ] Invariant cache hit.
[2024-06-02 20:04:41] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 20:04:41] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-06-02 20:04:41] [INFO ] Redundant transitions in 3 ms returned []
Running 260 sub problems to find dead transitions.
[2024-06-02 20:04:41] [INFO ] Flow matrix only has 213 transitions (discarded 53 similar events)
[2024-06-02 20:04:41] [INFO ] Invariant cache hit.
[2024-06-02 20:04:41] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 20:04:42] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:04:42] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:04:42] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-06-02 20:04:43] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-06-02 20:04:43] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/56 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 212/268 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 43/110 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-06-02 20:04:49] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 1/269 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (OVERLAPS) 0/269 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 112 constraints, problems are : Problem set: 0 solved, 260 unsolved in 16425 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 1/56 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 212/268 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 43/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 260/371 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 1/269 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (OVERLAPS) 0/269 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 372 constraints, problems are : Problem set: 0 solved, 260 unsolved in 20464 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 56/56 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 6/6 constraints]
After SMT, in 37103ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 37107ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37373 ms. Remains : 56/56 places, 266/266 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p3), (X (NOT (AND p1 (NOT p3)))), (X p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 131 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 1127 ms. (35 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 986 ms. (40 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 962 ms. (41 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1232 ms. (32 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 766 ms. (52 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 929 ms. (43 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1045 ms. (38 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (8 resets) in 1312 ms. (30 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 7934 steps, run visited all 7 properties in 67 ms. (steps per millisecond=118 )
Probabilistic random walk after 7934 steps, saw 2403 distinct states, run finished after 67 ms. (steps per millisecond=118 ) properties seen :7
Knowledge obtained : [(AND (NOT p1) p0 p3), (X (NOT (AND p1 (NOT p3)))), (X p3), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p3 (NOT p1)))), (F (NOT (OR p3 p1))), (F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p3))]
Knowledge based reduction with 15 factoid took 505 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 167 ms.
Product exploration explored 100000 steps with 0 reset in 503 ms.
Support contains 5 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 266/266 transitions.
Graph (trivial) has 38 edges and 56 vertex of which 2 / 56 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 54 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 19 place count 54 transition count 249
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 21 place count 52 transition count 227
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 52 transition count 227
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 29 place count 52 transition count 221
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 51 transition count 211
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 51 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 51 transition count 210
Applied a total of 32 rules in 20 ms. Remains 51 /56 variables (removed 5) and now considering 210/266 (removed 56) transitions.
[2024-06-02 20:05:23] [INFO ] Flow matrix only has 174 transitions (discarded 36 similar events)
// Phase 1: matrix 174 rows 51 cols
[2024-06-02 20:05:23] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 20:05:23] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 20:05:23] [INFO ] Flow matrix only has 174 transitions (discarded 36 similar events)
[2024-06-02 20:05:23] [INFO ] Invariant cache hit.
[2024-06-02 20:05:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-02 20:05:23] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-06-02 20:05:23] [INFO ] Redundant transitions in 16 ms returned [207]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 203 sub problems to find dead transitions.
[2024-06-02 20:05:23] [INFO ] Flow matrix only has 173 transitions (discarded 36 similar events)
// Phase 1: matrix 173 rows 51 cols
[2024-06-02 20:05:23] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 20:05:23] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 20:05:24] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:05:24] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-02 20:05:24] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:05:24] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:05:25] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 172/223 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 41/103 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 20:05:28] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 1/224 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 11 (OVERLAPS) 0/224 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 105 constraints, problems are : Problem set: 0 solved, 203 unsolved in 11012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 1/51 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (OVERLAPS) 172/223 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 41/104 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 203/307 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 1/224 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 20:05:44] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-06-02 20:05:50] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/224 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/224 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 14 (OVERLAPS) 0/224 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 310 constraints, problems are : Problem set: 0 solved, 203 unsolved in 23730 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 51/51 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 8/8 constraints]
After SMT, in 34844ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 34846ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/56 places, 209/266 transitions.
Applied a total of 0 rules in 5 ms. Remains 51 /51 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35069 ms. Remains : 51/56 places, 209/266 transitions.
Treatment of property MedleyA-PT-15-LTLFireability-14 finished in 132276 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&&(G(p0)||X(X(F(p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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)))))'
Found a Shortening insensitive property : MedleyA-PT-15-LTLFireability-07
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 149 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 149/149 places, 379/379 transitions.
Graph (trivial) has 141 edges and 149 vertex of which 9 / 149 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 142 transition count 352
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 122 transition count 352
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 41 place count 122 transition count 345
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 55 place count 115 transition count 345
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 63 place count 107 transition count 331
Iterating global reduction 2 with 8 rules applied. Total rules applied 71 place count 107 transition count 331
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 107 transition count 328
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 74 place count 107 transition count 326
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 105 transition count 326
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 104 place count 92 transition count 313
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 90 transition count 306
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 90 transition count 306
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 138 place count 75 transition count 405
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 74 transition count 404
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 84 edges and 72 vertex of which 25 / 72 are part of one of the 10 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 142 place count 57 transition count 404
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 216 place count 57 transition count 330
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 220 place count 53 transition count 276
Iterating global reduction 5 with 4 rules applied. Total rules applied 224 place count 53 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 225 place count 53 transition count 275
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 229 place count 51 transition count 299
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 231 place count 51 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 7 with 84 rules applied. Total rules applied 315 place count 51 transition count 213
Performed 4 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 323 place count 47 transition count 207
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 336 place count 47 transition count 194
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 337 place count 46 transition count 187
Iterating global reduction 8 with 1 rules applied. Total rules applied 338 place count 46 transition count 187
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 8 with 2 rules applied. Total rules applied 340 place count 45 transition count 194
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 345 place count 45 transition count 189
Applied a total of 345 rules in 57 ms. Remains 45 /149 variables (removed 104) and now considering 189/379 (removed 190) transitions.
[2024-06-02 20:05:59] [INFO ] Flow matrix only has 175 transitions (discarded 14 similar events)
// Phase 1: matrix 175 rows 45 cols
[2024-06-02 20:05:59] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 20:05:59] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 20:05:59] [INFO ] Flow matrix only has 175 transitions (discarded 14 similar events)
[2024-06-02 20:05:59] [INFO ] Invariant cache hit.
[2024-06-02 20:05:59] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-06-02 20:05:59] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-06-02 20:05:59] [INFO ] Flow matrix only has 175 transitions (discarded 14 similar events)
[2024-06-02 20:05:59] [INFO ] Invariant cache hit.
[2024-06-02 20:05:59] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 3/45 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-02 20:06:01] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:06:01] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2024-06-02 20:06:01] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:06:01] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 174/219 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 34/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/220 variables, and 88 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6726 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 3/45 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 174/219 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 34/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 185/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-02 20:06:10] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:06:10] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/220 variables, and 275 constraints, problems are : Problem set: 0 solved, 185 unsolved in 12021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 45/45 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 6/6 constraints]
After SMT, in 18935ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 18938ms
Starting structural reductions in LI_LTL mode, iteration 1 : 45/149 places, 189/379 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 19273 ms. Remains : 45/149 places, 189/379 transitions.
Running random walk in product with property : MedleyA-PT-15-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 60 ms.
Product exploration explored 100000 steps with 0 reset in 67 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
RANDOM walk for 40000 steps (6427 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1984 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 608 steps, run visited all 1 properties in 6 ms. (steps per millisecond=101 )
Probabilistic random walk after 608 steps, saw 190 distinct states, run finished after 6 ms. (steps per millisecond=101 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Support contains 2 out of 45 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 189/189 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 45 transition count 175
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 43 transition count 194
Applied a total of 18 rules in 10 ms. Remains 43 /45 variables (removed 2) and now considering 194/189 (removed -5) transitions.
[2024-06-02 20:06:19] [INFO ] Flow matrix only has 171 transitions (discarded 23 similar events)
// Phase 1: matrix 171 rows 43 cols
[2024-06-02 20:06:19] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:06:19] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 20:06:19] [INFO ] Flow matrix only has 171 transitions (discarded 23 similar events)
[2024-06-02 20:06:19] [INFO ] Invariant cache hit.
[2024-06-02 20:06:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 20:06:19] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-06-02 20:06:19] [INFO ] Redundant transitions in 51 ms returned [103, 104, 106, 133, 134, 136, 139, 143, 144, 145, 146, 147, 152, 153]
Found 14 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 14 transitions
Redundant transitions reduction (with SMT) removed 14 transitions.
Running 176 sub problems to find dead transitions.
[2024-06-02 20:06:19] [INFO ] Flow matrix only has 157 transitions (discarded 23 similar events)
// Phase 1: matrix 157 rows 43 cols
[2024-06-02 20:06:19] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:06:19] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-02 20:06:20] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:06:20] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-06-02 20:06:20] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-02 20:06:20] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:06:21] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-06-02 20:06:21] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 156/199 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 37/91 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/200 variables, and 91 constraints, problems are : Problem set: 0 solved, 176 unsolved in 6157 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 3/43 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 156/199 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 37/91 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 176/267 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-02 20:06:31] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/199 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-02 20:06:37] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/199 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 14 (OVERLAPS) 0/199 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/200 variables, and 269 constraints, problems are : Problem set: 0 solved, 176 unsolved in 20413 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 8/8 constraints]
After SMT, in 26741ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 26744ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/45 places, 180/189 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 43 transition count 179
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 42 transition count 179
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 41 transition count 177
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 41 transition count 177
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 39 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 0 with 21 rules applied. Total rules applied 29 place count 39 transition count 154
Applied a total of 29 rules in 6 ms. Remains 39 /43 variables (removed 4) and now considering 154/180 (removed 26) transitions.
[2024-06-02 20:06:46] [INFO ] Flow matrix only has 141 transitions (discarded 13 similar events)
// Phase 1: matrix 141 rows 39 cols
[2024-06-02 20:06:46] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:06:46] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 20:06:46] [INFO ] Flow matrix only has 141 transitions (discarded 13 similar events)
[2024-06-02 20:06:46] [INFO ] Invariant cache hit.
[2024-06-02 20:06:46] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 20:06:46] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/45 places, 154/189 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27330 ms. Remains : 39/45 places, 154/189 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
RANDOM walk for 40000 steps (6433 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1176 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 615 steps, run visited all 1 properties in 5 ms. (steps per millisecond=123 )
Probabilistic random walk after 615 steps, saw 216 distinct states, run finished after 5 ms. (steps per millisecond=123 ) properties seen :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 85 ms.
Product exploration explored 100000 steps with 0 reset in 97 ms.
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 154/154 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 39 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 153
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 34 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 0 with 22 rules applied. Total rules applied 32 place count 34 transition count 147
Applied a total of 32 rules in 10 ms. Remains 34 /39 variables (removed 5) and now considering 147/154 (removed 7) transitions.
[2024-06-02 20:06:47] [INFO ] Flow matrix only has 134 transitions (discarded 13 similar events)
// Phase 1: matrix 134 rows 34 cols
[2024-06-02 20:06:47] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:06:47] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 20:06:47] [INFO ] Flow matrix only has 134 transitions (discarded 13 similar events)
[2024-06-02 20:06:47] [INFO ] Invariant cache hit.
[2024-06-02 20:06:47] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 20:06:47] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-06-02 20:06:47] [INFO ] Redundant transitions in 23 ms returned []
Running 141 sub problems to find dead transitions.
[2024-06-02 20:06:47] [INFO ] Flow matrix only has 134 transitions (discarded 13 similar events)
[2024-06-02 20:06:47] [INFO ] Invariant cache hit.
[2024-06-02 20:06:47] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-06-02 20:06:48] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:06:48] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:06:48] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:06:48] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:06:48] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 133/167 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 35/79 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 0/167 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/168 variables, and 79 constraints, problems are : Problem set: 0 solved, 141 unsolved in 5178 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 34/34 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 133/167 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 35/79 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 141/220 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/167 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/168 variables, and 220 constraints, problems are : Problem set: 0 solved, 141 unsolved in 6231 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 34/34 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 5/5 constraints]
After SMT, in 11580ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 11582ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/39 places, 147/154 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11873 ms. Remains : 34/39 places, 147/154 transitions.
Treatment of property MedleyA-PT-15-LTLFireability-07 finished in 60101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p1)||p0))&&F(G((p2||F((G(p1)||p3))))))))'
[2024-06-02 20:06:59] [INFO ] Flatten gal took : 25 ms
[2024-06-02 20:06:59] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-02 20:06:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 149 places, 379 transitions and 1288 arcs took 8 ms.
Total runtime 993414 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MedleyA-PT-15-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-15-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-15-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-15-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717358821171

--------------------
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-15-LTLFireability-00
ltl formula formula --ltl=/tmp/2935/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 149 places, 379 transitions and 1288 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.070 real 0.020 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2935/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2935/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2935/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2935/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 151 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 150, there are 407 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( 0/ 4): ~46 levels ~10000 states ~72428 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~91!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3481
pnml2lts-mc( 0/ 4): unique states count: 9961
pnml2lts-mc( 0/ 4): unique transitions count: 67033
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 41117
pnml2lts-mc( 0/ 4): - claim found count: 13371
pnml2lts-mc( 0/ 4): - claim success count: 10133
pnml2lts-mc( 0/ 4): - cum. max stack depth: 688
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10174 states 68505 transitions, fanout: 6.733
pnml2lts-mc( 0/ 4): Total exploration time 0.210 sec (0.210 sec minimum, 0.210 sec on average)
pnml2lts-mc( 0/ 4): States per second: 48448, Transitions per second: 326214
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 9.4 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 382 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-15-LTLFireability-06
ltl formula formula --ltl=/tmp/2935/ltl_1_
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 149 places, 379 transitions and 1288 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.070 real 0.040 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2935/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2935/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2935/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2935/ltl_1_
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 151 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 150, there are 388 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( 3/ 4): ~189 levels ~10000 states ~43684 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~102!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1880
pnml2lts-mc( 0/ 4): unique states count: 11846
pnml2lts-mc( 0/ 4): unique transitions count: 48578
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 19677
pnml2lts-mc( 0/ 4): - claim found count: 13600
pnml2lts-mc( 0/ 4): - claim success count: 11863
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1597
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11864 states 48612 transitions, fanout: 4.097
pnml2lts-mc( 0/ 4): Total exploration time 0.220 sec (0.220 sec minimum, 0.220 sec on average)
pnml2lts-mc( 0/ 4): States per second: 53927, Transitions per second: 220964
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 10.1 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 382 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-15-LTLFireability-07
ltl formula formula --ltl=/tmp/2935/ltl_2_
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 149 places, 379 transitions and 1288 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.060 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2935/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2935/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2935/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2935/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 150 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 150, there are 409 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( 3/ 4): ~33 levels ~10000 states ~87740 transitions
pnml2lts-mc( 0/ 4): ~523 levels ~20000 states ~136236 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~247!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4396
pnml2lts-mc( 0/ 4): unique states count: 21356
pnml2lts-mc( 0/ 4): unique transitions count: 177398
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 91076
pnml2lts-mc( 0/ 4): - claim found count: 56167
pnml2lts-mc( 0/ 4): - claim success count: 21422
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1638
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 21446 states 178060 transitions, fanout: 8.303
pnml2lts-mc( 0/ 4): Total exploration time 0.400 sec (0.400 sec minimum, 0.400 sec on average)
pnml2lts-mc( 0/ 4): States per second: 53615, Transitions per second: 445150
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 9.5 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 382 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-15-LTLFireability-14
ltl formula formula --ltl=/tmp/2935/ltl_3_
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 149 places, 379 transitions and 1288 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.060 real 0.020 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2935/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2935/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2935/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2935/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 150 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 150, there are 576 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 ~132!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 990
pnml2lts-mc( 0/ 4): unique states count: 4276
pnml2lts-mc( 0/ 4): unique transitions count: 15451
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 6615
pnml2lts-mc( 0/ 4): - claim found count: 3198
pnml2lts-mc( 0/ 4): - claim success count: 4291
pnml2lts-mc( 0/ 4): - cum. max stack depth: 665
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4291 states 15480 transitions, fanout: 3.608
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 53638, Transitions per second: 193500
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 11.0 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 382 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~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-15"
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-15, 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-171734921300116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-15.tgz
mv MedleyA-PT-15 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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