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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 48K Apr 12 02:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 222K Apr 12 02:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 12 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 270K Apr 12 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 75K Apr 12 03:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 304K Apr 12 03:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 212K Apr 12 03:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 982K Apr 12 03:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 298K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717270684381

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:38:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:38:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:38:06] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2024-06-01 19:38:06] [INFO ] Transformed 480 places.
[2024-06-01 19:38:06] [INFO ] Transformed 690 transitions.
[2024-06-01 19:38:06] [INFO ] Found NUPN structural information;
[2024-06-01 19:38:06] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-PT-4-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 452 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 34 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 19:38:06] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-06-01 19:38:06] [INFO ] Computed 19 invariants in 34 ms
[2024-06-01 19:38:07] [INFO ] Implicit Places using invariants in 556 ms returned []
[2024-06-01 19:38:07] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:38:07] [INFO ] Invariant cache hit.
[2024-06-01 19:38:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:38:08] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2024-06-01 19:38:08] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:38:08] [INFO ] Invariant cache hit.
[2024-06-01 19:38:08] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (OVERLAPS) 5/480 variables, 10/489 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 5/494 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:38:29] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 42 ms to minimize.
[2024-06-01 19:38:29] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 5 ms to minimize.
[2024-06-01 19:38:29] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 5 ms to minimize.
[2024-06-01 19:38:29] [INFO ] Deduced a trap composed of 36 places in 203 ms of which 4 ms to minimize.
[2024-06-01 19:38:30] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 4 ms to minimize.
[2024-06-01 19:38:30] [INFO ] Deduced a trap composed of 45 places in 302 ms of which 5 ms to minimize.
[2024-06-01 19:38:30] [INFO ] Deduced a trap composed of 54 places in 229 ms of which 4 ms to minimize.
[2024-06-01 19:38:30] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 4 ms to minimize.
[2024-06-01 19:38:31] [INFO ] Deduced a trap composed of 58 places in 243 ms of which 4 ms to minimize.
[2024-06-01 19:38:31] [INFO ] Deduced a trap composed of 14 places in 286 ms of which 4 ms to minimize.
[2024-06-01 19:38:31] [INFO ] Deduced a trap composed of 17 places in 292 ms of which 4 ms to minimize.
[2024-06-01 19:38:32] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 4 ms to minimize.
[2024-06-01 19:38:32] [INFO ] Deduced a trap composed of 18 places in 271 ms of which 4 ms to minimize.
[2024-06-01 19:38:32] [INFO ] Deduced a trap composed of 10 places in 297 ms of which 5 ms to minimize.
[2024-06-01 19:38:32] [INFO ] Deduced a trap composed of 54 places in 214 ms of which 4 ms to minimize.
[2024-06-01 19:38:33] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 3 ms to minimize.
[2024-06-01 19:38:33] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 3 ms to minimize.
[2024-06-01 19:38:33] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 4 ms to minimize.
[2024-06-01 19:38:33] [INFO ] Deduced a trap composed of 40 places in 248 ms of which 4 ms to minimize.
[2024-06-01 19:38:33] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1110 variables, and 519 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30043 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (OVERLAPS) 5/480 variables, 10/509 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 5/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:38:47] [INFO ] Deduced a trap composed of 14 places in 259 ms of which 4 ms to minimize.
[2024-06-01 19:38:47] [INFO ] Deduced a trap composed of 57 places in 222 ms of which 4 ms to minimize.
[2024-06-01 19:38:48] [INFO ] Deduced a trap composed of 86 places in 227 ms of which 3 ms to minimize.
[2024-06-01 19:38:48] [INFO ] Deduced a trap composed of 83 places in 200 ms of which 3 ms to minimize.
[2024-06-01 19:38:48] [INFO ] Deduced a trap composed of 84 places in 219 ms of which 3 ms to minimize.
[2024-06-01 19:38:48] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 3 ms to minimize.
[2024-06-01 19:38:49] [INFO ] Deduced a trap composed of 62 places in 212 ms of which 4 ms to minimize.
[2024-06-01 19:38:49] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 3 ms to minimize.
[2024-06-01 19:38:49] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 3 ms to minimize.
[2024-06-01 19:38:49] [INFO ] Deduced a trap composed of 39 places in 235 ms of which 3 ms to minimize.
[2024-06-01 19:38:49] [INFO ] Deduced a trap composed of 61 places in 193 ms of which 4 ms to minimize.
[2024-06-01 19:38:50] [INFO ] Deduced a trap composed of 61 places in 179 ms of which 3 ms to minimize.
[2024-06-01 19:38:50] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 3 ms to minimize.
[2024-06-01 19:38:50] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 4 ms to minimize.
[2024-06-01 19:38:50] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 4 ms to minimize.
[2024-06-01 19:38:51] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 4 ms to minimize.
[2024-06-01 19:38:51] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 3 ms to minimize.
[2024-06-01 19:38:51] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 4 ms to minimize.
[2024-06-01 19:38:51] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 4 ms to minimize.
[2024-06-01 19:38:52] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 20/539 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:38:53] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 4 ms to minimize.
[2024-06-01 19:38:53] [INFO ] Deduced a trap composed of 32 places in 241 ms of which 3 ms to minimize.
[2024-06-01 19:38:53] [INFO ] Deduced a trap composed of 102 places in 257 ms of which 4 ms to minimize.
[2024-06-01 19:38:54] [INFO ] Deduced a trap composed of 62 places in 231 ms of which 4 ms to minimize.
[2024-06-01 19:38:54] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 3 ms to minimize.
[2024-06-01 19:38:54] [INFO ] Deduced a trap composed of 62 places in 264 ms of which 4 ms to minimize.
[2024-06-01 19:38:54] [INFO ] Deduced a trap composed of 62 places in 234 ms of which 3 ms to minimize.
[2024-06-01 19:38:55] [INFO ] Deduced a trap composed of 43 places in 156 ms of which 3 ms to minimize.
[2024-06-01 19:38:55] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 3 ms to minimize.
[2024-06-01 19:38:55] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:38:55] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 4 ms to minimize.
[2024-06-01 19:38:55] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 3 ms to minimize.
[2024-06-01 19:38:55] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:38:55] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 4 ms to minimize.
[2024-06-01 19:38:56] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 3 ms to minimize.
[2024-06-01 19:38:56] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 3 ms to minimize.
[2024-06-01 19:38:56] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 7 ms to minimize.
[2024-06-01 19:38:56] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 3 ms to minimize.
[2024-06-01 19:38:56] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:38:57] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 20/559 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:38:59] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:38:59] [INFO ] Deduced a trap composed of 87 places in 153 ms of which 3 ms to minimize.
[2024-06-01 19:38:59] [INFO ] Deduced a trap composed of 87 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:39:00] [INFO ] Deduced a trap composed of 112 places in 157 ms of which 4 ms to minimize.
[2024-06-01 19:39:00] [INFO ] Deduced a trap composed of 128 places in 156 ms of which 3 ms to minimize.
[2024-06-01 19:39:00] [INFO ] Deduced a trap composed of 36 places in 284 ms of which 4 ms to minimize.
[2024-06-01 19:39:00] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:39:01] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 4 ms to minimize.
[2024-06-01 19:39:01] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 3 ms to minimize.
[2024-06-01 19:39:01] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:39:01] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:39:01] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:39:02] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 3 ms to minimize.
[2024-06-01 19:39:02] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:39:02] [INFO ] Deduced a trap composed of 92 places in 162 ms of which 3 ms to minimize.
[2024-06-01 19:39:02] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 2 ms to minimize.
[2024-06-01 19:39:02] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:39:03] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:39:03] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:39:03] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 20/579 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:39:06] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 5 ms to minimize.
[2024-06-01 19:39:07] [INFO ] Deduced a trap composed of 54 places in 195 ms of which 3 ms to minimize.
[2024-06-01 19:39:07] [INFO ] Deduced a trap composed of 84 places in 179 ms of which 3 ms to minimize.
[2024-06-01 19:39:07] [INFO ] Deduced a trap composed of 84 places in 187 ms of which 3 ms to minimize.
[2024-06-01 19:39:07] [INFO ] Deduced a trap composed of 83 places in 183 ms of which 3 ms to minimize.
[2024-06-01 19:39:08] [INFO ] Deduced a trap composed of 119 places in 122 ms of which 3 ms to minimize.
[2024-06-01 19:39:08] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:39:08] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 3 ms to minimize.
SMT process timed out in 60516ms, After SMT, problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60554ms
Finished structural reductions in LTL mode , in 1 iterations and 61959 ms. Remains : 480/480 places, 690/690 transitions.
Support contains 452 out of 480 places after structural reductions.
[2024-06-01 19:39:08] [INFO ] Flatten gal took : 99 ms
[2024-06-01 19:39:09] [INFO ] Flatten gal took : 56 ms
[2024-06-01 19:39:09] [INFO ] Input system was already deterministic with 690 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (8 resets) in 2011 ms. (19 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
[2024-06-01 19:39:09] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:39:09] [INFO ] Invariant cache hit.
[2024-06-01 19:39:09] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 445/450 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 445/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/455 variables, 5/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 5/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/460 variables, 5/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 5/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:39:10] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 630/1090 variables, 460/936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1090 variables, 116/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1090 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 20/1110 variables, 20/1072 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1110 variables, 20/1092 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1110 variables, 4/1096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1110 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1110 variables, 0/1096 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 1096 constraints, problems are : Problem set: 0 solved, 1 unsolved in 781 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 445/450 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 445/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/455 variables, 5/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 5/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/460 variables, 5/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 5/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 630/1090 variables, 460/936 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1090 variables, 116/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1090 variables, 1/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1090 variables, 0/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 20/1110 variables, 20/1073 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1110 variables, 20/1093 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1110 variables, 4/1097 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:39:11] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 4 ms to minimize.
[2024-06-01 19:39:11] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 3 ms to minimize.
[2024-06-01 19:39:11] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 4 ms to minimize.
[2024-06-01 19:39:12] [INFO ] Deduced a trap composed of 66 places in 223 ms of which 3 ms to minimize.
[2024-06-01 19:39:12] [INFO ] Deduced a trap composed of 54 places in 228 ms of which 4 ms to minimize.
[2024-06-01 19:39:12] [INFO ] Deduced a trap composed of 54 places in 258 ms of which 5 ms to minimize.
[2024-06-01 19:39:13] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 4 ms to minimize.
[2024-06-01 19:39:13] [INFO ] Deduced a trap composed of 54 places in 254 ms of which 4 ms to minimize.
[2024-06-01 19:39:13] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 4 ms to minimize.
[2024-06-01 19:39:13] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 4 ms to minimize.
[2024-06-01 19:39:14] [INFO ] Deduced a trap composed of 32 places in 260 ms of which 4 ms to minimize.
[2024-06-01 19:39:14] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 4 ms to minimize.
[2024-06-01 19:39:14] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 3 ms to minimize.
[2024-06-01 19:39:15] [INFO ] Deduced a trap composed of 126 places in 258 ms of which 4 ms to minimize.
[2024-06-01 19:39:15] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 4 ms to minimize.
[2024-06-01 19:39:15] [INFO ] Deduced a trap composed of 79 places in 234 ms of which 4 ms to minimize.
SMT process timed out in 5858ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 400 place count 280 transition count 395
Deduced a syphon composed of 95 places in 1 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 590 place count 185 transition count 395
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 630 place count 165 transition count 375
Applied a total of 630 rules in 89 ms. Remains 165 /480 variables (removed 315) and now considering 375/690 (removed 315) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 165/480 places, 375/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 487 ms. (81 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1265742 steps, run timeout after 3001 ms. (steps per millisecond=421 ) properties seen :0 out of 1
Probabilistic random walk after 1265742 steps, saw 211125 distinct states, run finished after 3006 ms. (steps per millisecond=421 ) properties seen :0
[2024-06-01 19:39:19] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 165 cols
[2024-06-01 19:39:19] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 19:39:19] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/136 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 131/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/140 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/145 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 5/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 315/460 variables, 145/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 116/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 20/480 variables, 20/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/480 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/480 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 465 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Domain max(s): 165/165 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 165/165 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 131/136 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 131/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/140 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/145 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 5/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 315/460 variables, 145/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 116/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/460 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 20/480 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 20/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 4/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:39:19] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:39:19] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:39:19] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:39:19] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:39:19] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:39:20] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:39:20] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:39:20] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:39:20] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:39:20] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:39:20] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:39:20] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:39:20] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:39:20] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:39:20] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:39:20] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:39:21] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:39:21] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:39:21] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:39:21] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 20/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:39:21] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:39:21] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:39:21] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:39:21] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:39:21] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:39:21] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:39:21] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:39:22] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:39:22] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:39:22] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:39:22] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:39:22] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:39:22] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:39:22] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:39:22] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:39:22] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:39:22] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:39:22] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:39:23] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:39:23] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 20/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 19:39:23] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:39:23] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:39:23] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:39:23] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:39:23] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:39:23] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:39:23] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Int declared 480/480 variables, and 513 constraints, problems are : Problem set: 1 solved, 0 unsolved in 4655 ms.
Refiners :[Domain max(s): 165/165 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 165/165 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 47/47 constraints]
After SMT, in 4885ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA Peterson-PT-4-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F(p1)))))'
Support contains 125 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 22 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 19:39:24] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-06-01 19:39:24] [INFO ] Computed 19 invariants in 11 ms
[2024-06-01 19:39:24] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-06-01 19:39:24] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:39:24] [INFO ] Invariant cache hit.
[2024-06-01 19:39:24] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:39:25] [INFO ] Implicit Places using invariants and state equation in 1210 ms returned []
Implicit Place search using SMT with State Equation took 1561 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2024-06-01 19:39:25] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:39:25] [INFO ] Invariant cache hit.
[2024-06-01 19:39:25] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (OVERLAPS) 5/480 variables, 10/489 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 5/494 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:39:45] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 3 ms to minimize.
[2024-06-01 19:39:45] [INFO ] Deduced a trap composed of 35 places in 238 ms of which 4 ms to minimize.
[2024-06-01 19:39:46] [INFO ] Deduced a trap composed of 27 places in 226 ms of which 4 ms to minimize.
[2024-06-01 19:39:46] [INFO ] Deduced a trap composed of 36 places in 246 ms of which 5 ms to minimize.
[2024-06-01 19:39:46] [INFO ] Deduced a trap composed of 36 places in 258 ms of which 4 ms to minimize.
[2024-06-01 19:39:46] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 4 ms to minimize.
[2024-06-01 19:39:47] [INFO ] Deduced a trap composed of 54 places in 272 ms of which 4 ms to minimize.
[2024-06-01 19:39:47] [INFO ] Deduced a trap composed of 32 places in 300 ms of which 5 ms to minimize.
[2024-06-01 19:39:47] [INFO ] Deduced a trap composed of 58 places in 215 ms of which 3 ms to minimize.
[2024-06-01 19:39:47] [INFO ] Deduced a trap composed of 14 places in 300 ms of which 4 ms to minimize.
[2024-06-01 19:39:48] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 4 ms to minimize.
[2024-06-01 19:39:48] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 4 ms to minimize.
[2024-06-01 19:39:48] [INFO ] Deduced a trap composed of 18 places in 256 ms of which 5 ms to minimize.
[2024-06-01 19:39:49] [INFO ] Deduced a trap composed of 10 places in 279 ms of which 5 ms to minimize.
[2024-06-01 19:39:49] [INFO ] Deduced a trap composed of 54 places in 229 ms of which 3 ms to minimize.
[2024-06-01 19:39:49] [INFO ] Deduced a trap composed of 60 places in 181 ms of which 4 ms to minimize.
[2024-06-01 19:39:49] [INFO ] Deduced a trap composed of 64 places in 183 ms of which 3 ms to minimize.
[2024-06-01 19:39:49] [INFO ] Deduced a trap composed of 39 places in 242 ms of which 4 ms to minimize.
[2024-06-01 19:39:50] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 4 ms to minimize.
[2024-06-01 19:39:50] [INFO ] Deduced a trap composed of 18 places in 291 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1110 variables, and 519 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30019 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (OVERLAPS) 5/480 variables, 10/509 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 5/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:40:04] [INFO ] Deduced a trap composed of 14 places in 241 ms of which 4 ms to minimize.
[2024-06-01 19:40:05] [INFO ] Deduced a trap composed of 57 places in 219 ms of which 3 ms to minimize.
[2024-06-01 19:40:05] [INFO ] Deduced a trap composed of 86 places in 209 ms of which 3 ms to minimize.
[2024-06-01 19:40:05] [INFO ] Deduced a trap composed of 83 places in 186 ms of which 3 ms to minimize.
[2024-06-01 19:40:05] [INFO ] Deduced a trap composed of 84 places in 203 ms of which 3 ms to minimize.
[2024-06-01 19:40:05] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 4 ms to minimize.
[2024-06-01 19:40:06] [INFO ] Deduced a trap composed of 62 places in 192 ms of which 4 ms to minimize.
[2024-06-01 19:40:06] [INFO ] Deduced a trap composed of 62 places in 207 ms of which 3 ms to minimize.
[2024-06-01 19:40:06] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 3 ms to minimize.
[2024-06-01 19:40:06] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 4 ms to minimize.
[2024-06-01 19:40:06] [INFO ] Deduced a trap composed of 61 places in 197 ms of which 3 ms to minimize.
[2024-06-01 19:40:07] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 3 ms to minimize.
[2024-06-01 19:40:07] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 4 ms to minimize.
[2024-06-01 19:40:07] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 4 ms to minimize.
[2024-06-01 19:40:07] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 3 ms to minimize.
[2024-06-01 19:40:08] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 4 ms to minimize.
[2024-06-01 19:40:08] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 3 ms to minimize.
[2024-06-01 19:40:08] [INFO ] Deduced a trap composed of 65 places in 181 ms of which 3 ms to minimize.
[2024-06-01 19:40:08] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 3 ms to minimize.
[2024-06-01 19:40:08] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 20/539 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:40:10] [INFO ] Deduced a trap composed of 32 places in 211 ms of which 3 ms to minimize.
[2024-06-01 19:40:10] [INFO ] Deduced a trap composed of 32 places in 237 ms of which 4 ms to minimize.
[2024-06-01 19:40:10] [INFO ] Deduced a trap composed of 102 places in 284 ms of which 4 ms to minimize.
[2024-06-01 19:40:11] [INFO ] Deduced a trap composed of 62 places in 264 ms of which 4 ms to minimize.
[2024-06-01 19:40:11] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 4 ms to minimize.
[2024-06-01 19:40:11] [INFO ] Deduced a trap composed of 62 places in 248 ms of which 4 ms to minimize.
[2024-06-01 19:40:11] [INFO ] Deduced a trap composed of 62 places in 239 ms of which 3 ms to minimize.
[2024-06-01 19:40:12] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 3 ms to minimize.
[2024-06-01 19:40:12] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:40:12] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:40:12] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:40:12] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:40:12] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:40:12] [INFO ] Deduced a trap composed of 58 places in 131 ms of which 3 ms to minimize.
[2024-06-01 19:40:13] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:40:13] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:40:13] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 3 ms to minimize.
[2024-06-01 19:40:13] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:40:13] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:40:14] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 20/559 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:40:16] [INFO ] Deduced a trap composed of 88 places in 159 ms of which 3 ms to minimize.
[2024-06-01 19:40:16] [INFO ] Deduced a trap composed of 87 places in 148 ms of which 3 ms to minimize.
[2024-06-01 19:40:16] [INFO ] Deduced a trap composed of 87 places in 215 ms of which 3 ms to minimize.
[2024-06-01 19:40:17] [INFO ] Deduced a trap composed of 112 places in 185 ms of which 3 ms to minimize.
[2024-06-01 19:40:17] [INFO ] Deduced a trap composed of 128 places in 170 ms of which 3 ms to minimize.
[2024-06-01 19:40:17] [INFO ] Deduced a trap composed of 36 places in 294 ms of which 5 ms to minimize.
[2024-06-01 19:40:18] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 3 ms to minimize.
[2024-06-01 19:40:18] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 4 ms to minimize.
[2024-06-01 19:40:18] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 4 ms to minimize.
[2024-06-01 19:40:18] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 3 ms to minimize.
[2024-06-01 19:40:18] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 8 ms to minimize.
[2024-06-01 19:40:18] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 2 ms to minimize.
[2024-06-01 19:40:19] [INFO ] Deduced a trap composed of 76 places in 176 ms of which 3 ms to minimize.
[2024-06-01 19:40:19] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 4 ms to minimize.
[2024-06-01 19:40:19] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:40:19] [INFO ] Deduced a trap composed of 92 places in 181 ms of which 3 ms to minimize.
[2024-06-01 19:40:20] [INFO ] Deduced a trap composed of 92 places in 189 ms of which 4 ms to minimize.
[2024-06-01 19:40:20] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:40:20] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:40:20] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 20/579 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:40:24] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:40:24] [INFO ] Deduced a trap composed of 54 places in 197 ms of which 3 ms to minimize.
[2024-06-01 19:40:24] [INFO ] Deduced a trap composed of 84 places in 184 ms of which 3 ms to minimize.
[2024-06-01 19:40:24] [INFO ] Deduced a trap composed of 84 places in 186 ms of which 3 ms to minimize.
[2024-06-01 19:40:24] [INFO ] Deduced a trap composed of 83 places in 183 ms of which 3 ms to minimize.
[2024-06-01 19:40:25] [INFO ] Deduced a trap composed of 119 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:40:25] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:40:25] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 3 ms to minimize.
[2024-06-01 19:40:26] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 4 ms to minimize.
SMT process timed out in 60339ms, After SMT, problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60348ms
Finished structural reductions in LTL mode , in 1 iterations and 61934 ms. Remains : 480/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 309 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Peterson-PT-4-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Peterson-PT-4-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-4-LTLCardinality-00 finished in 62330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F(p1)||(X(G(p2))&&F(p0))))'
Support contains 225 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 19:40:26] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:40:26] [INFO ] Invariant cache hit.
[2024-06-01 19:40:26] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-06-01 19:40:26] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:40:26] [INFO ] Invariant cache hit.
[2024-06-01 19:40:27] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:40:27] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2024-06-01 19:40:27] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:40:27] [INFO ] Invariant cache hit.
[2024-06-01 19:40:27] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (OVERLAPS) 5/480 variables, 10/489 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 5/494 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:40:48] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 4 ms to minimize.
[2024-06-01 19:40:48] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 4 ms to minimize.
[2024-06-01 19:40:48] [INFO ] Deduced a trap composed of 27 places in 281 ms of which 4 ms to minimize.
[2024-06-01 19:40:48] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 4 ms to minimize.
[2024-06-01 19:40:49] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 4 ms to minimize.
[2024-06-01 19:40:49] [INFO ] Deduced a trap composed of 45 places in 265 ms of which 4 ms to minimize.
[2024-06-01 19:40:49] [INFO ] Deduced a trap composed of 54 places in 252 ms of which 4 ms to minimize.
[2024-06-01 19:40:49] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 6 ms to minimize.
[2024-06-01 19:40:50] [INFO ] Deduced a trap composed of 58 places in 192 ms of which 4 ms to minimize.
[2024-06-01 19:40:50] [INFO ] Deduced a trap composed of 14 places in 290 ms of which 5 ms to minimize.
[2024-06-01 19:40:50] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 4 ms to minimize.
[2024-06-01 19:40:51] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 4 ms to minimize.
[2024-06-01 19:40:51] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 4 ms to minimize.
[2024-06-01 19:40:51] [INFO ] Deduced a trap composed of 10 places in 277 ms of which 5 ms to minimize.
[2024-06-01 19:40:51] [INFO ] Deduced a trap composed of 54 places in 207 ms of which 5 ms to minimize.
[2024-06-01 19:40:51] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 3 ms to minimize.
[2024-06-01 19:40:52] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 3 ms to minimize.
[2024-06-01 19:40:52] [INFO ] Deduced a trap composed of 39 places in 238 ms of which 4 ms to minimize.
[2024-06-01 19:40:52] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 4 ms to minimize.
[2024-06-01 19:40:52] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1110 variables, and 519 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30026 ms.
Refiners :[Domain max(s): 480/480 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 685/685 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 685 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 475/475 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 4/479 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 4 (OVERLAPS) 5/480 variables, 10/509 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 5/514 constraints. Problems are: Problem set: 0 solved, 685 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 5/519 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:41:07] [INFO ] Deduced a trap composed of 14 places in 243 ms of which 4 ms to minimize.
[2024-06-01 19:41:07] [INFO ] Deduced a trap composed of 57 places in 231 ms of which 4 ms to minimize.
[2024-06-01 19:41:07] [INFO ] Deduced a trap composed of 86 places in 234 ms of which 4 ms to minimize.
[2024-06-01 19:41:07] [INFO ] Deduced a trap composed of 83 places in 248 ms of which 3 ms to minimize.
[2024-06-01 19:41:08] [INFO ] Deduced a trap composed of 84 places in 218 ms of which 4 ms to minimize.
[2024-06-01 19:41:08] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 3 ms to minimize.
[2024-06-01 19:41:08] [INFO ] Deduced a trap composed of 62 places in 194 ms of which 3 ms to minimize.
[2024-06-01 19:41:08] [INFO ] Deduced a trap composed of 62 places in 234 ms of which 3 ms to minimize.
[2024-06-01 19:41:08] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 3 ms to minimize.
[2024-06-01 19:41:09] [INFO ] Deduced a trap composed of 39 places in 251 ms of which 4 ms to minimize.
[2024-06-01 19:41:09] [INFO ] Deduced a trap composed of 61 places in 182 ms of which 3 ms to minimize.
[2024-06-01 19:41:09] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 3 ms to minimize.
[2024-06-01 19:41:09] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 4 ms to minimize.
[2024-06-01 19:41:09] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 3 ms to minimize.
[2024-06-01 19:41:10] [INFO ] Deduced a trap composed of 21 places in 262 ms of which 4 ms to minimize.
[2024-06-01 19:41:10] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 3 ms to minimize.
[2024-06-01 19:41:10] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 3 ms to minimize.
[2024-06-01 19:41:10] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 3 ms to minimize.
[2024-06-01 19:41:11] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 3 ms to minimize.
[2024-06-01 19:41:11] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 20/539 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:41:12] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 3 ms to minimize.
[2024-06-01 19:41:12] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 4 ms to minimize.
[2024-06-01 19:41:13] [INFO ] Deduced a trap composed of 102 places in 256 ms of which 4 ms to minimize.
[2024-06-01 19:41:13] [INFO ] Deduced a trap composed of 62 places in 260 ms of which 4 ms to minimize.
[2024-06-01 19:41:13] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 3 ms to minimize.
[2024-06-01 19:41:14] [INFO ] Deduced a trap composed of 62 places in 239 ms of which 3 ms to minimize.
[2024-06-01 19:41:14] [INFO ] Deduced a trap composed of 62 places in 205 ms of which 3 ms to minimize.
[2024-06-01 19:41:14] [INFO ] Deduced a trap composed of 43 places in 191 ms of which 3 ms to minimize.
[2024-06-01 19:41:14] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:41:14] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:41:14] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 3 ms to minimize.
[2024-06-01 19:41:15] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:41:15] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:41:15] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 3 ms to minimize.
[2024-06-01 19:41:15] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 3 ms to minimize.
[2024-06-01 19:41:15] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 2 ms to minimize.
[2024-06-01 19:41:15] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:41:16] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 3 ms to minimize.
[2024-06-01 19:41:16] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:41:16] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 20/559 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:41:19] [INFO ] Deduced a trap composed of 88 places in 166 ms of which 3 ms to minimize.
[2024-06-01 19:41:19] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 2 ms to minimize.
[2024-06-01 19:41:19] [INFO ] Deduced a trap composed of 87 places in 179 ms of which 3 ms to minimize.
[2024-06-01 19:41:19] [INFO ] Deduced a trap composed of 112 places in 163 ms of which 2 ms to minimize.
[2024-06-01 19:41:19] [INFO ] Deduced a trap composed of 128 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:41:20] [INFO ] Deduced a trap composed of 36 places in 326 ms of which 5 ms to minimize.
[2024-06-01 19:41:20] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
[2024-06-01 19:41:20] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 4 ms to minimize.
[2024-06-01 19:41:20] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 3 ms to minimize.
[2024-06-01 19:41:21] [INFO ] Deduced a trap composed of 76 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:41:21] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:41:21] [INFO ] Deduced a trap composed of 58 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:41:21] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 3 ms to minimize.
[2024-06-01 19:41:21] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 3 ms to minimize.
[2024-06-01 19:41:22] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:41:22] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 3 ms to minimize.
[2024-06-01 19:41:22] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 3 ms to minimize.
[2024-06-01 19:41:22] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:41:22] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:41:22] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 20/579 constraints. Problems are: Problem set: 0 solved, 685 unsolved
[2024-06-01 19:41:26] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:41:26] [INFO ] Deduced a trap composed of 54 places in 213 ms of which 4 ms to minimize.
[2024-06-01 19:41:26] [INFO ] Deduced a trap composed of 84 places in 179 ms of which 3 ms to minimize.
[2024-06-01 19:41:27] [INFO ] Deduced a trap composed of 84 places in 178 ms of which 3 ms to minimize.
[2024-06-01 19:41:27] [INFO ] Deduced a trap composed of 83 places in 175 ms of which 3 ms to minimize.
[2024-06-01 19:41:27] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 3 ms to minimize.
[2024-06-01 19:41:27] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:41:28] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
SMT process timed out in 60240ms, After SMT, problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60248ms
Finished structural reductions in LTL mode , in 1 iterations and 61671 ms. Remains : 480/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-PT-4-LTLCardinality-02
Product exploration explored 100000 steps with 61 reset in 500 ms.
Stack based approach found an accepted trace after 149 steps with 3 reset with depth 119 and stack size 119 in 2 ms.
FORMULA Peterson-PT-4-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLCardinality-02 finished in 62502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 220 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 19:41:28] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:41:28] [INFO ] Invariant cache hit.
[2024-06-01 19:41:29] [INFO ] Implicit Places using invariants in 366 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 370 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 385 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 458 ms.
Product exploration explored 100000 steps with 50000 reset in 416 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 p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-4-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-4-LTLCardinality-03 finished in 1436 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(p1)||p0)))'
Support contains 125 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 480 transition count 670
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 460 transition count 670
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 40 place count 460 transition count 586
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 208 place count 376 transition count 586
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 240 place count 360 transition count 570
Applied a total of 240 rules in 61 ms. Remains 360 /480 variables (removed 120) and now considering 570/690 (removed 120) transitions.
[2024-06-01 19:41:30] [INFO ] Flow matrix only has 510 transitions (discarded 60 similar events)
// Phase 1: matrix 510 rows 360 cols
[2024-06-01 19:41:30] [INFO ] Computed 19 invariants in 4 ms
[2024-06-01 19:41:30] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-01 19:41:30] [INFO ] Flow matrix only has 510 transitions (discarded 60 similar events)
[2024-06-01 19:41:30] [INFO ] Invariant cache hit.
[2024-06-01 19:41:31] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:41:31] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
[2024-06-01 19:41:31] [INFO ] Redundant transitions in 34 ms returned []
Running 565 sub problems to find dead transitions.
[2024-06-01 19:41:31] [INFO ] Flow matrix only has 510 transitions (discarded 60 similar events)
[2024-06-01 19:41:31] [INFO ] Invariant cache hit.
[2024-06-01 19:41:31] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 355/355 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 4/359 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 3 (OVERLAPS) 5/360 variables, 10/369 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 5/374 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 5/379 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-06-01 19:41:44] [INFO ] Deduced a trap composed of 50 places in 230 ms of which 3 ms to minimize.
[2024-06-01 19:41:44] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 3 ms to minimize.
[2024-06-01 19:41:45] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 3 ms to minimize.
[2024-06-01 19:41:45] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 2 ms to minimize.
[2024-06-01 19:41:45] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:41:45] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 3 ms to minimize.
[2024-06-01 19:41:45] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 3 ms to minimize.
[2024-06-01 19:41:46] [INFO ] Deduced a trap composed of 63 places in 118 ms of which 3 ms to minimize.
[2024-06-01 19:41:46] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 3 ms to minimize.
[2024-06-01 19:41:46] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:41:46] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 2 ms to minimize.
[2024-06-01 19:41:46] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 3 ms to minimize.
[2024-06-01 19:41:46] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:41:46] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 3 ms to minimize.
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 2 ms to minimize.
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 3 ms to minimize.
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 64 places in 148 ms of which 3 ms to minimize.
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 3 ms to minimize.
[2024-06-01 19:41:47] [INFO ] Deduced a trap composed of 68 places in 151 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 20/399 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-06-01 19:41:52] [INFO ] Deduced a trap composed of 42 places in 213 ms of which 3 ms to minimize.
[2024-06-01 19:41:52] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 3 ms to minimize.
[2024-06-01 19:41:52] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 4 ms to minimize.
[2024-06-01 19:41:52] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 4 ms to minimize.
[2024-06-01 19:41:53] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 3 ms to minimize.
[2024-06-01 19:41:53] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:41:53] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:41:53] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:41:53] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 3 ms to minimize.
[2024-06-01 19:41:53] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 3 ms to minimize.
[2024-06-01 19:41:53] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:41:54] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:41:54] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 3 ms to minimize.
[2024-06-01 19:41:54] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:41:54] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:41:54] [INFO ] Deduced a trap composed of 26 places in 183 ms of which 3 ms to minimize.
[2024-06-01 19:41:54] [INFO ] Deduced a trap composed of 39 places in 206 ms of which 3 ms to minimize.
[2024-06-01 19:41:55] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 4 ms to minimize.
[2024-06-01 19:41:55] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 3 ms to minimize.
[2024-06-01 19:41:55] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 20/419 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-06-01 19:41:56] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:41:56] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 3 ms to minimize.
[2024-06-01 19:41:56] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 3 ms to minimize.
[2024-06-01 19:41:56] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 2 ms to minimize.
[2024-06-01 19:41:56] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:41:57] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:41:57] [INFO ] Deduced a trap composed of 42 places in 194 ms of which 3 ms to minimize.
[2024-06-01 19:41:57] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 3 ms to minimize.
[2024-06-01 19:41:57] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:41:57] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 2 ms to minimize.
[2024-06-01 19:41:58] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 3 ms to minimize.
[2024-06-01 19:41:58] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:41:58] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:41:58] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 2 ms to minimize.
[2024-06-01 19:41:58] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:41:58] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 3 ms to minimize.
[2024-06-01 19:41:58] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-06-01 19:41:59] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:41:59] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 3 ms to minimize.
[2024-06-01 19:41:59] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-06-01 19:42:00] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2024-06-01 19:42:00] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:42:01] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:42:01] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:42:01] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:42:01] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:42:01] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:42:01] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 3 ms to minimize.
SMT process timed out in 30258ms, After SMT, problems are : Problem set: 0 solved, 565 unsolved
Search for dead transitions found 0 dead transitions in 30265ms
Starting structural reductions in SI_LTL mode, iteration 1 : 360/480 places, 570/690 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31409 ms. Remains : 360/480 places, 570/690 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Peterson-PT-4-LTLCardinality-05
Product exploration explored 100000 steps with 70 reset in 330 ms.
Product exploration explored 100000 steps with 77 reset in 363 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 1760 steps (0 resets) in 25 ms. (67 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 125 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 570/570 transitions.
Applied a total of 0 rules in 26 ms. Remains 360 /360 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-06-01 19:42:03] [INFO ] Flow matrix only has 510 transitions (discarded 60 similar events)
[2024-06-01 19:42:03] [INFO ] Invariant cache hit.
[2024-06-01 19:42:03] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-06-01 19:42:03] [INFO ] Flow matrix only has 510 transitions (discarded 60 similar events)
[2024-06-01 19:42:03] [INFO ] Invariant cache hit.
[2024-06-01 19:42:03] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:42:04] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
[2024-06-01 19:42:04] [INFO ] Redundant transitions in 6 ms returned []
Running 565 sub problems to find dead transitions.
[2024-06-01 19:42:04] [INFO ] Flow matrix only has 510 transitions (discarded 60 similar events)
[2024-06-01 19:42:04] [INFO ] Invariant cache hit.
[2024-06-01 19:42:04] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 355/355 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 4/359 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 3 (OVERLAPS) 5/360 variables, 10/369 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 5/374 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 5/379 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-06-01 19:42:17] [INFO ] Deduced a trap composed of 50 places in 223 ms of which 4 ms to minimize.
[2024-06-01 19:42:17] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 3 ms to minimize.
[2024-06-01 19:42:17] [INFO ] Deduced a trap composed of 28 places in 197 ms of which 3 ms to minimize.
[2024-06-01 19:42:17] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:42:18] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 3 ms to minimize.
[2024-06-01 19:42:18] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 3 ms to minimize.
[2024-06-01 19:42:18] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 3 ms to minimize.
[2024-06-01 19:42:18] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:42:18] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 3 ms to minimize.
[2024-06-01 19:42:18] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:42:18] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:42:19] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:42:19] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:42:19] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 2 ms to minimize.
[2024-06-01 19:42:19] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 3 ms to minimize.
[2024-06-01 19:42:19] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:42:19] [INFO ] Deduced a trap composed of 76 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:42:20] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:42:20] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 2 ms to minimize.
[2024-06-01 19:42:20] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 20/399 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-06-01 19:42:24] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 3 ms to minimize.
[2024-06-01 19:42:24] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 4 ms to minimize.
[2024-06-01 19:42:25] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:42:25] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 3 ms to minimize.
[2024-06-01 19:42:25] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 3 ms to minimize.
[2024-06-01 19:42:25] [INFO ] Deduced a trap composed of 57 places in 172 ms of which 3 ms to minimize.
[2024-06-01 19:42:25] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 3 ms to minimize.
[2024-06-01 19:42:25] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:42:26] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:42:26] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 2 ms to minimize.
[2024-06-01 19:42:26] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:42:26] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:42:26] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:42:26] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 3 ms to minimize.
[2024-06-01 19:42:26] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:42:27] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 3 ms to minimize.
[2024-06-01 19:42:27] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 3 ms to minimize.
[2024-06-01 19:42:27] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 4 ms to minimize.
[2024-06-01 19:42:27] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 3 ms to minimize.
[2024-06-01 19:42:27] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 20/419 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-06-01 19:42:28] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:42:28] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 2 ms to minimize.
[2024-06-01 19:42:29] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 2 ms to minimize.
[2024-06-01 19:42:29] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 3 ms to minimize.
[2024-06-01 19:42:29] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 3 ms to minimize.
[2024-06-01 19:42:29] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:42:29] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 3 ms to minimize.
[2024-06-01 19:42:29] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 3 ms to minimize.
[2024-06-01 19:42:30] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:42:30] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:42:30] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 3 ms to minimize.
[2024-06-01 19:42:30] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:42:30] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:42:30] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 3 ms to minimize.
[2024-06-01 19:42:30] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 3 ms to minimize.
[2024-06-01 19:42:31] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:42:31] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2024-06-01 19:42:31] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-06-01 19:42:31] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 3 ms to minimize.
[2024-06-01 19:42:31] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-06-01 19:42:33] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 3 ms to minimize.
[2024-06-01 19:42:33] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 3 ms to minimize.
[2024-06-01 19:42:33] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:42:33] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:42:33] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:42:33] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:42:34] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:42:34] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 3 ms to minimize.
[2024-06-01 19:42:34] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 2 ms to minimize.
SMT process timed out in 30192ms, After SMT, problems are : Problem set: 0 solved, 565 unsolved
Search for dead transitions found 0 dead transitions in 30199ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31354 ms. Remains : 360/360 places, 570/570 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 246 steps (0 resets) in 5 ms. (41 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 91 reset in 344 ms.
Product exploration explored 100000 steps with 82 reset in 365 ms.
Support contains 125 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 570/570 transitions.
Applied a total of 0 rules in 18 ms. Remains 360 /360 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-06-01 19:42:35] [INFO ] Flow matrix only has 510 transitions (discarded 60 similar events)
[2024-06-01 19:42:35] [INFO ] Invariant cache hit.
[2024-06-01 19:42:35] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-06-01 19:42:35] [INFO ] Flow matrix only has 510 transitions (discarded 60 similar events)
[2024-06-01 19:42:35] [INFO ] Invariant cache hit.
[2024-06-01 19:42:36] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:42:36] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
[2024-06-01 19:42:36] [INFO ] Redundant transitions in 3 ms returned []
Running 565 sub problems to find dead transitions.
[2024-06-01 19:42:36] [INFO ] Flow matrix only has 510 transitions (discarded 60 similar events)
[2024-06-01 19:42:36] [INFO ] Invariant cache hit.
[2024-06-01 19:42:36] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 355/355 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 4/359 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 3 (OVERLAPS) 5/360 variables, 10/369 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 5/374 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 5/379 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-06-01 19:42:49] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 4 ms to minimize.
[2024-06-01 19:42:50] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 3 ms to minimize.
[2024-06-01 19:42:50] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 3 ms to minimize.
[2024-06-01 19:42:50] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-06-01 19:42:50] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 3 ms to minimize.
[2024-06-01 19:42:50] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 3 ms to minimize.
[2024-06-01 19:42:50] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 3 ms to minimize.
[2024-06-01 19:42:51] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 3 ms to minimize.
[2024-06-01 19:42:51] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:42:51] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 3 ms to minimize.
[2024-06-01 19:42:51] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 2 ms to minimize.
[2024-06-01 19:42:51] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:42:51] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:42:51] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:42:52] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 2 ms to minimize.
[2024-06-01 19:42:52] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 3 ms to minimize.
[2024-06-01 19:42:52] [INFO ] Deduced a trap composed of 76 places in 167 ms of which 2 ms to minimize.
[2024-06-01 19:42:52] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 2 ms to minimize.
[2024-06-01 19:42:52] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:42:52] [INFO ] Deduced a trap composed of 68 places in 149 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 20/399 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-06-01 19:42:57] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 3 ms to minimize.
[2024-06-01 19:42:57] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 3 ms to minimize.
[2024-06-01 19:42:57] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 3 ms to minimize.
[2024-06-01 19:42:57] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 4 ms to minimize.
[2024-06-01 19:42:58] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 4 ms to minimize.
[2024-06-01 19:42:58] [INFO ] Deduced a trap composed of 57 places in 166 ms of which 3 ms to minimize.
[2024-06-01 19:42:58] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:42:58] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:42:58] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:42:58] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 3 ms to minimize.
[2024-06-01 19:42:58] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 3 ms to minimize.
[2024-06-01 19:42:59] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 3 ms to minimize.
[2024-06-01 19:42:59] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 3 ms to minimize.
[2024-06-01 19:42:59] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 3 ms to minimize.
[2024-06-01 19:42:59] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:42:59] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 3 ms to minimize.
[2024-06-01 19:42:59] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 3 ms to minimize.
[2024-06-01 19:43:00] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 4 ms to minimize.
[2024-06-01 19:43:00] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 3 ms to minimize.
[2024-06-01 19:43:00] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 20/419 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-06-01 19:43:01] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:43:01] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 2 ms to minimize.
[2024-06-01 19:43:01] [INFO ] Deduced a trap composed of 29 places in 152 ms of which 3 ms to minimize.
[2024-06-01 19:43:01] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 3 ms to minimize.
[2024-06-01 19:43:02] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 2 ms to minimize.
[2024-06-01 19:43:02] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 4 ms to minimize.
[2024-06-01 19:43:02] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 3 ms to minimize.
[2024-06-01 19:43:02] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 3 ms to minimize.
[2024-06-01 19:43:02] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:43:03] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 2 ms to minimize.
[2024-06-01 19:43:03] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 3 ms to minimize.
[2024-06-01 19:43:03] [INFO ] Deduced a trap composed of 107 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:43:03] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:43:03] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 3 ms to minimize.
[2024-06-01 19:43:03] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 3 ms to minimize.
[2024-06-01 19:43:03] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:43:04] [INFO ] Deduced a trap composed of 83 places in 144 ms of which 3 ms to minimize.
[2024-06-01 19:43:04] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:43:04] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 3 ms to minimize.
[2024-06-01 19:43:04] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 565 unsolved
[2024-06-01 19:43:05] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:43:06] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 3 ms to minimize.
[2024-06-01 19:43:06] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:43:06] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:43:06] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:43:06] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:43:06] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:43:06] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 3 ms to minimize.
SMT process timed out in 30163ms, After SMT, problems are : Problem set: 0 solved, 565 unsolved
Search for dead transitions found 0 dead transitions in 30171ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31252 ms. Remains : 360/360 places, 570/570 transitions.
Treatment of property Peterson-PT-4-LTLCardinality-05 finished in 96689 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 20 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 480 transition count 490
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 400 place count 280 transition count 405
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 570 place count 195 transition count 405
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 610 place count 175 transition count 385
Applied a total of 610 rules in 25 ms. Remains 175 /480 variables (removed 305) and now considering 385/690 (removed 305) transitions.
[2024-06-01 19:43:07] [INFO ] Flow matrix only has 325 transitions (discarded 60 similar events)
// Phase 1: matrix 325 rows 175 cols
[2024-06-01 19:43:07] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 19:43:07] [INFO ] Implicit Places using invariants in 178 ms returned [165, 166, 167, 168, 169]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 181 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/480 places, 385/690 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 170/480 places, 385/690 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-4-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 220 ms.
Product exploration explored 100000 steps with 0 reset in 231 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 120 steps (0 resets) in 8 ms. (13 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 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 385/385 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 385/385 (removed 0) transitions.
[2024-06-01 19:43:08] [INFO ] Flow matrix only has 325 transitions (discarded 60 similar events)
// Phase 1: matrix 325 rows 170 cols
[2024-06-01 19:43:08] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 19:43:08] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 19:43:08] [INFO ] Flow matrix only has 325 transitions (discarded 60 similar events)
[2024-06-01 19:43:08] [INFO ] Invariant cache hit.
[2024-06-01 19:43:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:43:08] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2024-06-01 19:43:08] [INFO ] Redundant transitions in 15 ms returned []
Running 380 sub problems to find dead transitions.
[2024-06-01 19:43:08] [INFO ] Flow matrix only has 325 transitions (discarded 60 similar events)
[2024-06-01 19:43:08] [INFO ] Invariant cache hit.
[2024-06-01 19:43:08] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 14/184 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:43:10] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:43:10] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:43:11] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:43:11] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:43:11] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:43:11] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:43:11] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:43:11] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:43:11] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:43:11] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:43:11] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:43:11] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:43:11] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:43:12] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:43:12] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:43:12] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:43:12] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:43:12] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:43:12] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:43:12] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:43:12] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:43:12] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-06-01 19:43:12] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:43:12] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:43:13] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:43:13] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:43:13] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:43:13] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:43:13] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:43:13] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-06-01 19:43:13] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:43:13] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:43:13] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:43:13] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:43:13] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:43:14] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:43:14] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:43:14] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:43:14] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:43:14] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:43:16] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:43:16] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:43:16] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:43:16] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:43:16] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:43:16] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:43:17] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:43:17] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:43:17] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:43:17] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:43:17] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:43:17] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:43:17] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:43:17] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2024-06-01 19:43:18] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 2 ms to minimize.
[2024-06-01 19:43:18] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:43:18] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:43:18] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-06-01 19:43:18] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:43:18] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:43:19] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:43:19] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:43:19] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:43:19] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:43:20] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:43:20] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:43:20] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:43:20] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:43:20] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:43:20] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
[2024-06-01 19:43:20] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:43:20] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:43:20] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:43:20] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 2 ms to minimize.
[2024-06-01 19:43:20] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 2 ms to minimize.
[2024-06-01 19:43:20] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:43:20] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 2 ms to minimize.
[2024-06-01 19:43:21] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 2 ms to minimize.
[2024-06-01 19:43:21] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:43:21] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:43:22] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:43:23] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:43:23] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:43:23] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:43:23] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
[2024-06-01 19:43:24] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:43:24] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:43:24] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:43:24] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:43:24] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:43:24] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:43:24] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:43:24] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2024-06-01 19:43:24] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-06-01 19:43:25] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:43:25] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:43:25] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:43:25] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:43:25] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:43:25] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:43:28] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:43:29] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:43:29] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:43:29] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:43:29] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:43:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:43:29] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:43:30] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:43:30] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:43:31] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:43:31] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:43:31] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:43:31] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:43:31] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:43:32] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:43:32] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:43:32] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-06-01 19:43:32] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:43:32] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-06-01 19:43:32] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:43:36] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:43:36] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:43:36] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:43:36] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:43:37] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 5/309 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/495 variables, and 309 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30021 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 125/125 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 14/184 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 125/309 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:43:43] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:43:43] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 2 ms to minimize.
[2024-06-01 19:43:43] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:43:44] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:43:44] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:43:47] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:43:52] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:43:52] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:43:53] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:43:54] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:43:57] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:44:01] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:44:02] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:44:02] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:44:04] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:44:06] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:44:07] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/495 variables, and 326 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30015 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/380 constraints, Known Traps: 142/142 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60770 ms. Remains : 170/170 places, 385/385 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 120 steps (0 resets) in 4 ms. (24 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 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 213 ms.
Product exploration explored 100000 steps with 0 reset in 237 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 385/385 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 385/385 (removed 0) transitions.
[2024-06-01 19:44:09] [INFO ] Flow matrix only has 325 transitions (discarded 60 similar events)
[2024-06-01 19:44:09] [INFO ] Invariant cache hit.
[2024-06-01 19:44:10] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-01 19:44:10] [INFO ] Flow matrix only has 325 transitions (discarded 60 similar events)
[2024-06-01 19:44:10] [INFO ] Invariant cache hit.
[2024-06-01 19:44:10] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:44:10] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2024-06-01 19:44:10] [INFO ] Redundant transitions in 7 ms returned []
Running 380 sub problems to find dead transitions.
[2024-06-01 19:44:10] [INFO ] Flow matrix only has 325 transitions (discarded 60 similar events)
[2024-06-01 19:44:10] [INFO ] Invariant cache hit.
[2024-06-01 19:44:10] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 14/184 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:44:12] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 19:44:12] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:44:12] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:44:12] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:44:13] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:44:13] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:44:13] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:44:13] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:44:13] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:44:13] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-06-01 19:44:13] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:44:13] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:44:13] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:44:13] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:44:13] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:44:13] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:44:14] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:44:14] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:44:14] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:44:14] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 20/204 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:44:14] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:44:14] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:44:14] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:44:14] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:44:14] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:44:15] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:44:15] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:44:15] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:44:15] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:44:15] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:44:15] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:44:15] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:44:15] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:44:15] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:44:15] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-06-01 19:44:15] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:44:15] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-06-01 19:44:16] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:44:16] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:44:16] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:44:18] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:44:18] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:44:18] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:44:18] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:44:18] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:44:18] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:44:18] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:44:18] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-06-01 19:44:19] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:44:19] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:44:19] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:44:19] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:44:19] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:44:19] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2024-06-01 19:44:19] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:44:19] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:44:20] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:44:20] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-06-01 19:44:20] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:44:20] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:44:20] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:44:21] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-06-01 19:44:21] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:44:21] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:44:21] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:44:21] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:44:21] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:44:21] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:44:22] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-06-01 19:44:22] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:44:22] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:44:22] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:44:22] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:44:22] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 2 ms to minimize.
[2024-06-01 19:44:22] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:44:22] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:44:22] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:44:22] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 2 ms to minimize.
[2024-06-01 19:44:22] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-06-01 19:44:22] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:44:24] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:44:24] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:44:25] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:44:25] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:44:25] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:44:25] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:44:25] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:44:25] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:44:25] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:44:26] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:44:26] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-06-01 19:44:26] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:44:26] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
[2024-06-01 19:44:26] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:44:26] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:44:26] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:44:26] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:44:26] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:44:26] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:44:27] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:44:30] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-06-01 19:44:30] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:44:30] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:44:31] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:44:31] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:44:31] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:44:31] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:44:31] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:44:32] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-06-01 19:44:32] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:44:33] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:44:33] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:44:33] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:44:33] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:44:33] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:44:33] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:44:33] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:44:34] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:44:34] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:44:34] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:44:37] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:44:37] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:44:37] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:44:38] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:44:38] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 5/309 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 170/495 variables, and 309 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30016 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 125/125 constraints]
Escalating to Integer solving :Problem set: 0 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 170/170 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 14/184 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 125/309 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:44:45] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:44:45] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:44:45] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:44:45] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:44:45] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:44:49] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:44:54] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-06-01 19:44:54] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:44:54] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:44:56] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:44:59] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:45:03] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2024-06-01 19:45:04] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-06-01 19:45:04] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-06-01 19:45:06] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:45:08] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:45:09] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 170/495 variables, and 326 constraints, problems are : Problem set: 0 solved, 380 unsolved in 30017 ms.
Refiners :[Domain max(s): 170/170 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/170 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/380 constraints, Known Traps: 142/142 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60816 ms. Remains : 170/170 places, 385/385 transitions.
Treatment of property Peterson-PT-4-LTLCardinality-06 finished in 123614 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((G(F(p1))||G(p2)))))))'
Support contains 205 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 19:45:10] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-06-01 19:45:10] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 19:45:10] [INFO ] Implicit Places using invariants in 253 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 255 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 4 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 263 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-4-LTLCardinality-07
Product exploration explored 100000 steps with 33333 reset in 232 ms.
Product exploration explored 100000 steps with 33333 reset in 244 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-4-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-4-LTLCardinality-07 finished in 1016 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((X(p2)||p1))))))'
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 19:45:11] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:45:11] [INFO ] Invariant cache hit.
[2024-06-01 19:45:12] [INFO ] Implicit Places using invariants in 305 ms returned [467, 468, 469, 470, 471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 306 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 475/480 places, 690/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 475 /475 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 318 ms. Remains : 475/480 places, 690/690 transitions.
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-PT-4-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 241 ms.
Product exploration explored 100000 steps with 33333 reset in 325 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p0), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 100 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-4-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-4-LTLCardinality-10 finished in 1359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(!p0&&F(G(!p1)))))))'
Support contains 4 out of 480 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 480 transition count 491
Reduce places removed 199 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 200 rules applied. Total rules applied 399 place count 281 transition count 490
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 400 place count 280 transition count 490
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 400 place count 280 transition count 393
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 594 place count 183 transition count 393
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 632 place count 164 transition count 374
Applied a total of 632 rules in 24 ms. Remains 164 /480 variables (removed 316) and now considering 374/690 (removed 316) transitions.
[2024-06-01 19:45:13] [INFO ] Flow matrix only has 314 transitions (discarded 60 similar events)
// Phase 1: matrix 314 rows 164 cols
[2024-06-01 19:45:13] [INFO ] Computed 19 invariants in 1 ms
[2024-06-01 19:45:13] [INFO ] Implicit Places using invariants in 267 ms returned [154, 155, 156, 157, 158]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 268 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/480 places, 374/690 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 299 ms. Remains : 159/480 places, 374/690 transitions.
Stuttering acceptance computed with spot in 113 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : Peterson-PT-4-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 230 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA Peterson-PT-4-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-4-LTLCardinality-12 finished in 660 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(p1)||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)))'
[2024-06-01 19:45:14] [INFO ] Flatten gal took : 47 ms
[2024-06-01 19:45:14] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-01 19:45:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 690 transitions and 2120 arcs took 11 ms.
Total runtime 428188 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Peterson-PT-4-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Peterson-PT-4-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717271777596

