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-171654407300265.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407300265
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME Peterson-PT-4-CTLCardinality-2024-01
FORMULA_NAME Peterson-PT-4-CTLCardinality-2024-02
FORMULA_NAME Peterson-PT-4-CTLCardinality-2024-03
FORMULA_NAME Peterson-PT-4-CTLCardinality-2024-04
FORMULA_NAME Peterson-PT-4-CTLCardinality-2024-05
FORMULA_NAME Peterson-PT-4-CTLCardinality-2024-06
FORMULA_NAME Peterson-PT-4-CTLCardinality-2024-07
FORMULA_NAME Peterson-PT-4-CTLCardinality-2024-08
FORMULA_NAME Peterson-PT-4-CTLCardinality-2024-09
FORMULA_NAME Peterson-PT-4-CTLCardinality-2024-10
FORMULA_NAME Peterson-PT-4-CTLCardinality-2024-11
FORMULA_NAME Peterson-PT-4-CTLCardinality-2024-12
FORMULA_NAME Peterson-PT-4-CTLCardinality-2024-13
FORMULA_NAME Peterson-PT-4-CTLCardinality-2024-14
FORMULA_NAME Peterson-PT-4-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717270336361

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
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:32:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:32:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:32:18] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2024-06-01 19:32:18] [INFO ] Transformed 480 places.
[2024-06-01 19:32:18] [INFO ] Transformed 690 transitions.
[2024-06-01 19:32:18] [INFO ] Found NUPN structural information;
[2024-06-01 19:32:18] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 541 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 38 ms.
FORMULA Peterson-PT-4-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 453 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 24 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
[2024-06-01 19:32:18] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-06-01 19:32:18] [INFO ] Computed 19 invariants in 34 ms
[2024-06-01 19:32:19] [INFO ] Implicit Places using invariants in 717 ms returned []
[2024-06-01 19:32:19] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:32:19] [INFO ] Invariant cache hit.
[2024-06-01 19:32:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:32:20] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1500 ms to find 0 implicit places.
Running 685 sub problems to find dead transitions.
[2024-06-01 19:32:20] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:32:20] [INFO ] Invariant cache hit.
[2024-06-01 19:32:20] [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:32:40] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 39 ms to minimize.
[2024-06-01 19:32:41] [INFO ] Deduced a trap composed of 35 places in 259 ms of which 5 ms to minimize.
[2024-06-01 19:32:41] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 5 ms to minimize.
[2024-06-01 19:32:41] [INFO ] Deduced a trap composed of 36 places in 236 ms of which 4 ms to minimize.
[2024-06-01 19:32:41] [INFO ] Deduced a trap composed of 36 places in 206 ms of which 4 ms to minimize.
[2024-06-01 19:32:42] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 4 ms to minimize.
[2024-06-01 19:32:42] [INFO ] Deduced a trap composed of 54 places in 278 ms of which 4 ms to minimize.
[2024-06-01 19:32:42] [INFO ] Deduced a trap composed of 32 places in 286 ms of which 5 ms to minimize.
[2024-06-01 19:32:42] [INFO ] Deduced a trap composed of 58 places in 203 ms of which 4 ms to minimize.
[2024-06-01 19:32:43] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 4 ms to minimize.
[2024-06-01 19:32:43] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 4 ms to minimize.
[2024-06-01 19:32:43] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 4 ms to minimize.
[2024-06-01 19:32:43] [INFO ] Deduced a trap composed of 18 places in 237 ms of which 5 ms to minimize.
[2024-06-01 19:32:44] [INFO ] Deduced a trap composed of 10 places in 294 ms of which 5 ms to minimize.
[2024-06-01 19:32:44] [INFO ] Deduced a trap composed of 54 places in 226 ms of which 4 ms to minimize.
[2024-06-01 19:32:44] [INFO ] Deduced a trap composed of 60 places in 148 ms of which 3 ms to minimize.
[2024-06-01 19:32:44] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:32:45] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 4 ms to minimize.
[2024-06-01 19:32:45] [INFO ] Deduced a trap composed of 40 places in 268 ms of which 4 ms to minimize.
[2024-06-01 19:32:45] [INFO ] Deduced a trap composed of 18 places in 260 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 30054 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:32:59] [INFO ] Deduced a trap composed of 14 places in 253 ms of which 4 ms to minimize.
[2024-06-01 19:33:00] [INFO ] Deduced a trap composed of 57 places in 222 ms of which 5 ms to minimize.
[2024-06-01 19:33:00] [INFO ] Deduced a trap composed of 86 places in 223 ms of which 3 ms to minimize.
[2024-06-01 19:33:00] [INFO ] Deduced a trap composed of 83 places in 215 ms of which 4 ms to minimize.
[2024-06-01 19:33:00] [INFO ] Deduced a trap composed of 84 places in 205 ms of which 3 ms to minimize.
[2024-06-01 19:33:01] [INFO ] Deduced a trap composed of 65 places in 237 ms of which 4 ms to minimize.
[2024-06-01 19:33:01] [INFO ] Deduced a trap composed of 62 places in 193 ms of which 3 ms to minimize.
[2024-06-01 19:33:01] [INFO ] Deduced a trap composed of 62 places in 210 ms of which 3 ms to minimize.
[2024-06-01 19:33:01] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:33:01] [INFO ] Deduced a trap composed of 39 places in 234 ms of which 4 ms to minimize.
[2024-06-01 19:33:02] [INFO ] Deduced a trap composed of 61 places in 185 ms of which 3 ms to minimize.
[2024-06-01 19:33:02] [INFO ] Deduced a trap composed of 61 places in 177 ms of which 4 ms to minimize.
[2024-06-01 19:33:02] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 3 ms to minimize.
[2024-06-01 19:33:02] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 4 ms to minimize.
[2024-06-01 19:33:03] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 6 ms to minimize.
[2024-06-01 19:33:03] [INFO ] Deduced a trap composed of 40 places in 261 ms of which 3 ms to minimize.
[2024-06-01 19:33:03] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 3 ms to minimize.
[2024-06-01 19:33:03] [INFO ] Deduced a trap composed of 65 places in 231 ms of which 4 ms to minimize.
[2024-06-01 19:33:04] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 3 ms to minimize.
[2024-06-01 19:33:04] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 5 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:33:05] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 7 ms to minimize.
[2024-06-01 19:33:05] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 4 ms to minimize.
[2024-06-01 19:33:06] [INFO ] Deduced a trap composed of 102 places in 221 ms of which 5 ms to minimize.
[2024-06-01 19:33:06] [INFO ] Deduced a trap composed of 62 places in 250 ms of which 4 ms to minimize.
[2024-06-01 19:33:06] [INFO ] Deduced a trap composed of 48 places in 207 ms of which 3 ms to minimize.
[2024-06-01 19:33:06] [INFO ] Deduced a trap composed of 62 places in 251 ms of which 4 ms to minimize.
[2024-06-01 19:33:07] [INFO ] Deduced a trap composed of 62 places in 226 ms of which 4 ms to minimize.
[2024-06-01 19:33:07] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 3 ms to minimize.
[2024-06-01 19:33:07] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-06-01 19:33:07] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:33:07] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 3 ms to minimize.
[2024-06-01 19:33:07] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:33:07] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:33:08] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 3 ms to minimize.
[2024-06-01 19:33:08] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-06-01 19:33:08] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 5 ms to minimize.
[2024-06-01 19:33:08] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 3 ms to minimize.
[2024-06-01 19:33:08] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 3 ms to minimize.
[2024-06-01 19:33:09] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 3 ms to minimize.
[2024-06-01 19:33:09] [INFO ] Deduced a trap composed of 50 places in 130 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:33:11] [INFO ] Deduced a trap composed of 88 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:33:11] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 2 ms to minimize.
[2024-06-01 19:33:12] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 3 ms to minimize.
[2024-06-01 19:33:12] [INFO ] Deduced a trap composed of 112 places in 146 ms of which 3 ms to minimize.
[2024-06-01 19:33:12] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 3 ms to minimize.
[2024-06-01 19:33:12] [INFO ] Deduced a trap composed of 36 places in 295 ms of which 4 ms to minimize.
[2024-06-01 19:33:13] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:33:13] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 3 ms to minimize.
[2024-06-01 19:33:13] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 3 ms to minimize.
[2024-06-01 19:33:13] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 3 ms to minimize.
[2024-06-01 19:33:13] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:33:13] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 3 ms to minimize.
[2024-06-01 19:33:14] [INFO ] Deduced a trap composed of 76 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:33:14] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 3 ms to minimize.
[2024-06-01 19:33:14] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 3 ms to minimize.
[2024-06-01 19:33:14] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:33:15] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 3 ms to minimize.
[2024-06-01 19:33:15] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:33:15] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:33:15] [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:33:18] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 3 ms to minimize.
[2024-06-01 19:33:19] [INFO ] Deduced a trap composed of 54 places in 209 ms of which 3 ms to minimize.
[2024-06-01 19:33:19] [INFO ] Deduced a trap composed of 84 places in 201 ms of which 3 ms to minimize.
[2024-06-01 19:33:19] [INFO ] Deduced a trap composed of 84 places in 173 ms of which 3 ms to minimize.
[2024-06-01 19:33:19] [INFO ] Deduced a trap composed of 83 places in 178 ms of which 4 ms to minimize.
[2024-06-01 19:33:20] [INFO ] Deduced a trap composed of 119 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:33:20] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:33:20] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/1110 variables, and 587 constraints, problems are : Problem set: 0 solved, 685 unsolved in 30020 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: 0/685 constraints, Known Traps: 88/88 constraints]
After SMT, in 60424ms problems are : Problem set: 0 solved, 685 unsolved
Search for dead transitions found 0 dead transitions in 60462ms
Finished structural reductions in LTL mode , in 1 iterations and 62032 ms. Remains : 480/480 places, 690/690 transitions.
Support contains 453 out of 480 places after structural reductions.
[2024-06-01 19:33:21] [INFO ] Flatten gal took : 105 ms
[2024-06-01 19:33:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Peterson-PT-4-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 19:33:21] [INFO ] Flatten gal took : 55 ms
[2024-06-01 19:33:21] [INFO ] Input system was already deterministic with 690 transitions.
RANDOM walk for 40000 steps (8 resets) in 2968 ms. (13 steps per ms) remains 37/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 31/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 30/30 properties
[2024-06-01 19:33:22] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-06-01 19:33:22] [INFO ] Invariant cache hit.
[2024-06-01 19:33:22] [INFO ] State equation strengthened by 116 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 450/450 constraints. Problems are: Problem set: 18 solved, 12 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/450 variables, 5/455 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/455 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/455 variables, 5/460 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 5/465 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 0/465 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/460 variables, 5/470 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 5/475 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/475 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 630/1090 variables, 460/935 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 116/1051 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1090 variables, 0/1051 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 20/1110 variables, 20/1071 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1110 variables, 20/1091 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1110 variables, 4/1095 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1110 variables, 0/1095 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1110 variables, 0/1095 constraints. Problems are: Problem set: 28 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 1095 constraints, problems are : Problem set: 28 solved, 2 unsolved in 839 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: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 28 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 266/271 variables, 4/9 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 266/275 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/275 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/273 variables, 2/277 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 2/279 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/279 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/276 variables, 3/282 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 3/285 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/285 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 378/654 variables, 276/561 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/654 variables, 48/609 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/654 variables, 1/610 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/654 variables, 0/610 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 52/706 variables, 20/630 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/706 variables, 20/650 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/706 variables, 4/654 constraints. Problems are: Problem set: 28 solved, 2 unsolved
[2024-06-01 19:33:24] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:33:24] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:33:24] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/706 variables, 3/657 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/706 variables, 0/657 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 80/786 variables, 16/673 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/786 variables, 16/689 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/786 variables, 68/757 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/786 variables, 0/757 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 164/950 variables, 2/759 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/950 variables, 164/923 constraints. Problems are: Problem set: 28 solved, 2 unsolved
[2024-06-01 19:33:25] [INFO ] Deduced a trap composed of 17 places in 215 ms of which 4 ms to minimize.
[2024-06-01 19:33:25] [INFO ] Deduced a trap composed of 61 places in 167 ms of which 3 ms to minimize.
[2024-06-01 19:33:25] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-06-01 19:33:25] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 3 ms to minimize.
[2024-06-01 19:33:25] [INFO ] Deduced a trap composed of 62 places in 144 ms of which 3 ms to minimize.
[2024-06-01 19:33:26] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 3 ms to minimize.
[2024-06-01 19:33:26] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:33:26] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2024-06-01 19:33:26] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:33:26] [INFO ] Deduced a trap composed of 71 places in 325 ms of which 4 ms to minimize.
[2024-06-01 19:33:27] [INFO ] Deduced a trap composed of 18 places in 318 ms of which 5 ms to minimize.
[2024-06-01 19:33:27] [INFO ] Deduced a trap composed of 84 places in 262 ms of which 4 ms to minimize.
[2024-06-01 19:33:27] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 3 ms to minimize.
[2024-06-01 19:33:27] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 3 ms to minimize.
[2024-06-01 19:33:28] [INFO ] Deduced a trap composed of 84 places in 162 ms of which 3 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/950 variables, 15/938 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/950 variables, 0/938 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 2/952 variables, 2/940 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/952 variables, 2/942 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/952 variables, 0/942 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 2/954 variables, 2/944 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/954 variables, 2/946 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/954 variables, 1/947 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/954 variables, 0/947 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 156/1110 variables, 168/1115 constraints. Problems are: Problem set: 28 solved, 2 unsolved
[2024-06-01 19:33:28] [INFO ] Deduced a trap composed of 127 places in 173 ms of which 4 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/1110 variables, 1/1116 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1110 variables, 0/1116 constraints. Problems are: Problem set: 28 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 0/1110 variables, 0/1116 constraints. Problems are: Problem set: 28 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1110/1110 variables, and 1116 constraints, problems are : Problem set: 28 solved, 2 unsolved in 4984 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: 2/30 constraints, Known Traps: 19/19 constraints]
After SMT, in 6073ms problems are : Problem set: 28 solved, 2 unsolved
Parikh walk visited 0 properties in 617 ms.
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 195 transitions
Trivial Post-agglo rules discarded 195 transitions
Performed 195 trivial Post agglomeration. Transition count delta: 195
Iterating post reduction 0 with 195 rules applied. Total rules applied 195 place count 480 transition count 495
Reduce places removed 195 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 198 rules applied. Total rules applied 393 place count 285 transition count 492
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 396 place count 282 transition count 492
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 396 place count 282 transition count 395
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 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 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 630 place count 165 transition count 375
Applied a total of 630 rules in 95 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 96 ms. Remains : 165/480 places, 375/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 477 ms. (83 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 740082 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 2
Probabilistic random walk after 740082 steps, saw 123767 distinct states, run finished after 3007 ms. (steps per millisecond=246 ) properties seen :0
[2024-06-01 19:33:32] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 165 cols
[2024-06-01 19:33:32] [INFO ] Computed 19 invariants in 3 ms
[2024-06-01 19:33:33] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 79/84 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 79/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/86 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/89 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 191/280 variables, 89/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 48/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 52/332 variables, 20/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/332 variables, 20/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/332 variables, 4/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 80/412 variables, 16/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/412 variables, 16/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/412 variables, 68/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/412 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 36/448 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/448 variables, 36/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/448 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/450 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/450 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/450 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 2/452 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/452 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/452 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 28/480 variables, 40/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/480 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/480 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 465 constraints, problems are : Problem set: 0 solved, 2 unsolved in 365 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: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 79/84 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 79/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/86 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/89 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 191/280 variables, 89/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/280 variables, 48/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 52/332 variables, 20/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/332 variables, 20/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/332 variables, 4/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:33:33] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-06-01 19:33:33] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 2 ms to minimize.
[2024-06-01 19:33:33] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:33:33] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/332 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/332 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 80/412 variables, 16/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/412 variables, 16/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/412 variables, 68/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:33:33] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/412 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/412 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 36/448 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/448 variables, 36/423 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:33:34] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:33:34] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-06-01 19:33:34] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:33:34] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:33:34] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2024-06-01 19:33:34] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:33:34] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:33:34] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:33:34] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:33:34] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:33:34] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-06-01 19:33:34] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/448 variables, 12/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/448 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 2/450 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/450 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/450 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 2/452 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/452 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/452 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/452 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 28/480 variables, 40/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:33:35] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-06-01 19:33:35] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:33:35] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:33:35] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:33:35] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/480 variables, 5/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/480 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 0/480 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 480/480 variables, and 489 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2127 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: 2/2 constraints, Known Traps: 22/22 constraints]
After SMT, in 2505ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 207 ms.
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 375/375 transitions.
Applied a total of 0 rules in 22 ms. Remains 165 /165 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 165/165 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 375/375 transitions.
Applied a total of 0 rules in 13 ms. Remains 165 /165 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-06-01 19:33:35] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-06-01 19:33:35] [INFO ] Invariant cache hit.
[2024-06-01 19:33:35] [INFO ] Implicit Places using invariants in 246 ms returned [156, 157, 158, 159]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 249 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 161/165 places, 375/375 transitions.
Applied a total of 0 rules in 13 ms. Remains 161 /161 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 275 ms. Remains : 161/165 places, 375/375 transitions.
RANDOM walk for 40000 steps (8 resets) in 232 ms. (171 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 799074 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 2
Probabilistic random walk after 799074 steps, saw 133627 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2024-06-01 19:33:39] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
// Phase 1: matrix 315 rows 161 cols
[2024-06-01 19:33:39] [INFO ] Computed 15 invariants in 8 ms
[2024-06-01 19:33:39] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 79/84 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 79/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/86 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/87 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 191/278 variables, 87/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 48/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/278 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 52/330 variables, 20/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 20/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/330 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 80/410 variables, 16/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/410 variables, 16/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/410 variables, 68/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/410 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 36/446 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/446 variables, 36/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/446 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/448 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/448 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/448 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 28/476 variables, 38/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/476 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/476 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 453 constraints, problems are : Problem set: 0 solved, 2 unsolved in 318 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 79/84 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 79/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/86 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/87 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 191/278 variables, 87/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 48/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/278 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/278 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 52/330 variables, 20/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/330 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:33:39] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 2 ms to minimize.
[2024-06-01 19:33:39] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:33:39] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/330 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/330 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 80/410 variables, 16/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/410 variables, 16/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/410 variables, 68/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:33:40] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/410 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/410 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 36/446 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/446 variables, 36/416 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/446 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:33:40] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:33:40] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:33:40] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:33:40] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-06-01 19:33:40] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:33:40] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:33:40] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-06-01 19:33:40] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:33:41] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:33:41] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 3 ms to minimize.
[2024-06-01 19:33:41] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:33:41] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-06-01 19:33:41] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:33:41] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:33:41] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/446 variables, 15/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/446 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 2/448 variables, 2/434 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/448 variables, 2/436 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/448 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 28/476 variables, 38/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/476 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 0/476 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 474 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2057 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 19/19 constraints]
After SMT, in 2391ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 179 ms.
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 375/375 transitions.
Applied a total of 0 rules in 13 ms. Remains 161 /161 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 161/161 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 375/375 transitions.
Applied a total of 0 rules in 10 ms. Remains 161 /161 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-06-01 19:33:41] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-06-01 19:33:41] [INFO ] Invariant cache hit.
[2024-06-01 19:33:41] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-01 19:33:41] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-06-01 19:33:41] [INFO ] Invariant cache hit.
[2024-06-01 19:33:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-06-01 19:33:42] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2024-06-01 19:33:42] [INFO ] Redundant transitions in 25 ms returned []
Running 370 sub problems to find dead transitions.
[2024-06-01 19:33:42] [INFO ] Flow matrix only has 315 transitions (discarded 60 similar events)
[2024-06-01 19:33:42] [INFO ] Invariant cache hit.
[2024-06-01 19:33:42] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-01 19:33:44] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-06-01 19:33:44] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-06-01 19:33:44] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:33:44] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:33:44] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2024-06-01 19:33:44] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-06-01 19:33:44] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:33:44] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:33:45] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:33:45] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:33:45] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:33:45] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:33:45] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:33:45] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:33:45] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:33:45] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:33:45] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:33:45] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:33:45] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:33:45] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-01 19:33:46] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:33:46] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:33:46] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:33:46] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:33:46] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:33:46] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:33:46] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:33:46] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:33:46] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:33:46] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:33:47] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:33:47] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:33:47] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-06-01 19:33:47] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:33:47] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:33:47] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:33:47] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:33:47] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:33:47] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
[2024-06-01 19:33:48] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-01 19:33:49] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:33:49] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:33:49] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:33:49] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:33:50] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:33:50] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:33:50] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:33:50] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:33:50] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:33:51] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:33:51] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:33:51] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:33:51] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:33:51] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:33:51] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:33:51] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:33:51] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-06-01 19:33:52] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:33:52] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:33:52] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 20/232 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-01 19:33:53] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:33:53] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:33:54] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:33:54] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-06-01 19:33:54] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:33:54] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:33:54] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 7/239 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-01 19:33:55] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-06-01 19:33:55] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:33:56] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:33:56] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-01 19:33:58] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:33:59] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:33:59] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:33:59] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:34:00] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 5/248 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-01 19:34:01] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-01 19:34:03] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 11 (OVERLAPS) 1/161 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-01 19:34:09] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:34:09] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:34:09] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:34:09] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:34:09] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:34:10] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 3 ms to minimize.
[2024-06-01 19:34:10] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:34:10] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:34:10] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:34:10] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:34:10] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-06-01 19:34:10] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:34:10] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:34:10] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:34:10] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:34:11] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:34:11] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:34:11] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
[2024-06-01 19:34:11] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:34:11] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
[2024-06-01 19:34:12] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-06-01 19:34:12] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:34:12] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 3 ms to minimize.
SMT process timed out in 30185ms, After SMT, problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 30191ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30922 ms. Remains : 161/161 places, 375/375 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 276 edges and 161 vertex of which 92 / 161 are part of one of the 20 SCC in 9 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 221 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 154
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 17 Pre rules applied. Total rules applied 2 place count 88 transition count 137
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 1 with 34 rules applied. Total rules applied 36 place count 71 transition count 137
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 48 place count 65 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 65 transition count 128
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 65 place count 55 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 29 edges and 55 vertex of which 21 / 55 are part of one of the 4 SCC in 0 ms
Free SCC test removed 17 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 38 transition count 132
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (trivial) has 40 edges and 36 vertex of which 8 / 36 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 25 rules applied. Total rules applied 93 place count 32 transition count 110
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 127 place count 32 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 133 place count 32 transition count 70
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 134 place count 32 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 135 place count 31 transition count 69
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 137 place count 31 transition count 69
Applied a total of 137 rules in 55 ms. Remains 31 /161 variables (removed 130) and now considering 69/375 (removed 306) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 69 rows 31 cols
[2024-06-01 19:34:12] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 19:34:12] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-01 19:34:12] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 19:34:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-01 19:34:12] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 19:34:12] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 19:34:12] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 227 ms.
Successfully simplified 28 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-PT-4-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 19:34:12] [INFO ] Flatten gal took : 42 ms
[2024-06-01 19:34:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Peterson-PT-4-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 19:34:13] [INFO ] Flatten gal took : 41 ms
[2024-06-01 19:34:13] [INFO ] Input system was already deterministic with 690 transitions.
Support contains 260 out of 480 places (down from 278) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
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.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 480/480 places, 690/690 transitions.
[2024-06-01 19:34:13] [INFO ] Flatten gal took : 35 ms
[2024-06-01 19:34:13] [INFO ] Flatten gal took : 37 ms
[2024-06-01 19:34:13] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 480/480 places, 690/690 transitions.
[2024-06-01 19:34:13] [INFO ] Flatten gal took : 29 ms
[2024-06-01 19:34:13] [INFO ] Flatten gal took : 30 ms
[2024-06-01 19:34:13] [INFO ] Input system was already deterministic with 690 transitions.
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.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 480/480 places, 690/690 transitions.
[2024-06-01 19:34:13] [INFO ] Flatten gal took : 27 ms
[2024-06-01 19:34:13] [INFO ] Flatten gal took : 30 ms
[2024-06-01 19:34:13] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 480 transition count 494
Reduce places removed 196 places and 0 transitions.
Iterating post reduction 1 with 196 rules applied. Total rules applied 392 place count 284 transition count 494
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 392 place count 284 transition count 410
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 560 place count 200 transition count 410
Applied a total of 560 rules in 31 ms. Remains 200 /480 variables (removed 280) and now considering 410/690 (removed 280) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 200/480 places, 410/690 transitions.
[2024-06-01 19:34:13] [INFO ] Flatten gal took : 15 ms
[2024-06-01 19:34:13] [INFO ] Flatten gal took : 16 ms
[2024-06-01 19:34:13] [INFO ] Input system was already deterministic with 410 transitions.
RANDOM walk for 40000 steps (8 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 450 steps (0 resets) in 8 ms. (50 steps per ms) remains 0/1 properties
FORMULA Peterson-PT-4-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 8 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 480/480 places, 690/690 transitions.
[2024-06-01 19:34:13] [INFO ] Flatten gal took : 24 ms
[2024-06-01 19:34:13] [INFO ] Flatten gal took : 25 ms
[2024-06-01 19:34:13] [INFO ] Input system was already deterministic with 690 transitions.
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.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 480/480 places, 690/690 transitions.
[2024-06-01 19:34:13] [INFO ] Flatten gal took : 24 ms
[2024-06-01 19:34:13] [INFO ] Flatten gal took : 23 ms
[2024-06-01 19:34:13] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in SI_CTL 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 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 400 place count 280 transition count 391
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 598 place count 181 transition count 391
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 3 with 40 rules applied. Total rules applied 638 place count 161 transition count 371
Applied a total of 638 rules in 33 ms. Remains 161 /480 variables (removed 319) and now considering 371/690 (removed 319) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 161/480 places, 371/690 transitions.
[2024-06-01 19:34:14] [INFO ] Flatten gal took : 13 ms
[2024-06-01 19:34:14] [INFO ] Flatten gal took : 14 ms
[2024-06-01 19:34:14] [INFO ] Input system was already deterministic with 371 transitions.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 5 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 480/480 places, 690/690 transitions.
[2024-06-01 19:34:14] [INFO ] Flatten gal took : 22 ms
[2024-06-01 19:34:14] [INFO ] Flatten gal took : 27 ms
[2024-06-01 19:34:14] [INFO ] Input system was already deterministic with 690 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 193 place count 480 transition count 497
Reduce places removed 193 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 196 rules applied. Total rules applied 389 place count 287 transition count 494
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 392 place count 284 transition count 494
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 392 place count 284 transition count 397
Deduced a syphon composed of 97 places in 0 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 194 rules applied. Total rules applied 586 place count 187 transition count 397
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 626 place count 167 transition count 377
Applied a total of 626 rules in 29 ms. Remains 167 /480 variables (removed 313) and now considering 377/690 (removed 313) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 167/480 places, 377/690 transitions.
[2024-06-01 19:34:14] [INFO ] Flatten gal took : 12 ms
[2024-06-01 19:34:14] [INFO ] Flatten gal took : 13 ms
[2024-06-01 19:34:14] [INFO ] Input system was already deterministic with 377 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 480 transition count 492
Reduce places removed 198 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 200 rules applied. Total rules applied 398 place count 282 transition count 490
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 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 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 3 with 40 rules applied. Total rules applied 634 place count 163 transition count 373
Applied a total of 634 rules in 29 ms. Remains 163 /480 variables (removed 317) and now considering 373/690 (removed 317) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 163/480 places, 373/690 transitions.
[2024-06-01 19:34:14] [INFO ] Flatten gal took : 11 ms
[2024-06-01 19:34:14] [INFO ] Flatten gal took : 17 ms
[2024-06-01 19:34:14] [INFO ] Input system was already deterministic with 373 transitions.
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.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 480/480 places, 690/690 transitions.
[2024-06-01 19:34:14] [INFO ] Flatten gal took : 19 ms
[2024-06-01 19:34:14] [INFO ] Flatten gal took : 35 ms
[2024-06-01 19:34:14] [INFO ] Input system was already deterministic with 690 transitions.
[2024-06-01 19:34:14] [INFO ] Flatten gal took : 21 ms
[2024-06-01 19:34:14] [INFO ] Flatten gal took : 21 ms
[2024-06-01 19:34:14] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-06-01 19:34:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 480 places, 690 transitions and 2120 arcs took 7 ms.
Total runtime 116585 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Peterson-PT-4-CTLCardinality-2024-01
Could not compute solution for formula : Peterson-PT-4-CTLCardinality-2024-04
Could not compute solution for formula : Peterson-PT-4-CTLCardinality-2024-06
Could not compute solution for formula : Peterson-PT-4-CTLCardinality-2024-09
Could not compute solution for formula : Peterson-PT-4-CTLCardinality-2024-10
Could not compute solution for formula : Peterson-PT-4-CTLCardinality-2024-11
Could not compute solution for formula : Peterson-PT-4-CTLCardinality-2024-12
Could not compute solution for formula : Peterson-PT-4-CTLCardinality-2024-13
Could not compute solution for formula : Peterson-PT-4-CTLCardinality-2024-14
Could not compute solution for formula : Peterson-PT-4-CTLCardinality-2024-15

BK_STOP 1717270455079

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name Peterson-PT-4-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1321/ctl_0_
ctl formula name Peterson-PT-4-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1321/ctl_1_
ctl formula name Peterson-PT-4-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1321/ctl_2_
ctl formula name Peterson-PT-4-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1321/ctl_3_
ctl formula name Peterson-PT-4-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1321/ctl_4_
ctl formula name Peterson-PT-4-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1321/ctl_5_
ctl formula name Peterson-PT-4-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/1321/ctl_6_
ctl formula name Peterson-PT-4-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/1321/ctl_7_
ctl formula name Peterson-PT-4-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/1321/ctl_8_
ctl formula name Peterson-PT-4-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/1321/ctl_9_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="CTLCardinality"
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 CTLCardinality"
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-171654407300265"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;