About the Execution of GreatSPN+red for MultiwaySync-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 892.176 | 380235.00 | 449412.00 | 1030.60 | FFFTFFFFFFFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r245-tall-171654349500236.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 MultiwaySync-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349500236
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 11 18:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 18:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 18:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 111K May 18 16:43 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 MultiwaySync-PT-none-LTLFireability-00
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-01
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-02
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-03
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-04
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-05
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-06
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-07
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-08
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-09
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-10
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-11
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-12
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-13
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-14
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716651539159
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiwaySync-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 15:39:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 15:39:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:39:00] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-05-25 15:39:00] [INFO ] Transformed 222 places.
[2024-05-25 15:39:00] [INFO ] Transformed 472 transitions.
[2024-05-25 15:39:00] [INFO ] Found NUPN structural information;
[2024-05-25 15:39:00] [INFO ] Parsed PT model containing 222 places and 472 transitions and 1496 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 83 transitions
Reduce redundant transitions removed 83 transitions.
FORMULA MultiwaySync-PT-none-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 389/389 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 211 transition count 378
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 211 transition count 378
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 211 transition count 372
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 208 transition count 363
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 208 transition count 363
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 208 transition count 361
Applied a total of 36 rules in 51 ms. Remains 208 /222 variables (removed 14) and now considering 361/389 (removed 28) transitions.
[2024-05-25 15:39:00] [INFO ] Flow matrix only has 356 transitions (discarded 5 similar events)
// Phase 1: matrix 356 rows 208 cols
[2024-05-25 15:39:00] [INFO ] Computed 25 invariants in 19 ms
[2024-05-25 15:39:00] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-25 15:39:00] [INFO ] Flow matrix only has 356 transitions (discarded 5 similar events)
[2024-05-25 15:39:00] [INFO ] Invariant cache hit.
[2024-05-25 15:39:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:39:01] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2024-05-25 15:39:01] [INFO ] Flow matrix only has 356 transitions (discarded 5 similar events)
[2024-05-25 15:39:01] [INFO ] Invariant cache hit.
[2024-05-25 15:39:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-25 15:39:04] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 11 ms to minimize.
[2024-05-25 15:39:04] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
[2024-05-25 15:39:05] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:39:05] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:39:05] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:39:05] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:39:05] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:39:05] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 356/564 variables, 208/241 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 0/564 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 242 constraints, problems are : Problem set: 0 solved, 360 unsolved in 13852 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 208/208 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 356/564 variables, 208/241 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 360/602 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-25 15:39:22] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:39:22] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 2/604 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 9 (OVERLAPS) 0/564 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 604 constraints, problems are : Problem set: 0 solved, 360 unsolved in 22783 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 208/208 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 10/10 constraints]
After SMT, in 37116ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 37145ms
Starting structural reductions in LTL mode, iteration 1 : 208/222 places, 361/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37697 ms. Remains : 208/222 places, 361/389 transitions.
Support contains 38 out of 208 places after structural reductions.
[2024-05-25 15:39:38] [INFO ] Flatten gal took : 53 ms
[2024-05-25 15:39:38] [INFO ] Flatten gal took : 25 ms
[2024-05-25 15:39:38] [INFO ] Input system was already deterministic with 361 transitions.
Support contains 37 out of 208 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1943 ms. (20 steps per ms) remains 2/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
[2024-05-25 15:39:39] [INFO ] Flow matrix only has 356 transitions (discarded 5 similar events)
[2024-05-25 15:39:39] [INFO ] Invariant cache hit.
[2024-05-25 15:39:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 165/202 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 356/558 variables, 202/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/564 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/564 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 234 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 208/208 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 165/202 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 356/558 variables, 202/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/564 variables, 6/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/564 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 208/208 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 361/361 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 208 transition count 359
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 206 transition count 359
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 575 edges and 206 vertex of which 37 are kept as prefixes of interest. Removing 169 places using SCC suffix rule.1 ms
Discarding 169 places :
Also discarding 171 output transitions
Drop transitions (Output transitions of discarded places.) removed 171 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 8 rules applied. Total rules applied 12 place count 37 transition count 181
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 1 with 114 rules applied. Total rules applied 126 place count 36 transition count 68
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 128 place count 34 transition count 64
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 34 transition count 64
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 33 transition count 61
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 33 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 133 place count 33 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 31 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 146 place count 31 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 146 place count 31 transition count 48
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 148 place count 30 transition count 48
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 29 transition count 47
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 29 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 150 place count 29 transition count 46
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 152 place count 28 transition count 46
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 153 place count 28 transition count 45
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 159 place count 25 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 161 place count 25 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 165 place count 23 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 23 transition count 37
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 167 place count 23 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 168 place count 22 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 169 place count 21 transition count 35
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 8 edges and 20 vertex of which 4 / 20 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 172 place count 17 transition count 34
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 178 place count 16 transition count 29
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 179 place count 15 transition count 23
Iterating global reduction 8 with 1 rules applied. Total rules applied 180 place count 15 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 181 place count 15 transition count 22
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 182 place count 15 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 183 place count 14 transition count 21
Applied a total of 183 rules in 71 ms. Remains 14 /208 variables (removed 194) and now considering 21/361 (removed 340) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 14/208 places, 21/361 transitions.
RANDOM walk for 1859 steps (385 resets) in 17 ms. (103 steps per ms) remains 0/1 properties
FORMULA MultiwaySync-PT-none-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 11 stabilizing places and 17 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p1 U (G(p1)||(F(!p1)&&p2)))))))'
Support contains 4 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 205 transition count 354
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 205 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 204 transition count 349
Applied a total of 10 rules in 19 ms. Remains 204 /208 variables (removed 4) and now considering 349/361 (removed 12) transitions.
[2024-05-25 15:39:40] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2024-05-25 15:39:40] [INFO ] Computed 25 invariants in 2 ms
[2024-05-25 15:39:40] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-25 15:39:40] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:39:40] [INFO ] Invariant cache hit.
[2024-05-25 15:39:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:39:40] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-25 15:39:40] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:39:40] [INFO ] Invariant cache hit.
[2024-05-25 15:39:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:39:43] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:39:44] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-25 15:39:44] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:39:44] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-25 15:39:44] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12654 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:40:00] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:40:00] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 24216 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 37266ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 37272ms
Starting structural reductions in LTL mode, iteration 1 : 204/208 places, 349/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37525 ms. Remains : 204/208 places, 349/361 transitions.
Stuttering acceptance computed with spot in 289 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-00 finished in 37891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 207 transition count 359
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 206 transition count 359
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 203 transition count 352
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 203 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 203 transition count 351
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 202 transition count 348
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 202 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 202 transition count 347
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 60 place count 178 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 177 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 177 transition count 318
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 80 place count 171 transition count 312
Applied a total of 80 rules in 51 ms. Remains 171 /208 variables (removed 37) and now considering 312/361 (removed 49) transitions.
[2024-05-25 15:40:17] [INFO ] Flow matrix only has 307 transitions (discarded 5 similar events)
// Phase 1: matrix 307 rows 171 cols
[2024-05-25 15:40:17] [INFO ] Computed 25 invariants in 3 ms
[2024-05-25 15:40:18] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-25 15:40:18] [INFO ] Flow matrix only has 307 transitions (discarded 5 similar events)
[2024-05-25 15:40:18] [INFO ] Invariant cache hit.
[2024-05-25 15:40:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:40:18] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-25 15:40:18] [INFO ] Redundant transitions in 14 ms returned []
Running 285 sub problems to find dead transitions.
[2024-05-25 15:40:18] [INFO ] Flow matrix only has 307 transitions (discarded 5 similar events)
[2024-05-25 15:40:18] [INFO ] Invariant cache hit.
[2024-05-25 15:40:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-25 15:40:19] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:40:19] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-25 15:40:19] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:40:19] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-25 15:40:19] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-25 15:40:19] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-25 15:40:19] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-25 15:40:20] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 1/171 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 307/478 variables, 171/204 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (OVERLAPS) 0/478 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 478/478 variables, and 205 constraints, problems are : Problem set: 0 solved, 285 unsolved in 9127 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 171/171 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 1/171 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 307/478 variables, 171/204 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 285/490 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-25 15:40:31] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 10 (OVERLAPS) 0/478 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 478/478 variables, and 491 constraints, problems are : Problem set: 0 solved, 285 unsolved in 15767 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 171/171 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 9/9 constraints]
After SMT, in 25197ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 25200ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/208 places, 312/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25461 ms. Remains : 171/208 places, 312/361 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 391 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 1 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-01 finished in 26009 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(p1)&&p0))&&X(p2)))'
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 206 transition count 357
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 206 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 206 transition count 356
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 205 transition count 353
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 205 transition count 353
Applied a total of 7 rules in 11 ms. Remains 205 /208 variables (removed 3) and now considering 353/361 (removed 8) transitions.
[2024-05-25 15:40:43] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
// Phase 1: matrix 348 rows 205 cols
[2024-05-25 15:40:43] [INFO ] Computed 25 invariants in 2 ms
[2024-05-25 15:40:44] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-25 15:40:44] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2024-05-25 15:40:44] [INFO ] Invariant cache hit.
[2024-05-25 15:40:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:40:44] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 352 sub problems to find dead transitions.
[2024-05-25 15:40:44] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2024-05-25 15:40:44] [INFO ] Invariant cache hit.
[2024-05-25 15:40:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-25 15:40:46] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:40:47] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-25 15:40:47] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-25 15:40:47] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 7 ms to minimize.
[2024-05-25 15:40:47] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-25 15:40:47] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-25 15:40:48] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-25 15:40:48] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 348/553 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 7 (OVERLAPS) 0/553 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 239 constraints, problems are : Problem set: 0 solved, 352 unsolved in 12295 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 352 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 348/553 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 352/591 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-25 15:41:03] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-25 15:41:09] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 10 (OVERLAPS) 0/553 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 593 constraints, problems are : Problem set: 0 solved, 352 unsolved in 26534 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 10/10 constraints]
After SMT, in 39121ms problems are : Problem set: 0 solved, 352 unsolved
Search for dead transitions found 0 dead transitions in 39124ms
Starting structural reductions in LTL mode, iteration 1 : 205/208 places, 353/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39361 ms. Remains : 205/208 places, 353/361 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 294 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 1 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-02 finished in 39852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Support contains 5 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 205 transition count 354
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 205 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 204 transition count 349
Applied a total of 10 rules in 31 ms. Remains 204 /208 variables (removed 4) and now considering 349/361 (removed 12) transitions.
[2024-05-25 15:41:23] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2024-05-25 15:41:23] [INFO ] Computed 25 invariants in 2 ms
[2024-05-25 15:41:23] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-25 15:41:23] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:41:23] [INFO ] Invariant cache hit.
[2024-05-25 15:41:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:41:24] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-25 15:41:24] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:41:24] [INFO ] Invariant cache hit.
[2024-05-25 15:41:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:41:26] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:41:26] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:41:27] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-25 15:41:27] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:41:27] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:41:27] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:41:27] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:41:27] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12407 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:41:43] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:41:44] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 25278 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 37984ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 37987ms
Starting structural reductions in LTL mode, iteration 1 : 204/208 places, 349/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38280 ms. Remains : 204/208 places, 349/361 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-04
Product exploration explored 100000 steps with 3487 reset in 369 ms.
Stack based approach found an accepted trace after 68 steps with 1 reset with depth 41 and stack size 41 in 1 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-04 finished in 38849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X((p2&&F(p3)&&X(G(p4))))))'
Support contains 7 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 205 transition count 354
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 205 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 204 transition count 349
Applied a total of 10 rules in 15 ms. Remains 204 /208 variables (removed 4) and now considering 349/361 (removed 12) transitions.
[2024-05-25 15:42:02] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:42:02] [INFO ] Invariant cache hit.
[2024-05-25 15:42:02] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-25 15:42:02] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:42:02] [INFO ] Invariant cache hit.
[2024-05-25 15:42:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:42:02] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-25 15:42:02] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:42:02] [INFO ] Invariant cache hit.
[2024-05-25 15:42:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:42:05] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-25 15:42:05] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:42:05] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:42:05] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:42:06] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-25 15:42:06] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-25 15:42:06] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:42:06] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12240 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:42:22] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:42:22] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 24685 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 37250ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 37254ms
Starting structural reductions in LTL mode, iteration 1 : 204/208 places, 349/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37490 ms. Remains : 204/208 places, 349/361 transitions.
Stuttering acceptance computed with spot in 532 ms :[true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4))), (OR (NOT p4) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (OR (NOT p4) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p4))), (NOT p4), (AND (NOT p4) (NOT p0)), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-06 finished in 38052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 207 transition count 358
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 204 transition count 358
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 205 edges and 204 vertex of which 108 / 204 are part of one of the 32 SCC in 1 ms
Free SCC test removed 76 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 80 rules applied. Total rules applied 85 place count 128 transition count 279
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 1 with 144 rules applied. Total rules applied 229 place count 97 transition count 166
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 244 place count 82 transition count 135
Iterating global reduction 2 with 15 rules applied. Total rules applied 259 place count 82 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 260 place count 82 transition count 134
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 267 place count 75 transition count 112
Iterating global reduction 3 with 7 rules applied. Total rules applied 274 place count 75 transition count 112
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 281 place count 75 transition count 105
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 303 place count 64 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 305 place count 63 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 317 place count 63 transition count 82
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 329 place count 57 transition count 76
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 334 place count 52 transition count 62
Iterating global reduction 4 with 5 rules applied. Total rules applied 339 place count 52 transition count 62
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 344 place count 52 transition count 57
Applied a total of 344 rules in 48 ms. Remains 52 /208 variables (removed 156) and now considering 57/361 (removed 304) transitions.
// Phase 1: matrix 57 rows 52 cols
[2024-05-25 15:42:40] [INFO ] Computed 10 invariants in 0 ms
[2024-05-25 15:42:40] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-25 15:42:40] [INFO ] Invariant cache hit.
[2024-05-25 15:42:40] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-25 15:42:40] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
[2024-05-25 15:42:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 5/50 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 56/106 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 2/108 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/109 variables, and 62 constraints, problems are : Problem set: 0 solved, 43 unsolved in 510 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 5/50 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 56/106 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 43/103 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 2/108 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 0/108 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/109 variables, and 105 constraints, problems are : Problem set: 0 solved, 43 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1125ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1125ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/208 places, 57/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1262 ms. Remains : 52/208 places, 57/361 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-07 finished in 1322 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)||G(F(p1))||G(p2))))'
Support contains 4 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 207 transition count 358
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 204 transition count 358
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 201 edges and 204 vertex of which 102 / 204 are part of one of the 30 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 80 rules applied. Total rules applied 85 place count 132 transition count 279
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 1 with 136 rules applied. Total rules applied 221 place count 103 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 221 place count 103 transition count 170
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 225 place count 101 transition count 170
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 240 place count 86 transition count 139
Iterating global reduction 2 with 15 rules applied. Total rules applied 255 place count 86 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 86 transition count 138
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 262 place count 80 transition count 118
Iterating global reduction 3 with 6 rules applied. Total rules applied 268 place count 80 transition count 118
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 274 place count 80 transition count 112
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 296 place count 69 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 298 place count 68 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 310 place count 68 transition count 89
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 322 place count 62 transition count 83
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 328 place count 56 transition count 63
Iterating global reduction 4 with 6 rules applied. Total rules applied 334 place count 56 transition count 63
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 340 place count 56 transition count 57
Applied a total of 340 rules in 26 ms. Remains 56 /208 variables (removed 152) and now considering 57/361 (removed 304) transitions.
// Phase 1: matrix 57 rows 56 cols
[2024-05-25 15:42:42] [INFO ] Computed 12 invariants in 0 ms
[2024-05-25 15:42:42] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-25 15:42:42] [INFO ] Invariant cache hit.
[2024-05-25 15:42:42] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-25 15:42:42] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2024-05-25 15:42:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 7/54 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 56/110 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 2/112 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/113 variables, and 68 constraints, problems are : Problem set: 0 solved, 41 unsolved in 498 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 7/54 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 56/110 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 41/107 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 2/112 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 0/112 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/113 variables, and 109 constraints, problems are : Problem set: 0 solved, 41 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 1087ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1088ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/208 places, 57/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1205 ms. Remains : 56/208 places, 57/361 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-08
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 2 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-08 finished in 1350 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((p0&&G((p1||F(p2)))))))'
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 205 transition count 354
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 205 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 204 transition count 349
Applied a total of 10 rules in 11 ms. Remains 204 /208 variables (removed 4) and now considering 349/361 (removed 12) transitions.
[2024-05-25 15:42:43] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2024-05-25 15:42:43] [INFO ] Computed 25 invariants in 2 ms
[2024-05-25 15:42:43] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-25 15:42:43] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:42:43] [INFO ] Invariant cache hit.
[2024-05-25 15:42:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:42:43] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-25 15:42:43] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:42:43] [INFO ] Invariant cache hit.
[2024-05-25 15:42:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:42:46] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:42:46] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:42:46] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-25 15:42:46] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-25 15:42:47] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:42:47] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-25 15:42:47] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:42:47] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12078 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:43:02] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:43:03] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 24742 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 37118ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 37122ms
Starting structural reductions in LTL mode, iteration 1 : 204/208 places, 349/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37342 ms. Remains : 204/208 places, 349/361 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 293 ms.
Product exploration explored 100000 steps with 0 reset in 282 ms.
Computed a total of 11 stabilizing places and 17 stable transitions
Computed a total of 11 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 383 ms. (104 steps per ms) remains 1/3 properties
BEST_FIRST walk for 5334 steps (1 resets) in 12 ms. (410 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p1)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 2 out of 204 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 349/349 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 203 transition count 346
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 200 transition count 346
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 197 edges and 200 vertex of which 103 / 200 are part of one of the 31 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 80 rules applied. Total rules applied 85 place count 128 transition count 267
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 139 rules applied. Total rules applied 224 place count 97 transition count 159
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 227 place count 95 transition count 158
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 238 place count 84 transition count 136
Iterating global reduction 3 with 11 rules applied. Total rules applied 249 place count 84 transition count 136
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 254 place count 79 transition count 123
Iterating global reduction 3 with 5 rules applied. Total rules applied 259 place count 79 transition count 123
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 263 place count 79 transition count 119
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 285 place count 68 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 287 place count 67 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 300 place count 67 transition count 96
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 312 place count 61 transition count 90
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 318 place count 55 transition count 70
Iterating global reduction 4 with 6 rules applied. Total rules applied 324 place count 55 transition count 70
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 329 place count 55 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 330 place count 55 transition count 64
Applied a total of 330 rules in 24 ms. Remains 55 /204 variables (removed 149) and now considering 64/349 (removed 285) transitions.
// Phase 1: matrix 64 rows 55 cols
[2024-05-25 15:43:22] [INFO ] Computed 10 invariants in 0 ms
[2024-05-25 15:43:22] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-25 15:43:22] [INFO ] Invariant cache hit.
[2024-05-25 15:43:22] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-25 15:43:22] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-25 15:43:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 5/53 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-25 15:43:22] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 63/116 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 2/118 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/118 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/119 variables, and 66 constraints, problems are : Problem set: 0 solved, 48 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 5/53 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 63/116 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 48/112 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 2/118 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/118 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/119 variables, and 114 constraints, problems are : Problem set: 0 solved, 48 unsolved in 736 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
After SMT, in 1524ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1525ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/204 places, 64/349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1645 ms. Remains : 55/204 places, 64/349 transitions.
Computed a total of 8 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p2 p1)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 1 factoid took 227 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 227 steps (6 resets) in 8 ms. (25 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 p1)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F (NOT p1)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 1 factoid took 282 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 44 ms.
Product exploration explored 100000 steps with 0 reset in 45 ms.
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 64/64 transitions.
Graph (trivial) has 11 edges and 55 vertex of which 2 / 55 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 53 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 52 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 52 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 52 transition count 53
Applied a total of 7 rules in 16 ms. Remains 52 /55 variables (removed 3) and now considering 53/64 (removed 11) transitions.
// Phase 1: matrix 53 rows 52 cols
[2024-05-25 15:43:24] [INFO ] Computed 10 invariants in 0 ms
[2024-05-25 15:43:24] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-25 15:43:24] [INFO ] Invariant cache hit.
[2024-05-25 15:43:24] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-25 15:43:24] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-25 15:43:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 5/50 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 52/102 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 2/104 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/105 variables, and 62 constraints, problems are : Problem set: 0 solved, 38 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 5/50 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 52/102 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 38/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 2/104 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/105 variables, and 100 constraints, problems are : Problem set: 0 solved, 38 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 998ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 999ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/55 places, 53/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1111 ms. Remains : 52/55 places, 53/64 transitions.
Treatment of property MultiwaySync-PT-none-LTLFireability-09 finished in 42591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||(p0 U (p1||G(p0))))))'
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 206 transition count 357
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 206 transition count 357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 205 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 205 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 205 transition count 353
Applied a total of 7 rules in 10 ms. Remains 205 /208 variables (removed 3) and now considering 353/361 (removed 8) transitions.
[2024-05-25 15:43:25] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
// Phase 1: matrix 348 rows 205 cols
[2024-05-25 15:43:25] [INFO ] Computed 25 invariants in 2 ms
[2024-05-25 15:43:26] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-25 15:43:26] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2024-05-25 15:43:26] [INFO ] Invariant cache hit.
[2024-05-25 15:43:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:43:26] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 352 sub problems to find dead transitions.
[2024-05-25 15:43:26] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2024-05-25 15:43:26] [INFO ] Invariant cache hit.
[2024-05-25 15:43:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-25 15:43:28] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-25 15:43:29] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-25 15:43:29] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:43:29] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:43:29] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:43:29] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-25 15:43:29] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:43:29] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 348/553 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 7 (OVERLAPS) 0/553 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 239 constraints, problems are : Problem set: 0 solved, 352 unsolved in 12373 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 352 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 348/553 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 352/591 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-05-25 15:43:46] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/553 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 9 (OVERLAPS) 0/553 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 592 constraints, problems are : Problem set: 0 solved, 352 unsolved in 22489 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 9/9 constraints]
After SMT, in 35156ms problems are : Problem set: 0 solved, 352 unsolved
Search for dead transitions found 0 dead transitions in 35160ms
Starting structural reductions in LTL mode, iteration 1 : 205/208 places, 353/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35410 ms. Remains : 205/208 places, 353/361 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-10
Entered a terminal (fully accepting) state of product in 352 steps with 0 reset in 3 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-10 finished in 35590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 207 transition count 359
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 205 transition count 359
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 207 edges and 205 vertex of which 108 / 205 are part of one of the 32 SCC in 1 ms
Free SCC test removed 76 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 81 rules applied. Total rules applied 84 place count 129 transition count 279
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 1 with 145 rules applied. Total rules applied 229 place count 97 transition count 166
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 243 place count 83 transition count 136
Iterating global reduction 2 with 14 rules applied. Total rules applied 257 place count 83 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 258 place count 83 transition count 135
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 264 place count 77 transition count 115
Iterating global reduction 3 with 6 rules applied. Total rules applied 270 place count 77 transition count 115
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 276 place count 77 transition count 109
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 300 place count 65 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 302 place count 64 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 314 place count 64 transition count 85
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 326 place count 58 transition count 79
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 332 place count 52 transition count 58
Iterating global reduction 4 with 6 rules applied. Total rules applied 338 place count 52 transition count 58
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 344 place count 52 transition count 52
Applied a total of 344 rules in 19 ms. Remains 52 /208 variables (removed 156) and now considering 52/361 (removed 309) transitions.
// Phase 1: matrix 52 rows 52 cols
[2024-05-25 15:44:01] [INFO ] Computed 10 invariants in 1 ms
[2024-05-25 15:44:01] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-25 15:44:01] [INFO ] Invariant cache hit.
[2024-05-25 15:44:01] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-25 15:44:01] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-25 15:44:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 5/50 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 51/101 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 2/103 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/104 variables, and 62 constraints, problems are : Problem set: 0 solved, 39 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 5/50 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 51/101 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 39/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 2/103 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/104 variables, and 101 constraints, problems are : Problem set: 0 solved, 39 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
After SMT, in 1047ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1047ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/208 places, 52/361 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1159 ms. Remains : 52/208 places, 52/361 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-11 finished in 1218 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(p0))&&F(G(F(p0)))))'
Support contains 2 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 205 transition count 354
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 205 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 204 transition count 349
Applied a total of 10 rules in 7 ms. Remains 204 /208 variables (removed 4) and now considering 349/361 (removed 12) transitions.
[2024-05-25 15:44:02] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
// Phase 1: matrix 344 rows 204 cols
[2024-05-25 15:44:02] [INFO ] Computed 25 invariants in 2 ms
[2024-05-25 15:44:02] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-25 15:44:02] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:44:02] [INFO ] Invariant cache hit.
[2024-05-25 15:44:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:44:02] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-25 15:44:02] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:44:02] [INFO ] Invariant cache hit.
[2024-05-25 15:44:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:44:05] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:44:05] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:44:06] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:44:06] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-25 15:44:06] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:44:06] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-25 15:44:06] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-25 15:44:06] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12373 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:44:22] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:44:22] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 24229 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 36969ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 36972ms
Starting structural reductions in LTL mode, iteration 1 : 204/208 places, 349/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37197 ms. Remains : 204/208 places, 349/361 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-12 finished in 37410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 208/208 places, 361/361 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 205 transition count 354
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 205 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 205 transition count 353
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 204 transition count 350
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 204 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 204 transition count 349
Applied a total of 10 rules in 5 ms. Remains 204 /208 variables (removed 4) and now considering 349/361 (removed 12) transitions.
[2024-05-25 15:44:40] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:44:40] [INFO ] Invariant cache hit.
[2024-05-25 15:44:40] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-25 15:44:40] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:44:40] [INFO ] Invariant cache hit.
[2024-05-25 15:44:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 15:44:40] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-25 15:44:40] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2024-05-25 15:44:40] [INFO ] Invariant cache hit.
[2024-05-25 15:44:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:44:43] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:44:43] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-25 15:44:43] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:44:43] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:44:43] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-25 15:44:43] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:44:44] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-25 15:44:44] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 12206 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-05-25 15:44:59] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:45:00] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 24688 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints]
After SMT, in 37189ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 37192ms
Starting structural reductions in LTL mode, iteration 1 : 204/208 places, 349/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37397 ms. Remains : 204/208 places, 349/361 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-15
Entered a terminal (fully accepting) state of product in 117 steps with 0 reset in 1 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-15 finished in 37552 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((p0&&G((p1||F(p2)))))))'
[2024-05-25 15:45:17] [INFO ] Flatten gal took : 24 ms
[2024-05-25 15:45:17] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 15 ms.
[2024-05-25 15:45:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 208 places, 361 transitions and 1192 arcs took 4 ms.
Total runtime 377683 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running MultiwaySync-PT-none
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 208
TRANSITIONS: 361
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.001s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1434
MODEL NAME: /home/mcc/execution/411/model
208 places, 361 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.
Building monolithic NSF...
FORMULA MultiwaySync-PT-none-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716651919394
--------------------
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="MultiwaySync-PT-none"
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 MultiwaySync-PT-none, 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 r245-tall-171654349500236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiwaySync-PT-none.tgz
mv MultiwaySync-PT-none execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;