--------------------
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
mcc2024
ltl formula name Peterson-PT-4-LTLCardinality-05
ltl formula formula --ltl=/tmp/3459/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 480 places, 690 transitions and 2120 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.020 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3459/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3459/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3459/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3459/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 482 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 481, there are 693 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~266!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 19
pnml2lts-mc( 0/ 4): unique states count: 1060
pnml2lts-mc( 0/ 4): unique transitions count: 5210
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 479
pnml2lts-mc( 0/ 4): - claim success count: 1065
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1046
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1065 states 5239 transitions, fanout: 4.919
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 17750, Transitions per second: 87317
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 22.9 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 702 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name Peterson-PT-4-LTLCardinality-06
ltl formula formula --ltl=/tmp/3459/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 480 places, 690 transitions and 2120 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3459/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3459/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3459/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3459/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 481 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 481, there are 694 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2496 levels ~10000 states ~50004 transitions
pnml2lts-mc( 1/ 4): ~4978 levels ~20000 states ~100004 transitions
pnml2lts-mc( 1/ 4): ~9888 levels ~40000 states ~200004 transitions
pnml2lts-mc( 1/ 4): ~19440 levels ~80000 states ~400004 transitions
pnml2lts-mc( 0/ 4): ~20899 levels ~160000 states ~800004 transitions
pnml2lts-mc( 1/ 4): ~26131 levels ~320000 states ~1600004 transitions
pnml2lts-mc( 1/ 4): ~29006 levels ~640000 states ~3200004 transitions
pnml2lts-mc( 1/ 4): ~29006 levels ~1280000 states ~6400004 transitions
pnml2lts-mc( 1/ 4): ~29006 levels ~2560000 states ~12800004 transitions
pnml2lts-mc( 1/ 4): ~29006 levels ~5120000 states ~25600004 transitions
pnml2lts-mc( 1/ 4): ~29006 levels ~10240000 states ~51200004 transitions
pnml2lts-mc( 2/ 4): ~29301 levels ~20480000 states ~102400004 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2056127
pnml2lts-mc( 0/ 4): unique states count: 33552996
pnml2lts-mc( 0/ 4): unique transitions count: 167764980
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 82835693
pnml2lts-mc( 0/ 4): - claim found count: 51474604
pnml2lts-mc( 0/ 4): - claim success count: 33599066
pnml2lts-mc( 0/ 4): - cum. max stack depth: 116005
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33617137 states 168085687 transitions, fanout: 5.000
pnml2lts-mc( 0/ 4): Total exploration time 662.220 sec (662.190 sec minimum, 662.202 sec on average)
pnml2lts-mc( 0/ 4): States per second: 50764, Transitions per second: 253822
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 297.4MB, 9.3 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/64.0%
pnml2lts-mc( 0/ 4): Stored 702 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 297.4MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Peterson-PT-4, 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 r512-smll-171654407300267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;