About the Execution of GreatSPN+red for DES-PT-00b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2478.415 | 812403.00 | 924159.00 | 1878.70 | TFTTFTTFFTFTFFTT | 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.r091-tall-171624188100611.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 DES-PT-00b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188100611
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 12 08:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 08:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 66K May 18 16:42 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 DES-PT-00b-LTLCardinality-00
FORMULA_NAME DES-PT-00b-LTLCardinality-01
FORMULA_NAME DES-PT-00b-LTLCardinality-02
FORMULA_NAME DES-PT-00b-LTLCardinality-03
FORMULA_NAME DES-PT-00b-LTLCardinality-04
FORMULA_NAME DES-PT-00b-LTLCardinality-05
FORMULA_NAME DES-PT-00b-LTLCardinality-06
FORMULA_NAME DES-PT-00b-LTLCardinality-07
FORMULA_NAME DES-PT-00b-LTLCardinality-08
FORMULA_NAME DES-PT-00b-LTLCardinality-09
FORMULA_NAME DES-PT-00b-LTLCardinality-10
FORMULA_NAME DES-PT-00b-LTLCardinality-11
FORMULA_NAME DES-PT-00b-LTLCardinality-12
FORMULA_NAME DES-PT-00b-LTLCardinality-13
FORMULA_NAME DES-PT-00b-LTLCardinality-14
FORMULA_NAME DES-PT-00b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716310010040
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-00b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:46:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 16:46:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:46:51] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-21 16:46:51] [INFO ] Transformed 271 places.
[2024-05-21 16:46:51] [INFO ] Transformed 230 transitions.
[2024-05-21 16:46:51] [INFO ] Found NUPN structural information;
[2024-05-21 16:46:51] [INFO ] Parsed PT model containing 271 places and 230 transitions and 658 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-00b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 230/230 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 269 transition count 230
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 248 transition count 209
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 248 transition count 209
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 57 place count 235 transition count 196
Iterating global reduction 1 with 13 rules applied. Total rules applied 70 place count 235 transition count 196
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 80 place count 235 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 234 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 234 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 234 transition count 184
Applied a total of 83 rules in 78 ms. Remains 234 /271 variables (removed 37) and now considering 184/230 (removed 46) transitions.
// Phase 1: matrix 184 rows 234 cols
[2024-05-21 16:46:51] [INFO ] Computed 57 invariants in 29 ms
[2024-05-21 16:46:51] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-21 16:46:51] [INFO ] Invariant cache hit.
[2024-05-21 16:46:52] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
Running 183 sub problems to find dead transitions.
[2024-05-21 16:46:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/234 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-21 16:46:54] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 9 ms to minimize.
[2024-05-21 16:46:54] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:46:54] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:46:54] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:46:55] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:46:55] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:46:55] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:46:55] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:46:55] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:46:55] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:46:55] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:46:55] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:46:55] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:46:55] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:46:55] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-21 16:46:55] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:46:55] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:46:55] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:46:55] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-21 16:46:56] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-21 16:46:56] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-21 16:46:56] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-21 16:46:56] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:46:56] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:46:56] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-21 16:46:56] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:46:56] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-21 16:46:56] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-21 16:46:56] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-21 16:46:56] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-21 16:46:57] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:46:57] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-21 16:46:57] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-21 16:46:57] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 2 ms to minimize.
[2024-05-21 16:46:57] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 3 ms to minimize.
[2024-05-21 16:46:57] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 16/93 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-21 16:46:57] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 2 ms to minimize.
[2024-05-21 16:46:57] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-05-21 16:46:57] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:46:58] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-21 16:46:59] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-21 16:46:59] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-21 16:47:00] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 9 (OVERLAPS) 184/418 variables, 234/334 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-21 16:47:02] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-21 16:47:02] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-21 16:47:02] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-21 16:47:03] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:47:03] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-21 16:47:03] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:47:03] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 7/341 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-21 16:47:04] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:47:04] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:47:04] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-21 16:47:05] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-21 16:47:07] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:47:07] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-21 16:47:07] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 15 (OVERLAPS) 0/418 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 183 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 348 constraints, problems are : Problem set: 0 solved, 183 unsolved in 20492 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 183 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 2 (OVERLAPS) 1/234 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 57/114 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 6 (OVERLAPS) 184/418 variables, 234/348 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 183/531 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-21 16:47:15] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:47:16] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-21 16:47:21] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-21 16:47:26] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:47:26] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:47:26] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:47:26] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:47:28] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:47:28] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 6/540 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-05-21 16:47:32] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 183 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 541 constraints, problems are : Problem set: 0 solved, 183 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 67/67 constraints]
After SMT, in 50581ms problems are : Problem set: 0 solved, 183 unsolved
Search for dead transitions found 0 dead transitions in 50594ms
Starting structural reductions in LTL mode, iteration 1 : 234/271 places, 184/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51223 ms. Remains : 234/271 places, 184/230 transitions.
Support contains 20 out of 234 places after structural reductions.
[2024-05-21 16:47:43] [INFO ] Flatten gal took : 37 ms
[2024-05-21 16:47:43] [INFO ] Flatten gal took : 15 ms
[2024-05-21 16:47:43] [INFO ] Input system was already deterministic with 184 transitions.
RANDOM walk for 40000 steps (348 resets) in 872 ms. (45 steps per ms) remains 1/11 properties
BEST_FIRST walk for 24721 steps (31 resets) in 87 ms. (280 steps per ms) remains 0/1 properties
FORMULA DES-PT-00b-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 419 edges and 234 vertex of which 232 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 184/184 transitions.
Graph (complete) has 419 edges and 234 vertex of which 232 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
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 18 rules applied. Total rules applied 19 place count 231 transition count 163
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 213 transition count 163
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 213 transition count 152
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 202 transition count 152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 63 place count 198 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 198 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 198 transition count 147
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 195 transition count 144
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 195 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 195 transition count 142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 76 place count 195 transition count 141
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 194 transition count 141
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 220 place count 123 transition count 70
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 4 with 4 rules applied. Total rules applied 224 place count 121 transition count 72
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 226 place count 119 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 228 place count 117 transition count 70
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 5 with 2 rules applied. Total rules applied 230 place count 116 transition count 69
Applied a total of 230 rules in 61 ms. Remains 116 /234 variables (removed 118) and now considering 69/184 (removed 115) transitions.
// Phase 1: matrix 69 rows 116 cols
[2024-05-21 16:47:43] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 16:47:43] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 16:47:43] [INFO ] Invariant cache hit.
[2024-05-21 16:47:43] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-21 16:47:43] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-21 16:47:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 22/50 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 4/115 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 16:47:44] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:47:44] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-21 16:47:44] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 1/116 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 69/185 variables, 116/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/185 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 174 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1769 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 22/50 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 16:47:45] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 1/116 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 69/185 variables, 116/175 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 61/236 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 0/185 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 236 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2560 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 4/4 constraints]
After SMT, in 4342ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 4344ms
Starting structural reductions in SI_LTL mode, iteration 1 : 116/234 places, 69/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4608 ms. Remains : 116/234 places, 69/184 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-00b-LTLCardinality-00
Product exploration explored 100000 steps with 15772 reset in 399 ms.
Product exploration explored 100000 steps with 15699 reset in 248 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 69/69 transitions.
Applied a total of 0 rules in 8 ms. Remains 116 /116 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-05-21 16:47:49] [INFO ] Invariant cache hit.
[2024-05-21 16:47:49] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 16:47:49] [INFO ] Invariant cache hit.
[2024-05-21 16:47:49] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-21 16:47:49] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-21 16:47:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 22/50 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 4/115 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 16:47:50] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:47:50] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:47:50] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 1/116 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 69/185 variables, 116/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/185 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 174 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1688 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 22/50 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 16:47:51] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 1/116 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 69/185 variables, 116/175 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 61/236 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 0/185 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 236 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2554 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 4/4 constraints]
After SMT, in 4257ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 4258ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4461 ms. Remains : 116/116 places, 69/69 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15759 reset in 153 ms.
Product exploration explored 100000 steps with 15677 reset in 176 ms.
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 69/69 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-05-21 16:47:55] [INFO ] Invariant cache hit.
[2024-05-21 16:47:55] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 16:47:55] [INFO ] Invariant cache hit.
[2024-05-21 16:47:55] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-21 16:47:55] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-21 16:47:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 22/50 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 4/115 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 16:47:55] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-21 16:47:55] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-21 16:47:55] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 1/116 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 69/185 variables, 116/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/185 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 174 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1672 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 22/50 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 16:47:57] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 1/116 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 69/185 variables, 116/175 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 61/236 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 0/185 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 236 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2524 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 4/4 constraints]
After SMT, in 4207ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 4208ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4384 ms. Remains : 116/116 places, 69/69 transitions.
Treatment of property DES-PT-00b-LTLCardinality-00 finished in 15929 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(X(p1))))'
Support contains 5 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 184/184 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 231 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 231 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 228 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 228 transition count 178
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 228 transition count 176
Applied a total of 14 rules in 7 ms. Remains 228 /234 variables (removed 6) and now considering 176/184 (removed 8) transitions.
// Phase 1: matrix 176 rows 228 cols
[2024-05-21 16:47:59] [INFO ] Computed 57 invariants in 9 ms
[2024-05-21 16:47:59] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-21 16:47:59] [INFO ] Invariant cache hit.
[2024-05-21 16:47:59] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 16:47:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:48:01] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2024-05-21 16:48:01] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 2 ms to minimize.
[2024-05-21 16:48:01] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
[2024-05-21 16:48:02] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:48:02] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:48:02] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
[2024-05-21 16:48:02] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:48:02] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-21 16:48:02] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-21 16:48:02] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-21 16:48:02] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:48:02] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-21 16:48:02] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:48:02] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-21 16:48:02] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-21 16:48:02] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-21 16:48:02] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-21 16:48:02] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:48:03] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-21 16:48:03] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:48:03] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:48:03] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-21 16:48:03] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:48:03] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:48:03] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:48:03] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:48:03] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:48:03] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-21 16:48:03] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:48:03] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:48:03] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-05-21 16:48:04] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:48:05] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:48:05] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:48:06] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:48:06] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 176/404 variables, 228/321 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:48:09] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:48:09] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-21 16:48:09] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-21 16:48:09] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:48:10] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (OVERLAPS) 0/404 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 326 constraints, problems are : Problem set: 0 solved, 175 unsolved in 14801 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 41/98 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/404 variables, 228/326 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 175/501 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:48:17] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:48:17] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:48:17] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-21 16:48:17] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:48:17] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:48:18] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:48:18] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 7/508 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:48:23] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:48:23] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:48:30] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:48:36] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 512 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 52/52 constraints]
After SMT, in 44844ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 44846ms
Starting structural reductions in LTL mode, iteration 1 : 228/234 places, 176/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45123 ms. Remains : 228/234 places, 176/184 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : DES-PT-00b-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DES-PT-00b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLCardinality-01 finished in 45325 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(F(p0))||(p1&&G(F(!p0))))))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 184/184 transitions.
Graph (complete) has 419 edges and 234 vertex of which 232 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
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 18 rules applied. Total rules applied 19 place count 232 transition count 164
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 214 transition count 164
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 214 transition count 152
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 61 place count 202 transition count 152
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 199 transition count 149
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 199 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 199 transition count 148
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 197 transition count 146
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 197 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 197 transition count 144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 74 place count 197 transition count 143
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 76 place count 196 transition count 143
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 222 place count 123 transition count 70
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 4 with 4 rules applied. Total rules applied 226 place count 121 transition count 72
Applied a total of 226 rules in 41 ms. Remains 121 /234 variables (removed 113) and now considering 72/184 (removed 112) transitions.
// Phase 1: matrix 72 rows 121 cols
[2024-05-21 16:48:44] [INFO ] Computed 57 invariants in 3 ms
[2024-05-21 16:48:44] [INFO ] Implicit Places using invariants in 89 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/234 places, 72/184 transitions.
Applied a total of 0 rules in 4 ms. Remains 120 /120 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 120/234 places, 72/184 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-00b-LTLCardinality-02
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA DES-PT-00b-LTLCardinality-02 TRUE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLCardinality-02 finished in 228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 184/184 transitions.
Graph (complete) has 419 edges and 234 vertex of which 232 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
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 17 rules applied. Total rules applied 18 place count 231 transition count 164
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 214 transition count 164
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 35 place count 214 transition count 151
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 61 place count 201 transition count 151
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 197 transition count 147
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 197 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 197 transition count 146
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 73 place count 194 transition count 143
Iterating global reduction 3 with 3 rules applied. Total rules applied 76 place count 194 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 194 transition count 141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 78 place count 194 transition count 140
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 193 transition count 140
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 222 place count 122 transition count 69
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 4 with 4 rules applied. Total rules applied 226 place count 120 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 228 place count 118 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 230 place count 116 transition count 69
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 5 with 2 rules applied. Total rules applied 232 place count 115 transition count 68
Applied a total of 232 rules in 37 ms. Remains 115 /234 variables (removed 119) and now considering 68/184 (removed 116) transitions.
// Phase 1: matrix 68 rows 115 cols
[2024-05-21 16:48:45] [INFO ] Computed 55 invariants in 1 ms
[2024-05-21 16:48:45] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 16:48:45] [INFO ] Invariant cache hit.
[2024-05-21 16:48:45] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-05-21 16:48:45] [INFO ] Redundant transitions in 0 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-21 16:48:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 5/114 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:48:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-21 16:48:45] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:48:45] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:48:45] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:48:45] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-21 16:48:46] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-21 16:48:46] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/115 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 68/183 variables, 115/177 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:48:46] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-21 16:48:46] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-21 16:48:46] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-21 16:48:46] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:48:47] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-21 16:48:47] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (OVERLAPS) 0/183 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2474 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 5/114 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:48:48] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/115 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 68/183 variables, 115/184 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 59/243 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:48:48] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:48:48] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:48:49] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/183 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:48:50] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/183 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/183 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 17 (OVERLAPS) 0/183 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 247 constraints, problems are : Problem set: 0 solved, 59 unsolved in 5101 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 18/18 constraints]
After SMT, in 7588ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 7589ms
Starting structural reductions in SI_LTL mode, iteration 1 : 115/234 places, 68/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7819 ms. Remains : 115/234 places, 68/184 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-00b-LTLCardinality-03
Product exploration explored 100000 steps with 6429 reset in 177 ms.
Product exploration explored 100000 steps with 6358 reset in 240 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2569 resets) in 244 ms. (163 steps per ms) remains 1/1 properties
BEST_FIRST walk for 6159 steps (64 resets) in 18 ms. (324 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 68/68 transitions.
Applied a total of 0 rules in 7 ms. Remains 115 /115 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-21 16:48:53] [INFO ] Invariant cache hit.
[2024-05-21 16:48:53] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 16:48:53] [INFO ] Invariant cache hit.
[2024-05-21 16:48:54] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-21 16:48:54] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-21 16:48:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 5/114 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:48:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-21 16:48:54] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-21 16:48:54] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:48:54] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:48:54] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-21 16:48:54] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-21 16:48:54] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/115 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 68/183 variables, 115/177 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:48:55] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-21 16:48:55] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-21 16:48:55] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-21 16:48:55] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:48:55] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-21 16:48:55] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (OVERLAPS) 0/183 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2474 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 5/114 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:48:56] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/115 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 68/183 variables, 115/184 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 59/243 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:48:57] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-21 16:48:57] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:48:58] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/183 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:48:59] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/183 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/183 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 17 (OVERLAPS) 0/183 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 247 constraints, problems are : Problem set: 0 solved, 59 unsolved in 4966 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 18/18 constraints]
After SMT, in 7452ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 7452ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7647 ms. Remains : 115/115 places, 68/68 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 38358 steps (2476 resets) in 116 ms. (327 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6505 reset in 162 ms.
Product exploration explored 100000 steps with 6452 reset in 202 ms.
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 68/68 transitions.
Applied a total of 0 rules in 3 ms. Remains 115 /115 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-21 16:49:02] [INFO ] Invariant cache hit.
[2024-05-21 16:49:02] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 16:49:02] [INFO ] Invariant cache hit.
[2024-05-21 16:49:02] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-21 16:49:02] [INFO ] Redundant transitions in 0 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-21 16:49:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 5/114 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:49:03] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-21 16:49:03] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-21 16:49:03] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:49:03] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-21 16:49:03] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-21 16:49:03] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-21 16:49:03] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/115 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 68/183 variables, 115/177 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:49:04] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-21 16:49:04] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-21 16:49:04] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-21 16:49:04] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:49:04] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-21 16:49:04] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (OVERLAPS) 0/183 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 183 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2464 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 5/114 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:49:05] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/115 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 68/183 variables, 115/184 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 59/243 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:49:05] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-21 16:49:06] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:49:07] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/183 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-21 16:49:08] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/183 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/183 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 17 (OVERLAPS) 0/183 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 247 constraints, problems are : Problem set: 0 solved, 59 unsolved in 5044 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 18/18 constraints]
After SMT, in 7515ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 7516ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7694 ms. Remains : 115/115 places, 68/68 transitions.
Treatment of property DES-PT-00b-LTLCardinality-03 finished in 25071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(p0))))))'
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 184/184 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 229 transition count 179
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 229 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 229 transition count 178
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 226 transition count 175
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 226 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 226 transition count 173
Applied a total of 19 rules in 9 ms. Remains 226 /234 variables (removed 8) and now considering 173/184 (removed 11) transitions.
// Phase 1: matrix 173 rows 226 cols
[2024-05-21 16:49:10] [INFO ] Computed 57 invariants in 1 ms
[2024-05-21 16:49:10] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 16:49:10] [INFO ] Invariant cache hit.
[2024-05-21 16:49:10] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-21 16:49:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:49:12] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
[2024-05-21 16:49:12] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:49:12] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:49:12] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:49:12] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:49:12] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:49:12] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:49:12] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:49:12] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:49:12] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-21 16:49:13] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:49:13] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:49:13] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:49:13] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:49:13] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:49:13] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-21 16:49:13] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:49:13] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-21 16:49:13] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-21 16:49:13] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:49:13] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:49:13] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:49:13] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:49:13] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:49:14] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:49:14] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:49:14] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:49:14] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:49:14] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:49:14] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-21 16:49:14] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:49:14] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:49:14] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:49:15] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:49:15] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 173/399 variables, 226/318 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:49:17] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:49:17] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:49:17] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:49:17] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:49:17] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-21 16:49:18] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-21 16:49:18] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-21 16:49:18] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-21 16:49:18] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 9/327 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:49:20] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2024-05-21 16:49:20] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:49:21] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (OVERLAPS) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 330 constraints, problems are : Problem set: 0 solved, 172 unsolved in 14736 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 173/399 variables, 226/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 172/502 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:49:27] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:49:28] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:49:32] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 2 ms to minimize.
[2024-05-21 16:49:32] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:49:32] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:49:37] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:49:37] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:49:37] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:49:37] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:49:38] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:49:38] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:49:39] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-05-21 16:49:40] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 515 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 60/60 constraints]
After SMT, in 44761ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 44763ms
Starting structural reductions in LTL mode, iteration 1 : 226/234 places, 173/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45010 ms. Remains : 226/234 places, 173/184 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-00b-LTLCardinality-05
Product exploration explored 100000 steps with 33333 reset in 146 ms.
Product exploration explored 100000 steps with 33333 reset in 128 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 401 edges and 226 vertex of which 224 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 9 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-00b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-00b-LTLCardinality-05 finished in 45425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 184/184 transitions.
Graph (complete) has 419 edges and 234 vertex of which 232 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
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 17 rules applied. Total rules applied 18 place count 231 transition count 164
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 214 transition count 164
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 214 transition count 152
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 202 transition count 152
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 199 transition count 149
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 199 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 199 transition count 148
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 197 transition count 146
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 197 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 197 transition count 145
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 213 place count 126 transition count 74
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 4 with 4 rules applied. Total rules applied 217 place count 124 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 122 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 221 place count 120 transition count 74
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 5 with 2 rules applied. Total rules applied 223 place count 119 transition count 73
Applied a total of 223 rules in 23 ms. Remains 119 /234 variables (removed 115) and now considering 73/184 (removed 111) transitions.
// Phase 1: matrix 73 rows 119 cols
[2024-05-21 16:49:55] [INFO ] Computed 55 invariants in 1 ms
[2024-05-21 16:49:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 16:49:55] [INFO ] Invariant cache hit.
[2024-05-21 16:49:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 16:49:55] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-21 16:49:55] [INFO ] Redundant transitions in 0 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-21 16:49:55] [INFO ] Invariant cache hit.
[2024-05-21 16:49:55] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 22/52 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-21 16:49:56] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 1/119 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/192 variables, 119/175 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 6/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-21 16:49:57] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/192 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 182 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2304 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 119/119 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 22/52 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 1/119 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/192 variables, 119/176 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 6/182 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 72/254 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-21 16:49:59] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-21 16:50:00] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 256 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4261 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 119/119 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 4/4 constraints]
After SMT, in 6580ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 6582ms
Starting structural reductions in SI_LTL mode, iteration 1 : 119/234 places, 73/184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6804 ms. Remains : 119/234 places, 73/184 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-00b-LTLCardinality-07
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA DES-PT-00b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLCardinality-07 finished in 6866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 184/184 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 230 transition count 180
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 230 transition count 180
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 230 transition count 179
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 228 transition count 177
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 228 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 228 transition count 176
Applied a total of 14 rules in 10 ms. Remains 228 /234 variables (removed 6) and now considering 176/184 (removed 8) transitions.
// Phase 1: matrix 176 rows 228 cols
[2024-05-21 16:50:02] [INFO ] Computed 57 invariants in 2 ms
[2024-05-21 16:50:02] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 16:50:02] [INFO ] Invariant cache hit.
[2024-05-21 16:50:02] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 16:50:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:50:04] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-21 16:50:04] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:50:04] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:50:04] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:50:04] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:50:05] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 2 ms to minimize.
[2024-05-21 16:50:05] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 4 ms to minimize.
[2024-05-21 16:50:05] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:50:05] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:50:05] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:50:05] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:50:05] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:50:05] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:50:05] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:50:05] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:50:05] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:50:05] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-21 16:50:05] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:50:05] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:50:05] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:50:06] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:50:06] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:50:06] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:50:06] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:50:06] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:50:06] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:50:06] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-21 16:50:06] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:50:07] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:50:07] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:50:07] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:50:08] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:50:09] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 176/404 variables, 228/318 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:50:12] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:50:12] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:50:12] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:50:12] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:50:12] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-21 16:50:12] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 6/324 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:50:13] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:50:13] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:50:14] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:50:14] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-21 16:50:14] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:50:14] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:50:14] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:50:14] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 6/332 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:50:18] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/404 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/404 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:50:21] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/404 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/404 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:50:24] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:50:24] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/404 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/404 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 20 (OVERLAPS) 0/404 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 336 constraints, problems are : Problem set: 0 solved, 175 unsolved in 25917 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 51/108 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/404 variables, 228/336 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 175/511 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:50:31] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:50:31] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:50:32] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:50:32] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:50:32] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:50:32] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:50:32] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:50:32] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 8/519 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:50:35] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:50:35] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:50:36] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 3/522 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:50:41] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:50:41] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 2/524 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:50:46] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:50:46] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 2/526 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 16:50:54] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:50:54] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 528 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 68/68 constraints]
After SMT, in 55952ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 55954ms
Starting structural reductions in LTL mode, iteration 1 : 228/234 places, 176/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56224 ms. Remains : 228/234 places, 176/184 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-00b-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-00b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLCardinality-12 finished in 56322 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 U X(p0)))))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 184/184 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 229 transition count 179
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 229 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 229 transition count 178
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 226 transition count 175
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 226 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 226 transition count 173
Applied a total of 19 rules in 7 ms. Remains 226 /234 variables (removed 8) and now considering 173/184 (removed 11) transitions.
// Phase 1: matrix 173 rows 226 cols
[2024-05-21 16:50:58] [INFO ] Computed 57 invariants in 4 ms
[2024-05-21 16:50:58] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 16:50:58] [INFO ] Invariant cache hit.
[2024-05-21 16:50:58] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-21 16:50:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:51:00] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:51:01] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:51:01] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:51:01] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:51:01] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
[2024-05-21 16:51:01] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:51:01] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:51:01] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-21 16:51:01] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-21 16:51:01] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-21 16:51:01] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:51:01] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:51:01] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-21 16:51:01] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:51:01] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:51:02] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:51:02] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:51:02] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-21 16:51:02] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 16:51:02] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:51:02] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-21 16:51:02] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:51:02] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:51:02] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:51:02] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:51:02] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:51:02] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:51:02] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:51:02] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
[2024-05-21 16:51:02] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:51:02] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:51:03] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:51:03] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:51:03] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:51:03] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 173/399 variables, 226/318 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:51:06] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:51:06] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:51:06] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:51:06] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:51:06] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-21 16:51:06] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-21 16:51:07] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-21 16:51:07] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-21 16:51:07] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 9/327 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:51:09] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:51:09] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:51:10] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (OVERLAPS) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 330 constraints, problems are : Problem set: 0 solved, 172 unsolved in 15034 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 173/399 variables, 226/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 172/502 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:51:16] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:51:17] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:51:21] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:51:21] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:51:21] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:51:26] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2024-05-21 16:51:26] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:51:27] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:51:27] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:51:27] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 3 ms to minimize.
[2024-05-21 16:51:27] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:51:28] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-05-21 16:51:29] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 515 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 60/60 constraints]
After SMT, in 45067ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 45070ms
Starting structural reductions in LTL mode, iteration 1 : 226/234 places, 173/184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45338 ms. Remains : 226/234 places, 173/184 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-00b-LTLCardinality-14
Product exploration explored 100000 steps with 920 reset in 156 ms.
Product exploration explored 100000 steps with 890 reset in 177 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 401 edges and 226 vertex of which 224 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 30 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 173/173 transitions.
Applied a total of 0 rules in 5 ms. Remains 226 /226 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2024-05-21 16:51:44] [INFO ] Invariant cache hit.
[2024-05-21 16:51:44] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 16:51:44] [INFO ] Invariant cache hit.
[2024-05-21 16:51:45] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-21 16:51:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:51:47] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:51:47] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:51:47] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:51:47] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:51:47] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:51:47] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-21 16:51:47] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:51:47] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-21 16:51:47] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-21 16:51:47] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-21 16:51:47] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:51:47] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:51:47] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-21 16:51:47] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:51:48] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:51:48] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-21 16:51:48] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:51:48] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-21 16:51:48] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 16:51:48] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:51:48] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 16:51:48] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-21 16:51:48] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:51:48] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:51:48] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:51:48] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:51:48] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-21 16:51:48] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2024-05-21 16:51:48] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:51:48] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:51:49] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-21 16:51:49] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 16:51:49] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:51:49] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-21 16:51:49] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 173/399 variables, 226/318 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:51:52] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-21 16:51:52] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:51:52] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-21 16:51:52] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:51:52] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-21 16:51:52] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-21 16:51:52] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-21 16:51:53] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-21 16:51:53] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 9/327 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:51:55] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-21 16:51:55] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:51:56] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (OVERLAPS) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 330 constraints, problems are : Problem set: 0 solved, 172 unsolved in 14708 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 173/399 variables, 226/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 172/502 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:52:02] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-05-21 16:52:02] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:52:07] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:52:07] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:52:07] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:52:12] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:52:12] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:52:12] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:52:12] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:52:12] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:52:13] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-05-21 16:52:14] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:52:14] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 515 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 60/60 constraints]
After SMT, in 44740ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 44742ms
Finished structural reductions in LTL mode , in 1 iterations and 44988 ms. Remains : 226/226 places, 173/173 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 401 edges and 226 vertex of which 224 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 920 reset in 163 ms.
Product exploration explored 100000 steps with 909 reset in 171 ms.
Support contains 2 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 173/173 transitions.
Applied a total of 0 rules in 4 ms. Remains 226 /226 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2024-05-21 16:52:30] [INFO ] Invariant cache hit.
[2024-05-21 16:52:31] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 16:52:31] [INFO ] Invariant cache hit.
[2024-05-21 16:52:31] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-21 16:52:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:52:33] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:52:33] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:52:33] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:52:33] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:52:33] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:52:33] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:52:33] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:52:33] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:52:33] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-21 16:52:33] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-21 16:52:33] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:52:33] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
[2024-05-21 16:52:34] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:52:34] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:52:34] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:52:34] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-21 16:52:34] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-21 16:52:34] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-21 16:52:34] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-21 16:52:34] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:52:34] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-21 16:52:34] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-21 16:52:34] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-21 16:52:34] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:52:34] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:52:34] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:52:34] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-21 16:52:35] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:52:35] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-21 16:52:35] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:52:35] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:52:35] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-21 16:52:35] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:52:35] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-21 16:52:35] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 173/399 variables, 226/318 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:52:38] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-21 16:52:38] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:52:38] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:52:38] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:52:38] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-21 16:52:38] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-21 16:52:39] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-21 16:52:39] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-21 16:52:39] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 9/327 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:52:41] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-21 16:52:41] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:52:42] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (OVERLAPS) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 330 constraints, problems are : Problem set: 0 solved, 172 unsolved in 14985 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 173/399 variables, 226/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 172/502 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:52:48] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:52:49] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:52:53] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:52:53] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:52:53] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 16:52:58] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:52:58] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 2 ms to minimize.
[2024-05-21 16:52:59] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:52:59] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:52:59] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:52:59] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:53:00] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:53:01] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 515 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 60/60 constraints]
After SMT, in 45013ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 45016ms
Finished structural reductions in LTL mode , in 1 iterations and 45270 ms. Remains : 226/226 places, 173/173 transitions.
Treatment of property DES-PT-00b-LTLCardinality-14 finished in 137524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(p0)))))'
Found a Lengthening insensitive property : DES-PT-00b-LTLCardinality-14
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 234/234 places, 184/184 transitions.
Graph (complete) has 419 edges and 234 vertex of which 232 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
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 18 rules applied. Total rules applied 19 place count 231 transition count 163
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 213 transition count 163
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 213 transition count 151
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 61 place count 201 transition count 151
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 197 transition count 147
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 197 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 197 transition count 146
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 73 place count 194 transition count 143
Iterating global reduction 3 with 3 rules applied. Total rules applied 76 place count 194 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 78 place count 194 transition count 141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 78 place count 194 transition count 140
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 80 place count 193 transition count 140
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 218 place count 124 transition count 71
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 4 with 4 rules applied. Total rules applied 222 place count 122 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 224 place count 120 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 226 place count 118 transition count 71
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 5 with 2 rules applied. Total rules applied 228 place count 117 transition count 70
Applied a total of 228 rules in 29 ms. Remains 117 /234 variables (removed 117) and now considering 70/184 (removed 114) transitions.
// Phase 1: matrix 70 rows 117 cols
[2024-05-21 16:53:16] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 16:53:16] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 16:53:16] [INFO ] Invariant cache hit.
[2024-05-21 16:53:16] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-21 16:53:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 5/116 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 16:53:17] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 1/117 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 16:53:17] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 70/187 variables, 117/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 0/187 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 174 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1935 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 5/116 variables, 27/46 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 1/117 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 70/187 variables, 117/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 61/235 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 16:53:20] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-21 16:53:20] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-21 16:53:20] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/187 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 14 (OVERLAPS) 0/187 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 238 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3716 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 5/5 constraints]
After SMT, in 5659ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 5660ms
Starting structural reductions in LI_LTL mode, iteration 1 : 117/234 places, 70/184 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5880 ms. Remains : 117/234 places, 70/184 transitions.
Running random walk in product with property : DES-PT-00b-LTLCardinality-14
Product exploration explored 100000 steps with 6055 reset in 171 ms.
Product exploration explored 100000 steps with 6073 reset in 218 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 141 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 11 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 167 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 70/70 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-21 16:53:23] [INFO ] Invariant cache hit.
[2024-05-21 16:53:23] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 16:53:23] [INFO ] Invariant cache hit.
[2024-05-21 16:53:23] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-21 16:53:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 5/116 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 16:53:24] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 1/117 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 16:53:24] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 70/187 variables, 117/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 0/187 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 174 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1907 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 5/116 variables, 27/46 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 1/117 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 70/187 variables, 117/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 61/235 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 16:53:26] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-21 16:53:27] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:53:27] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/187 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 14 (OVERLAPS) 0/187 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 238 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3591 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 5/5 constraints]
After SMT, in 5508ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 5509ms
Finished structural reductions in LTL mode , in 1 iterations and 5690 ms. Remains : 117/117 places, 70/70 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 119 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 167 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6083 reset in 161 ms.
Product exploration explored 100000 steps with 6000 reset in 183 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 70/70 transitions.
Applied a total of 0 rules in 0 ms. Remains 117 /117 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-21 16:53:30] [INFO ] Invariant cache hit.
[2024-05-21 16:53:30] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 16:53:30] [INFO ] Invariant cache hit.
[2024-05-21 16:53:30] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-21 16:53:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 5/116 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 16:53:30] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 1/117 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 16:53:31] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 70/187 variables, 117/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 0/187 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 174 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1845 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 5/116 variables, 27/46 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 1/117 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 70/187 variables, 117/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 61/235 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-21 16:53:33] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-21 16:53:33] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:53:33] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/187 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/187 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 14 (OVERLAPS) 0/187 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 238 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3503 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 5/5 constraints]
After SMT, in 5357ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 5358ms
Finished structural reductions in LTL mode , in 1 iterations and 5525 ms. Remains : 117/117 places, 70/70 transitions.
Treatment of property DES-PT-00b-LTLCardinality-14 finished in 19339 ms.
[2024-05-21 16:53:35] [INFO ] Flatten gal took : 10 ms
[2024-05-21 16:53:35] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-21 16:53:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 234 places, 184 transitions and 543 arcs took 4 ms.
Total runtime 404604 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DES-PT-00b
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 234
TRANSITIONS: 184
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.009s]
SAVING FILE /home/mcc/execution/412/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: 2870
MODEL NAME: /home/mcc/execution/412/model
234 places, 184 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DES-PT-00b-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-00b-LTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-00b-LTLCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716310822443
--------------------
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 LTLCardinality -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="DES-PT-00b"
export BK_EXAMINATION="LTLCardinality"
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 DES-PT-00b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624188100611"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-00b.tgz
mv DES-PT-00b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;