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.r575-smll-171734919500036.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MedleyA-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919500036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 75K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717353063085

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:31:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:31:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:31:06] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2024-06-02 18:31:06] [INFO ] Transformed 115 places.
[2024-06-02 18:31:06] [INFO ] Transformed 257 transitions.
[2024-06-02 18:31:06] [INFO ] Found NUPN structural information;
[2024-06-02 18:31:06] [INFO ] Parsed PT model containing 115 places and 257 transitions and 1160 arcs in 431 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA MedleyA-PT-05-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-05-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 254/254 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 101 transition count 226
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 101 transition count 226
Applied a total of 28 rules in 52 ms. Remains 101 /115 variables (removed 14) and now considering 226/254 (removed 28) transitions.
[2024-06-02 18:31:06] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
// Phase 1: matrix 225 rows 101 cols
[2024-06-02 18:31:06] [INFO ] Computed 20 invariants in 27 ms
[2024-06-02 18:31:07] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-06-02 18:31:07] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
[2024-06-02 18:31:07] [INFO ] Invariant cache hit.
[2024-06-02 18:31:07] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:31:07] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-06-02 18:31:07] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
[2024-06-02 18:31:07] [INFO ] Invariant cache hit.
[2024-06-02 18:31:07] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 18:31:10] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 29 ms to minimize.
[2024-06-02 18:31:11] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 4 ms to minimize.
[2024-06-02 18:31:11] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 224/325 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 93/217 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 0/326 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 218 constraints, problems are : Problem set: 0 solved, 225 unsolved in 14049 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 224/325 variables, 101/124 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 93/217 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 225/442 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (OVERLAPS) 1/326 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 18:31:37] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/326 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 13 (OVERLAPS) 0/326 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 444 constraints, problems are : Problem set: 0 solved, 225 unsolved in 25246 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 4/4 constraints]
After SMT, in 39849ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 39883ms
Starting structural reductions in LTL mode, iteration 1 : 101/115 places, 226/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41060 ms. Remains : 101/115 places, 226/254 transitions.
Support contains 42 out of 101 places after structural reductions.
[2024-06-02 18:31:48] [INFO ] Flatten gal took : 100 ms
[2024-06-02 18:31:48] [INFO ] Flatten gal took : 53 ms
[2024-06-02 18:31:48] [INFO ] Input system was already deterministic with 226 transitions.
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 40000 steps (2990 resets) in 2959 ms. (13 steps per ms) remains 9/30 properties
BEST_FIRST walk for 40004 steps (482 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (275 resets) in 121 ms. (327 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (451 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (478 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (362 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (371 resets) in 136 ms. (292 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (489 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
[2024-06-02 18:31:49] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
[2024-06-02 18:31:49] [INFO ] Invariant cache hit.
[2024-06-02 18:31:49] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 67/78 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 9/87 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 12/99 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 18:31:49] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 223/322 variables, 99/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 3/325 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/326 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/326 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 216 constraints, problems are : Problem set: 0 solved, 6 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 67/78 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 9/87 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 12/99 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 223/322 variables, 99/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 3/325 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/325 variables, 5/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/325 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 1/326 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/326 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/326 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 222 constraints, problems are : Problem set: 0 solved, 6 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1393ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 5 properties in 869 ms.
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 226/226 transitions.
Graph (complete) has 404 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 100 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 99 transition count 222
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 9 place count 95 transition count 214
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 95 transition count 214
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -81
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 33 place count 85 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 85 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 3 with 41 rules applied. Total rules applied 76 place count 85 transition count 252
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 92 place count 85 transition count 350
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 138 place count 69 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 69 transition count 319
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 142 place count 69 transition count 319
Applied a total of 142 rules in 217 ms. Remains 69 /101 variables (removed 32) and now considering 319/226 (removed -93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 69/101 places, 319/226 transitions.
RANDOM walk for 40000 steps (4722 resets) in 1047 ms. (38 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (285 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1521727 steps, run timeout after 3001 ms. (steps per millisecond=507 ) properties seen :0 out of 1
Probabilistic random walk after 1521727 steps, saw 251129 distinct states, run finished after 3006 ms. (steps per millisecond=506 ) properties seen :0
// Phase 1: matrix 319 rows 69 cols
[2024-06-02 18:31:55] [INFO ] Computed 20 invariants in 5 ms
[2024-06-02 18:31:55] [INFO ] State equation strengthened by 176 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/58 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/68 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 319/387 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 176/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/388 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/388 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 265 constraints, problems are : Problem set: 0 solved, 1 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 69/69 constraints, ReadFeed: 176/176 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/28 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/58 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/68 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 319/387 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 176/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/388 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/388 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 266 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 69/69 constraints, ReadFeed: 176/176 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 583ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 319/319 transitions.
Applied a total of 0 rules in 15 ms. Remains 69 /69 variables (removed 0) and now considering 319/319 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 69/69 places, 319/319 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 319/319 transitions.
Applied a total of 0 rules in 12 ms. Remains 69 /69 variables (removed 0) and now considering 319/319 (removed 0) transitions.
[2024-06-02 18:31:55] [INFO ] Invariant cache hit.
[2024-06-02 18:31:56] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-06-02 18:31:56] [INFO ] Invariant cache hit.
[2024-06-02 18:31:56] [INFO ] State equation strengthened by 176 read => feed constraints.
[2024-06-02 18:31:56] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2024-06-02 18:31:56] [INFO ] Redundant transitions in 74 ms returned []
Running 317 sub problems to find dead transitions.
[2024-06-02 18:31:56] [INFO ] Invariant cache hit.
[2024-06-02 18:31:56] [INFO ] State equation strengthened by 176 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 317 unsolved
[2024-06-02 18:32:00] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (OVERLAPS) 319/388 variables, 69/90 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 176/266 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (OVERLAPS) 0/388 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 266 constraints, problems are : Problem set: 0 solved, 317 unsolved in 16799 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 69/69 constraints, ReadFeed: 176/176 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (OVERLAPS) 319/388 variables, 69/90 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 176/266 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 317/583 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 9 (OVERLAPS) 0/388 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 583 constraints, problems are : Problem set: 0 solved, 317 unsolved in 24258 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 69/69 constraints, ReadFeed: 176/176 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 1/1 constraints]
After SMT, in 41841ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 41854ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42467 ms. Remains : 69/69 places, 319/319 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 33 edges and 69 vertex of which 5 / 69 are part of one of the 2 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 352 edges and 66 vertex of which 56 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 56 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 1 with 15 rules applied. Total rules applied 42 place count 56 transition count 271
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 56 transition count 269
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 64 place count 54 transition count 251
Free-agglomeration rule (complex) applied 3 times with reduction of 22 identical transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 54 transition count 268
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 78 place count 51 transition count 260
Partial Free-agglomeration rule applied 31 times.
Drop transitions (Partial Free agglomeration) removed 31 transitions
Iterating global reduction 3 with 31 rules applied. Total rules applied 109 place count 51 transition count 260
Applied a total of 109 rules in 47 ms. Remains 51 /69 variables (removed 18) and now considering 260/319 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 260 rows 51 cols
[2024-06-02 18:32:38] [INFO ] Computed 13 invariants in 5 ms
[2024-06-02 18:32:38] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 18:32:38] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-02 18:32:38] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:32:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 18:32:38] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 5 ms returned sat
[2024-06-02 18:32:38] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:32:38] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 18:32:38] [INFO ] After 21ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:32:38] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:32:38] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 472 ms.
Computed a total of 13 stabilizing places and 86 stable transitions
Graph (complete) has 506 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p0)&&F(!p1))||G(p0))))'
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 8 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 18:32:39] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 18:32:39] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:32:39] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 18:32:39] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:32:39] [INFO ] Invariant cache hit.
[2024-06-02 18:32:39] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:32:39] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:32:39] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:32:39] [INFO ] Invariant cache hit.
[2024-06-02 18:32:39] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:32:42] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 13705 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 16754 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 30658ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 30662ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31037 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 419 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-01
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-01 finished in 31569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Graph (complete) has 506 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 99 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 98 transition count 223
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 6 place count 95 transition count 217
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 95 transition count 217
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 27 place count 86 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 31 place count 86 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 43 place count 86 transition count 255
Applied a total of 43 rules in 57 ms. Remains 86 /101 variables (removed 15) and now considering 255/226 (removed -29) transitions.
[2024-06-02 18:33:10] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
// Phase 1: matrix 254 rows 86 cols
[2024-06-02 18:33:11] [INFO ] Computed 20 invariants in 5 ms
[2024-06-02 18:33:11] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-02 18:33:11] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2024-06-02 18:33:11] [INFO ] Invariant cache hit.
[2024-06-02 18:33:11] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 18:33:11] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
[2024-06-02 18:33:11] [INFO ] Redundant transitions in 96 ms returned []
Running 246 sub problems to find dead transitions.
[2024-06-02 18:33:11] [INFO ] Flow matrix only has 254 transitions (discarded 1 similar events)
[2024-06-02 18:33:11] [INFO ] Invariant cache hit.
[2024-06-02 18:33:11] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-06-02 18:33:15] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 253/339 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 28/135 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 9 (OVERLAPS) 1/340 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 11 (OVERLAPS) 0/340 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 136 constraints, problems are : Problem set: 0 solved, 246 unsolved in 14135 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 253/339 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 28/135 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 246/381 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 10 (OVERLAPS) 1/340 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 12 (OVERLAPS) 0/340 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 382 constraints, problems are : Problem set: 0 solved, 246 unsolved in 20144 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 1/1 constraints]
After SMT, in 34723ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 34728ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/101 places, 255/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35310 ms. Remains : 86/101 places, 255/226 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-02
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-02 finished in 35454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 7 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 18:33:46] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 18:33:46] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:33:46] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-02 18:33:46] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:33:46] [INFO ] Invariant cache hit.
[2024-06-02 18:33:46] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:33:46] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:33:46] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:33:46] [INFO ] Invariant cache hit.
[2024-06-02 18:33:46] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:33:49] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 13181 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 18392 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 31741ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 31745ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32146 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-03 finished in 32355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||(p1&&X(p1))))&&F(G(p2)))))'
Support contains 6 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 5 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 18:34:18] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:34:18] [INFO ] Invariant cache hit.
[2024-06-02 18:34:18] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 18:34:18] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:34:18] [INFO ] Invariant cache hit.
[2024-06-02 18:34:19] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:34:19] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:34:19] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:34:19] [INFO ] Invariant cache hit.
[2024-06-02 18:34:19] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:34:21] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 12984 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 16737 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 29920ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 29925ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30367 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-04
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-04 finished in 30550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p1)&&p0))||X(G(p2)))))'
Support contains 7 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 98 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 98 transition count 220
Applied a total of 6 rules in 5 ms. Remains 98 /101 variables (removed 3) and now considering 220/226 (removed 6) transitions.
[2024-06-02 18:34:49] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
// Phase 1: matrix 219 rows 98 cols
[2024-06-02 18:34:49] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 18:34:49] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 18:34:49] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 18:34:49] [INFO ] Invariant cache hit.
[2024-06-02 18:34:49] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:34:49] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-06-02 18:34:49] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2024-06-02 18:34:49] [INFO ] Invariant cache hit.
[2024-06-02 18:34:49] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-02 18:34:51] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-02 18:34:56] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/317 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/317 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 214 constraints, problems are : Problem set: 0 solved, 219 unsolved in 14473 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 219/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/317 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/317 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 433 constraints, problems are : Problem set: 0 solved, 219 unsolved in 16740 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints]
After SMT, in 31349ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 31352ms
Starting structural reductions in LTL mode, iteration 1 : 98/101 places, 220/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31681 ms. Remains : 98/101 places, 220/226 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-05
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-05 finished in 31969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 4 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 18:35:21] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 18:35:21] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:35:21] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-02 18:35:21] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:35:21] [INFO ] Invariant cache hit.
[2024-06-02 18:35:21] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:35:21] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:35:21] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:35:21] [INFO ] Invariant cache hit.
[2024-06-02 18:35:21] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:35:23] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 13290 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 17645 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 31081ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 31090ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31439 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-06 finished in 31593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1))||F((F(p3)&&p2)))))'
Support contains 9 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 9 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 18:35:52] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:35:52] [INFO ] Invariant cache hit.
[2024-06-02 18:35:52] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 18:35:52] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:35:52] [INFO ] Invariant cache hit.
[2024-06-02 18:35:53] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:35:53] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:35:53] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:35:53] [INFO ] Invariant cache hit.
[2024-06-02 18:35:53] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:35:55] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 13137 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14803 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 28134ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 28138ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28518 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-07
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-07 finished in 28767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(F(p1)))))))'
Support contains 7 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 4 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 18:36:21] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:36:21] [INFO ] Invariant cache hit.
[2024-06-02 18:36:21] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 18:36:21] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:36:21] [INFO ] Invariant cache hit.
[2024-06-02 18:36:21] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:36:22] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:36:22] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:36:22] [INFO ] Invariant cache hit.
[2024-06-02 18:36:22] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:36:23] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 10367 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 16540 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 27040ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 27045ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27440 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-08
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-08 finished in 27655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0) U G(p1))))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 99 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 99 transition count 222
Applied a total of 4 rules in 3 ms. Remains 99 /101 variables (removed 2) and now considering 222/226 (removed 4) transitions.
[2024-06-02 18:36:49] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
// Phase 1: matrix 221 rows 99 cols
[2024-06-02 18:36:49] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:36:49] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 18:36:49] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 18:36:49] [INFO ] Invariant cache hit.
[2024-06-02 18:36:49] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:36:49] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-06-02 18:36:49] [INFO ] Flow matrix only has 221 transitions (discarded 1 similar events)
[2024-06-02 18:36:49] [INFO ] Invariant cache hit.
[2024-06-02 18:36:49] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-02 18:36:51] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:36:51] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:36:51] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 220/319 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 93/215 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/320 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 216 constraints, problems are : Problem set: 0 solved, 221 unsolved in 11658 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 220/319 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 93/215 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 221/436 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/320 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/320 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 437 constraints, problems are : Problem set: 0 solved, 221 unsolved in 14768 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints]
After SMT, in 26562ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 26564ms
Starting structural reductions in LTL mode, iteration 1 : 99/101 places, 222/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26832 ms. Remains : 99/101 places, 222/226 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-09 finished in 27138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Graph (complete) has 506 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 99 transition count 224
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 7 place count 95 transition count 216
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 95 transition count 216
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -81
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 33 place count 84 transition count 297
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 37 place count 84 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 3 with 37 rules applied. Total rules applied 74 place count 84 transition count 256
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 83 transition count 263
Applied a total of 76 rules in 36 ms. Remains 83 /101 variables (removed 18) and now considering 263/226 (removed -37) transitions.
[2024-06-02 18:37:16] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
// Phase 1: matrix 262 rows 83 cols
[2024-06-02 18:37:16] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:37:16] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 18:37:16] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 18:37:16] [INFO ] Invariant cache hit.
[2024-06-02 18:37:16] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-06-02 18:37:16] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-06-02 18:37:16] [INFO ] Redundant transitions in 46 ms returned []
Running 261 sub problems to find dead transitions.
[2024-06-02 18:37:16] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 18:37:16] [INFO ] Invariant cache hit.
[2024-06-02 18:37:16] [INFO ] State equation strengthened by 142 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-02 18:37:18] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 261/344 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 141/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 1/345 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 0/345 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 246 constraints, problems are : Problem set: 0 solved, 261 unsolved in 13459 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 261/344 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 141/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 261/506 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 1/345 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 0/345 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 507 constraints, problems are : Problem set: 0 solved, 261 unsolved in 18581 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
After SMT, in 32346ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 32349ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/101 places, 263/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32734 ms. Remains : 83/101 places, 263/226 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-10
Product exploration explored 100000 steps with 1 reset in 200 ms.
Product exploration explored 100000 steps with 0 reset in 137 ms.
Computed a total of 11 stabilizing places and 134 stable transitions
Computed a total of 11 stabilizing places and 134 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 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 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2234 steps (200 resets) in 17 ms. (124 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 114 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 263/263 transitions.
Applied a total of 0 rules in 8 ms. Remains 83 /83 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-06-02 18:37:50] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 18:37:50] [INFO ] Invariant cache hit.
[2024-06-02 18:37:50] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 18:37:50] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 18:37:50] [INFO ] Invariant cache hit.
[2024-06-02 18:37:50] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-06-02 18:37:50] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-06-02 18:37:50] [INFO ] Redundant transitions in 63 ms returned []
Running 261 sub problems to find dead transitions.
[2024-06-02 18:37:50] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 18:37:50] [INFO ] Invariant cache hit.
[2024-06-02 18:37:50] [INFO ] State equation strengthened by 142 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-02 18:37:52] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 261/344 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 141/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 1/345 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 0/345 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 246 constraints, problems are : Problem set: 0 solved, 261 unsolved in 13610 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 261/344 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 141/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 261/506 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 1/345 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 0/345 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 507 constraints, problems are : Problem set: 0 solved, 261 unsolved in 24748 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
After SMT, in 38683ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 38686ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39186 ms. Remains : 83/83 places, 263/263 transitions.
Computed a total of 11 stabilizing places and 134 stable transitions
Computed a total of 11 stabilizing places and 134 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 715 steps (63 resets) in 10 ms. (65 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 142 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 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 157 ms.
Product exploration explored 100000 steps with 1 reset in 186 ms.
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 263/263 transitions.
Applied a total of 0 rules in 7 ms. Remains 83 /83 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-06-02 18:38:30] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 18:38:30] [INFO ] Invariant cache hit.
[2024-06-02 18:38:30] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 18:38:30] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 18:38:30] [INFO ] Invariant cache hit.
[2024-06-02 18:38:30] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-06-02 18:38:30] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-06-02 18:38:30] [INFO ] Redundant transitions in 52 ms returned []
Running 261 sub problems to find dead transitions.
[2024-06-02 18:38:30] [INFO ] Flow matrix only has 262 transitions (discarded 1 similar events)
[2024-06-02 18:38:30] [INFO ] Invariant cache hit.
[2024-06-02 18:38:30] [INFO ] State equation strengthened by 142 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-06-02 18:38:33] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 261/344 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 141/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 1/345 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 0/345 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 246 constraints, problems are : Problem set: 0 solved, 261 unsolved in 16111 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 261/344 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 141/245 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 261/506 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (OVERLAPS) 1/345 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 0/345 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 507 constraints, problems are : Problem set: 0 solved, 261 unsolved in 23747 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 83/83 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints]
After SMT, in 40384ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 40390ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40754 ms. Remains : 83/83 places, 263/263 transitions.
Treatment of property MedleyA-PT-05-LTLFireability-10 finished in 114756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p1 U !p2)&&p0))))'
Support contains 4 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 2 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 18:39:11] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 18:39:11] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:39:11] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 18:39:11] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:39:11] [INFO ] Invariant cache hit.
[2024-06-02 18:39:11] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:39:11] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:39:11] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:39:11] [INFO ] Invariant cache hit.
[2024-06-02 18:39:11] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:39:13] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 12548 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 17648 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 30406ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 30410ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30812 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) p2), p2, (OR (NOT p0) p2)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-12
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-12 finished in 31062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((F((G(F(!p1))||(!p2&&F(!p1))))&&p0)||(p3&&G(p4)&&F((G(F(!p1))||(!p2&&F(!p1)))))))))'
Support contains 12 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Graph (complete) has 506 edges and 101 vertex of which 100 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 100 transition count 224
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 99 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 7 place count 95 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 95 transition count 216
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 31 place count 85 transition count 285
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 35 place count 85 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 1 with 25 rules applied. Total rules applied 60 place count 85 transition count 256
Applied a total of 60 rules in 41 ms. Remains 85 /101 variables (removed 16) and now considering 256/226 (removed -30) transitions.
[2024-06-02 18:39:42] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
// Phase 1: matrix 255 rows 85 cols
[2024-06-02 18:39:42] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:39:42] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 18:39:42] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 18:39:42] [INFO ] Invariant cache hit.
[2024-06-02 18:39:42] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-06-02 18:39:42] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-06-02 18:39:42] [INFO ] Redundant transitions in 67 ms returned []
Running 255 sub problems to find dead transitions.
[2024-06-02 18:39:42] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 18:39:42] [INFO ] Invariant cache hit.
[2024-06-02 18:39:42] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-02 18:39:45] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 254/339 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 137/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 1/340 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (OVERLAPS) 0/340 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 244 constraints, problems are : Problem set: 0 solved, 255 unsolved in 15668 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 254/339 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 137/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 255/498 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (OVERLAPS) 1/340 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/340 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 499 constraints, problems are : Problem set: 0 solved, 255 unsolved in 21976 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 1/1 constraints]
After SMT, in 38095ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 38101ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/101 places, 256/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38631 ms. Remains : 85/101 places, 256/226 transitions.
Stuttering acceptance computed with spot in 375 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4)), (AND p1 (NOT p4))]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-13
Product exploration explored 100000 steps with 1 reset in 481 ms.
Product exploration explored 100000 steps with 1 reset in 278 ms.
Computed a total of 11 stabilizing places and 127 stable transitions
Computed a total of 11 stabilizing places and 127 stable transitions
Knowledge obtained : [(AND p0 p3 p4 (NOT p1) (NOT p2)), (X (NOT p2)), (X p3), (X p4), (X (NOT (OR (AND p0 p2) (AND p3 p2 p4)))), (X (NOT (AND (NOT p0) p3 p4))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))))), (X p0), (X (NOT (OR (AND p0 p1) (AND p3 p1 p4)))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X p4)), (X (X (NOT (OR (AND p0 p2) (AND p3 p2 p4))))), (X (X (NOT (AND p0 p2 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (AND (NOT p0) p3 p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4)))))), (X (X (NOT (AND p0 p1 (NOT p4))))), (X (X (NOT (AND p0 p1 (NOT p2) p4)))), (X (X p0)), (X (X (NOT (OR (AND p0 p1) (AND p3 p1 p4))))), (X (X (NOT (AND p0 p2 p4)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 216 ms. Reduced automaton from 7 states, 22 edges and 5 AP (stutter insensitive) to 7 states, 22 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 358 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4)), (AND p1 (NOT p4))]
RANDOM walk for 40000 steps (3404 resets) in 483 ms. (82 steps per ms) remains 11/20 properties
BEST_FIRST walk for 40004 steps (251 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (242 resets) in 534 ms. (74 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (243 resets) in 194 ms. (205 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (250 resets) in 160 ms. (248 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (254 resets) in 196 ms. (203 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (245 resets) in 164 ms. (242 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (187 resets) in 524 ms. (76 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (383 resets) in 201 ms. (198 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (232 resets) in 106 ms. (373 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (250 resets) in 178 ms. (223 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (244 resets) in 114 ms. (347 steps per ms) remains 11/11 properties
[2024-06-02 18:40:23] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 18:40:23] [INFO ] Invariant cache hit.
[2024-06-02 18:40:23] [INFO ] State equation strengthened by 138 read => feed constraints.
Problem apf2 is UNSAT
Problem apf18 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 46/58 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 16/74 variables, 5/15 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 11/85 variables, 5/20 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 254/339 variables, 85/105 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 137/242 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/242 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 1/340 variables, 1/243 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/243 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/340 variables, 0/243 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 243 constraints, problems are : Problem set: 2 solved, 9 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 46/58 variables, 10/10 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 16/74 variables, 5/15 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 11/85 variables, 5/20 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 254/339 variables, 85/105 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 137/242 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 9/251 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/251 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/340 variables, 1/252 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/252 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/340 variables, 0/252 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 252 constraints, problems are : Problem set: 2 solved, 9 unsolved in 1673 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 9/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 2254ms problems are : Problem set: 2 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
Finished Parikh walk after 8739 steps, including 182 resets, run visited all 9 properties in 185 ms. (steps per millisecond=47 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 192 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p4 (NOT p1) (NOT p2)), (X (NOT p2)), (X p3), (X p4), (X (NOT (OR (AND p0 p2) (AND p3 p2 p4)))), (X (NOT (AND (NOT p0) p3 p4))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))))), (X p0), (X (NOT (OR (AND p0 p1) (AND p3 p1 p4)))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X p4)), (X (X (NOT (OR (AND p0 p2) (AND p3 p2 p4))))), (X (X (NOT (AND p0 p2 (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (AND (NOT p0) p3 p4)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4)))))), (X (X (NOT (AND p0 p1 (NOT p4))))), (X (X (NOT (AND p0 p1 (NOT p2) p4)))), (X (X p0)), (X (X (NOT (OR (AND p0 p1) (AND p3 p1 p4))))), (X (X (NOT (AND p0 p2 p4)))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p2) (NOT p4))), (G (OR (NOT p2) (NOT p4)))]
False Knowledge obtained : [(F (NOT (OR p0 p4))), (F (NOT (OR p4 (NOT p1)))), (F (NOT (OR p0 (NOT p4)))), (F (NOT (OR (NOT p0) p2 (NOT p4) (NOT p1)))), (F (NOT p4)), (F (NOT (AND (OR (NOT p0) (NOT p1)) (OR (NOT p3) (NOT p4) (NOT p1))))), (F (NOT (OR (NOT p4) (NOT p1)))), (F (NOT (AND (OR (NOT p0) (NOT p2)) (OR (NOT p2) (NOT p3) (NOT p4))))), (F (NOT (OR (NOT p0) p4 (NOT p1)))), (F (NOT (OR (NOT p2) p4))), (F (NOT (OR (NOT p0) (NOT p2) p4))), (F p1), (F p2), (F (NOT p0)), (F (NOT (OR p2 (NOT p4) (NOT p1)))), (F (NOT p3)), (F (NOT (AND (OR p0 p3) (OR p0 p4)))), (F (NOT (OR p0 (NOT p3) (NOT p4))))]
Knowledge based reduction with 27 factoid took 1408 ms. Reduced automaton from 7 states, 22 edges and 5 AP (stutter insensitive) to 6 states, 17 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 366 ms :[(OR p1 (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR p1 (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Stuttering acceptance computed with spot in 301 ms :[(OR p1 (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR p1 (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Support contains 12 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 256/256 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-06-02 18:40:28] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 18:40:28] [INFO ] Invariant cache hit.
[2024-06-02 18:40:28] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 18:40:28] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 18:40:28] [INFO ] Invariant cache hit.
[2024-06-02 18:40:28] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-06-02 18:40:28] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-06-02 18:40:28] [INFO ] Redundant transitions in 56 ms returned []
Running 255 sub problems to find dead transitions.
[2024-06-02 18:40:28] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 18:40:28] [INFO ] Invariant cache hit.
[2024-06-02 18:40:28] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-02 18:40:30] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 254/339 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 137/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 1/340 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (OVERLAPS) 0/340 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 244 constraints, problems are : Problem set: 0 solved, 255 unsolved in 15316 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 254/339 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 137/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 255/498 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (OVERLAPS) 1/340 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/340 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 499 constraints, problems are : Problem set: 0 solved, 255 unsolved in 22125 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 1/1 constraints]
After SMT, in 37805ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 37811ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38164 ms. Remains : 85/85 places, 256/256 transitions.
Computed a total of 11 stabilizing places and 127 stable transitions
Computed a total of 11 stabilizing places and 127 stable transitions
Knowledge obtained : [(AND p0 p4 p3 (NOT p1) (NOT p2)), (X (NOT p2)), (X p3), (X p4), (X (NOT (AND (NOT p0) p4 p3))), (X (NOT (OR (AND p0 p1) (AND p4 p3 p1)))), (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))))), (X p0), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X p4)), (X (X (NOT (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (AND (NOT p0) p4 p3)))), (X (X (NOT (OR (AND p0 p1) (AND p4 p3 p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3)))))), (X (X (NOT (OR (AND p0 p2 p1) (AND p0 (NOT p4) p1))))), (X (X (NOT (AND p0 (NOT p2) p4 p1)))), (X (X p0)), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 255 ms. Reduced automaton from 6 states, 17 edges and 5 AP (stutter insensitive) to 6 states, 17 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 370 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
RANDOM walk for 40000 steps (3438 resets) in 1343 ms. (29 steps per ms) remains 7/15 properties
BEST_FIRST walk for 40004 steps (233 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (252 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (253 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (194 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (372 resets) in 145 ms. (274 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (243 resets) in 214 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (222 resets) in 172 ms. (231 steps per ms) remains 7/7 properties
[2024-06-02 18:41:07] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 18:41:07] [INFO ] Invariant cache hit.
[2024-06-02 18:41:07] [INFO ] State equation strengthened by 138 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 46/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 16/74 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 11/85 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 254/339 variables, 85/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 137/242 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/340 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/340 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 243 constraints, problems are : Problem set: 0 solved, 7 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 46/58 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 16/74 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 11/85 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 254/339 variables, 85/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 137/242 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 7/249 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/340 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/340 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 250 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1128 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1729ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 457 ms.
Support contains 12 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 256/256 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 85 transition count 254
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 15 place count 85 transition count 308
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 43 place count 72 transition count 293
Applied a total of 43 rules in 22 ms. Remains 72 /85 variables (removed 13) and now considering 293/256 (removed -37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 72/85 places, 293/256 transitions.
RANDOM walk for 40000 steps (4716 resets) in 1413 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (297 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (229 resets) in 98 ms. (404 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (529 resets) in 217 ms. (183 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (303 resets) in 189 ms. (210 steps per ms) remains 3/3 properties
// Phase 1: matrix 293 rows 72 cols
[2024-06-02 18:41:10] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:41:10] [INFO ] State equation strengthened by 163 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/63 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/72 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 293/365 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 163/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 255 constraints, problems are : Problem set: 0 solved, 3 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 72/72 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/63 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 9/72 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 293/365 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 163/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/365 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 258 constraints, problems are : Problem set: 0 solved, 3 unsolved in 520 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 72/72 constraints, ReadFeed: 163/163 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 826ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 795 steps, including 75 resets, run visited all 1 properties in 7 ms. (steps per millisecond=113 )
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 38 ms.
Knowledge obtained : [(AND p0 p4 p3 (NOT p1) (NOT p2)), (X (NOT p2)), (X p3), (X p4), (X (NOT (AND (NOT p0) p4 p3))), (X (NOT (OR (AND p0 p1) (AND p4 p3 p1)))), (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))))), (X p0), (X (NOT (AND p0 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X p4)), (X (X (NOT (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND (NOT p0) p4)))), (X (X (NOT (AND (NOT p0) p4 p3)))), (X (X (NOT (OR (AND p0 p1) (AND p4 p3 p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3)))))), (X (X (NOT (OR (AND p0 p2 p1) (AND p0 (NOT p4) p1))))), (X (X (NOT (AND p0 (NOT p2) p4 p1)))), (X (X p0)), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p3) (OR p0 p4)))), (F (NOT (OR p0 (NOT p3) (NOT p4)))), (F (NOT (OR (NOT p0) (NOT p4) (NOT p1) p2))), (F (NOT (OR p4 (NOT p1)))), (F p1), (F (NOT p4)), (F (NOT (OR p0 (NOT p4)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 p4))), (F p2), (F (NOT (OR (NOT p4) (NOT p1)))), (F (NOT p3)), (F (NOT (AND (OR (NOT p0) p4 (NOT p1)) (OR (NOT p0) (NOT p1) (NOT p2))))), (F (NOT (AND (OR (NOT p0) (NOT p1)) (OR (NOT p3) (NOT p4) (NOT p1)))))]
Knowledge based reduction with 23 factoid took 1039 ms. Reduced automaton from 6 states, 17 edges and 5 AP (stutter insensitive) to 6 states, 17 edges and 5 AP (stutter insensitive).
Stuttering acceptance computed with spot in 319 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Stuttering acceptance computed with spot in 383 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Stuttering acceptance computed with spot in 264 ms :[(OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR p1 (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4))), (OR (AND p0 p1 p2) (AND (NOT p0) (NOT p4)) (AND p1 (NOT p4))), p1, p1, (AND p1 (NOT p4))]
Product exploration explored 100000 steps with 2 reset in 193 ms.
Product exploration explored 100000 steps with 4 reset in 290 ms.
Support contains 12 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 256/256 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-06-02 18:41:14] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
// Phase 1: matrix 255 rows 85 cols
[2024-06-02 18:41:14] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:41:14] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 18:41:14] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 18:41:14] [INFO ] Invariant cache hit.
[2024-06-02 18:41:14] [INFO ] State equation strengthened by 138 read => feed constraints.
[2024-06-02 18:41:14] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-06-02 18:41:14] [INFO ] Redundant transitions in 48 ms returned []
Running 255 sub problems to find dead transitions.
[2024-06-02 18:41:14] [INFO ] Flow matrix only has 255 transitions (discarded 1 similar events)
[2024-06-02 18:41:14] [INFO ] Invariant cache hit.
[2024-06-02 18:41:14] [INFO ] State equation strengthened by 138 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
[2024-06-02 18:41:16] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 254/339 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 137/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (OVERLAPS) 1/340 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (OVERLAPS) 0/340 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 244 constraints, problems are : Problem set: 0 solved, 255 unsolved in 12820 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (OVERLAPS) 254/339 variables, 85/106 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 137/243 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 255/498 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 9 (OVERLAPS) 1/340 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 11 (OVERLAPS) 0/340 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 499 constraints, problems are : Problem set: 0 solved, 255 unsolved in 22431 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 138/138 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 1/1 constraints]
After SMT, in 35522ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 35525ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35906 ms. Remains : 85/85 places, 256/256 transitions.
Treatment of property MedleyA-PT-05-LTLFireability-13 finished in 127799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(G(p1))))))'
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 97 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 97 transition count 218
Applied a total of 8 rules in 2 ms. Remains 97 /101 variables (removed 4) and now considering 218/226 (removed 8) transitions.
[2024-06-02 18:41:50] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2024-06-02 18:41:50] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 18:41:50] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 18:41:50] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:41:50] [INFO ] Invariant cache hit.
[2024-06-02 18:41:50] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:41:50] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 18:41:50] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2024-06-02 18:41:50] [INFO ] Invariant cache hit.
[2024-06-02 18:41:50] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 18:41:52] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 11796 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 18956 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints]
After SMT, in 30876ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 30880ms
Starting structural reductions in LTL mode, iteration 1 : 97/101 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31165 ms. Remains : 97/101 places, 218/226 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-05-LTLFireability-15
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-05-LTLFireability-15 finished in 31423 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((F((G(F(!p1))||(!p2&&F(!p1))))&&p0)||(p3&&G(p4)&&F((G(F(!p1))||(!p2&&F(!p1)))))))))'
[2024-06-02 18:42:22] [INFO ] Flatten gal took : 33 ms
[2024-06-02 18:42:22] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-06-02 18:42:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 101 places, 226 transitions and 1095 arcs took 11 ms.
Total runtime 676644 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-05

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/402/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 101
TRANSITIONS: 226
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.000s]


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


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

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

Process ID: 1596
MODEL NAME: /home/mcc/execution/402/model
101 places, 226 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA MedleyA-PT-05-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-05-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717353876390

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is MedleyA-PT-05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r575-smll-171734919500036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;