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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 82K 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-07-LTLFireability-00
FORMULA_NAME MedleyA-PT-07-LTLFireability-01
FORMULA_NAME MedleyA-PT-07-LTLFireability-02
FORMULA_NAME MedleyA-PT-07-LTLFireability-03
FORMULA_NAME MedleyA-PT-07-LTLFireability-04
FORMULA_NAME MedleyA-PT-07-LTLFireability-05
FORMULA_NAME MedleyA-PT-07-LTLFireability-06
FORMULA_NAME MedleyA-PT-07-LTLFireability-07
FORMULA_NAME MedleyA-PT-07-LTLFireability-08
FORMULA_NAME MedleyA-PT-07-LTLFireability-09
FORMULA_NAME MedleyA-PT-07-LTLFireability-10
FORMULA_NAME MedleyA-PT-07-LTLFireability-11
FORMULA_NAME MedleyA-PT-07-LTLFireability-12
FORMULA_NAME MedleyA-PT-07-LTLFireability-13
FORMULA_NAME MedleyA-PT-07-LTLFireability-14
FORMULA_NAME MedleyA-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717354447003

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-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:54:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:54:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:54:09] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2024-06-02 18:54:09] [INFO ] Transformed 145 places.
[2024-06-02 18:54:09] [INFO ] Transformed 287 transitions.
[2024-06-02 18:54:09] [INFO ] Found NUPN structural information;
[2024-06-02 18:54:09] [INFO ] Parsed PT model containing 145 places and 287 transitions and 1240 arcs in 420 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 129 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 2 transitions.
FORMULA MedleyA-PT-07-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 285/285 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 285
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 31 place count 112 transition count 254
Iterating global reduction 1 with 29 rules applied. Total rules applied 60 place count 112 transition count 254
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 110 transition count 250
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 110 transition count 250
Applied a total of 64 rules in 101 ms. Remains 110 /143 variables (removed 33) and now considering 250/285 (removed 35) transitions.
// Phase 1: matrix 250 rows 110 cols
[2024-06-02 18:54:10] [INFO ] Computed 10 invariants in 35 ms
[2024-06-02 18:54:10] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-06-02 18:54:10] [INFO ] Invariant cache hit.
[2024-06-02 18:54:11] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 774 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2024-06-02 18:54:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/110 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 201 unsolved
[2024-06-02 18:54:15] [INFO ] Deduced a trap composed of 26 places in 499 ms of which 28 ms to minimize.
[2024-06-02 18:54:15] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-06-02 18:54:16] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2024-06-02 18:54:16] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2024-06-02 18:54:16] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 3 ms to minimize.
[2024-06-02 18:54:16] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 6/16 constraints. Problems are: Problem set: 48 solved, 201 unsolved
[2024-06-02 18:54:18] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-02 18:54:18] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:54:18] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:54:18] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 1 ms to minimize.
[2024-06-02 18:54:18] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:54:18] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 6/22 constraints. Problems are: Problem set: 48 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/22 constraints. Problems are: Problem set: 48 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 250/360 variables, 110/132 constraints. Problems are: Problem set: 48 solved, 201 unsolved
[2024-06-02 18:54:22] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 1/133 constraints. Problems are: Problem set: 48 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/133 constraints. Problems are: Problem set: 48 solved, 201 unsolved
At refinement iteration 9 (OVERLAPS) 0/360 variables, 0/133 constraints. Problems are: Problem set: 48 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 133 constraints, problems are : Problem set: 48 solved, 201 unsolved in 17385 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 48 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 6/6 constraints. Problems are: Problem set: 48 solved, 201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/6 constraints. Problems are: Problem set: 48 solved, 201 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 13/23 constraints. Problems are: Problem set: 48 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/23 constraints. Problems are: Problem set: 48 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 250/360 variables, 110/133 constraints. Problems are: Problem set: 48 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 201/334 constraints. Problems are: Problem set: 48 solved, 201 unsolved
[2024-06-02 18:54:35] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 3 ms to minimize.
[2024-06-02 18:54:36] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-06-02 18:54:36] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 3/337 constraints. Problems are: Problem set: 48 solved, 201 unsolved
[2024-06-02 18:54:41] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 1/338 constraints. Problems are: Problem set: 48 solved, 201 unsolved
[2024-06-02 18:54:44] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 2 ms to minimize.
[2024-06-02 18:54:44] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 2/340 constraints. Problems are: Problem set: 48 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/340 constraints. Problems are: Problem set: 48 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 0/360 variables, 0/340 constraints. Problems are: Problem set: 48 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 340 constraints, problems are : Problem set: 48 solved, 201 unsolved in 29524 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 201/249 constraints, Known Traps: 19/19 constraints]
After SMT, in 47811ms problems are : Problem set: 48 solved, 201 unsolved
Search for dead transitions found 48 dead transitions in 47854ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/143 places, 202/285 transitions.
Applied a total of 0 rules in 5 ms. Remains 110 /110 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48796 ms. Remains : 110/143 places, 202/285 transitions.
Support contains 34 out of 110 places after structural reductions.
[2024-06-02 18:54:59] [INFO ] Flatten gal took : 69 ms
[2024-06-02 18:54:59] [INFO ] Flatten gal took : 30 ms
[2024-06-02 18:54:59] [INFO ] Input system was already deterministic with 202 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 40000 steps (1404 resets) in 2917 ms. (13 steps per ms) remains 15/29 properties
BEST_FIRST walk for 4004 steps (31 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (29 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 58 ms. (67 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (30 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (33 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (34 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (33 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (27 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
// Phase 1: matrix 202 rows 110 cols
[2024-06-02 18:55:00] [INFO ] Computed 10 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 36/58 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 3 (OVERLAPS) 35/93 variables, 5/9 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 182/275 variables, 93/102 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/102 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 22/297 variables, 8/110 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/110 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2/299 variables, 1/111 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 2/113 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/113 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 11/310 variables, 5/118 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 0/118 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 2/312 variables, 2/120 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/312 variables, 0/120 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/312 variables, 0/120 constraints. Problems are: Problem set: 4 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 120 constraints, problems are : Problem set: 4 solved, 11 unsolved in 836 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 38/56 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 10 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 3 (OVERLAPS) 37/93 variables, 5/9 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 182/275 variables, 93/102 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 1/103 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/103 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 22/297 variables, 8/111 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 8/119 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/119 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2/299 variables, 1/120 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 2/122 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 0/122 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 11/310 variables, 5/127 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/310 variables, 0/127 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 2/312 variables, 2/129 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/312 variables, 0/129 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 0/312 variables, 0/129 constraints. Problems are: Problem set: 6 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 312/312 variables, and 129 constraints, problems are : Problem set: 6 solved, 9 unsolved in 1563 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 9/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 2488ms problems are : Problem set: 6 solved, 9 unsolved
Parikh walk visited 8 properties in 1036 ms.
Support contains 4 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 202/202 transitions.
Graph (complete) has 352 edges and 110 vertex of which 105 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 105 transition count 171
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 49 place count 89 transition count 167
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 53 place count 87 transition count 165
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 53 place count 87 transition count 158
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 67 place count 80 transition count 158
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 74 place count 73 transition count 147
Iterating global reduction 3 with 7 rules applied. Total rules applied 81 place count 73 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 81 place count 73 transition count 146
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 72 transition count 146
Performed 19 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 39 rules applied. Total rules applied 122 place count 52 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 52 transition count 124
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 136 place count 46 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 156 place count 46 transition count 128
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 160 place count 44 transition count 151
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 164 place count 44 transition count 147
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 168 place count 40 transition count 147
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 170 place count 40 transition count 145
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 172 place count 38 transition count 145
Applied a total of 172 rules in 96 ms. Remains 38 /110 variables (removed 72) and now considering 145/202 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 38/110 places, 145/202 transitions.
RANDOM walk for 40000 steps (131 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (172 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1095 steps, run visited all 1 properties in 15 ms. (steps per millisecond=73 )
Probabilistic random walk after 1095 steps, saw 402 distinct states, run finished after 21 ms. (steps per millisecond=52 ) properties seen :1
Successfully simplified 6 atomic propositions for a total of 13 simplifications.
FORMULA MedleyA-PT-07-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 11 stable transitions
Graph (complete) has 352 edges and 110 vertex of which 105 are kept as prefixes of interest. Removing 5 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(G((p0||X((G(F(p2))||p1))))))'
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 202/202 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 104 transition count 194
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 104 transition count 194
Applied a total of 12 rules in 22 ms. Remains 104 /110 variables (removed 6) and now considering 194/202 (removed 8) transitions.
// Phase 1: matrix 194 rows 104 cols
[2024-06-02 18:55:04] [INFO ] Computed 10 invariants in 10 ms
[2024-06-02 18:55:04] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 18:55:04] [INFO ] Invariant cache hit.
[2024-06-02 18:55:05] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-06-02 18:55:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 18:55:07] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-06-02 18:55:07] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:55:07] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:55:07] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:55:07] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-06-02 18:55:07] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 120 constraints, problems are : Problem set: 0 solved, 193 unsolved in 9245 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 193/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 18:55:18] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-06-02 18:55:18] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 315 constraints, problems are : Problem set: 0 solved, 193 unsolved in 11725 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints]
After SMT, in 21179ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 21188ms
Starting structural reductions in LTL mode, iteration 1 : 104/110 places, 194/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21522 ms. Remains : 104/110 places, 194/202 transitions.
Stuttering acceptance computed with spot in 419 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-00
Product exploration explored 100000 steps with 33399 reset in 328 ms.
Product exploration explored 100000 steps with 33356 reset in 289 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Graph (complete) has 336 edges and 104 vertex of which 99 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 421 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 3
RANDOM walk for 40000 steps (1403 resets) in 358 ms. (111 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (330 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (334 resets) in 259 ms. (153 steps per ms) remains 2/2 properties
[2024-06-02 18:55:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/47 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/83 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 171/254 variables, 83/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/284 variables, 11/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/288 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/297 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/297 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/298 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/298 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/298 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 114 constraints, problems are : Problem set: 0 solved, 2 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/47 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/83 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 171/254 variables, 83/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/284 variables, 11/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/288 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 9/297 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/297 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/298 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/298 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/298 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 116 constraints, problems are : Problem set: 0 solved, 2 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 622ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 183 ms.
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 194/194 transitions.
Graph (complete) has 336 edges and 104 vertex of which 99 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 99 transition count 166
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 18 rules applied. Total rules applied 44 place count 85 transition count 162
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 49 place count 83 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 82 transition count 159
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 50 place count 82 transition count 152
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 64 place count 75 transition count 152
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 66 place count 73 transition count 148
Iterating global reduction 4 with 2 rules applied. Total rules applied 68 place count 73 transition count 148
Performed 19 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 39 rules applied. Total rules applied 107 place count 53 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 109 place count 53 transition count 126
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 121 place count 47 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 141 place count 47 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 145 place count 45 transition count 153
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 149 place count 45 transition count 149
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 153 place count 41 transition count 149
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 155 place count 41 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 157 place count 39 transition count 147
Applied a total of 157 rules in 104 ms. Remains 39 /104 variables (removed 65) and now considering 147/194 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 39/104 places, 147/194 transitions.
RANDOM walk for 30543 steps (4469 resets) in 392 ms. (77 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 p1))), (F (NOT p1)), (F (NOT p2)), (F p0), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 11 factoid took 534 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 194/194 transitions.
Applied a total of 0 rules in 6 ms. Remains 104 /104 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-06-02 18:55:30] [INFO ] Invariant cache hit.
[2024-06-02 18:55:30] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 18:55:30] [INFO ] Invariant cache hit.
[2024-06-02 18:55:30] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-06-02 18:55:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 18:55:33] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-06-02 18:55:33] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:55:33] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-02 18:55:33] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:55:33] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-06-02 18:55:34] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 120 constraints, problems are : Problem set: 0 solved, 193 unsolved in 9295 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 193/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 18:55:44] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 3 ms to minimize.
[2024-06-02 18:55:44] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 315 constraints, problems are : Problem set: 0 solved, 193 unsolved in 13707 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints]
After SMT, in 23204ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 23209ms
Finished structural reductions in LTL mode , in 1 iterations and 23531 ms. Remains : 104/104 places, 194/194 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Graph (complete) has 336 edges and 104 vertex of which 99 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 202 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 3
RANDOM walk for 40000 steps (1410 resets) in 198 ms. (201 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (332 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (334 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
[2024-06-02 18:55:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/47 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/83 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 171/254 variables, 83/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/284 variables, 11/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/288 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/297 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/297 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/298 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/298 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/298 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 114 constraints, problems are : Problem set: 0 solved, 2 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 21/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/47 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/83 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 171/254 variables, 83/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 30/284 variables, 11/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/288 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 9/297 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/297 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/298 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/298 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/298 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 116 constraints, problems are : Problem set: 0 solved, 2 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 710ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 280 ms.
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 194/194 transitions.
Graph (complete) has 336 edges and 104 vertex of which 99 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 99 transition count 166
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 18 rules applied. Total rules applied 44 place count 85 transition count 162
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 49 place count 83 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 82 transition count 159
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 50 place count 82 transition count 152
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 64 place count 75 transition count 152
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 66 place count 73 transition count 148
Iterating global reduction 4 with 2 rules applied. Total rules applied 68 place count 73 transition count 148
Performed 19 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 39 rules applied. Total rules applied 107 place count 53 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 109 place count 53 transition count 126
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 121 place count 47 transition count 150
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 141 place count 47 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 145 place count 45 transition count 153
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 149 place count 45 transition count 149
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 153 place count 41 transition count 149
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 155 place count 41 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 157 place count 39 transition count 147
Applied a total of 157 rules in 66 ms. Remains 39 /104 variables (removed 65) and now considering 147/194 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 39/104 places, 147/194 transitions.
RANDOM walk for 23613 steps (3508 resets) in 351 ms. (67 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 p1))), (F (NOT p1)), (F (NOT p2)), (F p0), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 11 factoid took 539 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 33291 reset in 112 ms.
Product exploration explored 100000 steps with 33189 reset in 140 ms.
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-06-02 18:55:58] [INFO ] Invariant cache hit.
[2024-06-02 18:55:58] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 18:55:58] [INFO ] Invariant cache hit.
[2024-06-02 18:55:58] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-06-02 18:55:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 18:56:01] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 3 ms to minimize.
[2024-06-02 18:56:01] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-06-02 18:56:01] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-06-02 18:56:01] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:56:01] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:56:01] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 120 constraints, problems are : Problem set: 0 solved, 193 unsolved in 9786 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 193/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 18:56:13] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-06-02 18:56:13] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 315 constraints, problems are : Problem set: 0 solved, 193 unsolved in 14598 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints]
After SMT, in 24556ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 24559ms
Finished structural reductions in LTL mode , in 1 iterations and 24882 ms. Remains : 104/104 places, 194/194 transitions.
Treatment of property MedleyA-PT-07-LTLFireability-00 finished in 78486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(p1))))'
Support contains 7 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 202/202 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 104 transition count 194
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 104 transition count 194
Applied a total of 12 rules in 6 ms. Remains 104 /110 variables (removed 6) and now considering 194/202 (removed 8) transitions.
[2024-06-02 18:56:23] [INFO ] Invariant cache hit.
[2024-06-02 18:56:23] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 18:56:23] [INFO ] Invariant cache hit.
[2024-06-02 18:56:23] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-06-02 18:56:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 18:56:25] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-06-02 18:56:25] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-06-02 18:56:25] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:56:25] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-06-02 18:56:26] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:56:26] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 120 constraints, problems are : Problem set: 0 solved, 193 unsolved in 9591 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 193/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 18:56:38] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-06-02 18:56:38] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 315 constraints, problems are : Problem set: 0 solved, 193 unsolved in 15056 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints]
After SMT, in 24812ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 24816ms
Starting structural reductions in LTL mode, iteration 1 : 104/110 places, 194/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25110 ms. Remains : 104/110 places, 194/202 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-02
Product exploration explored 100000 steps with 3520 reset in 361 ms.
Product exploration explored 100000 steps with 3521 reset in 308 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Graph (complete) has 336 edges and 104 vertex of which 99 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 130 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (1404 resets) in 253 ms. (157 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (316 resets) in 377 ms. (105 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (317 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (311 resets) in 459 ms. (86 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (317 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
[2024-06-02 18:56:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 20/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/48 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 40/88 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 175/263 variables, 88/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 23/286 variables, 8/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/288 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 9/297 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/297 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1/298 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/298 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/298 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 114 constraints, problems are : Problem set: 0 solved, 3 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 20/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 21/48 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 40/88 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 175/263 variables, 88/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 18:56:50] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 23/286 variables, 8/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/288 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/288 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 9/297 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/297 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 1/298 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/298 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/298 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 118 constraints, problems are : Problem set: 0 solved, 3 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 746ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 5273 steps, including 104 resets, run visited all 3 properties in 10 ms. (steps per millisecond=527 )
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 19 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 289 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 7 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 194/194 transitions.
Graph (complete) has 336 edges and 104 vertex of which 99 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 98 transition count 178
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 87 transition count 174
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 33 place count 85 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 84 transition count 171
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 34 place count 84 transition count 165
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 46 place count 78 transition count 165
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 48 place count 76 transition count 161
Iterating global reduction 4 with 2 rules applied. Total rules applied 50 place count 76 transition count 161
Performed 21 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 43 rules applied. Total rules applied 93 place count 54 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 95 place count 54 transition count 135
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 109 place count 47 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 117 place count 47 transition count 168
Applied a total of 117 rules in 35 ms. Remains 47 /104 variables (removed 57) and now considering 168/194 (removed 26) transitions.
// Phase 1: matrix 168 rows 47 cols
[2024-06-02 18:56:51] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:56:51] [INFO ] Implicit Places using invariants in 60 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/104 places, 168/194 transitions.
Applied a total of 0 rules in 5 ms. Remains 46 /46 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 46/104 places, 168/194 transitions.
Computed a total of 5 stabilizing places and 45 stable transitions
Computed a total of 5 stabilizing places and 45 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 145 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (4255 resets) in 380 ms. (104 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (937 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (918 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (924 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
// Phase 1: matrix 168 rows 46 cols
[2024-06-02 18:56:52] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 18:56:52] [INFO ] State equation strengthened by 48 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 155/193 variables, 38/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 46/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 21/214 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/214 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 100 constraints, problems are : Problem set: 0 solved, 3 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 48/48 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 9/38 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 155/193 variables, 38/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 46/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 21/214 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/214 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 103 constraints, problems are : Problem set: 0 solved, 3 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 477ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1219 steps, including 50 resets, run visited all 3 properties in 6 ms. (steps per millisecond=203 )
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 6 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 353 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering criterion allowed to conclude after 51116 steps with 5504 reset in 105 ms.
FORMULA MedleyA-PT-07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-07-LTLFireability-02 finished in 30522 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((G(X(p0)) U p1)))'
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 202/202 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 105 transition count 195
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 105 transition count 195
Applied a total of 10 rules in 3 ms. Remains 105 /110 variables (removed 5) and now considering 195/202 (removed 7) transitions.
// Phase 1: matrix 195 rows 105 cols
[2024-06-02 18:56:53] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:56:53] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 18:56:53] [INFO ] Invariant cache hit.
[2024-06-02 18:56:53] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-06-02 18:56:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 18:56:55] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-06-02 18:56:55] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:56:55] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:56:55] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:56:55] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:56:56] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 121 constraints, problems are : Problem set: 0 solved, 194 unsolved in 7811 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 194/315 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 18:57:06] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:57:06] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/300 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 317 constraints, problems are : Problem set: 0 solved, 194 unsolved in 14806 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 8/8 constraints]
After SMT, in 22725ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 22727ms
Starting structural reductions in LTL mode, iteration 1 : 105/110 places, 195/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22941 ms. Remains : 105/110 places, 195/202 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-06
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-07-LTLFireability-06 finished in 23116 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(!(X(X((p0 U p1))) U !p2))))'
Support contains 7 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 202/202 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 105 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 105 transition count 196
Applied a total of 10 rules in 3 ms. Remains 105 /110 variables (removed 5) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 105 cols
[2024-06-02 18:57:16] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:57:16] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:57:16] [INFO ] Invariant cache hit.
[2024-06-02 18:57:17] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-06-02 18:57:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-02 18:57:19] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:57:19] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:57:19] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:57:19] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:57:19] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:57:19] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/301 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-02 18:57:22] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/301 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 122 constraints, problems are : Problem set: 0 solved, 195 unsolved in 10234 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/301 variables, 105/122 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 195/317 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-02 18:57:31] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/301 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 318 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13397 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 8/8 constraints]
After SMT, in 23783ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 23786ms
Starting structural reductions in LTL mode, iteration 1 : 105/110 places, 196/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23994 ms. Remains : 105/110 places, 196/202 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-07
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-07-LTLFireability-07 finished in 24234 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 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 202/202 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 105 transition count 195
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 105 transition count 195
Applied a total of 10 rules in 3 ms. Remains 105 /110 variables (removed 5) and now considering 195/202 (removed 7) transitions.
// Phase 1: matrix 195 rows 105 cols
[2024-06-02 18:57:41] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:57:41] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 18:57:41] [INFO ] Invariant cache hit.
[2024-06-02 18:57:41] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-06-02 18:57:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 18:57:43] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:57:43] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:57:43] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:57:43] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:57:43] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:57:44] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 18:57:45] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (OVERLAPS) 195/300 variables, 105/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 122 constraints, problems are : Problem set: 0 solved, 194 unsolved in 9695 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 194/316 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 316 constraints, problems are : Problem set: 0 solved, 194 unsolved in 8829 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 7/7 constraints]
After SMT, in 18694ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 18698ms
Starting structural reductions in LTL mode, iteration 1 : 105/110 places, 195/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19013 ms. Remains : 105/110 places, 195/202 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3113 steps with 109 reset in 14 ms.
FORMULA MedleyA-PT-07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-07-LTLFireability-09 finished in 19161 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))'
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 202/202 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 104 transition count 194
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 104 transition count 194
Applied a total of 12 rules in 5 ms. Remains 104 /110 variables (removed 6) and now considering 194/202 (removed 8) transitions.
// Phase 1: matrix 194 rows 104 cols
[2024-06-02 18:58:00] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:58:00] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 18:58:00] [INFO ] Invariant cache hit.
[2024-06-02 18:58:00] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-06-02 18:58:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 18:58:02] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:58:03] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:58:03] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:58:03] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:58:03] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:58:03] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 120 constraints, problems are : Problem set: 0 solved, 193 unsolved in 10039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 193/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 18:58:15] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:58:15] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 315 constraints, problems are : Problem set: 0 solved, 193 unsolved in 13465 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints]
After SMT, in 23666ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 23670ms
Starting structural reductions in LTL mode, iteration 1 : 104/110 places, 194/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23964 ms. Remains : 104/110 places, 194/202 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Graph (complete) has 336 edges and 104 vertex of which 99 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-07-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-07-LTLFireability-11 finished in 24342 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)&&F(G((X(p2)||p1))))))'
Support contains 9 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 202/202 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 104 transition count 194
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 104 transition count 194
Applied a total of 12 rules in 2 ms. Remains 104 /110 variables (removed 6) and now considering 194/202 (removed 8) transitions.
[2024-06-02 18:58:24] [INFO ] Invariant cache hit.
[2024-06-02 18:58:24] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 18:58:24] [INFO ] Invariant cache hit.
[2024-06-02 18:58:24] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-06-02 18:58:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 18:58:26] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-06-02 18:58:26] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:58:27] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-06-02 18:58:27] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:58:27] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:58:27] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 120 constraints, problems are : Problem set: 0 solved, 193 unsolved in 7810 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 193/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 18:58:36] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:58:36] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 315 constraints, problems are : Problem set: 0 solved, 193 unsolved in 12655 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints]
After SMT, in 20639ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 20643ms
Starting structural reductions in LTL mode, iteration 1 : 104/110 places, 194/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20866 ms. Remains : 104/110 places, 194/202 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-12
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-07-LTLFireability-12 finished in 21029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U X((X(p2)||p1))))))'
Support contains 7 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 202/202 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 104 transition count 194
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 104 transition count 194
Applied a total of 12 rules in 1 ms. Remains 104 /110 variables (removed 6) and now considering 194/202 (removed 8) transitions.
[2024-06-02 18:58:45] [INFO ] Invariant cache hit.
[2024-06-02 18:58:45] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:58:45] [INFO ] Invariant cache hit.
[2024-06-02 18:58:45] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2024-06-02 18:58:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 18:58:47] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
[2024-06-02 18:58:47] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:58:47] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:58:48] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:58:48] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2024-06-02 18:58:48] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 120 constraints, problems are : Problem set: 0 solved, 193 unsolved in 8497 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 194/298 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 193/313 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 18:58:58] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 3 ms to minimize.
[2024-06-02 18:58:58] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 315 constraints, problems are : Problem set: 0 solved, 193 unsolved in 12915 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints]
After SMT, in 21587ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 21591ms
Starting structural reductions in LTL mode, iteration 1 : 104/110 places, 194/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21816 ms. Remains : 104/110 places, 194/202 transitions.
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-13
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-07-LTLFireability-13 finished in 22136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 106 transition count 197
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 106 transition count 197
Applied a total of 8 rules in 3 ms. Remains 106 /110 variables (removed 4) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 106 cols
[2024-06-02 18:59:07] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 18:59:07] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 18:59:07] [INFO ] Invariant cache hit.
[2024-06-02 18:59:08] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-06-02 18:59:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 18:59:10] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2024-06-02 18:59:10] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:59:10] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:59:10] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:59:10] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-06-02 18:59:10] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-06-02 18:59:10] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-02 18:59:11] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:59:11] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/303 variables, 106/125 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 125 constraints, problems are : Problem set: 0 solved, 196 unsolved in 10494 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/303 variables, 106/125 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 196/321 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 18:59:24] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-06-02 18:59:24] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 2/323 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-06-02 18:59:27] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 1 ms to minimize.
[2024-06-02 18:59:27] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 325 constraints, problems are : Problem set: 0 solved, 196 unsolved in 19027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 13/13 constraints]
After SMT, in 29638ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 29641ms
Starting structural reductions in LTL mode, iteration 1 : 106/110 places, 197/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29895 ms. Remains : 106/110 places, 197/202 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-14
Product exploration explored 100000 steps with 3513 reset in 124 ms.
Product exploration explored 100000 steps with 3529 reset in 353 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Graph (complete) has 343 edges and 106 vertex of which 101 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 3194 steps (109 resets) in 11 ms. (266 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 197/197 transitions.
Graph (complete) has 343 edges and 106 vertex of which 101 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 100 transition count 179
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 87 transition count 175
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 85 transition count 173
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 36 place count 85 transition count 166
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 50 place count 78 transition count 166
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 76 transition count 162
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 76 transition count 162
Performed 23 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 102 place count 51 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 104 place count 51 transition count 134
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 122 place count 42 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 4 with 36 rules applied. Total rules applied 158 place count 42 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 162 place count 40 transition count 165
Applied a total of 162 rules in 43 ms. Remains 40 /106 variables (removed 66) and now considering 165/197 (removed 32) transitions.
// Phase 1: matrix 165 rows 40 cols
[2024-06-02 18:59:39] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 18:59:39] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:59:39] [INFO ] Invariant cache hit.
[2024-06-02 18:59:39] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-06-02 18:59:39] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-06-02 18:59:39] [INFO ] Redundant transitions in 34 ms returned [67, 68]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 157 sub problems to find dead transitions.
// Phase 1: matrix 163 rows 40 cols
[2024-06-02 18:59:39] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 18:59:39] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 163/203 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 82/128 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 0/203 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 128 constraints, problems are : Problem set: 0 solved, 157 unsolved in 3969 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 163/203 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 82/128 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 157/285 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 285 constraints, problems are : Problem set: 0 solved, 157 unsolved in 16252 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 0/0 constraints]
After SMT, in 20393ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 20395ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/106 places, 163/197 transitions.
Applied a total of 0 rules in 8 ms. Remains 40 /40 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20731 ms. Remains : 40/106 places, 163/197 transitions.
Computed a total of 8 stabilizing places and 81 stable transitions
Computed a total of 8 stabilizing places and 81 stable transitions
Detected a total of 8/40 stabilizing places and 81/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 328 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 243 steps (29 resets) in 5 ms. (40 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 328 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 12919 reset in 349 ms.
Product exploration explored 100000 steps with 12900 reset in 540 ms.
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 163/163 transitions.
Applied a total of 0 rules in 7 ms. Remains 40 /40 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-02 19:00:01] [INFO ] Invariant cache hit.
[2024-06-02 19:00:01] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 19:00:01] [INFO ] Invariant cache hit.
[2024-06-02 19:00:01] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-06-02 19:00:01] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-06-02 19:00:01] [INFO ] Redundant transitions in 25 ms returned []
Running 157 sub problems to find dead transitions.
[2024-06-02 19:00:01] [INFO ] Invariant cache hit.
[2024-06-02 19:00:01] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 163/203 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 82/128 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 0/203 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 128 constraints, problems are : Problem set: 0 solved, 157 unsolved in 5825 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (OVERLAPS) 163/203 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 82/128 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 157/285 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 285 constraints, problems are : Problem set: 0 solved, 157 unsolved in 7420 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 0/0 constraints]
After SMT, in 13537ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 13539ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13820 ms. Remains : 40/40 places, 163/163 transitions.
Treatment of property MedleyA-PT-07-LTLFireability-14 finished in 67720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 202/202 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 105 transition count 195
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 105 transition count 195
Applied a total of 10 rules in 2 ms. Remains 105 /110 variables (removed 5) and now considering 195/202 (removed 7) transitions.
// Phase 1: matrix 195 rows 105 cols
[2024-06-02 19:00:15] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:00:15] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 19:00:15] [INFO ] Invariant cache hit.
[2024-06-02 19:00:15] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-06-02 19:00:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 19:00:17] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 3 ms to minimize.
[2024-06-02 19:00:18] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:00:18] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:00:18] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:00:18] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:00:18] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 19:00:25] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/300 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/300 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 122 constraints, problems are : Problem set: 0 solved, 194 unsolved in 14730 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 195/300 variables, 105/122 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 194/316 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-06-02 19:00:34] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-06-02 19:00:34] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 0/300 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 318 constraints, problems are : Problem set: 0 solved, 194 unsolved in 13808 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 9/9 constraints]
After SMT, in 28687ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 28690ms
Starting structural reductions in LTL mode, iteration 1 : 105/110 places, 195/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28910 ms. Remains : 105/110 places, 195/202 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-07-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1777 steps with 62 reset in 3 ms.
FORMULA MedleyA-PT-07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-07-LTLFireability-15 finished in 29095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((G(F(p2))||p1))))))'
Found a Lengthening insensitive property : MedleyA-PT-07-LTLFireability-00
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 110/110 places, 202/202 transitions.
Graph (complete) has 352 edges and 110 vertex of which 105 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 104 transition count 185
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 92 transition count 181
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 35 place count 90 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 89 transition count 178
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 36 place count 89 transition count 172
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 48 place count 83 transition count 172
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 55 place count 76 transition count 161
Iterating global reduction 4 with 7 rules applied. Total rules applied 62 place count 76 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 62 place count 76 transition count 160
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 75 transition count 160
Performed 20 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 41 rules applied. Total rules applied 105 place count 54 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 107 place count 54 transition count 136
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 119 place count 48 transition count 160
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 121 place count 46 transition count 158
Applied a total of 121 rules in 29 ms. Remains 46 /110 variables (removed 64) and now considering 158/202 (removed 44) transitions.
// Phase 1: matrix 158 rows 46 cols
[2024-06-02 19:00:44] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:00:45] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 19:00:45] [INFO ] Invariant cache hit.
[2024-06-02 19:00:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 19:00:45] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-06-02 19:00:45] [INFO ] Invariant cache hit.
[2024-06-02 19:00:45] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 3/46 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 158/204 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 61 constraints, problems are : Problem set: 0 solved, 149 unsolved in 4386 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 3/46 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 158/204 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 149/210 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (OVERLAPS) 0/204 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 210 constraints, problems are : Problem set: 0 solved, 149 unsolved in 5973 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 10655ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 10656ms
Starting structural reductions in LI_LTL mode, iteration 1 : 46/110 places, 158/202 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10870 ms. Remains : 46/110 places, 158/202 transitions.
Running random walk in product with property : MedleyA-PT-07-LTLFireability-00
Product exploration explored 100000 steps with 33373 reset in 217 ms.
Product exploration explored 100000 steps with 33508 reset in 250 ms.
Computed a total of 2 stabilizing places and 41 stable transitions
Computed a total of 2 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 247 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 3
RANDOM walk for 40000 steps (4388 resets) in 232 ms. (171 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (762 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (741 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
[2024-06-02 19:00:57] [INFO ] Invariant cache hit.
[2024-06-02 19:00:57] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/31 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/38 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 146/184 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 20/204 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/204 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 61 constraints, problems are : Problem set: 0 solved, 2 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/31 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/38 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 146/184 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 20/204 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/204 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 63 constraints, problems are : Problem set: 0 solved, 2 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 378ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 158/158 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 46 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 29 place count 46 transition count 129
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 46 transition count 125
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 42 transition count 125
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 43 place count 42 transition count 233
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 49 place count 36 transition count 233
Applied a total of 49 rules in 26 ms. Remains 36 /46 variables (removed 10) and now considering 233/158 (removed -75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 36/46 places, 233/158 transitions.
RANDOM walk for 8521 steps (475 resets) in 408 ms. (20 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 p1))), (F (NOT p1)), (F (NOT p2)), (F p0), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 11 factoid took 536 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 158/158 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2024-06-02 19:00:58] [INFO ] Invariant cache hit.
[2024-06-02 19:00:58] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 19:00:58] [INFO ] Invariant cache hit.
[2024-06-02 19:00:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 19:00:58] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-06-02 19:00:58] [INFO ] Invariant cache hit.
[2024-06-02 19:00:58] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 3/46 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 158/204 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 61 constraints, problems are : Problem set: 0 solved, 149 unsolved in 3804 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 3/46 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 158/204 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 149/210 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (OVERLAPS) 0/204 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 210 constraints, problems are : Problem set: 0 solved, 149 unsolved in 6143 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 10207ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 10210ms
Finished structural reductions in LTL mode , in 1 iterations and 10410 ms. Remains : 46/46 places, 158/158 transitions.
Computed a total of 2 stabilizing places and 41 stable transitions
Computed a total of 2 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 173 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 3
RANDOM walk for 40000 steps (4363 resets) in 538 ms. (74 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (754 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (746 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
[2024-06-02 19:01:09] [INFO ] Invariant cache hit.
[2024-06-02 19:01:09] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/31 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/38 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 146/184 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 20/204 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/204 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 61 constraints, problems are : Problem set: 0 solved, 2 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/31 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/38 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 146/184 variables, 38/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 20/204 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/204 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/204 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 63 constraints, problems are : Problem set: 0 solved, 2 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 344ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 56 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 158/158 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 46 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 29 place count 46 transition count 129
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 46 transition count 125
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 42 transition count 125
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 43 place count 42 transition count 233
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 49 place count 36 transition count 233
Applied a total of 49 rules in 24 ms. Remains 36 /46 variables (removed 10) and now considering 233/158 (removed -75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 36/46 places, 233/158 transitions.
RANDOM walk for 4767 steps (232 resets) in 48 ms. (97 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 p0 p1))), (F (NOT p1)), (F (NOT p2)), (F p0), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 11 factoid took 513 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 33400 reset in 124 ms.
Product exploration explored 100000 steps with 33588 reset in 135 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 158/158 transitions.
Applied a total of 0 rules in 6 ms. Remains 46 /46 variables (removed 0) and now considering 158/158 (removed 0) transitions.
[2024-06-02 19:01:11] [INFO ] Invariant cache hit.
[2024-06-02 19:01:11] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 19:01:11] [INFO ] Invariant cache hit.
[2024-06-02 19:01:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 19:01:12] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-06-02 19:01:12] [INFO ] Invariant cache hit.
[2024-06-02 19:01:12] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 3/46 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 158/204 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 61 constraints, problems are : Problem set: 0 solved, 149 unsolved in 2873 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 3/46 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 158/204 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 149/210 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (OVERLAPS) 0/204 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 210 constraints, problems are : Problem set: 0 solved, 149 unsolved in 6826 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 9877ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 9879ms
Finished structural reductions in LTL mode , in 1 iterations and 10073 ms. Remains : 46/46 places, 158/158 transitions.
Treatment of property MedleyA-PT-07-LTLFireability-00 finished in 37411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Found a Lengthening insensitive property : MedleyA-PT-07-LTLFireability-14
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 110/110 places, 202/202 transitions.
Graph (complete) has 352 edges and 110 vertex of which 105 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 104 transition count 184
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 91 transition count 180
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 89 transition count 178
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 36 place count 89 transition count 172
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 48 place count 83 transition count 172
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 53 place count 78 transition count 164
Iterating global reduction 3 with 5 rules applied. Total rules applied 58 place count 78 transition count 164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 78 transition count 163
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 60 place count 77 transition count 163
Performed 24 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 110 place count 51 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 112 place count 51 transition count 134
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 128 place count 43 transition count 179
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 41 transition count 177
Applied a total of 130 rules in 25 ms. Remains 41 /110 variables (removed 69) and now considering 177/202 (removed 25) transitions.
[2024-06-02 19:01:22] [INFO ] Flow matrix only has 171 transitions (discarded 6 similar events)
// Phase 1: matrix 171 rows 41 cols
[2024-06-02 19:01:22] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 19:01:22] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 19:01:22] [INFO ] Flow matrix only has 171 transitions (discarded 6 similar events)
[2024-06-02 19:01:22] [INFO ] Invariant cache hit.
[2024-06-02 19:01:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-02 19:01:22] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-06-02 19:01:22] [INFO ] Flow matrix only has 171 transitions (discarded 6 similar events)
[2024-06-02 19:01:22] [INFO ] Invariant cache hit.
[2024-06-02 19:01:22] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 2/41 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 171/212 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 22/69 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 69 constraints, problems are : Problem set: 0 solved, 169 unsolved in 3592 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 41/41 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 2/41 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 171/212 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 22/69 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 169/238 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 238 constraints, problems are : Problem set: 0 solved, 169 unsolved in 7020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 41/41 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints]
After SMT, in 10942ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 10945ms
Starting structural reductions in LI_LTL mode, iteration 1 : 41/110 places, 177/202 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11204 ms. Remains : 41/110 places, 177/202 transitions.
Running random walk in product with property : MedleyA-PT-07-LTLFireability-14
Product exploration explored 100000 steps with 11879 reset in 126 ms.
Product exploration explored 100000 steps with 11790 reset in 151 ms.
Computed a total of 7 stabilizing places and 99 stable transitions
Computed a total of 7 stabilizing places and 99 stable transitions
Detected a total of 7/41 stabilizing places and 99/177 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 245 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 404 steps (47 resets) in 5 ms. (67 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 315 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 177/177 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 41 transition count 141
Applied a total of 36 rules in 9 ms. Remains 41 /41 variables (removed 0) and now considering 141/177 (removed 36) transitions.
// Phase 1: matrix 141 rows 41 cols
[2024-06-02 19:01:34] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 19:01:34] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 19:01:34] [INFO ] Invariant cache hit.
[2024-06-02 19:01:34] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 19:01:34] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-06-02 19:01:34] [INFO ] Redundant transitions in 33 ms returned [71, 72]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 131 sub problems to find dead transitions.
// Phase 1: matrix 139 rows 41 cols
[2024-06-02 19:01:34] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 19:01:34] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 2/41 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 139/180 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 59 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2787 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 41/41 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 2/41 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 139/180 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 131/190 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/180 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 190 constraints, problems are : Problem set: 0 solved, 131 unsolved in 4071 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 41/41 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 7038ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 7040ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/41 places, 139/177 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7289 ms. Remains : 41/41 places, 139/177 transitions.
Computed a total of 7 stabilizing places and 73 stable transitions
Computed a total of 7 stabilizing places and 73 stable transitions
Detected a total of 7/41 stabilizing places and 73/139 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 196 steps (22 resets) in 5 ms. (32 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 302 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 11817 reset in 113 ms.
Product exploration explored 100000 steps with 11848 reset in 123 ms.
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 139/139 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-06-02 19:01:43] [INFO ] Invariant cache hit.
[2024-06-02 19:01:43] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 19:01:43] [INFO ] Invariant cache hit.
[2024-06-02 19:01:43] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 19:01:43] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-06-02 19:01:43] [INFO ] Redundant transitions in 19 ms returned []
Running 131 sub problems to find dead transitions.
[2024-06-02 19:01:43] [INFO ] Invariant cache hit.
[2024-06-02 19:01:43] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 2/41 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 139/180 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 59 constraints, problems are : Problem set: 0 solved, 131 unsolved in 3394 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 41/41 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 2/41 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 139/180 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 12/59 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 131/190 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/180 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 190 constraints, problems are : Problem set: 0 solved, 131 unsolved in 4713 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 41/41 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 8215ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 8217ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8443 ms. Remains : 41/41 places, 139/139 transitions.
Treatment of property MedleyA-PT-07-LTLFireability-14 finished in 29554 ms.
[2024-06-02 19:01:51] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:01:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-02 19:01:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 110 places, 202 transitions and 812 arcs took 8 ms.
Total runtime 462302 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-07

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 2342
MODEL NAME: /home/mcc/execution/416/model
110 places, 202 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-07-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-07-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717355176738

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

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